blob: 43b036185712c25f66d04a3c9e49565297c94ccd [file] [log] [blame]
Jens Axboe8324aa92008-01-29 14:51:59 +01001#ifndef BLK_INTERNAL_H
2#define BLK_INTERNAL_H
3
Tejun Heoa73f7302011-12-14 00:33:37 +01004#include <linux/idr.h>
Ming Leif70ced02014-09-25 23:23:47 +08005#include <linux/blk-mq.h>
6#include "blk-mq.h"
Tejun Heoa73f7302011-12-14 00:33:37 +01007
Jens Axboe86db1e22008-01-29 14:53:40 +01008/* Amount of time in which a process may batch requests */
9#define BLK_BATCH_TIME (HZ/50UL)
10
11/* Number of requests a "batching" process may submit */
12#define BLK_BATCH_REQ 32
13
Jens Axboe0d2602c2014-05-13 15:10:52 -060014/* Max future timer expiry for timeouts */
15#define BLK_MAX_TIMEOUT (5 * HZ)
16
Ming Lei7c94e1c2014-09-25 23:23:43 +080017struct blk_flush_queue {
18 unsigned int flush_queue_delayed:1;
19 unsigned int flush_pending_idx:1;
20 unsigned int flush_running_idx:1;
21 unsigned long flush_pending_since;
22 struct list_head flush_queue[2];
23 struct list_head flush_data_in_flight;
24 struct request *flush_rq;
25 spinlock_t mq_flush_lock;
26};
27
Jens Axboe8324aa92008-01-29 14:51:59 +010028extern struct kmem_cache *blk_requestq_cachep;
Jens Axboe320ae512013-10-24 09:20:05 +010029extern struct kmem_cache *request_cachep;
Jens Axboe8324aa92008-01-29 14:51:59 +010030extern struct kobj_type blk_queue_ktype;
Tejun Heoa73f7302011-12-14 00:33:37 +010031extern struct ida blk_queue_ida;
Jens Axboe8324aa92008-01-29 14:51:59 +010032
Ming Lei7c94e1c2014-09-25 23:23:43 +080033static inline struct blk_flush_queue *blk_get_flush_queue(
Ming Leie97c2932014-09-25 23:23:46 +080034 struct request_queue *q, struct blk_mq_ctx *ctx)
Ming Lei7c94e1c2014-09-25 23:23:43 +080035{
Ming Leif70ced02014-09-25 23:23:47 +080036 struct blk_mq_hw_ctx *hctx;
37
38 if (!q->mq_ops)
39 return q->fq;
40
41 hctx = q->mq_ops->map_queue(q, ctx->cpu);
42
43 return hctx->fq;
Ming Lei7c94e1c2014-09-25 23:23:43 +080044}
45
Tejun Heo09ac46c2011-12-14 00:33:38 +010046static inline void __blk_get_queue(struct request_queue *q)
47{
48 kobject_get(&q->kobj);
49}
50
Ming Leif70ced02014-09-25 23:23:47 +080051struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
52 int node, int cmd_size);
53void blk_free_flush_queue(struct blk_flush_queue *q);
Ming Leif3552652014-09-25 23:23:40 +080054
Tejun Heo5b788ce2012-06-04 20:40:59 -070055int blk_init_rl(struct request_list *rl, struct request_queue *q,
56 gfp_t gfp_mask);
57void blk_exit_rl(struct request_list *rl);
Jens Axboe86db1e22008-01-29 14:53:40 +010058void init_request_from_bio(struct request *req, struct bio *bio);
59void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
60 struct bio *bio);
Boaz Harrosha411f4b2009-05-17 19:00:01 +030061int blk_rq_append_bio(struct request_queue *q, struct request *rq,
62 struct bio *bio);
Tejun Heod7325802012-03-05 13:14:58 -080063void blk_queue_bypass_start(struct request_queue *q);
64void blk_queue_bypass_end(struct request_queue *q);
Tejun Heo9934c8c2009-05-08 11:54:16 +090065void blk_dequeue_request(struct request *rq);
Jens Axboe8324aa92008-01-29 14:51:59 +010066void __blk_queue_free_tags(struct request_queue *q);
Jeff Moyer4853aba2011-08-15 21:37:25 +020067bool __blk_end_bidi_request(struct request *rq, int error,
68 unsigned int nr_bytes, unsigned int bidi_bytes);
Jens Axboe8324aa92008-01-29 14:51:59 +010069
Jens Axboe242f9dc2008-09-14 05:55:09 -070070void blk_rq_timed_out_timer(unsigned long data);
Jens Axboe0d2602c2014-05-13 15:10:52 -060071unsigned long blk_rq_timeout(unsigned long timeout);
Jens Axboe87ee7b12014-04-24 08:51:47 -060072void blk_add_timer(struct request *req);
Jens Axboe242f9dc2008-09-14 05:55:09 -070073void blk_delete_timer(struct request *);
Jens Axboe242f9dc2008-09-14 05:55:09 -070074
Jens Axboe320ae512013-10-24 09:20:05 +010075
76bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
77 struct bio *bio);
78bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
79 struct bio *bio);
80bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
81 unsigned int *request_count);
82
83void blk_account_io_start(struct request *req, bool new_io);
84void blk_account_io_completion(struct request *req, unsigned int bytes);
85void blk_account_io_done(struct request *req);
86
Jens Axboe242f9dc2008-09-14 05:55:09 -070087/*
88 * Internal atomic flags for request handling
89 */
90enum rq_atomic_flags {
91 REQ_ATOM_COMPLETE = 0,
Jens Axboe320ae512013-10-24 09:20:05 +010092 REQ_ATOM_STARTED,
Jens Axboe242f9dc2008-09-14 05:55:09 -070093};
94
95/*
96 * EH timer and IO completion will both attempt to 'grab' the request, make
Lucas De Marchi25985ed2011-03-30 22:57:33 -030097 * sure that only one of them succeeds
Jens Axboe242f9dc2008-09-14 05:55:09 -070098 */
99static inline int blk_mark_rq_complete(struct request *rq)
100{
101 return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
102}
103
104static inline void blk_clear_rq_complete(struct request *rq)
105{
106 clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
107}
Jens Axboe86db1e22008-01-29 14:53:40 +0100108
Tejun Heo158dbda2009-04-23 11:05:18 +0900109/*
110 * Internal elevator interface
111 */
Jens Axboe360f92c2014-04-09 20:27:01 -0600112#define ELV_ON_HASH(rq) ((rq)->cmd_flags & REQ_HASHED)
Tejun Heo158dbda2009-04-23 11:05:18 +0900113
Tejun Heoae1b1532011-01-25 12:43:54 +0100114void blk_insert_flush(struct request *rq);
Tejun Heodd831002010-09-03 11:56:16 +0200115
Tejun Heo158dbda2009-04-23 11:05:18 +0900116static inline struct request *__elv_next_request(struct request_queue *q)
117{
118 struct request *rq;
Ming Leie97c2932014-09-25 23:23:46 +0800119 struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
Tejun Heo158dbda2009-04-23 11:05:18 +0900120
121 while (1) {
Tejun Heoae1b1532011-01-25 12:43:54 +0100122 if (!list_empty(&q->queue_head)) {
Tejun Heo158dbda2009-04-23 11:05:18 +0900123 rq = list_entry_rq(q->queue_head.next);
Tejun Heoae1b1532011-01-25 12:43:54 +0100124 return rq;
Tejun Heo158dbda2009-04-23 11:05:18 +0900125 }
126
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600127 /*
128 * Flush request is running and flush request isn't queueable
129 * in the drive, we can hold the queue till flush request is
130 * finished. Even we don't do this, driver can't dispatch next
131 * requests and will requeue them. And this can improve
132 * throughput too. For example, we have request flush1, write1,
133 * flush 2. flush1 is dispatched, then queue is hold, write1
134 * isn't inserted to queue. After flush1 is finished, flush2
135 * will be dispatched. Since disk cache is already clean,
136 * flush2 will be finished very soon, so looks like flush2 is
137 * folded to flush1.
138 * Since the queue is hold, a flag is set to indicate the queue
139 * should be restarted later. Please see flush_end_io() for
140 * details.
141 */
Ming Lei7c94e1c2014-09-25 23:23:43 +0800142 if (fq->flush_pending_idx != fq->flush_running_idx &&
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600143 !queue_flush_queueable(q)) {
Ming Lei7c94e1c2014-09-25 23:23:43 +0800144 fq->flush_queue_delayed = 1;
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600145 return NULL;
146 }
Tejun Heo556ee812014-01-29 14:56:16 -0700147 if (unlikely(blk_queue_bypass(q)) ||
Tejun Heo22f746e2011-12-14 00:33:41 +0100148 !q->elevator->type->ops.elevator_dispatch_fn(q, 0))
Tejun Heo158dbda2009-04-23 11:05:18 +0900149 return NULL;
150 }
151}
152
153static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
154{
155 struct elevator_queue *e = q->elevator;
156
Tejun Heo22f746e2011-12-14 00:33:41 +0100157 if (e->type->ops.elevator_activate_req_fn)
158 e->type->ops.elevator_activate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900159}
160
161static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
162{
163 struct elevator_queue *e = q->elevator;
164
Tejun Heo22f746e2011-12-14 00:33:41 +0100165 if (e->type->ops.elevator_deactivate_req_fn)
166 e->type->ops.elevator_deactivate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900167}
168
Jens Axboe581d4e22008-09-14 05:56:33 -0700169#ifdef CONFIG_FAIL_IO_TIMEOUT
170int blk_should_fake_timeout(struct request_queue *);
171ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
172ssize_t part_timeout_store(struct device *, struct device_attribute *,
173 const char *, size_t);
174#else
175static inline int blk_should_fake_timeout(struct request_queue *q)
176{
177 return 0;
178}
179#endif
180
Jens Axboed6d48192008-01-29 14:04:06 +0100181int ll_back_merge_fn(struct request_queue *q, struct request *req,
182 struct bio *bio);
183int ll_front_merge_fn(struct request_queue *q, struct request *req,
184 struct bio *bio);
185int attempt_back_merge(struct request_queue *q, struct request *rq);
186int attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100187int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
188 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100189void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900190void blk_rq_set_mixed_merge(struct request *rq);
Tejun Heo050c8ea2012-02-08 09:19:38 +0100191bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
192int blk_try_merge(struct request *rq, struct bio *bio);
Jens Axboed6d48192008-01-29 14:04:06 +0100193
Jens Axboe8324aa92008-01-29 14:51:59 +0100194void blk_queue_congestion_threshold(struct request_queue *q);
195
Bart Van Asschec246e802012-12-06 14:32:01 +0100196void __blk_run_queue_uncond(struct request_queue *q);
197
Adrian Bunkff889722008-03-04 11:23:45 +0100198int blk_dev_init(void);
199
Jens Axboef253b862010-10-24 22:06:02 +0200200
Jens Axboe8324aa92008-01-29 14:51:59 +0100201/*
202 * Return the threshold (number of used requests) at which the queue is
203 * considered to be congested. It include a little hysteresis to keep the
204 * context switch rate down.
205 */
206static inline int queue_congestion_on_threshold(struct request_queue *q)
207{
208 return q->nr_congestion_on;
209}
210
211/*
212 * The threshold at which a queue is considered to be uncongested
213 */
214static inline int queue_congestion_off_threshold(struct request_queue *q)
215{
216 return q->nr_congestion_off;
217}
218
Jens Axboee3a2b3f2014-05-20 11:49:02 -0600219extern int blk_update_nr_requests(struct request_queue *, unsigned int);
220
Jens Axboec2553b52009-04-24 08:10:11 +0200221/*
222 * Contribute to IO statistics IFF:
223 *
224 * a) it's attached to a gendisk, and
225 * b) the queue had IO stats enabled when this request was started, and
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400226 * c) it's a file system request
Jens Axboec2553b52009-04-24 08:10:11 +0200227 */
Jerome Marchand26308ea2009-03-27 10:31:51 +0100228static inline int blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100229{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200230 return rq->rq_disk &&
231 (rq->cmd_flags & REQ_IO_STAT) &&
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400232 (rq->cmd_type == REQ_TYPE_FS);
Jens Axboefb8ec182009-02-02 08:42:32 +0100233}
234
Tejun Heof2dbd762011-12-14 00:33:40 +0100235/*
236 * Internal io_context interface
237 */
238void get_io_context(struct io_context *ioc);
Tejun Heo47fdd4c2011-12-14 00:33:42 +0100239struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
Tejun Heo24acfc32012-03-05 13:15:24 -0800240struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
241 gfp_t gfp_mask);
Tejun Heo7e5a8792011-12-14 00:33:42 +0100242void ioc_clear_queue(struct request_queue *q);
Tejun Heof2dbd762011-12-14 00:33:40 +0100243
Tejun Heo24acfc32012-03-05 13:15:24 -0800244int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
Tejun Heof2dbd762011-12-14 00:33:40 +0100245
246/**
247 * create_io_context - try to create task->io_context
Tejun Heof2dbd762011-12-14 00:33:40 +0100248 * @gfp_mask: allocation mask
249 * @node: allocation node
250 *
Tejun Heo24acfc32012-03-05 13:15:24 -0800251 * If %current->io_context is %NULL, allocate a new io_context and install
252 * it. Returns the current %current->io_context which may be %NULL if
253 * allocation failed.
Tejun Heof2dbd762011-12-14 00:33:40 +0100254 *
255 * Note that this function can't be called with IRQ disabled because
Tejun Heo24acfc32012-03-05 13:15:24 -0800256 * task_lock which protects %current->io_context is IRQ-unsafe.
Tejun Heof2dbd762011-12-14 00:33:40 +0100257 */
Tejun Heo24acfc32012-03-05 13:15:24 -0800258static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
Tejun Heof2dbd762011-12-14 00:33:40 +0100259{
260 WARN_ON_ONCE(irqs_disabled());
Tejun Heo24acfc32012-03-05 13:15:24 -0800261 if (unlikely(!current->io_context))
262 create_task_io_context(current, gfp_mask, node);
263 return current->io_context;
Tejun Heof2dbd762011-12-14 00:33:40 +0100264}
265
266/*
267 * Internal throttling interface
268 */
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200269#ifdef CONFIG_BLK_DEV_THROTTLING
Tejun Heobc16a4f2011-10-19 14:33:01 +0200270extern bool blk_throtl_bio(struct request_queue *q, struct bio *bio);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200271extern void blk_throtl_drain(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200272extern int blk_throtl_init(struct request_queue *q);
273extern void blk_throtl_exit(struct request_queue *q);
274#else /* CONFIG_BLK_DEV_THROTTLING */
Tejun Heobc16a4f2011-10-19 14:33:01 +0200275static inline bool blk_throtl_bio(struct request_queue *q, struct bio *bio)
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200276{
Tejun Heobc16a4f2011-10-19 14:33:01 +0200277 return false;
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200278}
Tejun Heoc9a929d2011-10-19 14:42:16 +0200279static inline void blk_throtl_drain(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200280static inline int blk_throtl_init(struct request_queue *q) { return 0; }
281static inline void blk_throtl_exit(struct request_queue *q) { }
282#endif /* CONFIG_BLK_DEV_THROTTLING */
283
284#endif /* BLK_INTERNAL_H */