2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1991, 1992 Linus Torvalds
|
|
|
|
* Copyright (C) 1994, Karl Keyte: Added support for disk statistics
|
|
|
|
* Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
|
|
|
|
* Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de>
|
2008-01-31 13:03:55 +01:00
|
|
|
* kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au>
|
|
|
|
* - July2000
|
2005-04-17 00:20:36 +02:00
|
|
|
* bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This handles all read/write requests to block devices
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/backing-dev.h>
|
|
|
|
#include <linux/bio.h>
|
|
|
|
#include <linux/blkdev.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/kernel_stat.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/completion.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/swap.h>
|
|
|
|
#include <linux/writeback.h>
|
2006-12-10 11:19:35 +01:00
|
|
|
#include <linux/task_io_accounting_ops.h>
|
2006-12-08 11:39:46 +01:00
|
|
|
#include <linux/fault-inject.h>
|
tracing/events: convert block trace points to TRACE_EVENT()
TRACE_EVENT is a more generic way to define tracepoints. Doing so adds
these new capabilities to this tracepoint:
- zero-copy and per-cpu splice() tracing
- binary tracing without printf overhead
- structured logging records exposed under /debug/tracing/events
- trace events embedded in function tracer output and other plugins
- user-defined, per tracepoint filter expressions
...
Cons:
- no dev_t info for the output of plug, unplug_timer and unplug_io events.
no dev_t info for getrq and sleeprq events if bio == NULL.
no dev_t info for rq_abort,...,rq_requeue events if rq->rq_disk == NULL.
This is mainly because we can't get the deivce from a request queue.
But this may change in the future.
- A packet command is converted to a string in TP_assign, not TP_print.
While blktrace do the convertion just before output.
Since pc requests should be rather rare, this is not a big issue.
- In blktrace, an event can have 2 different print formats, but a TRACE_EVENT
has a unique format, which means we have some unused data in a trace entry.
The overhead is minimized by using __dynamic_array() instead of __array().
I've benchmarked the ioctl blktrace vs the splice based TRACE_EVENT tracing:
dd dd + ioctl blktrace dd + TRACE_EVENT (splice)
1 7.36s, 42.7 MB/s 7.50s, 42.0 MB/s 7.41s, 42.5 MB/s
2 7.43s, 42.3 MB/s 7.48s, 42.1 MB/s 7.43s, 42.4 MB/s
3 7.38s, 42.6 MB/s 7.45s, 42.2 MB/s 7.41s, 42.5 MB/s
So the overhead of tracing is very small, and no regression when using
those trace events vs blktrace.
And the binary output of TRACE_EVENT is much smaller than blktrace:
# ls -l -h
-rw-r--r-- 1 root root 8.8M 06-09 13:24 sda.blktrace.0
-rw-r--r-- 1 root root 195K 06-09 13:24 sda.blktrace.1
-rw-r--r-- 1 root root 2.7M 06-09 13:25 trace_splice.out
Following are some comparisons between TRACE_EVENT and blktrace:
plug:
kjournald-480 [000] 303.084981: block_plug: [kjournald]
kjournald-480 [000] 303.084981: 8,0 P N [kjournald]
unplug_io:
kblockd/0-118 [000] 300.052973: block_unplug_io: [kblockd/0] 1
kblockd/0-118 [000] 300.052974: 8,0 U N [kblockd/0] 1
remap:
kjournald-480 [000] 303.085042: block_remap: 8,0 W 102736992 + 8 <- (8,8) 33384
kjournald-480 [000] 303.085043: 8,0 A W 102736992 + 8 <- (8,8) 33384
bio_backmerge:
kjournald-480 [000] 303.085086: block_bio_backmerge: 8,0 W 102737032 + 8 [kjournald]
kjournald-480 [000] 303.085086: 8,0 M W 102737032 + 8 [kjournald]
getrq:
kjournald-480 [000] 303.084974: block_getrq: 8,0 W 102736984 + 8 [kjournald]
kjournald-480 [000] 303.084975: 8,0 G W 102736984 + 8 [kjournald]
bash-2066 [001] 1072.953770: 8,0 G N [bash]
bash-2066 [001] 1072.953773: block_getrq: 0,0 N 0 + 0 [bash]
rq_complete:
konsole-2065 [001] 300.053184: block_rq_complete: 8,0 W () 103669040 + 16 [0]
konsole-2065 [001] 300.053191: 8,0 C W 103669040 + 16 [0]
ksoftirqd/1-7 [001] 1072.953811: 8,0 C N (5a 00 08 00 00 00 00 00 24 00) [0]
ksoftirqd/1-7 [001] 1072.953813: block_rq_complete: 0,0 N (5a 00 08 00 00 00 00 00 24 00) 0 + 0 [0]
rq_insert:
kjournald-480 [000] 303.084985: block_rq_insert: 8,0 W 0 () 102736984 + 8 [kjournald]
kjournald-480 [000] 303.084986: 8,0 I W 102736984 + 8 [kjournald]
Changelog from v2 -> v3:
- use the newly introduced __dynamic_array().
Changelog from v1 -> v2:
- use __string() instead of __array() to minimize the memory required
to store hex dump of rq->cmd().
- support large pc requests.
- add missing blk_fill_rwbs_rq() in block_rq_requeue TRACE_EVENT.
- some cleanups.
Signed-off-by: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <4A2DF669.5070905@cn.fujitsu.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2009-06-09 07:43:05 +02:00
|
|
|
|
|
|
|
#define CREATE_TRACE_POINTS
|
|
|
|
#include <trace/events/block.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-29 14:51:59 +01:00
|
|
|
#include "blk.h"
|
|
|
|
|
2008-11-26 11:59:56 +01:00
|
|
|
EXPORT_TRACEPOINT_SYMBOL_GPL(block_remap);
|
tracing/events: convert block trace points to TRACE_EVENT()
TRACE_EVENT is a more generic way to define tracepoints. Doing so adds
these new capabilities to this tracepoint:
- zero-copy and per-cpu splice() tracing
- binary tracing without printf overhead
- structured logging records exposed under /debug/tracing/events
- trace events embedded in function tracer output and other plugins
- user-defined, per tracepoint filter expressions
...
Cons:
- no dev_t info for the output of plug, unplug_timer and unplug_io events.
no dev_t info for getrq and sleeprq events if bio == NULL.
no dev_t info for rq_abort,...,rq_requeue events if rq->rq_disk == NULL.
This is mainly because we can't get the deivce from a request queue.
But this may change in the future.
- A packet command is converted to a string in TP_assign, not TP_print.
While blktrace do the convertion just before output.
Since pc requests should be rather rare, this is not a big issue.
- In blktrace, an event can have 2 different print formats, but a TRACE_EVENT
has a unique format, which means we have some unused data in a trace entry.
The overhead is minimized by using __dynamic_array() instead of __array().
I've benchmarked the ioctl blktrace vs the splice based TRACE_EVENT tracing:
dd dd + ioctl blktrace dd + TRACE_EVENT (splice)
1 7.36s, 42.7 MB/s 7.50s, 42.0 MB/s 7.41s, 42.5 MB/s
2 7.43s, 42.3 MB/s 7.48s, 42.1 MB/s 7.43s, 42.4 MB/s
3 7.38s, 42.6 MB/s 7.45s, 42.2 MB/s 7.41s, 42.5 MB/s
So the overhead of tracing is very small, and no regression when using
those trace events vs blktrace.
And the binary output of TRACE_EVENT is much smaller than blktrace:
# ls -l -h
-rw-r--r-- 1 root root 8.8M 06-09 13:24 sda.blktrace.0
-rw-r--r-- 1 root root 195K 06-09 13:24 sda.blktrace.1
-rw-r--r-- 1 root root 2.7M 06-09 13:25 trace_splice.out
Following are some comparisons between TRACE_EVENT and blktrace:
plug:
kjournald-480 [000] 303.084981: block_plug: [kjournald]
kjournald-480 [000] 303.084981: 8,0 P N [kjournald]
unplug_io:
kblockd/0-118 [000] 300.052973: block_unplug_io: [kblockd/0] 1
kblockd/0-118 [000] 300.052974: 8,0 U N [kblockd/0] 1
remap:
kjournald-480 [000] 303.085042: block_remap: 8,0 W 102736992 + 8 <- (8,8) 33384
kjournald-480 [000] 303.085043: 8,0 A W 102736992 + 8 <- (8,8) 33384
bio_backmerge:
kjournald-480 [000] 303.085086: block_bio_backmerge: 8,0 W 102737032 + 8 [kjournald]
kjournald-480 [000] 303.085086: 8,0 M W 102737032 + 8 [kjournald]
getrq:
kjournald-480 [000] 303.084974: block_getrq: 8,0 W 102736984 + 8 [kjournald]
kjournald-480 [000] 303.084975: 8,0 G W 102736984 + 8 [kjournald]
bash-2066 [001] 1072.953770: 8,0 G N [bash]
bash-2066 [001] 1072.953773: block_getrq: 0,0 N 0 + 0 [bash]
rq_complete:
konsole-2065 [001] 300.053184: block_rq_complete: 8,0 W () 103669040 + 16 [0]
konsole-2065 [001] 300.053191: 8,0 C W 103669040 + 16 [0]
ksoftirqd/1-7 [001] 1072.953811: 8,0 C N (5a 00 08 00 00 00 00 00 24 00) [0]
ksoftirqd/1-7 [001] 1072.953813: block_rq_complete: 0,0 N (5a 00 08 00 00 00 00 00 24 00) 0 + 0 [0]
rq_insert:
kjournald-480 [000] 303.084985: block_rq_insert: 8,0 W 0 () 102736984 + 8 [kjournald]
kjournald-480 [000] 303.084986: 8,0 I W 102736984 + 8 [kjournald]
Changelog from v2 -> v3:
- use the newly introduced __dynamic_array().
Changelog from v1 -> v2:
- use __string() instead of __array() to minimize the memory required
to store hex dump of rq->cmd().
- support large pc requests.
- add missing blk_fill_rwbs_rq() in block_rq_requeue TRACE_EVENT.
- some cleanups.
Signed-off-by: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <4A2DF669.5070905@cn.fujitsu.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2009-06-09 07:43:05 +02:00
|
|
|
EXPORT_TRACEPOINT_SYMBOL_GPL(block_bio_complete);
|
2008-11-26 11:59:56 +01:00
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
static int __make_request(struct request_queue *q, struct bio *bio);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* For the allocated request tables
|
|
|
|
*/
|
2008-02-18 13:45:51 +01:00
|
|
|
static struct kmem_cache *request_cachep;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* For queue allocation
|
|
|
|
*/
|
2008-01-31 13:03:55 +01:00
|
|
|
struct kmem_cache *blk_requestq_cachep;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Controlling structure to kblockd
|
|
|
|
*/
|
2006-01-09 16:02:34 +01:00
|
|
|
static struct workqueue_struct *kblockd_workqueue;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-29 13:54:41 +01:00
|
|
|
static void drive_stat_acct(struct request *rq, int new_io)
|
|
|
|
{
|
2008-05-07 10:15:46 +02:00
|
|
|
struct hd_struct *part;
|
2008-01-29 13:54:41 +01:00
|
|
|
int rw = rq_data_dir(rq);
|
2008-08-25 12:47:21 +02:00
|
|
|
int cpu;
|
2008-01-29 13:54:41 +01:00
|
|
|
|
2009-04-24 08:10:11 +02:00
|
|
|
if (!blk_do_io_stat(rq))
|
2008-01-29 13:54:41 +01:00
|
|
|
return;
|
|
|
|
|
2008-08-25 12:56:14 +02:00
|
|
|
cpu = part_stat_lock();
|
2009-05-07 15:24:39 +02:00
|
|
|
part = disk_map_sector_rcu(rq->rq_disk, blk_rq_pos(rq));
|
2008-08-25 12:47:21 +02:00
|
|
|
|
2008-05-07 10:15:46 +02:00
|
|
|
if (!new_io)
|
2008-08-25 12:56:14 +02:00
|
|
|
part_stat_inc(cpu, part, merges[rw]);
|
2008-05-07 10:15:46 +02:00
|
|
|
else {
|
2008-08-25 12:56:14 +02:00
|
|
|
part_round_stats(cpu, part);
|
|
|
|
part_inc_in_flight(part);
|
2008-01-29 13:54:41 +01:00
|
|
|
}
|
2008-09-03 09:03:02 +02:00
|
|
|
|
2008-08-25 12:56:14 +02:00
|
|
|
part_stat_unlock();
|
2008-01-29 13:54:41 +01:00
|
|
|
}
|
|
|
|
|
2008-01-29 14:51:59 +01:00
|
|
|
void blk_queue_congestion_threshold(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int nr;
|
|
|
|
|
|
|
|
nr = q->nr_requests - (q->nr_requests / 8) + 1;
|
|
|
|
if (nr > q->nr_requests)
|
|
|
|
nr = q->nr_requests;
|
|
|
|
q->nr_congestion_on = nr;
|
|
|
|
|
|
|
|
nr = q->nr_requests - (q->nr_requests / 8) - (q->nr_requests / 16) - 1;
|
|
|
|
if (nr < 1)
|
|
|
|
nr = 1;
|
|
|
|
q->nr_congestion_off = nr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_get_backing_dev_info - get the address of a queue's backing_dev_info
|
|
|
|
* @bdev: device
|
|
|
|
*
|
|
|
|
* Locates the passed device's request queue and returns the address of its
|
|
|
|
* backing_dev_info
|
|
|
|
*
|
|
|
|
* Will return NULL if the request queue cannot be located.
|
|
|
|
*/
|
|
|
|
struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev)
|
|
|
|
{
|
|
|
|
struct backing_dev_info *ret = NULL;
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = bdev_get_queue(bdev);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (q)
|
|
|
|
ret = &q->backing_dev_info;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_get_backing_dev_info);
|
|
|
|
|
2008-04-29 09:54:36 +02:00
|
|
|
void blk_rq_init(struct request_queue *q, struct request *rq)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-04-25 12:26:28 +02:00
|
|
|
memset(rq, 0, sizeof(*rq));
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
INIT_LIST_HEAD(&rq->queuelist);
|
2008-09-14 14:55:09 +02:00
|
|
|
INIT_LIST_HEAD(&rq->timeout_list);
|
2008-09-13 20:26:01 +02:00
|
|
|
rq->cpu = -1;
|
2008-02-08 12:41:03 +01:00
|
|
|
rq->q = q;
|
2009-05-07 15:24:44 +02:00
|
|
|
rq->__sector = (sector_t) -1;
|
2006-07-13 11:55:04 +02:00
|
|
|
INIT_HLIST_NODE(&rq->hash);
|
|
|
|
RB_CLEAR_NODE(&rq->rb_node);
|
2008-04-29 09:54:39 +02:00
|
|
|
rq->cmd = rq->__cmd;
|
2009-04-02 07:43:26 +02:00
|
|
|
rq->cmd_len = BLK_MAX_CDB;
|
2008-02-08 12:41:03 +01:00
|
|
|
rq->tag = -1;
|
2005-04-17 00:20:36 +02:00
|
|
|
rq->ref_count = 1;
|
2009-04-23 04:05:18 +02:00
|
|
|
rq->start_time = jiffies;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2008-04-29 09:54:36 +02:00
|
|
|
EXPORT_SYMBOL(blk_rq_init);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-09-27 12:46:13 +02:00
|
|
|
static void req_bio_endio(struct request *rq, struct bio *bio,
|
|
|
|
unsigned int nbytes, int error)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = rq->q;
|
2006-01-06 09:51:03 +01:00
|
|
|
|
2007-09-27 12:46:13 +02:00
|
|
|
if (&q->bar_rq != rq) {
|
|
|
|
if (error)
|
|
|
|
clear_bit(BIO_UPTODATE, &bio->bi_flags);
|
|
|
|
else if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
|
|
|
|
error = -EIO;
|
2006-01-06 09:51:03 +01:00
|
|
|
|
2007-09-27 12:46:13 +02:00
|
|
|
if (unlikely(nbytes > bio->bi_size)) {
|
2008-01-31 13:03:55 +01:00
|
|
|
printk(KERN_ERR "%s: want %u bytes done, %u left\n",
|
2008-05-01 13:35:17 +02:00
|
|
|
__func__, nbytes, bio->bi_size);
|
2007-09-27 12:46:13 +02:00
|
|
|
nbytes = bio->bi_size;
|
|
|
|
}
|
2006-01-06 09:51:03 +01:00
|
|
|
|
block: Supress Buffer I/O errors when SCSI REQ_QUIET flag set
Allow the scsi request REQ_QUIET flag to be propagated to the buffer
file system layer. The basic ideas is to pass the flag from the scsi
request to the bio (block IO) and then to the buffer layer. The buffer
layer can then suppress needless printks.
This patch declutters the kernel log by removed the 40-50 (per lun)
buffer io error messages seen during a boot in my multipath setup . It
is a good chance any real errors will be missed in the "noise" it the
logs without this patch.
During boot I see blocks of messages like
"
__ratelimit: 211 callbacks suppressed
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242847
Buffer I/O error on device sdm, logical block 1
Buffer I/O error on device sdm, logical block 5242878
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242879
Buffer I/O error on device sdm, logical block 5242872
"
in my logs.
My disk environment is multipath fiber channel using the SCSI_DH_RDAC
code and multipathd. This topology includes an "active" and "ghost"
path for each lun. IO's to the "ghost" path will never complete and the
SCSI layer, via the scsi device handler rdac code, quick returns the IOs
to theses paths and sets the REQ_QUIET scsi flag to suppress the scsi
layer messages.
I am wanting to extend the QUIET behavior to include the buffer file
system layer to deal with these errors as well. I have been running this
patch for a while now on several boxes without issue. A few runs of
bonnie++ show no noticeable difference in performance in my setup.
Thanks for John Stultz for the quiet_error finalization.
Submitted-by: Keith Mannthey <kmannth@us.ibm.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-11-25 10:24:35 +01:00
|
|
|
if (unlikely(rq->cmd_flags & REQ_QUIET))
|
|
|
|
set_bit(BIO_QUIET, &bio->bi_flags);
|
|
|
|
|
2007-09-27 12:46:13 +02:00
|
|
|
bio->bi_size -= nbytes;
|
|
|
|
bio->bi_sector += (nbytes >> 9);
|
2008-06-30 20:04:41 +02:00
|
|
|
|
|
|
|
if (bio_integrity(bio))
|
|
|
|
bio_integrity_advance(bio, nbytes);
|
|
|
|
|
2007-09-27 12:46:13 +02:00
|
|
|
if (bio->bi_size == 0)
|
2007-09-27 12:47:43 +02:00
|
|
|
bio_endio(bio, error);
|
2007-09-27 12:46:13 +02:00
|
|
|
} else {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Okay, this is the barrier request in progress, just
|
|
|
|
* record the error;
|
|
|
|
*/
|
|
|
|
if (error && !q->orderr)
|
|
|
|
q->orderr = error;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void blk_dump_rq_flags(struct request *rq, char *msg)
|
|
|
|
{
|
|
|
|
int bit;
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
printk(KERN_INFO "%s: dev %s: type=%x, flags=%x\n", msg,
|
2006-08-10 08:44:47 +02:00
|
|
|
rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->cmd_type,
|
|
|
|
rq->cmd_flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-05-07 15:24:39 +02:00
|
|
|
printk(KERN_INFO " sector %llu, nr/cnr %u/%u\n",
|
|
|
|
(unsigned long long)blk_rq_pos(rq),
|
|
|
|
blk_rq_sectors(rq), blk_rq_cur_sectors(rq));
|
2009-04-23 04:05:20 +02:00
|
|
|
printk(KERN_INFO " bio %p, biotail %p, buffer %p, len %u\n",
|
2009-05-07 15:24:41 +02:00
|
|
|
rq->bio, rq->biotail, rq->buffer, blk_rq_bytes(rq));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-08-10 08:44:47 +02:00
|
|
|
if (blk_pc_request(rq)) {
|
2008-01-31 13:03:55 +01:00
|
|
|
printk(KERN_INFO " cdb: ");
|
2008-04-29 14:37:52 +02:00
|
|
|
for (bit = 0; bit < BLK_MAX_CDB; bit++)
|
2005-04-17 00:20:36 +02:00
|
|
|
printk("%02x ", rq->cmd[bit]);
|
|
|
|
printk("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_dump_rq_flags);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* "plug" the device if there are no outstanding requests: this will
|
|
|
|
* force the transfer to start only after we have put all the requests
|
|
|
|
* on the list.
|
|
|
|
*
|
|
|
|
* This is called with interrupts off and no requests on the queue and
|
|
|
|
* with the queue lock held.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_plug_device(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
WARN_ON(!irqs_disabled());
|
|
|
|
|
|
|
|
/*
|
|
|
|
* don't plug a stopped queue, it must be paired with blk_start_queue()
|
|
|
|
* which will restart the queueing
|
|
|
|
*/
|
2006-04-19 10:14:49 +02:00
|
|
|
if (blk_queue_stopped(q))
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
|
2008-07-03 13:18:54 +02:00
|
|
|
if (!queue_flag_test_and_set(QUEUE_FLAG_PLUGGED, q)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
mod_timer(&q->unplug_timer, jiffies + q->unplug_delay);
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_plug(q);
|
2006-03-23 20:00:26 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_plug_device);
|
|
|
|
|
2008-08-01 20:31:32 +02:00
|
|
|
/**
|
|
|
|
* blk_plug_device_unlocked - plug a device without queue lock held
|
|
|
|
* @q: The &struct request_queue to plug
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Like @blk_plug_device(), but grabs the queue lock and disables
|
|
|
|
* interrupts.
|
|
|
|
**/
|
|
|
|
void blk_plug_device_unlocked(struct request_queue *q)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
blk_plug_device(q);
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_plug_device_unlocked);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* remove the queue from the plugged list, if present. called with
|
|
|
|
* queue lock held and interrupts disabled.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
int blk_remove_plug(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
WARN_ON(!irqs_disabled());
|
|
|
|
|
2008-07-03 13:18:54 +02:00
|
|
|
if (!queue_flag_test_and_clear(QUEUE_FLAG_PLUGGED, q))
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
del_timer(&q->unplug_timer);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_remove_plug);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* remove the plug and let it rip..
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
void __generic_unplug_device(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-04-19 10:14:49 +02:00
|
|
|
if (unlikely(blk_queue_stopped(q)))
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
2008-10-17 13:58:29 +02:00
|
|
|
if (!blk_remove_plug(q) && !blk_queue_nonrot(q))
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
|
2005-06-27 10:55:12 +02:00
|
|
|
q->request_fn(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* generic_unplug_device - fire a request queue
|
2007-07-24 09:28:11 +02:00
|
|
|
* @q: The &struct request_queue in question
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Linux uses plugging to build bigger requests queues before letting
|
|
|
|
* the device have at them. If a queue is plugged, the I/O scheduler
|
|
|
|
* is still adding and merging requests on the queue. Once the queue
|
|
|
|
* gets unplugged, the request_fn defined for the queue is invoked and
|
|
|
|
* transfers started.
|
|
|
|
**/
|
2007-07-24 09:28:11 +02:00
|
|
|
void generic_unplug_device(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-05-07 09:48:17 +02:00
|
|
|
if (blk_queue_plugged(q)) {
|
|
|
|
spin_lock_irq(q->queue_lock);
|
|
|
|
__generic_unplug_device(q);
|
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(generic_unplug_device);
|
|
|
|
|
|
|
|
static void blk_backing_dev_unplug(struct backing_dev_info *bdi,
|
|
|
|
struct page *page)
|
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = bdi->unplug_io_data;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-11-07 20:26:56 +01:00
|
|
|
blk_unplug(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-01-29 14:53:40 +01:00
|
|
|
void blk_unplug_work(struct work_struct *work)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q =
|
|
|
|
container_of(work, struct request_queue, unplug_work);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_unplug_io(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
q->unplug_fn(q);
|
|
|
|
}
|
|
|
|
|
2008-01-29 14:53:40 +01:00
|
|
|
void blk_unplug_timeout(unsigned long data)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = (struct request_queue *)data;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_unplug_timer(q);
|
2008-07-28 13:08:45 +02:00
|
|
|
kblockd_schedule_work(q, &q->unplug_work);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-11-07 20:26:56 +01:00
|
|
|
void blk_unplug(struct request_queue *q)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* devices don't necessarily have an ->unplug_fn defined
|
|
|
|
*/
|
|
|
|
if (q->unplug_fn) {
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_unplug_io(q);
|
2007-11-07 20:26:56 +01:00
|
|
|
q->unplug_fn(q);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_unplug);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/**
|
|
|
|
* blk_start_queue - restart a previously stopped queue
|
2007-07-24 09:28:11 +02:00
|
|
|
* @q: The &struct request_queue in question
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* blk_start_queue() will clear the stop flag on the queue, and call
|
|
|
|
* the request_fn for the queue if it was in a stopped state when
|
|
|
|
* entered. Also see blk_stop_queue(). Queue lock must be held.
|
|
|
|
**/
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_start_queue(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-06-05 12:09:01 +02:00
|
|
|
WARN_ON(!irqs_disabled());
|
|
|
|
|
2008-04-29 14:48:33 +02:00
|
|
|
queue_flag_clear(QUEUE_FLAG_STOPPED, q);
|
2009-04-23 04:05:17 +02:00
|
|
|
__blk_run_queue(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_start_queue);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_stop_queue - stop a queue
|
2007-07-24 09:28:11 +02:00
|
|
|
* @q: The &struct request_queue in question
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* The Linux block layer assumes that a block driver will consume all
|
|
|
|
* entries on the request queue when the request_fn strategy is called.
|
|
|
|
* Often this will not happen, because of hardware limitations (queue
|
|
|
|
* depth settings). If a device driver gets a 'queue full' response,
|
|
|
|
* or if it simply chooses not to queue more I/O at one point, it can
|
|
|
|
* call this function to prevent the request_fn from being called until
|
|
|
|
* the driver has signalled it's ready to go again. This happens by calling
|
|
|
|
* blk_start_queue() to restart queue operations. Queue lock must be held.
|
|
|
|
**/
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_stop_queue(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
blk_remove_plug(q);
|
2008-04-29 14:48:33 +02:00
|
|
|
queue_flag_set(QUEUE_FLAG_STOPPED, q);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_stop_queue);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_sync_queue - cancel any pending callbacks on a queue
|
|
|
|
* @q: the queue
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* The block layer may perform asynchronous callback activity
|
|
|
|
* on a queue, such as calling the unplug function after a timeout.
|
|
|
|
* A block device may call blk_sync_queue to ensure that any
|
|
|
|
* such activity is cancelled, thus allowing it to release resources
|
2007-05-09 08:57:56 +02:00
|
|
|
* that the callbacks might use. The caller must already have made sure
|
2005-04-17 00:20:36 +02:00
|
|
|
* that its ->make_request_fn will not re-add plugging prior to calling
|
|
|
|
* this function.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void blk_sync_queue(struct request_queue *q)
|
|
|
|
{
|
|
|
|
del_timer_sync(&q->unplug_timer);
|
2008-11-19 14:38:39 +01:00
|
|
|
del_timer_sync(&q->timeout);
|
2008-12-03 12:41:39 +01:00
|
|
|
cancel_work_sync(&q->unplug_work);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_sync_queue);
|
|
|
|
|
|
|
|
/**
|
2008-10-14 09:51:06 +02:00
|
|
|
* __blk_run_queue - run a single device queue
|
2005-04-17 00:20:36 +02:00
|
|
|
* @q: The queue to run
|
2008-10-14 09:51:06 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* See @blk_run_queue. This variant must be called with the queue lock
|
|
|
|
* held and interrupts disabled.
|
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2008-04-29 14:48:33 +02:00
|
|
|
void __blk_run_queue(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
blk_remove_plug(q);
|
2006-05-11 08:20:16 +02:00
|
|
|
|
2009-04-23 04:05:17 +02:00
|
|
|
if (unlikely(blk_queue_stopped(q)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (elv_queue_empty(q))
|
|
|
|
return;
|
|
|
|
|
2006-05-11 08:20:16 +02:00
|
|
|
/*
|
|
|
|
* Only recurse once to avoid overrunning the stack, let the unplug
|
|
|
|
* handling reinvoke the handler shortly if we already got there.
|
|
|
|
*/
|
2009-04-23 04:05:17 +02:00
|
|
|
if (!queue_flag_test_and_set(QUEUE_FLAG_REENTER, q)) {
|
|
|
|
q->request_fn(q);
|
|
|
|
queue_flag_clear(QUEUE_FLAG_REENTER, q);
|
|
|
|
} else {
|
|
|
|
queue_flag_set(QUEUE_FLAG_PLUGGED, q);
|
|
|
|
kblockd_schedule_work(q, &q->unplug_work);
|
|
|
|
}
|
2008-04-29 14:48:33 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__blk_run_queue);
|
2006-05-11 08:20:16 +02:00
|
|
|
|
2008-04-29 14:48:33 +02:00
|
|
|
/**
|
|
|
|
* blk_run_queue - run a single device queue
|
|
|
|
* @q: The queue to run
|
2008-10-14 09:51:06 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Invoke request handling on this queue, if it has pending work to do.
|
2009-04-23 04:05:17 +02:00
|
|
|
* May be used to restart queueing when a request has completed.
|
2008-04-29 14:48:33 +02:00
|
|
|
*/
|
|
|
|
void blk_run_queue(struct request_queue *q)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
__blk_run_queue(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_run_queue);
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_put_queue(struct request_queue *q)
|
2006-03-19 00:34:37 +01:00
|
|
|
{
|
|
|
|
kobject_put(&q->kobj);
|
|
|
|
}
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
void blk_cleanup_queue(struct request_queue *q)
|
2006-03-19 00:34:37 +01:00
|
|
|
{
|
2008-09-18 18:22:54 +02:00
|
|
|
/*
|
|
|
|
* We know we have process context here, so we can be a little
|
|
|
|
* cautious and ensure that pending block actions on this device
|
|
|
|
* are done before moving on. Going into this function, we should
|
|
|
|
* not have processes doing IO to this device.
|
|
|
|
*/
|
|
|
|
blk_sync_queue(q);
|
|
|
|
|
2006-03-19 00:34:37 +01:00
|
|
|
mutex_lock(&q->sysfs_lock);
|
2008-04-29 14:48:33 +02:00
|
|
|
queue_flag_set_unlocked(QUEUE_FLAG_DEAD, q);
|
2006-03-19 00:34:37 +01:00
|
|
|
mutex_unlock(&q->sysfs_lock);
|
|
|
|
|
|
|
|
if (q->elevator)
|
|
|
|
elevator_exit(q->elevator);
|
|
|
|
|
|
|
|
blk_put_queue(q);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
EXPORT_SYMBOL(blk_cleanup_queue);
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
static int blk_init_free_list(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request_list *rl = &q->rq;
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
rl->count[BLK_RW_SYNC] = rl->count[BLK_RW_ASYNC] = 0;
|
|
|
|
rl->starved[BLK_RW_SYNC] = rl->starved[BLK_RW_ASYNC] = 0;
|
2005-10-28 08:29:39 +02:00
|
|
|
rl->elvpriv = 0;
|
2009-04-06 14:48:01 +02:00
|
|
|
init_waitqueue_head(&rl->wait[BLK_RW_SYNC]);
|
|
|
|
init_waitqueue_head(&rl->wait[BLK_RW_ASYNC]);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-06-23 09:08:19 +02:00
|
|
|
rl->rq_pool = mempool_create_node(BLKDEV_MIN_RQ, mempool_alloc_slab,
|
|
|
|
mempool_free_slab, request_cachep, q->node);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (!rl->rq_pool)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *blk_alloc_queue(gfp_t gfp_mask)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-06-23 09:08:19 +02:00
|
|
|
return blk_alloc_queue_node(gfp_mask, -1);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_alloc_queue);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *blk_alloc_queue_node(gfp_t gfp_mask, int node_id)
|
2005-06-23 09:08:19 +02:00
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q;
|
2007-10-17 08:25:46 +02:00
|
|
|
int err;
|
2005-06-23 09:08:19 +02:00
|
|
|
|
2008-01-29 14:51:59 +01:00
|
|
|
q = kmem_cache_alloc_node(blk_requestq_cachep,
|
2007-07-17 13:03:29 +02:00
|
|
|
gfp_mask | __GFP_ZERO, node_id);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!q)
|
|
|
|
return NULL;
|
|
|
|
|
2007-10-17 08:25:46 +02:00
|
|
|
q->backing_dev_info.unplug_io_fn = blk_backing_dev_unplug;
|
|
|
|
q->backing_dev_info.unplug_io_data = q;
|
2009-06-12 14:42:56 +02:00
|
|
|
q->backing_dev_info.ra_pages =
|
|
|
|
(VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
|
|
|
|
q->backing_dev_info.state = 0;
|
|
|
|
q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
|
|
|
|
|
2007-10-17 08:25:46 +02:00
|
|
|
err = bdi_init(&q->backing_dev_info);
|
|
|
|
if (err) {
|
2008-01-29 14:51:59 +01:00
|
|
|
kmem_cache_free(blk_requestq_cachep, q);
|
2007-10-17 08:25:46 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
init_timer(&q->unplug_timer);
|
2008-09-14 14:55:09 +02:00
|
|
|
setup_timer(&q->timeout, blk_rq_timed_out_timer, (unsigned long) q);
|
|
|
|
INIT_LIST_HEAD(&q->timeout_list);
|
2008-10-16 13:44:57 +02:00
|
|
|
INIT_WORK(&q->unplug_work, blk_unplug_work);
|
2006-03-19 00:34:37 +01:00
|
|
|
|
2008-01-29 14:51:59 +01:00
|
|
|
kobject_init(&q->kobj, &blk_queue_ktype);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-03-19 00:34:37 +01:00
|
|
|
mutex_init(&q->sysfs_lock);
|
2008-05-15 01:05:54 +02:00
|
|
|
spin_lock_init(&q->__queue_lock);
|
2006-03-19 00:34:37 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
return q;
|
|
|
|
}
|
2005-06-23 09:08:19 +02:00
|
|
|
EXPORT_SYMBOL(blk_alloc_queue_node);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_init_queue - prepare a request queue for use with a block device
|
|
|
|
* @rfn: The function to be called to process requests that have been
|
|
|
|
* placed on the queue.
|
|
|
|
* @lock: Request queue spin lock
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* If a block device wishes to use the standard request handling procedures,
|
|
|
|
* which sorts requests and coalesces adjacent requests, then it must
|
|
|
|
* call blk_init_queue(). The function @rfn will be called when there
|
|
|
|
* are requests on the queue that need to be processed. If the device
|
|
|
|
* supports plugging, then @rfn may not be called immediately when requests
|
|
|
|
* are available on the queue, but may be called at some time later instead.
|
|
|
|
* Plugged queues are generally unplugged when a buffer belonging to one
|
|
|
|
* of the requests on the queue is needed, or due to memory pressure.
|
|
|
|
*
|
|
|
|
* @rfn is not required, or even expected, to remove all requests off the
|
|
|
|
* queue, but only as many as it can handle at a time. If it does leave
|
|
|
|
* requests on the queue, it is responsible for arranging that the requests
|
|
|
|
* get dealt with eventually.
|
|
|
|
*
|
|
|
|
* The queue spin lock must be held while manipulating the requests on the
|
2006-06-05 12:09:01 +02:00
|
|
|
* request queue; this lock will be taken also from interrupt context, so irq
|
|
|
|
* disabling is needed for it.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
2008-08-19 20:13:11 +02:00
|
|
|
* Function returns a pointer to the initialized request queue, or %NULL if
|
2005-04-17 00:20:36 +02:00
|
|
|
* it didn't succeed.
|
|
|
|
*
|
|
|
|
* Note:
|
|
|
|
* blk_init_queue() must be paired with a blk_cleanup_queue() call
|
|
|
|
* when the block device is deactivated (such as at module unload).
|
|
|
|
**/
|
2005-06-23 09:08:19 +02:00
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *blk_init_queue(request_fn_proc *rfn, spinlock_t *lock)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-06-23 09:08:19 +02:00
|
|
|
return blk_init_queue_node(rfn, lock, -1);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_init_queue);
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *
|
2005-06-23 09:08:19 +02:00
|
|
|
blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id)
|
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = blk_alloc_queue_node(GFP_KERNEL, node_id);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (!q)
|
|
|
|
return NULL;
|
|
|
|
|
2005-06-23 09:08:19 +02:00
|
|
|
q->node = node_id;
|
2006-03-18 19:50:00 +01:00
|
|
|
if (blk_init_free_list(q)) {
|
2008-01-29 14:51:59 +01:00
|
|
|
kmem_cache_free(blk_requestq_cachep, q);
|
2006-03-18 19:50:00 +01:00
|
|
|
return NULL;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
q->request_fn = rfn;
|
|
|
|
q->prep_rq_fn = NULL;
|
|
|
|
q->unplug_fn = generic_unplug_device;
|
2009-01-23 10:54:44 +01:00
|
|
|
q->queue_flags = QUEUE_FLAG_DEFAULT;
|
2005-04-17 00:20:36 +02:00
|
|
|
q->queue_lock = lock;
|
|
|
|
|
2009-03-06 08:48:33 +01:00
|
|
|
/*
|
|
|
|
* This also sets hw/phys segments, boundary and size
|
|
|
|
*/
|
2005-04-17 00:20:36 +02:00
|
|
|
blk_queue_make_request(q, __make_request);
|
|
|
|
|
2007-02-20 17:01:57 +01:00
|
|
|
q->sg_reserved_size = INT_MAX;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* all done
|
|
|
|
*/
|
|
|
|
if (!elevator_init(q, NULL)) {
|
|
|
|
blk_queue_congestion_threshold(q);
|
|
|
|
return q;
|
|
|
|
}
|
|
|
|
|
2006-03-18 19:50:00 +01:00
|
|
|
blk_put_queue(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
2005-06-23 09:08:19 +02:00
|
|
|
EXPORT_SYMBOL(blk_init_queue_node);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
int blk_get_queue(struct request_queue *q)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-06-23 09:08:53 +02:00
|
|
|
if (likely(!test_bit(QUEUE_FLAG_DEAD, &q->queue_flags))) {
|
2006-03-19 00:34:37 +01:00
|
|
|
kobject_get(&q->kobj);
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
static inline void blk_free_request(struct request_queue *q, struct request *rq)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-08-10 08:44:47 +02:00
|
|
|
if (rq->cmd_flags & REQ_ELVPRIV)
|
2005-10-28 08:29:39 +02:00
|
|
|
elv_put_request(q, rq);
|
2005-04-17 00:20:36 +02:00
|
|
|
mempool_free(rq, q->rq.rq_pool);
|
|
|
|
}
|
|
|
|
|
2006-07-18 22:24:11 +02:00
|
|
|
static struct request *
|
2009-04-22 14:01:49 +02:00
|
|
|
blk_alloc_request(struct request_queue *q, int flags, int priv, gfp_t gfp_mask)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request *rq = mempool_alloc(q->rq.rq_pool, gfp_mask);
|
|
|
|
|
|
|
|
if (!rq)
|
|
|
|
return NULL;
|
|
|
|
|
2008-04-29 09:54:36 +02:00
|
|
|
blk_rq_init(q, rq);
|
2008-04-25 12:26:28 +02:00
|
|
|
|
2009-04-22 14:01:49 +02:00
|
|
|
rq->cmd_flags = flags | REQ_ALLOCED;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-10-28 08:29:39 +02:00
|
|
|
if (priv) {
|
2006-07-28 09:32:57 +02:00
|
|
|
if (unlikely(elv_set_request(q, rq, gfp_mask))) {
|
2005-10-28 08:29:39 +02:00
|
|
|
mempool_free(rq, q->rq.rq_pool);
|
|
|
|
return NULL;
|
|
|
|
}
|
2006-08-10 08:44:47 +02:00
|
|
|
rq->cmd_flags |= REQ_ELVPRIV;
|
2005-10-28 08:29:39 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-10-28 08:29:39 +02:00
|
|
|
return rq;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ioc_batching returns true if the ioc is a valid batching request and
|
|
|
|
* should be given priority access to a request.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
static inline int ioc_batching(struct request_queue *q, struct io_context *ioc)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
if (!ioc)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make sure the process is able to allocate at least 1 request
|
|
|
|
* even if the batch times out, otherwise we could theoretically
|
|
|
|
* lose wakeups.
|
|
|
|
*/
|
|
|
|
return ioc->nr_batch_requests == q->nr_batching ||
|
|
|
|
(ioc->nr_batch_requests > 0
|
|
|
|
&& time_before(jiffies, ioc->last_waited + BLK_BATCH_TIME));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
|
|
|
|
* will cause the process to be a "batcher" on all queues in the system. This
|
|
|
|
* is the behaviour we want though - once it gets a wakeup it should be given
|
|
|
|
* a nice run.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
static void ioc_set_batching(struct request_queue *q, struct io_context *ioc)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
if (!ioc || ioc_batching(q, ioc))
|
|
|
|
return;
|
|
|
|
|
|
|
|
ioc->nr_batch_requests = q->nr_batching;
|
|
|
|
ioc->last_waited = jiffies;
|
|
|
|
}
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
static void __freed_request(struct request_queue *q, int sync)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request_list *rl = &q->rq;
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
if (rl->count[sync] < queue_congestion_off_threshold(q))
|
|
|
|
blk_clear_queue_congested(q, sync);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
if (rl->count[sync] + 1 <= q->nr_requests) {
|
|
|
|
if (waitqueue_active(&rl->wait[sync]))
|
|
|
|
wake_up(&rl->wait[sync]);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
blk_clear_queue_full(q, sync);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* A request has just been released. Account for it, update the full and
|
|
|
|
* congestion status, wake up any waiters. Called under q->queue_lock.
|
|
|
|
*/
|
2009-04-06 14:48:01 +02:00
|
|
|
static void freed_request(struct request_queue *q, int sync, int priv)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request_list *rl = &q->rq;
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
rl->count[sync]--;
|
2005-10-28 08:29:39 +02:00
|
|
|
if (priv)
|
|
|
|
rl->elvpriv--;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
__freed_request(q, sync);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
if (unlikely(rl->starved[sync ^ 1]))
|
|
|
|
__freed_request(q, sync ^ 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2005-06-29 05:45:14 +02:00
|
|
|
* Get a free request, queue_lock must be held.
|
|
|
|
* Returns NULL on failure, with queue_lock held.
|
|
|
|
* Returns !NULL on success, with queue_lock *not held*.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
static struct request *get_request(struct request_queue *q, int rw_flags,
|
2006-12-13 13:02:26 +01:00
|
|
|
struct bio *bio, gfp_t gfp_mask)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request *rq = NULL;
|
|
|
|
struct request_list *rl = &q->rq;
|
2005-11-12 11:09:12 +01:00
|
|
|
struct io_context *ioc = NULL;
|
2009-04-06 14:48:01 +02:00
|
|
|
const bool is_sync = rw_is_sync(rw_flags) != 0;
|
2005-11-12 11:09:12 +01:00
|
|
|
int may_queue, priv;
|
|
|
|
|
2006-12-13 13:02:26 +01:00
|
|
|
may_queue = elv_may_queue(q, rw_flags);
|
2005-11-12 11:09:12 +01:00
|
|
|
if (may_queue == ELV_MQUEUE_NO)
|
|
|
|
goto rq_starved;
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
if (rl->count[is_sync]+1 >= queue_congestion_on_threshold(q)) {
|
|
|
|
if (rl->count[is_sync]+1 >= q->nr_requests) {
|
2006-07-19 23:39:40 +02:00
|
|
|
ioc = current_io_context(GFP_ATOMIC, q->node);
|
2005-11-12 11:09:12 +01:00
|
|
|
/*
|
|
|
|
* The queue will fill after this allocation, so set
|
|
|
|
* it as full, and mark this process as "batching".
|
|
|
|
* This process will be allowed to complete a batch of
|
|
|
|
* requests, others will be blocked.
|
|
|
|
*/
|
2009-04-06 14:48:01 +02:00
|
|
|
if (!blk_queue_full(q, is_sync)) {
|
2005-11-12 11:09:12 +01:00
|
|
|
ioc_set_batching(q, ioc);
|
2009-04-06 14:48:01 +02:00
|
|
|
blk_set_queue_full(q, is_sync);
|
2005-11-12 11:09:12 +01:00
|
|
|
} else {
|
|
|
|
if (may_queue != ELV_MQUEUE_MUST
|
|
|
|
&& !ioc_batching(q, ioc)) {
|
|
|
|
/*
|
|
|
|
* The queue is full and the allocating
|
|
|
|
* process is not a "batcher", and not
|
|
|
|
* exempted by the IO scheduler
|
|
|
|
*/
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2009-04-06 14:48:01 +02:00
|
|
|
blk_set_queue_congested(q, is_sync);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-06-28 16:35:11 +02:00
|
|
|
/*
|
|
|
|
* Only allow batching queuers to allocate up to 50% over the defined
|
|
|
|
* limit of requests, otherwise we could have thousands of requests
|
|
|
|
* allocated with any setting of ->nr_requests
|
|
|
|
*/
|
2009-04-06 14:48:01 +02:00
|
|
|
if (rl->count[is_sync] >= (3 * q->nr_requests / 2))
|
2005-06-28 16:35:11 +02:00
|
|
|
goto out;
|
2005-06-29 16:15:40 +02:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
rl->count[is_sync]++;
|
|
|
|
rl->starved[is_sync] = 0;
|
2005-10-28 08:29:39 +02:00
|
|
|
|
2005-10-28 08:30:39 +02:00
|
|
|
priv = !test_bit(QUEUE_FLAG_ELVSWITCH, &q->queue_flags);
|
2005-10-28 08:29:39 +02:00
|
|
|
if (priv)
|
|
|
|
rl->elvpriv++;
|
|
|
|
|
2009-04-22 14:01:49 +02:00
|
|
|
if (blk_queue_io_stat(q))
|
|
|
|
rw_flags |= REQ_IO_STAT;
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
|
2006-12-13 13:02:26 +01:00
|
|
|
rq = blk_alloc_request(q, rw_flags, priv, gfp_mask);
|
2005-11-12 11:09:12 +01:00
|
|
|
if (unlikely(!rq)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Allocation failed presumably due to memory. Undo anything
|
|
|
|
* we might have messed up.
|
|
|
|
*
|
|
|
|
* Allocating task should really be put onto the front of the
|
|
|
|
* wait queue, but this is pretty rare.
|
|
|
|
*/
|
|
|
|
spin_lock_irq(q->queue_lock);
|
2009-04-06 14:48:01 +02:00
|
|
|
freed_request(q, is_sync, priv);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* in the very unlikely event that allocation failed and no
|
|
|
|
* requests for this direction was pending, mark us starved
|
|
|
|
* so that freeing of a request in the other direction will
|
|
|
|
* notice us. another possible fix would be to split the
|
|
|
|
* rq mempool into READ and WRITE
|
|
|
|
*/
|
|
|
|
rq_starved:
|
2009-04-06 14:48:01 +02:00
|
|
|
if (unlikely(rl->count[is_sync] == 0))
|
|
|
|
rl->starved[is_sync] = 1;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2005-11-12 11:09:12 +01:00
|
|
|
/*
|
|
|
|
* ioc may be NULL here, and ioc_batching will be false. That's
|
|
|
|
* OK, if the queue is under the request limit then requests need
|
|
|
|
* not count toward the nr_batch_requests limit. There will always
|
|
|
|
* be some limit enforced by BLK_BATCH_TIME.
|
|
|
|
*/
|
2005-04-17 00:20:36 +02:00
|
|
|
if (ioc_batching(q, ioc))
|
|
|
|
ioc->nr_batch_requests--;
|
2008-01-31 13:03:55 +01:00
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
trace_block_getrq(q, bio, rw_flags & 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
out:
|
|
|
|
return rq;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No available requests for this queue, unplug the device and wait for some
|
|
|
|
* requests to become available.
|
2005-06-29 05:45:14 +02:00
|
|
|
*
|
|
|
|
* Called with q->queue_lock held, and returns with it unlocked.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
static struct request *get_request_wait(struct request_queue *q, int rw_flags,
|
2005-06-27 10:55:12 +02:00
|
|
|
struct bio *bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2009-04-06 14:48:01 +02:00
|
|
|
const bool is_sync = rw_is_sync(rw_flags) != 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct request *rq;
|
|
|
|
|
2006-12-13 13:02:26 +01:00
|
|
|
rq = get_request(q, rw_flags, bio, GFP_NOIO);
|
2005-06-29 05:45:13 +02:00
|
|
|
while (!rq) {
|
|
|
|
DEFINE_WAIT(wait);
|
2008-05-22 15:13:29 +02:00
|
|
|
struct io_context *ioc;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct request_list *rl = &q->rq;
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
prepare_to_wait_exclusive(&rl->wait[is_sync], &wait,
|
2005-04-17 00:20:36 +02:00
|
|
|
TASK_UNINTERRUPTIBLE);
|
|
|
|
|
2009-04-06 14:48:01 +02:00
|
|
|
trace_block_sleeprq(q, bio, rw_flags & 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-05-22 15:13:29 +02:00
|
|
|
__generic_unplug_device(q);
|
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
io_schedule();
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-05-22 15:13:29 +02:00
|
|
|
/*
|
|
|
|
* After sleeping, we become a "batching" process and
|
|
|
|
* will be able to allocate at least one request, and
|
|
|
|
* up to a big batch of them for a small period time.
|
|
|
|
* See ioc_batching, ioc_set_batching
|
|
|
|
*/
|
|
|
|
ioc = current_io_context(GFP_NOIO, q->node);
|
|
|
|
ioc_set_batching(q, ioc);
|
2005-06-29 05:45:14 +02:00
|
|
|
|
2008-05-22 15:13:29 +02:00
|
|
|
spin_lock_irq(q->queue_lock);
|
2009-04-06 14:48:01 +02:00
|
|
|
finish_wait(&rl->wait[is_sync], &wait);
|
2008-05-22 15:13:29 +02:00
|
|
|
|
|
|
|
rq = get_request(q, rw_flags, bio, GFP_NOIO);
|
|
|
|
};
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
return rq;
|
|
|
|
}
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request *blk_get_request(struct request_queue *q, int rw, gfp_t gfp_mask)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct request *rq;
|
|
|
|
|
|
|
|
BUG_ON(rw != READ && rw != WRITE);
|
|
|
|
|
2005-06-29 05:45:14 +02:00
|
|
|
spin_lock_irq(q->queue_lock);
|
|
|
|
if (gfp_mask & __GFP_WAIT) {
|
2005-06-27 10:55:12 +02:00
|
|
|
rq = get_request_wait(q, rw, NULL);
|
2005-06-29 05:45:14 +02:00
|
|
|
} else {
|
2005-06-27 10:55:12 +02:00
|
|
|
rq = get_request(q, rw, NULL, gfp_mask);
|
2005-06-29 05:45:14 +02:00
|
|
|
if (!rq)
|
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
}
|
|
|
|
/* q->queue_lock is unlocked at this point */
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
return rq;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_get_request);
|
|
|
|
|
2006-07-20 14:54:05 +02:00
|
|
|
/**
|
2009-05-17 17:57:15 +02:00
|
|
|
* blk_make_request - given a bio, allocate a corresponding struct request.
|
2009-06-12 05:00:41 +02:00
|
|
|
* @q: target request queue
|
2009-05-17 17:57:15 +02:00
|
|
|
* @bio: The bio describing the memory mappings that will be submitted for IO.
|
|
|
|
* It may be a chained-bio properly constructed by block/bio layer.
|
2009-06-12 05:00:41 +02:00
|
|
|
* @gfp_mask: gfp flags to be used for memory allocation
|
2006-07-20 14:54:05 +02:00
|
|
|
*
|
2009-05-17 17:57:15 +02:00
|
|
|
* blk_make_request is the parallel of generic_make_request for BLOCK_PC
|
|
|
|
* type commands. Where the struct request needs to be farther initialized by
|
|
|
|
* the caller. It is passed a &struct bio, which describes the memory info of
|
|
|
|
* the I/O transfer.
|
2006-07-20 14:54:05 +02:00
|
|
|
*
|
2009-05-17 17:57:15 +02:00
|
|
|
* The caller of blk_make_request must make sure that bi_io_vec
|
|
|
|
* are set to describe the memory buffers. That bio_data_dir() will return
|
|
|
|
* the needed direction of the request. (And all bio's in the passed bio-chain
|
|
|
|
* are properly set accordingly)
|
|
|
|
*
|
|
|
|
* If called under none-sleepable conditions, mapped bio buffers must not
|
|
|
|
* need bouncing, by calling the appropriate masked or flagged allocator,
|
|
|
|
* suitable for the target device. Otherwise the call to blk_queue_bounce will
|
|
|
|
* BUG.
|
2009-05-19 19:52:35 +02:00
|
|
|
*
|
|
|
|
* WARNING: When allocating/cloning a bio-chain, careful consideration should be
|
|
|
|
* given to how you allocate bios. In particular, you cannot use __GFP_WAIT for
|
|
|
|
* anything but the first bio in the chain. Otherwise you risk waiting for IO
|
|
|
|
* completion of a bio that hasn't been submitted yet, thus resulting in a
|
|
|
|
* deadlock. Alternatively bios should be allocated using bio_kmalloc() instead
|
|
|
|
* of bio_alloc(), as that avoids the mempool deadlock.
|
|
|
|
* If possible a big IO should be split into smaller parts when allocation
|
|
|
|
* fails. Partial allocation should not be an error, or you risk a live-lock.
|
2006-07-20 14:54:05 +02:00
|
|
|
*/
|
2009-05-17 17:57:15 +02:00
|
|
|
struct request *blk_make_request(struct request_queue *q, struct bio *bio,
|
|
|
|
gfp_t gfp_mask)
|
2006-07-20 14:54:05 +02:00
|
|
|
{
|
2009-05-17 17:57:15 +02:00
|
|
|
struct request *rq = blk_get_request(q, bio_data_dir(bio), gfp_mask);
|
|
|
|
|
|
|
|
if (unlikely(!rq))
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
|
|
|
|
for_each_bio(bio) {
|
|
|
|
struct bio *bounce_bio = bio;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
blk_queue_bounce(q, &bounce_bio);
|
|
|
|
ret = blk_rq_append_bio(q, rq, bounce_bio);
|
|
|
|
if (unlikely(ret)) {
|
|
|
|
blk_put_request(rq);
|
|
|
|
return ERR_PTR(ret);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return rq;
|
2006-07-20 14:54:05 +02:00
|
|
|
}
|
2009-05-17 17:57:15 +02:00
|
|
|
EXPORT_SYMBOL(blk_make_request);
|
2006-07-20 14:54:05 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/**
|
|
|
|
* blk_requeue_request - put a request back on queue
|
|
|
|
* @q: request queue where request should be inserted
|
|
|
|
* @rq: request to be inserted
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Drivers often keep queueing requests until the hardware cannot accept
|
|
|
|
* more, when that condition happens we need to put the request back
|
|
|
|
* on the queue. Must be called with queue lock held.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_requeue_request(struct request_queue *q, struct request *rq)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-09-14 14:55:09 +02:00
|
|
|
blk_delete_timer(rq);
|
|
|
|
blk_clear_rq_complete(rq);
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_rq_requeue(q, rq);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (blk_rq_tagged(rq))
|
|
|
|
blk_queue_end_tag(q, rq);
|
|
|
|
|
2009-05-27 14:17:08 +02:00
|
|
|
BUG_ON(blk_queued_rq(rq));
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
elv_requeue_request(q, rq);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_requeue_request);
|
|
|
|
|
|
|
|
/**
|
2008-08-19 20:13:11 +02:00
|
|
|
* blk_insert_request - insert a special request into a request queue
|
2005-04-17 00:20:36 +02:00
|
|
|
* @q: request queue where request should be inserted
|
|
|
|
* @rq: request to be inserted
|
|
|
|
* @at_head: insert request at head or tail of queue
|
|
|
|
* @data: private data
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Many block devices need to execute commands asynchronously, so they don't
|
|
|
|
* block the whole kernel from preemption during request execution. This is
|
|
|
|
* accomplished normally by inserting aritficial requests tagged as
|
2008-08-19 20:13:11 +02:00
|
|
|
* REQ_TYPE_SPECIAL in to the corresponding request queue, and letting them
|
|
|
|
* be scheduled for actual execution by the request queue.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* We have the option of inserting the head or the tail of the queue.
|
|
|
|
* Typically we use the tail for new ioctls and so forth. We use the head
|
|
|
|
* of the queue for things like a QUEUE_FULL message from a device, or a
|
|
|
|
* host that is unable to accept a particular command.
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
void blk_insert_request(struct request_queue *q, struct request *rq,
|
2005-04-24 09:06:05 +02:00
|
|
|
int at_head, void *data)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-04-24 09:06:05 +02:00
|
|
|
int where = at_head ? ELEVATOR_INSERT_FRONT : ELEVATOR_INSERT_BACK;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* tell I/O scheduler that this isn't a regular read/write (ie it
|
|
|
|
* must not attempt merges on this) and that it acts as a soft
|
|
|
|
* barrier
|
|
|
|
*/
|
2006-08-10 08:44:47 +02:00
|
|
|
rq->cmd_type = REQ_TYPE_SPECIAL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
rq->special = data;
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If command is tagged, release the tag
|
|
|
|
*/
|
2005-04-24 09:06:05 +02:00
|
|
|
if (blk_rq_tagged(rq))
|
|
|
|
blk_queue_end_tag(q, rq);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-10-23 15:05:46 +02:00
|
|
|
drive_stat_acct(rq, 1);
|
2005-04-24 09:06:05 +02:00
|
|
|
__elv_add_request(q, rq, where, 0);
|
2009-04-23 04:05:17 +02:00
|
|
|
__blk_run_queue(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_insert_request);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* add-request adds a request to the linked list.
|
|
|
|
* queue lock is held and interrupts disabled, as we muck with the
|
|
|
|
* request queue list.
|
|
|
|
*/
|
2008-01-31 13:03:55 +01:00
|
|
|
static inline void add_request(struct request_queue *q, struct request *req)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-10-23 15:05:46 +02:00
|
|
|
drive_stat_acct(req, 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* elevator indicated where it wants this request to be
|
|
|
|
* inserted at elevator_merge time
|
|
|
|
*/
|
|
|
|
__elv_add_request(q, req, ELEVATOR_INSERT_SORT, 0);
|
|
|
|
}
|
2008-01-31 13:03:55 +01:00
|
|
|
|
2008-08-25 12:56:14 +02:00
|
|
|
static void part_round_stats_single(int cpu, struct hd_struct *part,
|
|
|
|
unsigned long now)
|
|
|
|
{
|
|
|
|
if (now == part->stamp)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (part->in_flight) {
|
|
|
|
__part_stat_add(cpu, part, time_in_queue,
|
|
|
|
part->in_flight * (now - part->stamp));
|
|
|
|
__part_stat_add(cpu, part, io_ticks, (now - part->stamp));
|
|
|
|
}
|
|
|
|
part->stamp = now;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2008-10-16 07:46:23 +02:00
|
|
|
* part_round_stats() - Round off the performance stats on a struct disk_stats.
|
|
|
|
* @cpu: cpu number for stats access
|
|
|
|
* @part: target partition
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* The average IO queue length and utilisation statistics are maintained
|
|
|
|
* by observing the current state of the queue length and the amount of
|
|
|
|
* time it has been in this state for.
|
|
|
|
*
|
|
|
|
* Normally, that accounting is done on IO completion, but that can result
|
|
|
|
* in more than a second's worth of IO being accounted for within any one
|
|
|
|
* second, leading to >100% utilisation. To deal with that, we call this
|
|
|
|
* function to do a round-off before returning the results when reading
|
|
|
|
* /proc/diskstats. This accounts immediately for all queue usage up to
|
|
|
|
* the current jiffies and restarts the counters again.
|
|
|
|
*/
|
2008-08-25 12:47:21 +02:00
|
|
|
void part_round_stats(int cpu, struct hd_struct *part)
|
2008-02-08 11:04:35 +01:00
|
|
|
{
|
|
|
|
unsigned long now = jiffies;
|
|
|
|
|
2008-08-25 12:56:14 +02:00
|
|
|
if (part->partno)
|
|
|
|
part_round_stats_single(cpu, &part_to_disk(part)->part0, now);
|
|
|
|
part_round_stats_single(cpu, part, now);
|
2008-02-08 11:04:35 +01:00
|
|
|
}
|
2008-08-25 12:56:14 +02:00
|
|
|
EXPORT_SYMBOL_GPL(part_round_stats);
|
2008-02-08 11:04:35 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* queue lock must be held
|
|
|
|
*/
|
2007-07-24 09:28:11 +02:00
|
|
|
void __blk_put_request(struct request_queue *q, struct request *req)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
if (unlikely(!q))
|
|
|
|
return;
|
|
|
|
if (unlikely(--req->ref_count))
|
|
|
|
return;
|
|
|
|
|
2005-10-20 16:23:44 +02:00
|
|
|
elv_completed_request(q, req);
|
|
|
|
|
2009-03-24 12:35:07 +01:00
|
|
|
/* this is a bio leak */
|
|
|
|
WARN_ON(req->bio != NULL);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Request may not have originated from ll_rw_blk. if not,
|
|
|
|
* it didn't come out of our reserved rq pools
|
|
|
|
*/
|
2006-08-10 08:59:11 +02:00
|
|
|
if (req->cmd_flags & REQ_ALLOCED) {
|
2009-04-06 14:48:01 +02:00
|
|
|
int is_sync = rq_is_sync(req) != 0;
|
2006-08-10 08:44:47 +02:00
|
|
|
int priv = req->cmd_flags & REQ_ELVPRIV;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
BUG_ON(!list_empty(&req->queuelist));
|
2006-07-28 09:23:08 +02:00
|
|
|
BUG_ON(!hlist_unhashed(&req->hash));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
blk_free_request(q, req);
|
2009-04-06 14:48:01 +02:00
|
|
|
freed_request(q, is_sync, priv);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
2005-11-11 12:30:24 +01:00
|
|
|
EXPORT_SYMBOL_GPL(__blk_put_request);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
void blk_put_request(struct request *req)
|
|
|
|
{
|
2005-10-20 16:23:44 +02:00
|
|
|
unsigned long flags;
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q = req->q;
|
2005-10-20 16:23:44 +02:00
|
|
|
|
2008-07-15 21:21:45 +02:00
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
__blk_put_request(q, req);
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_put_request);
|
|
|
|
|
2008-01-29 14:53:40 +01:00
|
|
|
void init_request_from_bio(struct request *req, struct bio *bio)
|
2006-01-06 09:49:58 +01:00
|
|
|
{
|
2008-09-13 20:26:01 +02:00
|
|
|
req->cpu = bio->bi_comp_cpu;
|
2006-08-10 08:44:47 +02:00
|
|
|
req->cmd_type = REQ_TYPE_FS;
|
2006-01-06 09:49:58 +01:00
|
|
|
|
|
|
|
/*
|
2009-07-03 10:48:16 +02:00
|
|
|
* Inherit FAILFAST from bio (for read-ahead, and explicit
|
|
|
|
* FAILFAST). FAILFAST flags are identical for req and bio.
|
2006-01-06 09:49:58 +01:00
|
|
|
*/
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_AHEAD))
|
2009-07-03 10:48:16 +02:00
|
|
|
req->cmd_flags |= REQ_FAILFAST_MASK;
|
|
|
|
else
|
|
|
|
req->cmd_flags |= bio->bi_rw & REQ_FAILFAST_MASK;
|
2006-01-06 09:49:58 +01:00
|
|
|
|
2009-09-11 14:32:04 +02:00
|
|
|
if (unlikely(bio_rw_flagged(bio, BIO_RW_DISCARD))) {
|
2008-08-09 17:42:20 +02:00
|
|
|
req->cmd_flags |= REQ_DISCARD;
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_BARRIER))
|
2008-08-09 17:42:20 +02:00
|
|
|
req->cmd_flags |= REQ_SOFTBARRIER;
|
2008-08-05 19:01:53 +02:00
|
|
|
req->q->prepare_discard_fn(req->q, req);
|
2009-09-11 14:32:04 +02:00
|
|
|
} else if (unlikely(bio_rw_flagged(bio, BIO_RW_BARRIER)))
|
2009-04-23 04:05:17 +02:00
|
|
|
req->cmd_flags |= REQ_HARDBARRIER;
|
2006-01-06 09:49:58 +01:00
|
|
|
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_SYNCIO))
|
2006-08-10 08:44:47 +02:00
|
|
|
req->cmd_flags |= REQ_RW_SYNC;
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_META))
|
2006-08-10 09:01:02 +02:00
|
|
|
req->cmd_flags |= REQ_RW_META;
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_NOIDLE))
|
2009-04-06 14:48:07 +02:00
|
|
|
req->cmd_flags |= REQ_NOIDLE;
|
2006-06-13 08:26:10 +02:00
|
|
|
|
2006-01-06 09:49:58 +01:00
|
|
|
req->errors = 0;
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__sector = bio->bi_sector;
|
2006-01-06 09:49:58 +01:00
|
|
|
req->ioprio = bio_prio(bio);
|
2007-08-16 13:31:30 +02:00
|
|
|
blk_rq_bio_prep(req->q, req, bio);
|
2006-01-06 09:49:58 +01:00
|
|
|
}
|
|
|
|
|
2009-04-06 14:48:06 +02:00
|
|
|
/*
|
|
|
|
* Only disabling plugging for non-rotational devices if it does tagging
|
|
|
|
* as well, otherwise we do need the proper merging
|
|
|
|
*/
|
|
|
|
static inline bool queue_should_plug(struct request_queue *q)
|
|
|
|
{
|
|
|
|
return !(blk_queue_nonrot(q) && blk_queue_tagged(q));
|
|
|
|
}
|
|
|
|
|
2007-07-24 09:28:11 +02:00
|
|
|
static int __make_request(struct request_queue *q, struct bio *bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-06-29 05:45:13 +02:00
|
|
|
struct request *req;
|
2009-05-07 15:24:41 +02:00
|
|
|
int el_ret;
|
|
|
|
unsigned int bytes = bio->bi_size;
|
2006-07-18 04:14:45 +02:00
|
|
|
const unsigned short prio = bio_prio(bio);
|
2009-09-11 14:32:04 +02:00
|
|
|
const bool sync = bio_rw_flagged(bio, BIO_RW_SYNCIO);
|
|
|
|
const bool unplug = bio_rw_flagged(bio, BIO_RW_UNPLUG);
|
2009-07-03 10:48:17 +02:00
|
|
|
const unsigned int ff = bio->bi_rw & REQ_FAILFAST_MASK;
|
2006-12-13 13:02:26 +01:00
|
|
|
int rw_flags;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_BARRIER) && bio_has_data(bio) &&
|
2009-06-30 09:35:44 +02:00
|
|
|
(q->next_ordered == QUEUE_ORDERED_NONE)) {
|
|
|
|
bio_endio(bio, -EOPNOTSUPP);
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* low level driver can indicate that it wants pages above a
|
|
|
|
* certain limit bounced to low memory (ie for highmem, or even
|
|
|
|
* ISA dma in theory)
|
|
|
|
*/
|
|
|
|
blk_queue_bounce(q, &bio);
|
|
|
|
|
|
|
|
spin_lock_irq(q->queue_lock);
|
|
|
|
|
2009-09-11 14:32:04 +02:00
|
|
|
if (unlikely(bio_rw_flagged(bio, BIO_RW_BARRIER)) || elv_queue_empty(q))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto get_rq;
|
|
|
|
|
|
|
|
el_ret = elv_merge(q, &req, bio);
|
|
|
|
switch (el_ret) {
|
2008-01-31 13:03:55 +01:00
|
|
|
case ELEVATOR_BACK_MERGE:
|
|
|
|
BUG_ON(!rq_mergeable(req));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
if (!ll_back_merge_fn(q, req, bio))
|
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_bio_backmerge(q, bio);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff)
|
|
|
|
blk_rq_set_mixed_merge(req);
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
req->biotail->bi_next = bio;
|
|
|
|
req->biotail = bio;
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__data_len += bytes;
|
2008-01-31 13:03:55 +01:00
|
|
|
req->ioprio = ioprio_best(req->ioprio, prio);
|
2008-08-26 10:25:02 +02:00
|
|
|
if (!blk_rq_cpu_valid(req))
|
|
|
|
req->cpu = bio->bi_comp_cpu;
|
2008-01-31 13:03:55 +01:00
|
|
|
drive_stat_acct(req, 0);
|
|
|
|
if (!attempt_back_merge(q, req))
|
|
|
|
elv_merged_request(q, req, el_ret);
|
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
case ELEVATOR_FRONT_MERGE:
|
|
|
|
BUG_ON(!rq_mergeable(req));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
if (!ll_front_merge_fn(q, req, bio))
|
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_bio_frontmerge(q, bio);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) {
|
|
|
|
blk_rq_set_mixed_merge(req);
|
|
|
|
req->cmd_flags &= ~REQ_FAILFAST_MASK;
|
|
|
|
req->cmd_flags |= ff;
|
|
|
|
}
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
bio->bi_next = req->bio;
|
|
|
|
req->bio = bio;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
/*
|
|
|
|
* may not be valid. if the low level driver said
|
|
|
|
* it didn't need a bounce buffer then it better
|
|
|
|
* not touch req->buffer either...
|
|
|
|
*/
|
|
|
|
req->buffer = bio_data(bio);
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__sector = bio->bi_sector;
|
|
|
|
req->__data_len += bytes;
|
2008-01-31 13:03:55 +01:00
|
|
|
req->ioprio = ioprio_best(req->ioprio, prio);
|
2008-08-26 10:25:02 +02:00
|
|
|
if (!blk_rq_cpu_valid(req))
|
|
|
|
req->cpu = bio->bi_comp_cpu;
|
2008-01-31 13:03:55 +01:00
|
|
|
drive_stat_acct(req, 0);
|
|
|
|
if (!attempt_front_merge(q, req))
|
|
|
|
elv_merged_request(q, req, el_ret);
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* ELV_NO_MERGE: elevator says don't/can't merge. */
|
|
|
|
default:
|
|
|
|
;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2005-06-29 05:45:13 +02:00
|
|
|
get_rq:
|
2006-12-13 13:02:26 +01:00
|
|
|
/*
|
|
|
|
* This sync check and mask will be re-done in init_request_from_bio(),
|
|
|
|
* but we need to set it earlier to expose the sync flag to the
|
|
|
|
* rq allocator and io schedulers.
|
|
|
|
*/
|
|
|
|
rw_flags = bio_data_dir(bio);
|
|
|
|
if (sync)
|
|
|
|
rw_flags |= REQ_RW_SYNC;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2005-06-29 05:45:13 +02:00
|
|
|
* Grab a free request. This is might sleep but can not fail.
|
2005-06-29 05:45:14 +02:00
|
|
|
* Returns with the queue unlocked.
|
2005-06-29 05:45:13 +02:00
|
|
|
*/
|
2006-12-13 13:02:26 +01:00
|
|
|
req = get_request_wait(q, rw_flags, bio);
|
2005-06-29 05:45:14 +02:00
|
|
|
|
2005-06-29 05:45:13 +02:00
|
|
|
/*
|
|
|
|
* After dropping the lock and possibly sleeping here, our request
|
|
|
|
* may now be mergeable after it had proven unmergeable (above).
|
|
|
|
* We don't worry about that case for efficiency. It won't happen
|
|
|
|
* often, and the elevators are able to handle it.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2006-01-06 09:49:58 +01:00
|
|
|
init_request_from_bio(req, bio);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-06-29 05:45:13 +02:00
|
|
|
spin_lock_irq(q->queue_lock);
|
2008-09-13 20:26:01 +02:00
|
|
|
if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags) ||
|
|
|
|
bio_flagged(bio, BIO_CPU_AFFINE))
|
|
|
|
req->cpu = blk_cpu_to_group(smp_processor_id());
|
2009-04-06 14:48:06 +02:00
|
|
|
if (queue_should_plug(q) && elv_queue_empty(q))
|
2005-06-29 05:45:13 +02:00
|
|
|
blk_plug_device(q);
|
2005-04-17 00:20:36 +02:00
|
|
|
add_request(q, req);
|
|
|
|
out:
|
2009-04-06 14:48:06 +02:00
|
|
|
if (unplug || !queue_should_plug(q))
|
2005-04-17 00:20:36 +02:00
|
|
|
__generic_unplug_device(q);
|
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If bio->bi_dev is a partition, remap the location
|
|
|
|
*/
|
|
|
|
static inline void blk_partition_remap(struct bio *bio)
|
|
|
|
{
|
|
|
|
struct block_device *bdev = bio->bi_bdev;
|
|
|
|
|
2007-09-27 13:01:25 +02:00
|
|
|
if (bio_sectors(bio) && bdev != bdev->bd_contains) {
|
2005-04-17 00:20:36 +02:00
|
|
|
struct hd_struct *p = bdev->bd_part;
|
|
|
|
|
|
|
|
bio->bi_sector += p->start_sect;
|
|
|
|
bio->bi_bdev = bdev->bd_contains;
|
2007-08-07 15:30:23 +02:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_remap(bdev_get_queue(bio->bi_bdev), bio,
|
2009-05-04 22:35:08 +02:00
|
|
|
bdev->bd_dev,
|
2007-08-07 15:30:23 +02:00
|
|
|
bio->bi_sector - p->start_sect);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void handle_bad_sector(struct bio *bio)
|
|
|
|
{
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
|
|
|
|
printk(KERN_INFO "attempt to access beyond end of device\n");
|
|
|
|
printk(KERN_INFO "%s: rw=%ld, want=%Lu, limit=%Lu\n",
|
|
|
|
bdevname(bio->bi_bdev, b),
|
|
|
|
bio->bi_rw,
|
|
|
|
(unsigned long long)bio->bi_sector + bio_sectors(bio),
|
|
|
|
(long long)(bio->bi_bdev->bd_inode->i_size >> 9));
|
|
|
|
|
|
|
|
set_bit(BIO_EOF, &bio->bi_flags);
|
|
|
|
}
|
|
|
|
|
2006-12-08 11:39:46 +01:00
|
|
|
#ifdef CONFIG_FAIL_MAKE_REQUEST
|
|
|
|
|
|
|
|
static DECLARE_FAULT_ATTR(fail_make_request);
|
|
|
|
|
|
|
|
static int __init setup_fail_make_request(char *str)
|
|
|
|
{
|
|
|
|
return setup_fault_attr(&fail_make_request, str);
|
|
|
|
}
|
|
|
|
__setup("fail_make_request=", setup_fail_make_request);
|
|
|
|
|
|
|
|
static int should_fail_request(struct bio *bio)
|
|
|
|
{
|
2008-08-25 12:56:13 +02:00
|
|
|
struct hd_struct *part = bio->bi_bdev->bd_part;
|
|
|
|
|
|
|
|
if (part_to_disk(part)->part0.make_it_fail || part->make_it_fail)
|
2006-12-08 11:39:46 +01:00
|
|
|
return should_fail(&fail_make_request, bio->bi_size);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __init fail_make_request_debugfs(void)
|
|
|
|
{
|
|
|
|
return init_fault_attr_dentries(&fail_make_request,
|
|
|
|
"fail_make_request");
|
|
|
|
}
|
|
|
|
|
|
|
|
late_initcall(fail_make_request_debugfs);
|
|
|
|
|
|
|
|
#else /* CONFIG_FAIL_MAKE_REQUEST */
|
|
|
|
|
|
|
|
static inline int should_fail_request(struct bio *bio)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_FAIL_MAKE_REQUEST */
|
|
|
|
|
2007-07-18 13:27:58 +02:00
|
|
|
/*
|
|
|
|
* Check whether this bio extends beyond the end of the device.
|
|
|
|
*/
|
|
|
|
static inline int bio_check_eod(struct bio *bio, unsigned int nr_sectors)
|
|
|
|
{
|
|
|
|
sector_t maxsector;
|
|
|
|
|
|
|
|
if (!nr_sectors)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Test device or partition size, when known. */
|
|
|
|
maxsector = bio->bi_bdev->bd_inode->i_size >> 9;
|
|
|
|
if (maxsector) {
|
|
|
|
sector_t sector = bio->bi_sector;
|
|
|
|
|
|
|
|
if (maxsector < nr_sectors || maxsector - nr_sectors < sector) {
|
|
|
|
/*
|
|
|
|
* This may well happen - the kernel calls bread()
|
|
|
|
* without checking the size of the device, e.g., when
|
|
|
|
* mounting a device.
|
|
|
|
*/
|
|
|
|
handle_bad_sector(bio);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/**
|
2008-08-19 20:13:11 +02:00
|
|
|
* generic_make_request - hand a buffer to its device driver for I/O
|
2005-04-17 00:20:36 +02:00
|
|
|
* @bio: The bio describing the location in memory and on the device.
|
|
|
|
*
|
|
|
|
* generic_make_request() is used to make I/O requests of block
|
|
|
|
* devices. It is passed a &struct bio, which describes the I/O that needs
|
|
|
|
* to be done.
|
|
|
|
*
|
|
|
|
* generic_make_request() does not return any status. The
|
|
|
|
* success/failure status of the request, along with notification of
|
|
|
|
* completion, is delivered asynchronously through the bio->bi_end_io
|
|
|
|
* function described (one day) else where.
|
|
|
|
*
|
|
|
|
* The caller of generic_make_request must make sure that bi_io_vec
|
|
|
|
* are set to describe the memory buffer, and that bi_dev and bi_sector are
|
|
|
|
* set to describe the device address, and the
|
|
|
|
* bi_end_io and optionally bi_private are set to describe how
|
|
|
|
* completion notification should be signaled.
|
|
|
|
*
|
|
|
|
* generic_make_request and the drivers it calls may use bi_next if this
|
|
|
|
* bio happens to be merged with someone else, and may change bi_dev and
|
|
|
|
* bi_sector for remaps as it sees fit. So the values of these fields
|
|
|
|
* should NOT be depended on after the call to generic_make_request.
|
|
|
|
*/
|
When stacked block devices are in-use (e.g. md or dm), the recursive calls
to generic_make_request can use up a lot of space, and we would rather they
didn't.
As generic_make_request is a void function, and as it is generally not
expected that it will have any effect immediately, it is safe to delay any
call to generic_make_request until there is sufficient stack space
available.
As ->bi_next is reserved for the driver to use, it can have no valid value
when generic_make_request is called, and as __make_request implicitly
assumes it will be NULL (ELEVATOR_BACK_MERGE fork of switch) we can be
certain that all callers set it to NULL. We can therefore safely use
bi_next to link pending requests together, providing we clear it before
making the real call.
So, we choose to allow each thread to only be active in one
generic_make_request at a time. If a subsequent (recursive) call is made,
the bio is linked into a per-thread list, and is handled when the active
call completes.
As the list of pending bios is per-thread, there are no locking issues to
worry about.
I say above that it is "safe to delay any call...". There are, however,
some behaviours of a make_request_fn which would make it unsafe. These
include any behaviour that assumes anything will have changed after a
recursive call to generic_make_request.
These could include:
- waiting for that call to finish and call it's bi_end_io function.
md use to sometimes do this (marking the superblock dirty before
completing a write) but doesn't any more
- inspecting the bio for fields that generic_make_request might
change, such as bi_sector or bi_bdev. It is hard to see a good
reason for this, and I don't think anyone actually does it.
- inspecing the queue to see if, e.g. it is 'full' yet. Again, I
think this is very unlikely to be useful, or to be done.
Signed-off-by: Neil Brown <neilb@suse.de>
Cc: Jens Axboe <axboe@kernel.dk>
Cc: <dm-devel@redhat.com>
Alasdair G Kergon <agk@redhat.com> said:
I can see nothing wrong with this in principle.
For device-mapper at the moment though it's essential that, while the bio
mappings may now get delayed, they still get processed in exactly
the same order as they were passed to generic_make_request().
My main concern is whether the timing changes implicit in this patch
will make the rare data-corrupting races in the existing snapshot code
more likely. (I'm working on a fix for these races, but the unfinished
patch is already several hundred lines long.)
It would be helpful if some people on this mailing list would test
this patch in various scenarios and report back.
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2007-05-01 09:53:42 +02:00
|
|
|
static inline void __generic_make_request(struct bio *bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-24 09:28:11 +02:00
|
|
|
struct request_queue *q;
|
2006-10-31 07:07:21 +01:00
|
|
|
sector_t old_sector;
|
2005-04-17 00:20:36 +02:00
|
|
|
int ret, nr_sectors = bio_sectors(bio);
|
2006-03-23 20:00:26 +01:00
|
|
|
dev_t old_dev;
|
2007-11-02 08:49:08 +01:00
|
|
|
int err = -EIO;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
might_sleep();
|
|
|
|
|
2007-07-18 13:27:58 +02:00
|
|
|
if (bio_check_eod(bio, nr_sectors))
|
|
|
|
goto end_io;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Resolve the mapping until finished. (drivers are
|
|
|
|
* still free to implement/resolve their own stacking
|
|
|
|
* by explicitly returning 0)
|
|
|
|
*
|
|
|
|
* NOTE: we don't repeat the blk_size check for each new device.
|
|
|
|
* Stacking drivers are expected to know what they are doing.
|
|
|
|
*/
|
2006-10-31 07:07:21 +01:00
|
|
|
old_sector = -1;
|
2006-03-23 20:00:26 +01:00
|
|
|
old_dev = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
do {
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
|
|
|
|
q = bdev_get_queue(bio->bi_bdev);
|
2008-11-28 05:32:03 +01:00
|
|
|
if (unlikely(!q)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
printk(KERN_ERR
|
|
|
|
"generic_make_request: Trying to access "
|
|
|
|
"nonexistent block-device %s (%Lu)\n",
|
|
|
|
bdevname(bio->bi_bdev, b),
|
|
|
|
(long long) bio->bi_sector);
|
2008-11-28 05:32:03 +01:00
|
|
|
goto end_io;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2009-05-22 23:17:50 +02:00
|
|
|
if (unlikely(nr_sectors > queue_max_hw_sectors(q))) {
|
2008-01-31 13:03:55 +01:00
|
|
|
printk(KERN_ERR "bio too big device %s (%u > %u)\n",
|
2009-05-22 23:17:50 +02:00
|
|
|
bdevname(bio->bi_bdev, b),
|
|
|
|
bio_sectors(bio),
|
|
|
|
queue_max_hw_sectors(q));
|
2005-04-17 00:20:36 +02:00
|
|
|
goto end_io;
|
|
|
|
}
|
|
|
|
|
2005-06-23 09:08:53 +02:00
|
|
|
if (unlikely(test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto end_io;
|
|
|
|
|
2006-12-08 11:39:46 +01:00
|
|
|
if (should_fail_request(bio))
|
|
|
|
goto end_io;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* If this device has partitions, remap block n
|
|
|
|
* of partition p to block n+start(p) of the disk.
|
|
|
|
*/
|
|
|
|
blk_partition_remap(bio);
|
|
|
|
|
2008-06-30 20:04:41 +02:00
|
|
|
if (bio_integrity_enabled(bio) && bio_integrity_prep(bio))
|
|
|
|
goto end_io;
|
|
|
|
|
2006-10-31 07:07:21 +01:00
|
|
|
if (old_sector != -1)
|
2009-05-04 22:35:08 +02:00
|
|
|
trace_block_remap(q, bio, old_dev, old_sector);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_bio_queue(q, bio);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2006-10-31 07:07:21 +01:00
|
|
|
old_sector = bio->bi_sector;
|
2006-03-23 20:00:26 +01:00
|
|
|
old_dev = bio->bi_bdev->bd_dev;
|
|
|
|
|
2007-07-18 13:27:58 +02:00
|
|
|
if (bio_check_eod(bio, nr_sectors))
|
|
|
|
goto end_io;
|
2008-11-28 05:32:03 +01:00
|
|
|
|
2009-09-11 14:32:04 +02:00
|
|
|
if (bio_rw_flagged(bio, BIO_RW_DISCARD) &&
|
|
|
|
!q->prepare_discard_fn) {
|
2007-11-02 08:49:08 +01:00
|
|
|
err = -EOPNOTSUPP;
|
|
|
|
goto end_io;
|
|
|
|
}
|
2006-10-31 07:07:21 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
ret = q->make_request_fn(q, bio);
|
|
|
|
} while (ret);
|
2008-11-28 05:32:03 +01:00
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
end_io:
|
|
|
|
bio_endio(bio, err);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
When stacked block devices are in-use (e.g. md or dm), the recursive calls
to generic_make_request can use up a lot of space, and we would rather they
didn't.
As generic_make_request is a void function, and as it is generally not
expected that it will have any effect immediately, it is safe to delay any
call to generic_make_request until there is sufficient stack space
available.
As ->bi_next is reserved for the driver to use, it can have no valid value
when generic_make_request is called, and as __make_request implicitly
assumes it will be NULL (ELEVATOR_BACK_MERGE fork of switch) we can be
certain that all callers set it to NULL. We can therefore safely use
bi_next to link pending requests together, providing we clear it before
making the real call.
So, we choose to allow each thread to only be active in one
generic_make_request at a time. If a subsequent (recursive) call is made,
the bio is linked into a per-thread list, and is handled when the active
call completes.
As the list of pending bios is per-thread, there are no locking issues to
worry about.
I say above that it is "safe to delay any call...". There are, however,
some behaviours of a make_request_fn which would make it unsafe. These
include any behaviour that assumes anything will have changed after a
recursive call to generic_make_request.
These could include:
- waiting for that call to finish and call it's bi_end_io function.
md use to sometimes do this (marking the superblock dirty before
completing a write) but doesn't any more
- inspecting the bio for fields that generic_make_request might
change, such as bi_sector or bi_bdev. It is hard to see a good
reason for this, and I don't think anyone actually does it.
- inspecing the queue to see if, e.g. it is 'full' yet. Again, I
think this is very unlikely to be useful, or to be done.
Signed-off-by: Neil Brown <neilb@suse.de>
Cc: Jens Axboe <axboe@kernel.dk>
Cc: <dm-devel@redhat.com>
Alasdair G Kergon <agk@redhat.com> said:
I can see nothing wrong with this in principle.
For device-mapper at the moment though it's essential that, while the bio
mappings may now get delayed, they still get processed in exactly
the same order as they were passed to generic_make_request().
My main concern is whether the timing changes implicit in this patch
will make the rare data-corrupting races in the existing snapshot code
more likely. (I'm working on a fix for these races, but the unfinished
patch is already several hundred lines long.)
It would be helpful if some people on this mailing list would test
this patch in various scenarios and report back.
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2007-05-01 09:53:42 +02:00
|
|
|
/*
|
|
|
|
* We only want one ->make_request_fn to be active at a time,
|
|
|
|
* else stack usage with stacked devices could be a problem.
|
|
|
|
* So use current->bio_{list,tail} to keep a list of requests
|
|
|
|
* submited by a make_request_fn function.
|
|
|
|
* current->bio_tail is also used as a flag to say if
|
|
|
|
* generic_make_request is currently active in this task or not.
|
|
|
|
* If it is NULL, then no make_request is active. If it is non-NULL,
|
|
|
|
* then a make_request is active, and new requests should be added
|
|
|
|
* at the tail
|
|
|
|
*/
|
|
|
|
void generic_make_request(struct bio *bio)
|
|
|
|
{
|
|
|
|
if (current->bio_tail) {
|
|
|
|
/* make_request is active */
|
|
|
|
*(current->bio_tail) = bio;
|
|
|
|
bio->bi_next = NULL;
|
|
|
|
current->bio_tail = &bio->bi_next;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* following loop may be a bit non-obvious, and so deserves some
|
|
|
|
* explanation.
|
|
|
|
* Before entering the loop, bio->bi_next is NULL (as all callers
|
|
|
|
* ensure that) so we have a list with a single bio.
|
|
|
|
* We pretend that we have just taken it off a longer list, so
|
|
|
|
* we assign bio_list to the next (which is NULL) and bio_tail
|
|
|
|
* to &bio_list, thus initialising the bio_list of new bios to be
|
|
|
|
* added. __generic_make_request may indeed add some more bios
|
|
|
|
* through a recursive call to generic_make_request. If it
|
|
|
|
* did, we find a non-NULL value in bio_list and re-enter the loop
|
|
|
|
* from the top. In this case we really did just take the bio
|
|
|
|
* of the top of the list (no pretending) and so fixup bio_list and
|
|
|
|
* bio_tail or bi_next, and call into __generic_make_request again.
|
|
|
|
*
|
|
|
|
* The loop was structured like this to make only one call to
|
|
|
|
* __generic_make_request (which is important as it is large and
|
|
|
|
* inlined) and to keep the structure simple.
|
|
|
|
*/
|
|
|
|
BUG_ON(bio->bi_next);
|
|
|
|
do {
|
|
|
|
current->bio_list = bio->bi_next;
|
|
|
|
if (bio->bi_next == NULL)
|
|
|
|
current->bio_tail = ¤t->bio_list;
|
|
|
|
else
|
|
|
|
bio->bi_next = NULL;
|
|
|
|
__generic_make_request(bio);
|
|
|
|
bio = current->bio_list;
|
|
|
|
} while (bio);
|
|
|
|
current->bio_tail = NULL; /* deactivate */
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
EXPORT_SYMBOL(generic_make_request);
|
|
|
|
|
|
|
|
/**
|
2008-08-19 20:13:11 +02:00
|
|
|
* submit_bio - submit a bio to the block device layer for I/O
|
2005-04-17 00:20:36 +02:00
|
|
|
* @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
|
|
|
|
* @bio: The &struct bio which describes the I/O
|
|
|
|
*
|
|
|
|
* submit_bio() is very similar in purpose to generic_make_request(), and
|
|
|
|
* uses that function to do most of the work. Both are fairly rough
|
2008-08-19 20:13:11 +02:00
|
|
|
* interfaces; @bio must be presetup and ready for I/O.
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
void submit_bio(int rw, struct bio *bio)
|
|
|
|
{
|
|
|
|
int count = bio_sectors(bio);
|
|
|
|
|
2005-06-27 10:55:12 +02:00
|
|
|
bio->bi_rw |= rw;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-09-27 13:01:25 +02:00
|
|
|
/*
|
|
|
|
* If it's a regular read/write or a barrier with data attached,
|
|
|
|
* go through the normal accounting stuff before submission.
|
|
|
|
*/
|
2008-08-08 11:04:44 +02:00
|
|
|
if (bio_has_data(bio)) {
|
2007-09-27 13:01:25 +02:00
|
|
|
if (rw & WRITE) {
|
|
|
|
count_vm_events(PGPGOUT, count);
|
|
|
|
} else {
|
|
|
|
task_io_account_read(bio->bi_size);
|
|
|
|
count_vm_events(PGPGIN, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (unlikely(block_dump)) {
|
|
|
|
char b[BDEVNAME_SIZE];
|
|
|
|
printk(KERN_DEBUG "%s(%d): %s block %Lu on %s\n",
|
2007-10-19 08:40:40 +02:00
|
|
|
current->comm, task_pid_nr(current),
|
2007-09-27 13:01:25 +02:00
|
|
|
(rw & WRITE) ? "WRITE" : "READ",
|
|
|
|
(unsigned long long)bio->bi_sector,
|
2008-01-31 13:03:55 +01:00
|
|
|
bdevname(bio->bi_bdev, b));
|
2007-09-27 13:01:25 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
generic_make_request(bio);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(submit_bio);
|
|
|
|
|
2008-09-18 16:45:38 +02:00
|
|
|
/**
|
|
|
|
* blk_rq_check_limits - Helper function to check a request for the queue limit
|
|
|
|
* @q: the queue
|
|
|
|
* @rq: the request being checked
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* @rq may have been made based on weaker limitations of upper-level queues
|
|
|
|
* in request stacking drivers, and it may violate the limitation of @q.
|
|
|
|
* Since the block layer and the underlying device driver trust @rq
|
|
|
|
* after it is inserted to @q, it should be checked against @q before
|
|
|
|
* the insertion using this generic function.
|
|
|
|
*
|
|
|
|
* This function should also be useful for request stacking drivers
|
|
|
|
* in some cases below, so export this fuction.
|
|
|
|
* Request stacking drivers like request-based dm may change the queue
|
|
|
|
* limits while requests are in the queue (e.g. dm's table swapping).
|
|
|
|
* Such request stacking drivers should check those requests agaist
|
|
|
|
* the new queue limits again when they dispatch those requests,
|
|
|
|
* although such checkings are also done against the old queue limits
|
|
|
|
* when submitting requests.
|
|
|
|
*/
|
|
|
|
int blk_rq_check_limits(struct request_queue *q, struct request *rq)
|
|
|
|
{
|
2009-05-22 23:17:50 +02:00
|
|
|
if (blk_rq_sectors(rq) > queue_max_sectors(q) ||
|
|
|
|
blk_rq_bytes(rq) > queue_max_hw_sectors(q) << 9) {
|
2008-09-18 16:45:38 +02:00
|
|
|
printk(KERN_ERR "%s: over max size limit.\n", __func__);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* queue's settings related to segment counting like q->bounce_pfn
|
|
|
|
* may differ from that of other stacking queues.
|
|
|
|
* Recalculate it to check the request correctly on this queue's
|
|
|
|
* limitation.
|
|
|
|
*/
|
|
|
|
blk_recalc_rq_segments(rq);
|
2009-05-22 23:17:50 +02:00
|
|
|
if (rq->nr_phys_segments > queue_max_phys_segments(q) ||
|
|
|
|
rq->nr_phys_segments > queue_max_hw_segments(q)) {
|
2008-09-18 16:45:38 +02:00
|
|
|
printk(KERN_ERR "%s: over max segments limit.\n", __func__);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_rq_check_limits);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_insert_cloned_request - Helper for stacking drivers to submit a request
|
|
|
|
* @q: the queue to submit the request
|
|
|
|
* @rq: the request being queued
|
|
|
|
*/
|
|
|
|
int blk_insert_cloned_request(struct request_queue *q, struct request *rq)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (blk_rq_check_limits(q, rq))
|
|
|
|
return -EIO;
|
|
|
|
|
|
|
|
#ifdef CONFIG_FAIL_MAKE_REQUEST
|
|
|
|
if (rq->rq_disk && rq->rq_disk->part0.make_it_fail &&
|
|
|
|
should_fail(&fail_make_request, blk_rq_bytes(rq)))
|
|
|
|
return -EIO;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Submitting request must be dequeued before calling this function
|
|
|
|
* because it will be linked to another request_queue
|
|
|
|
*/
|
|
|
|
BUG_ON(blk_queued_rq(rq));
|
|
|
|
|
|
|
|
drive_stat_acct(rq, 1);
|
|
|
|
__elv_add_request(q, rq, ELEVATOR_INSERT_BACK, 0);
|
|
|
|
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_insert_cloned_request);
|
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
/**
|
|
|
|
* blk_rq_err_bytes - determine number of bytes till the next failure boundary
|
|
|
|
* @rq: request to examine
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* A request could be merge of IOs which require different failure
|
|
|
|
* handling. This function determines the number of bytes which
|
|
|
|
* can be failed from the beginning of the request without
|
|
|
|
* crossing into area which need to be retried further.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* The number of bytes to fail.
|
|
|
|
*
|
|
|
|
* Context:
|
|
|
|
* queue_lock must be held.
|
|
|
|
*/
|
|
|
|
unsigned int blk_rq_err_bytes(const struct request *rq)
|
|
|
|
{
|
|
|
|
unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK;
|
|
|
|
unsigned int bytes = 0;
|
|
|
|
struct bio *bio;
|
|
|
|
|
|
|
|
if (!(rq->cmd_flags & REQ_MIXED_MERGE))
|
|
|
|
return blk_rq_bytes(rq);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Currently the only 'mixing' which can happen is between
|
|
|
|
* different fastfail types. We can safely fail portions
|
|
|
|
* which have all the failfast bits that the first one has -
|
|
|
|
* the ones which are at least as eager to fail as the first
|
|
|
|
* one.
|
|
|
|
*/
|
|
|
|
for (bio = rq->bio; bio; bio = bio->bi_next) {
|
|
|
|
if ((bio->bi_rw & ff) != ff)
|
|
|
|
break;
|
|
|
|
bytes += bio->bi_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* this could lead to infinite loop */
|
|
|
|
BUG_ON(blk_rq_bytes(rq) && !bytes);
|
|
|
|
return bytes;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_rq_err_bytes);
|
|
|
|
|
2009-01-23 10:54:44 +01:00
|
|
|
static void blk_account_io_completion(struct request *req, unsigned int bytes)
|
|
|
|
{
|
2009-04-24 08:10:11 +02:00
|
|
|
if (blk_do_io_stat(req)) {
|
2009-01-23 10:54:44 +01:00
|
|
|
const int rw = rq_data_dir(req);
|
|
|
|
struct hd_struct *part;
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
cpu = part_stat_lock();
|
2009-05-07 15:24:39 +02:00
|
|
|
part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req));
|
2009-01-23 10:54:44 +01:00
|
|
|
part_stat_add(cpu, part, sectors[rw], bytes >> 9);
|
|
|
|
part_stat_unlock();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void blk_account_io_done(struct request *req)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Account IO completion. bar_rq isn't accounted as a normal
|
|
|
|
* IO on queueing nor completion. Accounting the containing
|
|
|
|
* request is enough.
|
|
|
|
*/
|
2009-04-24 08:10:11 +02:00
|
|
|
if (blk_do_io_stat(req) && req != &req->q->bar_rq) {
|
2009-01-23 10:54:44 +01:00
|
|
|
unsigned long duration = jiffies - req->start_time;
|
|
|
|
const int rw = rq_data_dir(req);
|
|
|
|
struct hd_struct *part;
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
cpu = part_stat_lock();
|
2009-05-07 15:24:39 +02:00
|
|
|
part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req));
|
2009-01-23 10:54:44 +01:00
|
|
|
|
|
|
|
part_stat_inc(cpu, part, ios[rw]);
|
|
|
|
part_stat_add(cpu, part, ticks[rw], duration);
|
|
|
|
part_round_stats(cpu, part);
|
|
|
|
part_dec_in_flight(part);
|
|
|
|
|
|
|
|
part_stat_unlock();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-12-11 23:52:28 +01:00
|
|
|
/**
|
2009-05-08 04:54:16 +02:00
|
|
|
* blk_peek_request - peek at the top of a request queue
|
|
|
|
* @q: request queue to peek at
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Return the request at the top of @q. The returned request
|
|
|
|
* should be started using blk_start_request() before LLD starts
|
|
|
|
* processing it.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* Pointer to the request at the top of @q if available. Null
|
|
|
|
* otherwise.
|
|
|
|
*
|
|
|
|
* Context:
|
|
|
|
* queue_lock must be held.
|
|
|
|
*/
|
|
|
|
struct request *blk_peek_request(struct request_queue *q)
|
2009-04-23 04:05:18 +02:00
|
|
|
{
|
|
|
|
struct request *rq;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
while ((rq = __elv_next_request(q)) != NULL) {
|
|
|
|
if (!(rq->cmd_flags & REQ_STARTED)) {
|
|
|
|
/*
|
|
|
|
* This is the first time the device driver
|
|
|
|
* sees this request (possibly after
|
|
|
|
* requeueing). Notify IO scheduler.
|
|
|
|
*/
|
|
|
|
if (blk_sorted_rq(rq))
|
|
|
|
elv_activate_rq(q, rq);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* just mark as started even if we don't start
|
|
|
|
* it, a request that has been delayed should
|
|
|
|
* not be passed by new incoming requests
|
|
|
|
*/
|
|
|
|
rq->cmd_flags |= REQ_STARTED;
|
|
|
|
trace_block_rq_issue(q, rq);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!q->boundary_rq || q->boundary_rq == rq) {
|
|
|
|
q->end_sector = rq_end_sector(rq);
|
|
|
|
q->boundary_rq = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rq->cmd_flags & REQ_DONTPREP)
|
|
|
|
break;
|
|
|
|
|
2009-05-07 15:24:41 +02:00
|
|
|
if (q->dma_drain_size && blk_rq_bytes(rq)) {
|
2009-04-23 04:05:18 +02:00
|
|
|
/*
|
|
|
|
* make sure space for the drain appears we
|
|
|
|
* know we can do this because max_hw_segments
|
|
|
|
* has been adjusted to be one fewer than the
|
|
|
|
* device can handle
|
|
|
|
*/
|
|
|
|
rq->nr_phys_segments++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!q->prep_rq_fn)
|
|
|
|
break;
|
|
|
|
|
|
|
|
ret = q->prep_rq_fn(q, rq);
|
|
|
|
if (ret == BLKPREP_OK) {
|
|
|
|
break;
|
|
|
|
} else if (ret == BLKPREP_DEFER) {
|
|
|
|
/*
|
|
|
|
* the request may have been (partially) prepped.
|
|
|
|
* we need to keep this request in the front to
|
|
|
|
* avoid resource deadlock. REQ_STARTED will
|
|
|
|
* prevent other fs requests from passing this one.
|
|
|
|
*/
|
2009-05-07 15:24:41 +02:00
|
|
|
if (q->dma_drain_size && blk_rq_bytes(rq) &&
|
2009-04-23 04:05:18 +02:00
|
|
|
!(rq->cmd_flags & REQ_DONTPREP)) {
|
|
|
|
/*
|
|
|
|
* remove the space for the drain we added
|
|
|
|
* so that we don't add it again
|
|
|
|
*/
|
|
|
|
--rq->nr_phys_segments;
|
|
|
|
}
|
|
|
|
|
|
|
|
rq = NULL;
|
|
|
|
break;
|
|
|
|
} else if (ret == BLKPREP_KILL) {
|
|
|
|
rq->cmd_flags |= REQ_QUIET;
|
2009-05-30 06:43:49 +02:00
|
|
|
/*
|
|
|
|
* Mark this request as started so we don't trigger
|
|
|
|
* any debug logic in the end I/O path.
|
|
|
|
*/
|
|
|
|
blk_start_request(rq);
|
2009-04-23 04:05:19 +02:00
|
|
|
__blk_end_request_all(rq, -EIO);
|
2009-04-23 04:05:18 +02:00
|
|
|
} else {
|
|
|
|
printk(KERN_ERR "%s: bad return=%d\n", __func__, ret);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return rq;
|
|
|
|
}
|
2009-05-08 04:54:16 +02:00
|
|
|
EXPORT_SYMBOL(blk_peek_request);
|
2009-04-23 04:05:18 +02:00
|
|
|
|
2009-05-08 04:54:16 +02:00
|
|
|
void blk_dequeue_request(struct request *rq)
|
2009-04-23 04:05:18 +02:00
|
|
|
{
|
2009-05-08 04:54:16 +02:00
|
|
|
struct request_queue *q = rq->q;
|
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
BUG_ON(list_empty(&rq->queuelist));
|
|
|
|
BUG_ON(ELV_ON_HASH(rq));
|
|
|
|
|
|
|
|
list_del_init(&rq->queuelist);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* the time frame between a request being removed from the lists
|
|
|
|
* and to it is freed is accounted as io that is in progress at
|
|
|
|
* the driver side.
|
|
|
|
*/
|
|
|
|
if (blk_account_rq(rq))
|
2009-05-20 08:54:31 +02:00
|
|
|
q->in_flight[rq_is_sync(rq)]++;
|
2009-04-23 04:05:18 +02:00
|
|
|
}
|
|
|
|
|
2009-05-08 04:54:16 +02:00
|
|
|
/**
|
|
|
|
* blk_start_request - start request processing on the driver
|
|
|
|
* @req: request to dequeue
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Dequeue @req and start timeout timer on it. This hands off the
|
|
|
|
* request to the driver.
|
|
|
|
*
|
|
|
|
* Block internal functions which don't want to start timer should
|
|
|
|
* call blk_dequeue_request().
|
|
|
|
*
|
|
|
|
* Context:
|
|
|
|
* queue_lock must be held.
|
|
|
|
*/
|
|
|
|
void blk_start_request(struct request *req)
|
|
|
|
{
|
|
|
|
blk_dequeue_request(req);
|
|
|
|
|
|
|
|
/*
|
2009-05-19 11:33:05 +02:00
|
|
|
* We are now handing the request to the hardware, initialize
|
|
|
|
* resid_len to full count and add the timeout handler.
|
2009-05-08 04:54:16 +02:00
|
|
|
*/
|
2009-05-19 11:33:05 +02:00
|
|
|
req->resid_len = blk_rq_bytes(req);
|
2009-06-09 05:47:10 +02:00
|
|
|
if (unlikely(blk_bidi_rq(req)))
|
|
|
|
req->next_rq->resid_len = blk_rq_bytes(req->next_rq);
|
|
|
|
|
2009-05-08 04:54:16 +02:00
|
|
|
blk_add_timer(req);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_start_request);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_fetch_request - fetch a request from a request queue
|
|
|
|
* @q: request queue to fetch a request from
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Return the request at the top of @q. The request is started on
|
|
|
|
* return and LLD can start processing it immediately.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* Pointer to the request at the top of @q if available. Null
|
|
|
|
* otherwise.
|
|
|
|
*
|
|
|
|
* Context:
|
|
|
|
* queue_lock must be held.
|
|
|
|
*/
|
|
|
|
struct request *blk_fetch_request(struct request_queue *q)
|
|
|
|
{
|
|
|
|
struct request *rq;
|
|
|
|
|
|
|
|
rq = blk_peek_request(q);
|
|
|
|
if (rq)
|
|
|
|
blk_start_request(rq);
|
|
|
|
return rq;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blk_fetch_request);
|
|
|
|
|
2007-12-11 23:52:28 +01:00
|
|
|
/**
|
2009-04-23 04:05:18 +02:00
|
|
|
* blk_update_request - Special helper function for request stacking drivers
|
2009-06-12 05:00:41 +02:00
|
|
|
* @req: the request being processed
|
2008-08-19 20:13:11 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2009-06-12 05:00:41 +02:00
|
|
|
* @nr_bytes: number of bytes to complete @req
|
2007-12-11 23:52:28 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2009-06-12 05:00:41 +02:00
|
|
|
* Ends I/O on a number of bytes attached to @req, but doesn't complete
|
|
|
|
* the request structure even if @req doesn't have leftover.
|
|
|
|
* If @req has leftover, sets it up for the next range of segments.
|
2009-04-23 04:05:18 +02:00
|
|
|
*
|
|
|
|
* This special helper function is only for request stacking drivers
|
|
|
|
* (e.g. request-based dm) so that they can handle partial completion.
|
|
|
|
* Actual device drivers should use blk_end_request instead.
|
|
|
|
*
|
|
|
|
* Passing the result of blk_rq_bytes() as @nr_bytes guarantees
|
|
|
|
* %false return from this function.
|
2007-12-11 23:52:28 +01:00
|
|
|
*
|
|
|
|
* Return:
|
2009-04-23 04:05:18 +02:00
|
|
|
* %false - this request doesn't have any more data
|
|
|
|
* %true - this request has more data
|
2007-12-11 23:52:28 +01:00
|
|
|
**/
|
2009-04-23 04:05:18 +02:00
|
|
|
bool blk_update_request(struct request *req, int error, unsigned int nr_bytes)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-12-11 23:53:03 +01:00
|
|
|
int total_bytes, bio_nbytes, next_idx = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct bio *bio;
|
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
if (!req->bio)
|
|
|
|
return false;
|
|
|
|
|
2008-10-30 08:34:33 +01:00
|
|
|
trace_block_rq_complete(req->q, req);
|
2006-03-23 20:00:26 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
2009-04-19 00:00:41 +02:00
|
|
|
* For fs requests, rq is just carrier of independent bio's
|
|
|
|
* and each partial completion should be handled separately.
|
|
|
|
* Reset per-request error on each partial completion.
|
|
|
|
*
|
|
|
|
* TODO: tj: This is too subtle. It would be better to let
|
|
|
|
* low level drivers do what they see fit.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2009-04-19 00:00:41 +02:00
|
|
|
if (blk_fs_request(req))
|
2005-04-17 00:20:36 +02:00
|
|
|
req->errors = 0;
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
if (error && (blk_fs_request(req) && !(req->cmd_flags & REQ_QUIET))) {
|
|
|
|
printk(KERN_ERR "end_request: I/O error, dev %s, sector %llu\n",
|
2005-04-17 00:20:36 +02:00
|
|
|
req->rq_disk ? req->rq_disk->disk_name : "?",
|
2009-05-07 15:24:39 +02:00
|
|
|
(unsigned long long)blk_rq_pos(req));
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2009-01-23 10:54:44 +01:00
|
|
|
blk_account_io_completion(req, nr_bytes);
|
2005-11-01 08:35:42 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
total_bytes = bio_nbytes = 0;
|
|
|
|
while ((bio = req->bio) != NULL) {
|
|
|
|
int nbytes;
|
|
|
|
|
|
|
|
if (nr_bytes >= bio->bi_size) {
|
|
|
|
req->bio = bio->bi_next;
|
|
|
|
nbytes = bio->bi_size;
|
2007-09-27 12:46:13 +02:00
|
|
|
req_bio_endio(req, bio, nbytes, error);
|
2005-04-17 00:20:36 +02:00
|
|
|
next_idx = 0;
|
|
|
|
bio_nbytes = 0;
|
|
|
|
} else {
|
|
|
|
int idx = bio->bi_idx + next_idx;
|
|
|
|
|
2009-05-12 13:27:45 +02:00
|
|
|
if (unlikely(idx >= bio->bi_vcnt)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
blk_dump_rq_flags(req, "__end_that");
|
2008-01-31 13:03:55 +01:00
|
|
|
printk(KERN_ERR "%s: bio idx %d >= vcnt %d\n",
|
2009-05-12 13:27:45 +02:00
|
|
|
__func__, idx, bio->bi_vcnt);
|
2005-04-17 00:20:36 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
nbytes = bio_iovec_idx(bio, idx)->bv_len;
|
|
|
|
BIO_BUG_ON(nbytes > bio->bi_size);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* not a complete bvec done
|
|
|
|
*/
|
|
|
|
if (unlikely(nbytes > nr_bytes)) {
|
|
|
|
bio_nbytes += nr_bytes;
|
|
|
|
total_bytes += nr_bytes;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* advance to the next vector
|
|
|
|
*/
|
|
|
|
next_idx++;
|
|
|
|
bio_nbytes += nbytes;
|
|
|
|
}
|
|
|
|
|
|
|
|
total_bytes += nbytes;
|
|
|
|
nr_bytes -= nbytes;
|
|
|
|
|
2008-01-31 13:03:55 +01:00
|
|
|
bio = req->bio;
|
|
|
|
if (bio) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* end more in this run, or just return 'not-done'
|
|
|
|
*/
|
|
|
|
if (unlikely(nr_bytes <= 0))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* completely done
|
|
|
|
*/
|
2009-04-23 04:05:18 +02:00
|
|
|
if (!req->bio) {
|
|
|
|
/*
|
|
|
|
* Reset counters so that the request stacking driver
|
|
|
|
* can find how many bytes remain in the request
|
|
|
|
* later.
|
|
|
|
*/
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__data_len = 0;
|
2009-04-23 04:05:18 +02:00
|
|
|
return false;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* if the request wasn't completed, update state
|
|
|
|
*/
|
|
|
|
if (bio_nbytes) {
|
2007-09-27 12:46:13 +02:00
|
|
|
req_bio_endio(req, bio, bio_nbytes, error);
|
2005-04-17 00:20:36 +02:00
|
|
|
bio->bi_idx += next_idx;
|
|
|
|
bio_iovec(bio)->bv_offset += nr_bytes;
|
|
|
|
bio_iovec(bio)->bv_len -= nr_bytes;
|
|
|
|
}
|
|
|
|
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__data_len -= total_bytes;
|
2009-05-07 15:24:41 +02:00
|
|
|
req->buffer = bio_data(req->bio);
|
|
|
|
|
|
|
|
/* update sector only for requests with clear definition of sector */
|
|
|
|
if (blk_fs_request(req) || blk_discard_rq(req))
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__sector += total_bytes >> 9;
|
2009-05-07 15:24:41 +02:00
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
/* mixed attributes always follow the first bio */
|
|
|
|
if (req->cmd_flags & REQ_MIXED_MERGE) {
|
|
|
|
req->cmd_flags &= ~REQ_FAILFAST_MASK;
|
|
|
|
req->cmd_flags |= req->bio->bi_rw & REQ_FAILFAST_MASK;
|
|
|
|
}
|
|
|
|
|
2009-05-07 15:24:41 +02:00
|
|
|
/*
|
|
|
|
* If total number of sectors is less than the first segment
|
|
|
|
* size, something has gone terribly wrong.
|
|
|
|
*/
|
|
|
|
if (blk_rq_bytes(req) < blk_rq_cur_bytes(req)) {
|
|
|
|
printk(KERN_ERR "blk: request botched\n");
|
2009-05-07 15:24:44 +02:00
|
|
|
req->__data_len = blk_rq_cur_bytes(req);
|
2009-05-07 15:24:41 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* recalculate the number of segments */
|
2005-04-17 00:20:36 +02:00
|
|
|
blk_recalc_rq_segments(req);
|
2009-05-07 15:24:41 +02:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
return true;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2009-04-23 04:05:18 +02:00
|
|
|
EXPORT_SYMBOL_GPL(blk_update_request);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
static bool blk_update_bidi_request(struct request *rq, int error,
|
|
|
|
unsigned int nr_bytes,
|
|
|
|
unsigned int bidi_bytes)
|
2009-04-23 04:05:18 +02:00
|
|
|
{
|
2009-04-23 04:05:18 +02:00
|
|
|
if (blk_update_request(rq, error, nr_bytes))
|
|
|
|
return true;
|
2009-04-23 04:05:18 +02:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
/* Bidi request must be completed as a whole */
|
|
|
|
if (unlikely(blk_bidi_rq(rq)) &&
|
|
|
|
blk_update_request(rq->next_rq, error, bidi_bytes))
|
|
|
|
return true;
|
2009-04-23 04:05:18 +02:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
add_disk_randomness(rq->rq_disk);
|
|
|
|
|
|
|
|
return false;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* queue lock must be held
|
|
|
|
*/
|
2009-04-23 04:05:18 +02:00
|
|
|
static void blk_finish_request(struct request *req, int error)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-12-11 23:53:24 +01:00
|
|
|
if (blk_rq_tagged(req))
|
|
|
|
blk_queue_end_tag(req->q, req);
|
|
|
|
|
2009-05-27 14:17:08 +02:00
|
|
|
BUG_ON(blk_queued_rq(req));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (unlikely(laptop_mode) && blk_fs_request(req))
|
|
|
|
laptop_io_completion();
|
|
|
|
|
2008-10-30 10:16:20 +01:00
|
|
|
blk_delete_timer(req);
|
|
|
|
|
2009-01-23 10:54:44 +01:00
|
|
|
blk_account_io_done(req);
|
2007-12-11 23:53:24 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (req->end_io)
|
2006-01-06 09:49:03 +01:00
|
|
|
req->end_io(req, error);
|
2007-12-11 23:53:24 +01:00
|
|
|
else {
|
|
|
|
if (blk_bidi_rq(req))
|
|
|
|
__blk_put_request(req->next_rq->q, req->next_rq);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
__blk_put_request(req->q, req);
|
2007-12-11 23:53:24 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-12-11 23:41:17 +01:00
|
|
|
/**
|
2009-04-23 04:05:18 +02:00
|
|
|
* blk_end_bidi_request - Complete a bidi request
|
|
|
|
* @rq: the request to complete
|
|
|
|
* @error: %0 for success, < %0 for error
|
|
|
|
* @nr_bytes: number of bytes to complete @rq
|
|
|
|
* @bidi_bytes: number of bytes to complete @rq->next_rq
|
2007-09-21 10:41:07 +02:00
|
|
|
*
|
|
|
|
* Description:
|
2007-12-11 23:51:46 +01:00
|
|
|
* Ends I/O on a number of bytes attached to @rq and @rq->next_rq.
|
2009-04-23 04:05:18 +02:00
|
|
|
* Drivers that supports bidi can safely call this member for any
|
|
|
|
* type of request, bidi or uni. In the later case @bidi_bytes is
|
|
|
|
* just ignored.
|
2007-12-11 23:40:30 +01:00
|
|
|
*
|
|
|
|
* Return:
|
2009-04-23 04:05:18 +02:00
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
2007-09-21 10:41:07 +02:00
|
|
|
**/
|
2009-05-11 10:56:09 +02:00
|
|
|
static bool blk_end_bidi_request(struct request *rq, int error,
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
unsigned int nr_bytes, unsigned int bidi_bytes)
|
|
|
|
{
|
2007-12-11 23:40:30 +01:00
|
|
|
struct request_queue *q = rq->q;
|
2009-04-23 04:05:18 +02:00
|
|
|
unsigned long flags;
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
|
|
|
|
return true;
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
|
2007-12-11 23:40:30 +01:00
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
2009-04-23 04:05:18 +02:00
|
|
|
blk_finish_request(rq, error);
|
2007-12-11 23:40:30 +01:00
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
return false;
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
}
|
|
|
|
|
2007-12-11 23:40:30 +01:00
|
|
|
/**
|
2009-04-23 04:05:18 +02:00
|
|
|
* __blk_end_bidi_request - Complete a bidi request with queue lock held
|
|
|
|
* @rq: the request to complete
|
2008-08-19 20:13:11 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2007-12-11 23:51:46 +01:00
|
|
|
* @nr_bytes: number of bytes to complete @rq
|
|
|
|
* @bidi_bytes: number of bytes to complete @rq->next_rq
|
2007-12-11 23:40:30 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2009-04-23 04:05:18 +02:00
|
|
|
* Identical to blk_end_bidi_request() except that queue lock is
|
|
|
|
* assumed to be locked on entry and remains so on return.
|
2007-12-11 23:40:30 +01:00
|
|
|
*
|
|
|
|
* Return:
|
2009-04-23 04:05:18 +02:00
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
2007-12-11 23:40:30 +01:00
|
|
|
**/
|
2009-05-11 10:56:09 +02:00
|
|
|
static bool __blk_end_bidi_request(struct request *rq, int error,
|
|
|
|
unsigned int nr_bytes, unsigned int bidi_bytes)
|
2007-12-11 23:40:30 +01:00
|
|
|
{
|
2009-04-23 04:05:18 +02:00
|
|
|
if (blk_update_bidi_request(rq, error, nr_bytes, bidi_bytes))
|
|
|
|
return true;
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
blk_finish_request(rq, error);
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-04-23 04:05:18 +02:00
|
|
|
return false;
|
2007-12-11 23:40:30 +01:00
|
|
|
}
|
2007-12-11 23:51:02 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_end_request - Helper function for drivers to complete the request.
|
|
|
|
* @rq: the request being processed
|
2008-08-19 20:13:11 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2007-12-11 23:51:02 +01:00
|
|
|
* @nr_bytes: number of bytes to complete
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Ends I/O on a number of bytes attached to @rq.
|
|
|
|
* If @rq has leftover, sets it up for the next range of segments.
|
|
|
|
*
|
|
|
|
* Return:
|
2009-05-11 10:56:09 +02:00
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
2007-12-11 23:51:02 +01:00
|
|
|
**/
|
2009-05-11 10:56:09 +02:00
|
|
|
bool blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
|
2007-12-11 23:51:02 +01:00
|
|
|
{
|
2009-05-11 10:56:09 +02:00
|
|
|
return blk_end_bidi_request(rq, error, nr_bytes, 0);
|
2007-12-11 23:51:02 +01:00
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(blk_end_request);
|
2007-12-11 23:40:30 +01:00
|
|
|
|
|
|
|
/**
|
2009-05-11 10:56:09 +02:00
|
|
|
* blk_end_request_all - Helper function for drives to finish the request.
|
|
|
|
* @rq: the request to finish
|
2009-06-12 05:00:41 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2007-12-11 23:40:30 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2009-05-11 10:56:09 +02:00
|
|
|
* Completely finish @rq.
|
|
|
|
*/
|
|
|
|
void blk_end_request_all(struct request *rq, int error)
|
2007-12-11 23:40:30 +01:00
|
|
|
{
|
2009-05-11 10:56:09 +02:00
|
|
|
bool pending;
|
|
|
|
unsigned int bidi_bytes = 0;
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-05-11 10:56:09 +02:00
|
|
|
if (unlikely(blk_bidi_rq(rq)))
|
|
|
|
bidi_bytes = blk_rq_bytes(rq->next_rq);
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-05-11 10:56:09 +02:00
|
|
|
pending = blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
|
|
|
|
BUG_ON(pending);
|
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(blk_end_request_all);
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-05-11 10:56:09 +02:00
|
|
|
/**
|
|
|
|
* blk_end_request_cur - Helper function to finish the current request chunk.
|
|
|
|
* @rq: the request to finish the current chunk for
|
2009-06-12 05:00:41 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2009-05-11 10:56:09 +02:00
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Complete the current consecutively mapped chunk from @rq.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
|
|
|
*/
|
|
|
|
bool blk_end_request_cur(struct request *rq, int error)
|
|
|
|
{
|
|
|
|
return blk_end_request(rq, error, blk_rq_cur_bytes(rq));
|
2007-12-11 23:40:30 +01:00
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(blk_end_request_cur);
|
2007-12-11 23:40:30 +01:00
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
/**
|
|
|
|
* blk_end_request_err - Finish a request till the next failure boundary.
|
|
|
|
* @rq: the request to finish till the next failure boundary for
|
|
|
|
* @error: must be negative errno
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Complete @rq till the next failure boundary.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
|
|
|
*/
|
|
|
|
bool blk_end_request_err(struct request *rq, int error)
|
|
|
|
{
|
|
|
|
WARN_ON(error >= 0);
|
|
|
|
return blk_end_request(rq, error, blk_rq_err_bytes(rq));
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_end_request_err);
|
|
|
|
|
2007-12-11 23:51:46 +01:00
|
|
|
/**
|
2009-05-11 10:56:09 +02:00
|
|
|
* __blk_end_request - Helper function for drivers to complete the request.
|
|
|
|
* @rq: the request being processed
|
|
|
|
* @error: %0 for success, < %0 for error
|
|
|
|
* @nr_bytes: number of bytes to complete
|
2007-12-11 23:51:46 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2009-05-11 10:56:09 +02:00
|
|
|
* Must be called with queue lock held unlike blk_end_request().
|
2007-12-11 23:51:46 +01:00
|
|
|
*
|
|
|
|
* Return:
|
2009-05-11 10:56:09 +02:00
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
2007-12-11 23:51:46 +01:00
|
|
|
**/
|
2009-05-11 10:56:09 +02:00
|
|
|
bool __blk_end_request(struct request *rq, int error, unsigned int nr_bytes)
|
2007-12-11 23:51:46 +01:00
|
|
|
{
|
2009-05-11 10:56:09 +02:00
|
|
|
return __blk_end_bidi_request(rq, error, nr_bytes, 0);
|
2007-12-11 23:51:46 +01:00
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(__blk_end_request);
|
2007-12-11 23:51:46 +01:00
|
|
|
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
/**
|
2009-05-11 10:56:09 +02:00
|
|
|
* __blk_end_request_all - Helper function for drives to finish the request.
|
|
|
|
* @rq: the request to finish
|
2009-06-12 05:00:41 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
*
|
|
|
|
* Description:
|
2009-05-11 10:56:09 +02:00
|
|
|
* Completely finish @rq. Must be called with queue lock held.
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
*/
|
2009-05-11 10:56:09 +02:00
|
|
|
void __blk_end_request_all(struct request *rq, int error)
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
{
|
2009-05-11 10:56:09 +02:00
|
|
|
bool pending;
|
|
|
|
unsigned int bidi_bytes = 0;
|
|
|
|
|
|
|
|
if (unlikely(blk_bidi_rq(rq)))
|
|
|
|
bidi_bytes = blk_rq_bytes(rq->next_rq);
|
|
|
|
|
|
|
|
pending = __blk_end_bidi_request(rq, error, blk_rq_bytes(rq), bidi_bytes);
|
|
|
|
BUG_ON(pending);
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(__blk_end_request_all);
|
block: add request update interface
This patch adds blk_update_request(), which updates struct request
with completing its data part, but doesn't complete the struct
request itself.
Though it looks like end_that_request_first() of older kernels,
blk_update_request() should be used only by request stacking drivers.
Request-based dm will use it in bio->bi_end_io callback to update
the original request when a data part of a cloned request completes.
Followings are additional background information of why request-based
dm needs this interface.
- Request stacking drivers can't use blk_end_request() directly from
the lower driver's completion context (bio->bi_end_io or rq->end_io),
because some device drivers (e.g. ide) may try to complete
their request with queue lock held, and it may cause deadlock.
See below for detailed description of possible deadlock:
<http://marc.info/?l=linux-kernel&m=120311479108569&w=2>
- To solve that, request-based dm offloads the completion of
cloned struct request to softirq context (i.e. using
blk_complete_request() from rq->end_io).
- Though it is possible to use the same solution from bio->bi_end_io,
it will delay the notification of bio completion to the original
submitter. Also, it will cause inefficient partial completion,
because the lower driver can't perform the cloned request anymore
and request-based dm needs to requeue and redispatch it to
the lower driver again later. That's not good.
- So request-based dm needs blk_update_request() to perform the bio
completion in the lower driver's completion context, which is more
efficient.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2008-09-18 16:45:09 +02:00
|
|
|
|
2007-12-11 23:51:02 +01:00
|
|
|
/**
|
2009-05-11 10:56:09 +02:00
|
|
|
* __blk_end_request_cur - Helper function to finish the current request chunk.
|
|
|
|
* @rq: the request to finish the current chunk for
|
2009-06-12 05:00:41 +02:00
|
|
|
* @error: %0 for success, < %0 for error
|
2007-12-11 23:51:02 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2009-05-11 10:56:09 +02:00
|
|
|
* Complete the current consecutively mapped chunk from @rq. Must
|
|
|
|
* be called with queue lock held.
|
2007-12-11 23:51:02 +01:00
|
|
|
*
|
|
|
|
* Return:
|
2009-05-11 10:56:09 +02:00
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
|
|
|
*/
|
|
|
|
bool __blk_end_request_cur(struct request *rq, int error)
|
2007-12-11 23:51:02 +01:00
|
|
|
{
|
2009-05-11 10:56:09 +02:00
|
|
|
return __blk_end_request(rq, error, blk_rq_cur_bytes(rq));
|
2007-12-11 23:51:02 +01:00
|
|
|
}
|
2009-07-28 22:11:24 +02:00
|
|
|
EXPORT_SYMBOL(__blk_end_request_cur);
|
2007-12-11 23:51:02 +01:00
|
|
|
|
2009-07-03 10:48:17 +02:00
|
|
|
/**
|
|
|
|
* __blk_end_request_err - Finish a request till the next failure boundary.
|
|
|
|
* @rq: the request to finish till the next failure boundary for
|
|
|
|
* @error: must be negative errno
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Complete @rq till the next failure boundary. Must be called
|
|
|
|
* with queue lock held.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* %false - we are done with this request
|
|
|
|
* %true - still buffers pending for this request
|
|
|
|
*/
|
|
|
|
bool __blk_end_request_err(struct request *rq, int error)
|
|
|
|
{
|
|
|
|
WARN_ON(error >= 0);
|
|
|
|
return __blk_end_request(rq, error, blk_rq_err_bytes(rq));
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__blk_end_request_err);
|
|
|
|
|
2008-01-29 14:53:40 +01:00
|
|
|
void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
|
|
|
|
struct bio *bio)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2009-07-03 10:48:16 +02:00
|
|
|
/* Bit 0 (R/W) is identical in rq->cmd_flags and bio->bi_rw */
|
|
|
|
rq->cmd_flags |= bio->bi_rw & REQ_RW;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-08-05 19:01:53 +02:00
|
|
|
if (bio_has_data(bio)) {
|
|
|
|
rq->nr_phys_segments = bio_phys_segments(q, bio);
|
|
|
|
rq->buffer = bio_data(bio);
|
|
|
|
}
|
2009-05-07 15:24:44 +02:00
|
|
|
rq->__data_len = bio->bi_size;
|
2005-04-17 00:20:36 +02:00
|
|
|
rq->bio = rq->biotail = bio;
|
|
|
|
|
2007-08-16 13:31:28 +02:00
|
|
|
if (bio->bi_bdev)
|
|
|
|
rq->rq_disk = bio->bi_bdev->bd_disk;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-01 16:12:15 +02:00
|
|
|
/**
|
|
|
|
* blk_lld_busy - Check if underlying low-level drivers of a device are busy
|
|
|
|
* @q : the queue of the device being checked
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Check if underlying low-level drivers of a device are busy.
|
|
|
|
* If the drivers want to export their busy state, they must set own
|
|
|
|
* exporting function using blk_queue_lld_busy() first.
|
|
|
|
*
|
|
|
|
* Basically, this function is used only by request stacking drivers
|
|
|
|
* to stop dispatching requests to underlying devices when underlying
|
|
|
|
* devices are busy. This behavior helps more I/O merging on the queue
|
|
|
|
* of the request stacking driver and prevents I/O throughput regression
|
|
|
|
* on burst I/O load.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* 0 - Not busy (The request stacking driver should dispatch request)
|
|
|
|
* 1 - Busy (The request stacking driver should stop dispatching request)
|
|
|
|
*/
|
|
|
|
int blk_lld_busy(struct request_queue *q)
|
|
|
|
{
|
|
|
|
if (q->lld_busy_fn)
|
|
|
|
return q->lld_busy_fn(q);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_lld_busy);
|
|
|
|
|
block: add request clone interface (v2)
This patch adds the following 2 interfaces for request-stacking drivers:
- blk_rq_prep_clone(struct request *clone, struct request *orig,
struct bio_set *bs, gfp_t gfp_mask,
int (*bio_ctr)(struct bio *, struct bio*, void *),
void *data)
* Clones bios in the original request to the clone request
(bio_ctr is called for each cloned bios.)
* Copies attributes of the original request to the clone request.
The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not
copied.
- blk_rq_unprep_clone(struct request *clone)
* Frees cloned bios from the clone request.
Request stacking drivers (e.g. request-based dm) need to make a clone
request for a submitted request and dispatch it to other devices.
To allocate request for the clone, request stacking drivers may not
be able to use blk_get_request() because the allocation may be done
in an irq-disabled context.
So blk_rq_prep_clone() takes a request allocated by the caller
as an argument.
For each clone bio in the clone request, request stacking drivers
should be able to set up their own completion handler.
So blk_rq_prep_clone() takes a callback function which is called
for each clone bio, and a pointer for private data which is passed
to the callback.
NOTE:
blk_rq_prep_clone() doesn't copy any actual data of the original
request. Pages are shared between original bios and cloned bios.
So caller must not complete the original request before the clone
request.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Cc: Boaz Harrosh <bharrosh@panasas.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2009-06-11 13:10:16 +02:00
|
|
|
/**
|
|
|
|
* blk_rq_unprep_clone - Helper function to free all bios in a cloned request
|
|
|
|
* @rq: the clone request to be cleaned up
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Free all bios in @rq for a cloned request.
|
|
|
|
*/
|
|
|
|
void blk_rq_unprep_clone(struct request *rq)
|
|
|
|
{
|
|
|
|
struct bio *bio;
|
|
|
|
|
|
|
|
while ((bio = rq->bio) != NULL) {
|
|
|
|
rq->bio = bio->bi_next;
|
|
|
|
|
|
|
|
bio_put(bio);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_rq_unprep_clone);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy attributes of the original request to the clone request.
|
|
|
|
* The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not copied.
|
|
|
|
*/
|
|
|
|
static void __blk_rq_prep_clone(struct request *dst, struct request *src)
|
|
|
|
{
|
|
|
|
dst->cpu = src->cpu;
|
|
|
|
dst->cmd_flags = (rq_data_dir(src) | REQ_NOMERGE);
|
|
|
|
dst->cmd_type = src->cmd_type;
|
|
|
|
dst->__sector = blk_rq_pos(src);
|
|
|
|
dst->__data_len = blk_rq_bytes(src);
|
|
|
|
dst->nr_phys_segments = src->nr_phys_segments;
|
|
|
|
dst->ioprio = src->ioprio;
|
|
|
|
dst->extra_len = src->extra_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blk_rq_prep_clone - Helper function to setup clone request
|
|
|
|
* @rq: the request to be setup
|
|
|
|
* @rq_src: original request to be cloned
|
|
|
|
* @bs: bio_set that bios for clone are allocated from
|
|
|
|
* @gfp_mask: memory allocation mask for bio
|
|
|
|
* @bio_ctr: setup function to be called for each clone bio.
|
|
|
|
* Returns %0 for success, non %0 for failure.
|
|
|
|
* @data: private data to be passed to @bio_ctr
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Clones bios in @rq_src to @rq, and copies attributes of @rq_src to @rq.
|
|
|
|
* The actual data parts of @rq_src (e.g. ->cmd, ->buffer, ->sense)
|
|
|
|
* are not copied, and copying such parts is the caller's responsibility.
|
|
|
|
* Also, pages which the original bios are pointing to are not copied
|
|
|
|
* and the cloned bios just point same pages.
|
|
|
|
* So cloned bios must be completed before original bios, which means
|
|
|
|
* the caller must complete @rq before @rq_src.
|
|
|
|
*/
|
|
|
|
int blk_rq_prep_clone(struct request *rq, struct request *rq_src,
|
|
|
|
struct bio_set *bs, gfp_t gfp_mask,
|
|
|
|
int (*bio_ctr)(struct bio *, struct bio *, void *),
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
struct bio *bio, *bio_src;
|
|
|
|
|
|
|
|
if (!bs)
|
|
|
|
bs = fs_bio_set;
|
|
|
|
|
|
|
|
blk_rq_init(NULL, rq);
|
|
|
|
|
|
|
|
__rq_for_each_bio(bio_src, rq_src) {
|
|
|
|
bio = bio_alloc_bioset(gfp_mask, bio_src->bi_max_vecs, bs);
|
|
|
|
if (!bio)
|
|
|
|
goto free_and_out;
|
|
|
|
|
|
|
|
__bio_clone(bio, bio_src);
|
|
|
|
|
|
|
|
if (bio_integrity(bio_src) &&
|
2009-06-26 15:37:49 +02:00
|
|
|
bio_integrity_clone(bio, bio_src, gfp_mask, bs))
|
block: add request clone interface (v2)
This patch adds the following 2 interfaces for request-stacking drivers:
- blk_rq_prep_clone(struct request *clone, struct request *orig,
struct bio_set *bs, gfp_t gfp_mask,
int (*bio_ctr)(struct bio *, struct bio*, void *),
void *data)
* Clones bios in the original request to the clone request
(bio_ctr is called for each cloned bios.)
* Copies attributes of the original request to the clone request.
The actual data parts (e.g. ->cmd, ->buffer, ->sense) are not
copied.
- blk_rq_unprep_clone(struct request *clone)
* Frees cloned bios from the clone request.
Request stacking drivers (e.g. request-based dm) need to make a clone
request for a submitted request and dispatch it to other devices.
To allocate request for the clone, request stacking drivers may not
be able to use blk_get_request() because the allocation may be done
in an irq-disabled context.
So blk_rq_prep_clone() takes a request allocated by the caller
as an argument.
For each clone bio in the clone request, request stacking drivers
should be able to set up their own completion handler.
So blk_rq_prep_clone() takes a callback function which is called
for each clone bio, and a pointer for private data which is passed
to the callback.
NOTE:
blk_rq_prep_clone() doesn't copy any actual data of the original
request. Pages are shared between original bios and cloned bios.
So caller must not complete the original request before the clone
request.
Signed-off-by: Kiyoshi Ueda <k-ueda@ct.jp.nec.com>
Signed-off-by: Jun'ichi Nomura <j-nomura@ce.jp.nec.com>
Cc: Boaz Harrosh <bharrosh@panasas.com>
Signed-off-by: Jens Axboe <jens.axboe@oracle.com>
2009-06-11 13:10:16 +02:00
|
|
|
goto free_and_out;
|
|
|
|
|
|
|
|
if (bio_ctr && bio_ctr(bio, bio_src, data))
|
|
|
|
goto free_and_out;
|
|
|
|
|
|
|
|
if (rq->bio) {
|
|
|
|
rq->biotail->bi_next = bio;
|
|
|
|
rq->biotail = bio;
|
|
|
|
} else
|
|
|
|
rq->bio = rq->biotail = bio;
|
|
|
|
}
|
|
|
|
|
|
|
|
__blk_rq_prep_clone(rq, rq_src);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
free_and_out:
|
|
|
|
if (bio)
|
|
|
|
bio_free(bio, bs);
|
|
|
|
blk_rq_unprep_clone(rq);
|
|
|
|
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(blk_rq_prep_clone);
|
|
|
|
|
2008-07-28 13:08:45 +02:00
|
|
|
int kblockd_schedule_work(struct request_queue *q, struct work_struct *work)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return queue_work(kblockd_workqueue, work);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(kblockd_schedule_work);
|
|
|
|
|
|
|
|
int __init blk_dev_init(void)
|
|
|
|
{
|
2009-04-27 14:53:54 +02:00
|
|
|
BUILD_BUG_ON(__REQ_NR_BITS > 8 *
|
|
|
|
sizeof(((struct request *)0)->cmd_flags));
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
kblockd_workqueue = create_workqueue("kblockd");
|
|
|
|
if (!kblockd_workqueue)
|
|
|
|
panic("Failed to create kblockd\n");
|
|
|
|
|
|
|
|
request_cachep = kmem_cache_create("blkdev_requests",
|
2007-07-20 03:11:58 +02:00
|
|
|
sizeof(struct request), 0, SLAB_PANIC, NULL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-29 14:51:59 +01:00
|
|
|
blk_requestq_cachep = kmem_cache_create("blkdev_queue",
|
2007-07-24 09:28:11 +02:00
|
|
|
sizeof(struct request_queue), 0, SLAB_PANIC, NULL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-01-24 08:53:35 +01:00
|
|
|
return 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|