blob: aae4d88fc523bb5e3c7bfd7acf56ddbeb5bd7372 [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 Axboe8324aa92008-01-29 14:51:59 +010012extern struct kmem_cache *blk_requestq_cachep;
13extern struct kobj_type blk_queue_ktype;
Tejun Heoa73f7302011-12-14 00:33:37 +010014extern struct ida blk_queue_ida;
Jens Axboe8324aa92008-01-29 14:51:59 +010015
Jens Axboe86db1e22008-01-29 14:53:40 +010016void init_request_from_bio(struct request *req, struct bio *bio);
17void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
18 struct bio *bio);
Boaz Harrosha411f4b2009-05-17 19:00:01 +030019int blk_rq_append_bio(struct request_queue *q, struct request *rq,
20 struct bio *bio);
Tejun Heoc9a929d2011-10-19 14:42:16 +020021void blk_drain_queue(struct request_queue *q, bool drain_all);
Tejun Heo9934c8c2009-05-08 11:54:16 +090022void blk_dequeue_request(struct request *rq);
Jens Axboe8324aa92008-01-29 14:51:59 +010023void __blk_queue_free_tags(struct request_queue *q);
Jeff Moyer4853aba2011-08-15 21:37:25 +020024bool __blk_end_bidi_request(struct request *rq, int error,
25 unsigned int nr_bytes, unsigned int bidi_bytes);
Jens Axboe8324aa92008-01-29 14:51:59 +010026
Jens Axboe242f9dc2008-09-14 05:55:09 -070027void blk_rq_timed_out_timer(unsigned long data);
28void blk_delete_timer(struct request *);
29void blk_add_timer(struct request *);
Jens Axboef73e2d12008-10-17 14:03:08 +020030void __generic_unplug_device(struct request_queue *);
Jens Axboe242f9dc2008-09-14 05:55:09 -070031
32/*
33 * Internal atomic flags for request handling
34 */
35enum rq_atomic_flags {
36 REQ_ATOM_COMPLETE = 0,
37};
38
39/*
40 * EH timer and IO completion will both attempt to 'grab' the request, make
Lucas De Marchi25985ed2011-03-30 22:57:33 -030041 * sure that only one of them succeeds
Jens Axboe242f9dc2008-09-14 05:55:09 -070042 */
43static inline int blk_mark_rq_complete(struct request *rq)
44{
45 return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
46}
47
48static inline void blk_clear_rq_complete(struct request *rq)
49{
50 clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
51}
Jens Axboe86db1e22008-01-29 14:53:40 +010052
Tejun Heo158dbda2009-04-23 11:05:18 +090053/*
54 * Internal elevator interface
55 */
56#define ELV_ON_HASH(rq) (!hlist_unhashed(&(rq)->hash))
57
Tejun Heoae1b1532011-01-25 12:43:54 +010058void blk_insert_flush(struct request *rq);
59void blk_abort_flushes(struct request_queue *q);
Tejun Heodd831002010-09-03 11:56:16 +020060
Tejun Heo158dbda2009-04-23 11:05:18 +090061static inline struct request *__elv_next_request(struct request_queue *q)
62{
63 struct request *rq;
64
65 while (1) {
Tejun Heoae1b1532011-01-25 12:43:54 +010066 if (!list_empty(&q->queue_head)) {
Tejun Heo158dbda2009-04-23 11:05:18 +090067 rq = list_entry_rq(q->queue_head.next);
Tejun Heoae1b1532011-01-25 12:43:54 +010068 return rq;
Tejun Heo158dbda2009-04-23 11:05:18 +090069 }
70
shaohua.li@intel.com3ac0cc42011-05-06 11:34:41 -060071 /*
72 * Flush request is running and flush request isn't queueable
73 * in the drive, we can hold the queue till flush request is
74 * finished. Even we don't do this, driver can't dispatch next
75 * requests and will requeue them. And this can improve
76 * throughput too. For example, we have request flush1, write1,
77 * flush 2. flush1 is dispatched, then queue is hold, write1
78 * isn't inserted to queue. After flush1 is finished, flush2
79 * will be dispatched. Since disk cache is already clean,
80 * flush2 will be finished very soon, so looks like flush2 is
81 * folded to flush1.
82 * Since the queue is hold, a flag is set to indicate the queue
83 * should be restarted later. Please see flush_end_io() for
84 * details.
85 */
86 if (q->flush_pending_idx != q->flush_running_idx &&
87 !queue_flush_queueable(q)) {
88 q->flush_queue_delayed = 1;
89 return NULL;
90 }
Tejun Heo34f60552011-12-14 00:33:37 +010091 if (unlikely(blk_queue_dead(q)) ||
James Bottomley0a58e072011-05-18 16:20:10 +020092 !q->elevator->ops->elevator_dispatch_fn(q, 0))
Tejun Heo158dbda2009-04-23 11:05:18 +090093 return NULL;
94 }
95}
96
97static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
98{
99 struct elevator_queue *e = q->elevator;
100
101 if (e->ops->elevator_activate_req_fn)
102 e->ops->elevator_activate_req_fn(q, rq);
103}
104
105static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
106{
107 struct elevator_queue *e = q->elevator;
108
109 if (e->ops->elevator_deactivate_req_fn)
110 e->ops->elevator_deactivate_req_fn(q, rq);
111}
112
Jens Axboe581d4e22008-09-14 05:56:33 -0700113#ifdef CONFIG_FAIL_IO_TIMEOUT
114int blk_should_fake_timeout(struct request_queue *);
115ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
116ssize_t part_timeout_store(struct device *, struct device_attribute *,
117 const char *, size_t);
118#else
119static inline int blk_should_fake_timeout(struct request_queue *q)
120{
121 return 0;
122}
123#endif
124
Jens Axboe86db1e22008-01-29 14:53:40 +0100125struct io_context *current_io_context(gfp_t gfp_flags, int node);
126
Jens Axboed6d48192008-01-29 14:04:06 +0100127int ll_back_merge_fn(struct request_queue *q, struct request *req,
128 struct bio *bio);
129int ll_front_merge_fn(struct request_queue *q, struct request *req,
130 struct bio *bio);
131int attempt_back_merge(struct request_queue *q, struct request *rq);
132int attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100133int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
134 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100135void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900136void blk_rq_set_mixed_merge(struct request *rq);
Jens Axboed6d48192008-01-29 14:04:06 +0100137
Jens Axboe8324aa92008-01-29 14:51:59 +0100138void blk_queue_congestion_threshold(struct request_queue *q);
139
Adrian Bunkff889722008-03-04 11:23:45 +0100140int blk_dev_init(void);
141
Jens Axboef253b862010-10-24 22:06:02 +0200142void elv_quiesce_start(struct request_queue *q);
143void elv_quiesce_end(struct request_queue *q);
144
145
Jens Axboe8324aa92008-01-29 14:51:59 +0100146/*
147 * Return the threshold (number of used requests) at which the queue is
148 * considered to be congested. It include a little hysteresis to keep the
149 * context switch rate down.
150 */
151static inline int queue_congestion_on_threshold(struct request_queue *q)
152{
153 return q->nr_congestion_on;
154}
155
156/*
157 * The threshold at which a queue is considered to be uncongested
158 */
159static inline int queue_congestion_off_threshold(struct request_queue *q)
160{
161 return q->nr_congestion_off;
162}
163
Jens Axboec7c22e42008-09-13 20:26:01 +0200164static inline int blk_cpu_to_group(int cpu)
165{
Brian Kingbe14eb62010-09-10 09:03:21 +0200166 int group = NR_CPUS;
Jens Axboec7c22e42008-09-13 20:26:01 +0200167#ifdef CONFIG_SCHED_MC
Rusty Russellbe4d6382008-12-26 22:23:43 +1030168 const struct cpumask *mask = cpu_coregroup_mask(cpu);
Brian Kingbe14eb62010-09-10 09:03:21 +0200169 group = cpumask_first(mask);
Jens Axboec7c22e42008-09-13 20:26:01 +0200170#elif defined(CONFIG_SCHED_SMT)
Brian Kingbe14eb62010-09-10 09:03:21 +0200171 group = cpumask_first(topology_thread_cpumask(cpu));
Jens Axboec7c22e42008-09-13 20:26:01 +0200172#else
173 return cpu;
174#endif
Brian Kingbe14eb62010-09-10 09:03:21 +0200175 if (likely(group < NR_CPUS))
176 return group;
177 return cpu;
Jens Axboec7c22e42008-09-13 20:26:01 +0200178}
179
Jens Axboec2553b52009-04-24 08:10:11 +0200180/*
181 * Contribute to IO statistics IFF:
182 *
183 * a) it's attached to a gendisk, and
184 * b) the queue had IO stats enabled when this request was started, and
Kiyoshi Ueda3c4198e2009-05-27 14:50:02 +0200185 * c) it's a file system request or a discard request
Jens Axboec2553b52009-04-24 08:10:11 +0200186 */
Jerome Marchand26308ea2009-03-27 10:31:51 +0100187static inline int blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100188{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200189 return rq->rq_disk &&
190 (rq->cmd_flags & REQ_IO_STAT) &&
191 (rq->cmd_type == REQ_TYPE_FS ||
192 (rq->cmd_flags & REQ_DISCARD));
Jens Axboefb8ec182009-02-02 08:42:32 +0100193}
194
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200195#ifdef CONFIG_BLK_DEV_THROTTLING
Tejun Heobc16a4f2011-10-19 14:33:01 +0200196extern bool blk_throtl_bio(struct request_queue *q, struct bio *bio);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200197extern void blk_throtl_drain(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200198extern int blk_throtl_init(struct request_queue *q);
199extern void blk_throtl_exit(struct request_queue *q);
Tejun Heoc9a929d2011-10-19 14:42:16 +0200200extern void blk_throtl_release(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200201#else /* CONFIG_BLK_DEV_THROTTLING */
Tejun Heobc16a4f2011-10-19 14:33:01 +0200202static inline bool blk_throtl_bio(struct request_queue *q, struct bio *bio)
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200203{
Tejun Heobc16a4f2011-10-19 14:33:01 +0200204 return false;
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200205}
Tejun Heoc9a929d2011-10-19 14:42:16 +0200206static inline void blk_throtl_drain(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200207static inline int blk_throtl_init(struct request_queue *q) { return 0; }
208static inline void blk_throtl_exit(struct request_queue *q) { }
Tejun Heoc9a929d2011-10-19 14:42:16 +0200209static inline void blk_throtl_release(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200210#endif /* CONFIG_BLK_DEV_THROTTLING */
211
212#endif /* BLK_INTERNAL_H */