blob: 7ecdd8517e69b30d452f42e6393a1b66dc403ece [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>
5
Jens Axboe86db1e22008-01-29 14:53:40 +01006/* Amount of time in which a process may batch requests */
7#define BLK_BATCH_TIME (HZ/50UL)
8
9/* Number of requests a "batching" process may submit */
10#define BLK_BATCH_REQ 32
11
Jens Axboe0d2602c2014-05-13 15:10:52 -060012/* Max future timer expiry for timeouts */
13#define BLK_MAX_TIMEOUT (5 * HZ)
14
Ming Lei7c94e1c2014-09-25 23:23:43 +080015struct blk_flush_queue {
16 unsigned int flush_queue_delayed:1;
17 unsigned int flush_pending_idx:1;
18 unsigned int flush_running_idx:1;
19 unsigned long flush_pending_since;
20 struct list_head flush_queue[2];
21 struct list_head flush_data_in_flight;
22 struct request *flush_rq;
23 spinlock_t mq_flush_lock;
24};
25
Jens Axboe8324aa92008-01-29 14:51:59 +010026extern struct kmem_cache *blk_requestq_cachep;
Jens Axboe320ae512013-10-24 09:20:05 +010027extern struct kmem_cache *request_cachep;
Jens Axboe8324aa92008-01-29 14:51:59 +010028extern struct kobj_type blk_queue_ktype;
Tejun Heoa73f7302011-12-14 00:33:37 +010029extern struct ida blk_queue_ida;
Jens Axboe8324aa92008-01-29 14:51:59 +010030
Ming Lei7c94e1c2014-09-25 23:23:43 +080031static inline struct blk_flush_queue *blk_get_flush_queue(
Ming Leie97c2932014-09-25 23:23:46 +080032 struct request_queue *q, struct blk_mq_ctx *ctx)
Ming Lei7c94e1c2014-09-25 23:23:43 +080033{
34 return q->fq;
35}
36
Tejun Heo09ac46c2011-12-14 00:33:38 +010037static inline void __blk_get_queue(struct request_queue *q)
38{
39 kobject_get(&q->kobj);
40}
41
Ming Leiba483382014-09-25 23:23:44 +080042struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q);
43void blk_free_flush_queue(struct blk_flush_queue *fq);
Ming Leif3552652014-09-25 23:23:40 +080044
Tejun Heo5b788ce2012-06-04 20:40:59 -070045int blk_init_rl(struct request_list *rl, struct request_queue *q,
46 gfp_t gfp_mask);
47void blk_exit_rl(struct request_list *rl);
Jens Axboe86db1e22008-01-29 14:53:40 +010048void init_request_from_bio(struct request *req, struct bio *bio);
49void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
50 struct bio *bio);
Boaz Harrosha411f4b2009-05-17 19:00:01 +030051int blk_rq_append_bio(struct request_queue *q, struct request *rq,
52 struct bio *bio);
Tejun Heod7325802012-03-05 13:14:58 -080053void blk_queue_bypass_start(struct request_queue *q);
54void blk_queue_bypass_end(struct request_queue *q);
Tejun Heo9934c8c2009-05-08 11:54:16 +090055void blk_dequeue_request(struct request *rq);
Jens Axboe8324aa92008-01-29 14:51:59 +010056void __blk_queue_free_tags(struct request_queue *q);
Jeff Moyer4853aba2011-08-15 21:37:25 +020057bool __blk_end_bidi_request(struct request *rq, int error,
58 unsigned int nr_bytes, unsigned int bidi_bytes);
Jens Axboe8324aa92008-01-29 14:51:59 +010059
Jens Axboe242f9dc2008-09-14 05:55:09 -070060void blk_rq_timed_out_timer(unsigned long data);
Jens Axboe0d2602c2014-05-13 15:10:52 -060061unsigned long blk_rq_timeout(unsigned long timeout);
Jens Axboe87ee7b12014-04-24 08:51:47 -060062void blk_add_timer(struct request *req);
Jens Axboe242f9dc2008-09-14 05:55:09 -070063void blk_delete_timer(struct request *);
Jens Axboe242f9dc2008-09-14 05:55:09 -070064
Jens Axboe320ae512013-10-24 09:20:05 +010065
66bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
67 struct bio *bio);
68bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
69 struct bio *bio);
70bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
71 unsigned int *request_count);
72
73void blk_account_io_start(struct request *req, bool new_io);
74void blk_account_io_completion(struct request *req, unsigned int bytes);
75void blk_account_io_done(struct request *req);
76
Jens Axboe242f9dc2008-09-14 05:55:09 -070077/*
78 * Internal atomic flags for request handling
79 */
80enum rq_atomic_flags {
81 REQ_ATOM_COMPLETE = 0,
Jens Axboe320ae512013-10-24 09:20:05 +010082 REQ_ATOM_STARTED,
Jens Axboe242f9dc2008-09-14 05:55:09 -070083};
84
85/*
86 * EH timer and IO completion will both attempt to 'grab' the request, make
Lucas De Marchi25985ed2011-03-30 22:57:33 -030087 * sure that only one of them succeeds
Jens Axboe242f9dc2008-09-14 05:55:09 -070088 */
89static inline int blk_mark_rq_complete(struct request *rq)
90{
91 return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
92}
93
94static inline void blk_clear_rq_complete(struct request *rq)
95{
96 clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
97}
Jens Axboe86db1e22008-01-29 14:53:40 +010098
Tejun Heo158dbda2009-04-23 11:05:18 +090099/*
100 * Internal elevator interface
101 */
Jens Axboe360f92c2014-04-09 20:27:01 -0600102#define ELV_ON_HASH(rq) ((rq)->cmd_flags & REQ_HASHED)
Tejun Heo158dbda2009-04-23 11:05:18 +0900103
Tejun Heoae1b1532011-01-25 12:43:54 +0100104void blk_insert_flush(struct request *rq);
Tejun Heodd831002010-09-03 11:56:16 +0200105
Tejun Heo158dbda2009-04-23 11:05:18 +0900106static inline struct request *__elv_next_request(struct request_queue *q)
107{
108 struct request *rq;
Ming Leie97c2932014-09-25 23:23:46 +0800109 struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
Tejun Heo158dbda2009-04-23 11:05:18 +0900110
111 while (1) {
Tejun Heoae1b1532011-01-25 12:43:54 +0100112 if (!list_empty(&q->queue_head)) {
Tejun Heo158dbda2009-04-23 11:05:18 +0900113 rq = list_entry_rq(q->queue_head.next);
Tejun Heoae1b1532011-01-25 12:43:54 +0100114 return rq;
Tejun Heo158dbda2009-04-23 11:05:18 +0900115 }
116
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600117 /*
118 * Flush request is running and flush request isn't queueable
119 * in the drive, we can hold the queue till flush request is
120 * finished. Even we don't do this, driver can't dispatch next
121 * requests and will requeue them. And this can improve
122 * throughput too. For example, we have request flush1, write1,
123 * flush 2. flush1 is dispatched, then queue is hold, write1
124 * isn't inserted to queue. After flush1 is finished, flush2
125 * will be dispatched. Since disk cache is already clean,
126 * flush2 will be finished very soon, so looks like flush2 is
127 * folded to flush1.
128 * Since the queue is hold, a flag is set to indicate the queue
129 * should be restarted later. Please see flush_end_io() for
130 * details.
131 */
Ming Lei7c94e1c2014-09-25 23:23:43 +0800132 if (fq->flush_pending_idx != fq->flush_running_idx &&
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600133 !queue_flush_queueable(q)) {
Ming Lei7c94e1c2014-09-25 23:23:43 +0800134 fq->flush_queue_delayed = 1;
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -0600135 return NULL;
136 }
Tejun Heo556ee812014-01-29 14:56:16 -0700137 if (unlikely(blk_queue_bypass(q)) ||
Tejun Heo22f746e2011-12-14 00:33:41 +0100138 !q->elevator->type->ops.elevator_dispatch_fn(q, 0))
Tejun Heo158dbda2009-04-23 11:05:18 +0900139 return NULL;
140 }
141}
142
143static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
144{
145 struct elevator_queue *e = q->elevator;
146
Tejun Heo22f746e2011-12-14 00:33:41 +0100147 if (e->type->ops.elevator_activate_req_fn)
148 e->type->ops.elevator_activate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900149}
150
151static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
152{
153 struct elevator_queue *e = q->elevator;
154
Tejun Heo22f746e2011-12-14 00:33:41 +0100155 if (e->type->ops.elevator_deactivate_req_fn)
156 e->type->ops.elevator_deactivate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900157}
158
Jens Axboe581d4e22008-09-14 05:56:33 -0700159#ifdef CONFIG_FAIL_IO_TIMEOUT
160int blk_should_fake_timeout(struct request_queue *);
161ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
162ssize_t part_timeout_store(struct device *, struct device_attribute *,
163 const char *, size_t);
164#else
165static inline int blk_should_fake_timeout(struct request_queue *q)
166{
167 return 0;
168}
169#endif
170
Jens Axboed6d48192008-01-29 14:04:06 +0100171int ll_back_merge_fn(struct request_queue *q, struct request *req,
172 struct bio *bio);
173int ll_front_merge_fn(struct request_queue *q, struct request *req,
174 struct bio *bio);
175int attempt_back_merge(struct request_queue *q, struct request *rq);
176int attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100177int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
178 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100179void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900180void blk_rq_set_mixed_merge(struct request *rq);
Tejun Heo050c8ea2012-02-08 09:19:38 +0100181bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
182int blk_try_merge(struct request *rq, struct bio *bio);
Jens Axboed6d48192008-01-29 14:04:06 +0100183
Jens Axboe8324aa92008-01-29 14:51:59 +0100184void blk_queue_congestion_threshold(struct request_queue *q);
185
Bart Van Asschec246e802012-12-06 14:32:01 +0100186void __blk_run_queue_uncond(struct request_queue *q);
187
Adrian Bunkff889722008-03-04 11:23:45 +0100188int blk_dev_init(void);
189
Jens Axboef253b862010-10-24 22:06:02 +0200190
Jens Axboe8324aa92008-01-29 14:51:59 +0100191/*
192 * Return the threshold (number of used requests) at which the queue is
193 * considered to be congested. It include a little hysteresis to keep the
194 * context switch rate down.
195 */
196static inline int queue_congestion_on_threshold(struct request_queue *q)
197{
198 return q->nr_congestion_on;
199}
200
201/*
202 * The threshold at which a queue is considered to be uncongested
203 */
204static inline int queue_congestion_off_threshold(struct request_queue *q)
205{
206 return q->nr_congestion_off;
207}
208
Jens Axboee3a2b3f2014-05-20 11:49:02 -0600209extern int blk_update_nr_requests(struct request_queue *, unsigned int);
210
Jens Axboec2553b52009-04-24 08:10:11 +0200211/*
212 * Contribute to IO statistics IFF:
213 *
214 * a) it's attached to a gendisk, and
215 * b) the queue had IO stats enabled when this request was started, and
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400216 * c) it's a file system request
Jens Axboec2553b52009-04-24 08:10:11 +0200217 */
Jerome Marchand26308ea2009-03-27 10:31:51 +0100218static inline int blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100219{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200220 return rq->rq_disk &&
221 (rq->cmd_flags & REQ_IO_STAT) &&
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400222 (rq->cmd_type == REQ_TYPE_FS);
Jens Axboefb8ec182009-02-02 08:42:32 +0100223}
224
Tejun Heof2dbd762011-12-14 00:33:40 +0100225/*
226 * Internal io_context interface
227 */
228void get_io_context(struct io_context *ioc);
Tejun Heo47fdd4c2011-12-14 00:33:42 +0100229struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
Tejun Heo24acfc32012-03-05 13:15:24 -0800230struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
231 gfp_t gfp_mask);
Tejun Heo7e5a8792011-12-14 00:33:42 +0100232void ioc_clear_queue(struct request_queue *q);
Tejun Heof2dbd762011-12-14 00:33:40 +0100233
Tejun Heo24acfc32012-03-05 13:15:24 -0800234int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
Tejun Heof2dbd762011-12-14 00:33:40 +0100235
236/**
237 * create_io_context - try to create task->io_context
Tejun Heof2dbd762011-12-14 00:33:40 +0100238 * @gfp_mask: allocation mask
239 * @node: allocation node
240 *
Tejun Heo24acfc32012-03-05 13:15:24 -0800241 * If %current->io_context is %NULL, allocate a new io_context and install
242 * it. Returns the current %current->io_context which may be %NULL if
243 * allocation failed.
Tejun Heof2dbd762011-12-14 00:33:40 +0100244 *
245 * Note that this function can't be called with IRQ disabled because
Tejun Heo24acfc32012-03-05 13:15:24 -0800246 * task_lock which protects %current->io_context is IRQ-unsafe.
Tejun Heof2dbd762011-12-14 00:33:40 +0100247 */
Tejun Heo24acfc32012-03-05 13:15:24 -0800248static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
Tejun Heof2dbd762011-12-14 00:33:40 +0100249{
250 WARN_ON_ONCE(irqs_disabled());
Tejun Heo24acfc32012-03-05 13:15:24 -0800251 if (unlikely(!current->io_context))
252 create_task_io_context(current, gfp_mask, node);
253 return current->io_context;
Tejun Heof2dbd762011-12-14 00:33:40 +0100254}
255
256/*
257 * Internal throttling interface
258 */
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200259#ifdef CONFIG_BLK_DEV_THROTTLING
Tejun Heobc16a4f2011-10-19 14:33:01 +0200260extern bool blk_throtl_bio(struct request_queue *q, struct bio *bio);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200261extern void blk_throtl_drain(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200262extern int blk_throtl_init(struct request_queue *q);
263extern void blk_throtl_exit(struct request_queue *q);
264#else /* CONFIG_BLK_DEV_THROTTLING */
Tejun Heobc16a4f2011-10-19 14:33:01 +0200265static inline bool blk_throtl_bio(struct request_queue *q, struct bio *bio)
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200266{
Tejun Heobc16a4f2011-10-19 14:33:01 +0200267 return false;
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200268}
Tejun Heoc9a929d2011-10-19 14:42:16 +0200269static inline void blk_throtl_drain(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200270static inline int blk_throtl_init(struct request_queue *q) { return 0; }
271static inline void blk_throtl_exit(struct request_queue *q) { }
272#endif /* CONFIG_BLK_DEV_THROTTLING */
273
274#endif /* BLK_INTERNAL_H */