blob: 4df474d37e6d353d08aef657268880fde9ef1c3c [file] [log] [blame]
Jens Axboe8324aa92008-01-29 14:51:59 +01001#ifndef BLK_INTERNAL_H
2#define BLK_INTERNAL_H
3
Jens Axboe86db1e22008-01-29 14:53:40 +01004/* Amount of time in which a process may batch requests */
5#define BLK_BATCH_TIME (HZ/50UL)
6
7/* Number of requests a "batching" process may submit */
8#define BLK_BATCH_REQ 32
9
Jens Axboe8324aa92008-01-29 14:51:59 +010010extern struct kmem_cache *blk_requestq_cachep;
11extern struct kobj_type blk_queue_ktype;
12
Jens Axboe86db1e22008-01-29 14:53:40 +010013void init_request_from_bio(struct request *req, struct bio *bio);
14void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
15 struct bio *bio);
Boaz Harrosha411f4b2009-05-17 19:00:01 +030016int blk_rq_append_bio(struct request_queue *q, struct request *rq,
17 struct bio *bio);
Tejun Heo9934c8c2009-05-08 11:54:16 +090018void blk_dequeue_request(struct request *rq);
Jens Axboe8324aa92008-01-29 14:51:59 +010019void __blk_queue_free_tags(struct request_queue *q);
20
Jens Axboe242f9dc2008-09-14 05:55:09 -070021void blk_rq_timed_out_timer(unsigned long data);
22void blk_delete_timer(struct request *);
23void blk_add_timer(struct request *);
Jens Axboef73e2d12008-10-17 14:03:08 +020024void __generic_unplug_device(struct request_queue *);
Jens Axboe242f9dc2008-09-14 05:55:09 -070025
26/*
27 * Internal atomic flags for request handling
28 */
29enum rq_atomic_flags {
30 REQ_ATOM_COMPLETE = 0,
31};
32
33/*
34 * EH timer and IO completion will both attempt to 'grab' the request, make
Lucas De Marchi25985ed2011-03-30 22:57:33 -030035 * sure that only one of them succeeds
Jens Axboe242f9dc2008-09-14 05:55:09 -070036 */
37static inline int blk_mark_rq_complete(struct request *rq)
38{
39 return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
40}
41
42static inline void blk_clear_rq_complete(struct request *rq)
43{
44 clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
45}
Jens Axboe86db1e22008-01-29 14:53:40 +010046
Tejun Heo158dbda2009-04-23 11:05:18 +090047/*
48 * Internal elevator interface
49 */
50#define ELV_ON_HASH(rq) (!hlist_unhashed(&(rq)->hash))
51
Tejun Heoae1b1532011-01-25 12:43:54 +010052void blk_insert_flush(struct request *rq);
53void blk_abort_flushes(struct request_queue *q);
Tejun Heodd831002010-09-03 11:56:16 +020054
Tejun Heo158dbda2009-04-23 11:05:18 +090055static inline struct request *__elv_next_request(struct request_queue *q)
56{
57 struct request *rq;
58
59 while (1) {
Tejun Heoae1b1532011-01-25 12:43:54 +010060 if (!list_empty(&q->queue_head)) {
Tejun Heo158dbda2009-04-23 11:05:18 +090061 rq = list_entry_rq(q->queue_head.next);
Tejun Heoae1b1532011-01-25 12:43:54 +010062 return rq;
Tejun Heo158dbda2009-04-23 11:05:18 +090063 }
64
James Bottomley0a58e072011-05-18 16:20:10 +020065 if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags) ||
66 !q->elevator->ops->elevator_dispatch_fn(q, 0))
Tejun Heo158dbda2009-04-23 11:05:18 +090067 return NULL;
68 }
69}
70
71static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
72{
73 struct elevator_queue *e = q->elevator;
74
75 if (e->ops->elevator_activate_req_fn)
76 e->ops->elevator_activate_req_fn(q, rq);
77}
78
79static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
80{
81 struct elevator_queue *e = q->elevator;
82
83 if (e->ops->elevator_deactivate_req_fn)
84 e->ops->elevator_deactivate_req_fn(q, rq);
85}
86
Jens Axboe581d4e22008-09-14 05:56:33 -070087#ifdef CONFIG_FAIL_IO_TIMEOUT
88int blk_should_fake_timeout(struct request_queue *);
89ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
90ssize_t part_timeout_store(struct device *, struct device_attribute *,
91 const char *, size_t);
92#else
93static inline int blk_should_fake_timeout(struct request_queue *q)
94{
95 return 0;
96}
97#endif
98
Jens Axboe86db1e22008-01-29 14:53:40 +010099struct io_context *current_io_context(gfp_t gfp_flags, int node);
100
Jens Axboed6d48192008-01-29 14:04:06 +0100101int ll_back_merge_fn(struct request_queue *q, struct request *req,
102 struct bio *bio);
103int ll_front_merge_fn(struct request_queue *q, struct request *req,
104 struct bio *bio);
105int attempt_back_merge(struct request_queue *q, struct request *rq);
106int attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100107int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
108 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100109void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900110void blk_rq_set_mixed_merge(struct request *rq);
Jens Axboed6d48192008-01-29 14:04:06 +0100111
Jens Axboe8324aa92008-01-29 14:51:59 +0100112void blk_queue_congestion_threshold(struct request_queue *q);
113
Adrian Bunkff889722008-03-04 11:23:45 +0100114int blk_dev_init(void);
115
Jens Axboef253b862010-10-24 22:06:02 +0200116void elv_quiesce_start(struct request_queue *q);
117void elv_quiesce_end(struct request_queue *q);
118
119
Jens Axboe8324aa92008-01-29 14:51:59 +0100120/*
121 * Return the threshold (number of used requests) at which the queue is
122 * considered to be congested. It include a little hysteresis to keep the
123 * context switch rate down.
124 */
125static inline int queue_congestion_on_threshold(struct request_queue *q)
126{
127 return q->nr_congestion_on;
128}
129
130/*
131 * The threshold at which a queue is considered to be uncongested
132 */
133static inline int queue_congestion_off_threshold(struct request_queue *q)
134{
135 return q->nr_congestion_off;
136}
137
Jens Axboec7c22e42008-09-13 20:26:01 +0200138static inline int blk_cpu_to_group(int cpu)
139{
Brian Kingbe14eb62010-09-10 09:03:21 +0200140 int group = NR_CPUS;
Jens Axboec7c22e42008-09-13 20:26:01 +0200141#ifdef CONFIG_SCHED_MC
Rusty Russellbe4d6382008-12-26 22:23:43 +1030142 const struct cpumask *mask = cpu_coregroup_mask(cpu);
Brian Kingbe14eb62010-09-10 09:03:21 +0200143 group = cpumask_first(mask);
Jens Axboec7c22e42008-09-13 20:26:01 +0200144#elif defined(CONFIG_SCHED_SMT)
Brian Kingbe14eb62010-09-10 09:03:21 +0200145 group = cpumask_first(topology_thread_cpumask(cpu));
Jens Axboec7c22e42008-09-13 20:26:01 +0200146#else
147 return cpu;
148#endif
Brian Kingbe14eb62010-09-10 09:03:21 +0200149 if (likely(group < NR_CPUS))
150 return group;
151 return cpu;
Jens Axboec7c22e42008-09-13 20:26:01 +0200152}
153
Jens Axboec2553b52009-04-24 08:10:11 +0200154/*
155 * Contribute to IO statistics IFF:
156 *
157 * a) it's attached to a gendisk, and
158 * b) the queue had IO stats enabled when this request was started, and
Kiyoshi Ueda3c4198e2009-05-27 14:50:02 +0200159 * c) it's a file system request or a discard request
Jens Axboec2553b52009-04-24 08:10:11 +0200160 */
Jerome Marchand26308ea2009-03-27 10:31:51 +0100161static inline int blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100162{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200163 return rq->rq_disk &&
164 (rq->cmd_flags & REQ_IO_STAT) &&
165 (rq->cmd_type == REQ_TYPE_FS ||
166 (rq->cmd_flags & REQ_DISCARD));
Jens Axboefb8ec182009-02-02 08:42:32 +0100167}
168
Jens Axboe8324aa92008-01-29 14:51:59 +0100169#endif