Blame view
block/blk.h
7.13 KB
8324aa91d
|
1 2 |
#ifndef BLK_INTERNAL_H #define BLK_INTERNAL_H |
a73f730d0
|
3 |
#include <linux/idr.h> |
86db1e297
|
4 5 6 7 8 |
/* Amount of time in which a process may batch requests */ #define BLK_BATCH_TIME (HZ/50UL) /* Number of requests a "batching" process may submit */ #define BLK_BATCH_REQ 32 |
8324aa91d
|
9 10 |
extern struct kmem_cache *blk_requestq_cachep; extern struct kobj_type blk_queue_ktype; |
a73f730d0
|
11 |
extern struct ida blk_queue_ida; |
8324aa91d
|
12 |
|
09ac46c42
|
13 14 15 16 |
static inline void __blk_get_queue(struct request_queue *q) { kobject_get(&q->kobj); } |
5b788ce3e
|
17 18 19 |
int blk_init_rl(struct request_list *rl, struct request_queue *q, gfp_t gfp_mask); void blk_exit_rl(struct request_list *rl); |
86db1e297
|
20 21 22 |
void init_request_from_bio(struct request *req, struct bio *bio); void blk_rq_bio_prep(struct request_queue *q, struct request *rq, struct bio *bio); |
a411f4bbb
|
23 24 |
int blk_rq_append_bio(struct request_queue *q, struct request *rq, struct bio *bio); |
d732580b4
|
25 26 |
void blk_queue_bypass_start(struct request_queue *q); void blk_queue_bypass_end(struct request_queue *q); |
9934c8c04
|
27 |
void blk_dequeue_request(struct request *rq); |
8324aa91d
|
28 |
void __blk_queue_free_tags(struct request_queue *q); |
4853abaae
|
29 30 |
bool __blk_end_bidi_request(struct request *rq, int error, unsigned int nr_bytes, unsigned int bidi_bytes); |
8324aa91d
|
31 |
|
242f9dcb8
|
32 33 34 35 36 37 38 39 40 41 42 43 44 |
void blk_rq_timed_out_timer(unsigned long data); void blk_delete_timer(struct request *); void blk_add_timer(struct request *); /* * Internal atomic flags for request handling */ enum rq_atomic_flags { REQ_ATOM_COMPLETE = 0, }; /* * EH timer and IO completion will both attempt to 'grab' the request, make |
25985edce
|
45 |
* sure that only one of them succeeds |
242f9dcb8
|
46 47 48 49 50 51 52 53 54 55 |
*/ static inline int blk_mark_rq_complete(struct request *rq) { return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags); } static inline void blk_clear_rq_complete(struct request *rq) { clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags); } |
86db1e297
|
56 |
|
158dbda00
|
57 58 59 |
/* * Internal elevator interface */ |
242d98f07
|
60 |
#define ELV_ON_HASH(rq) hash_hashed(&(rq)->hash) |
158dbda00
|
61 |
|
ae1b15396
|
62 63 |
void blk_insert_flush(struct request *rq); void blk_abort_flushes(struct request_queue *q); |
dd831006d
|
64 |
|
158dbda00
|
65 66 67 68 69 |
static inline struct request *__elv_next_request(struct request_queue *q) { struct request *rq; while (1) { |
ae1b15396
|
70 |
if (!list_empty(&q->queue_head)) { |
158dbda00
|
71 |
rq = list_entry_rq(q->queue_head.next); |
ae1b15396
|
72 |
return rq; |
158dbda00
|
73 |
} |
3ac0cc450
|
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 |
/* * Flush request is running and flush request isn't queueable * in the drive, we can hold the queue till flush request is * finished. Even we don't do this, driver can't dispatch next * requests and will requeue them. And this can improve * throughput too. For example, we have request flush1, write1, * flush 2. flush1 is dispatched, then queue is hold, write1 * isn't inserted to queue. After flush1 is finished, flush2 * will be dispatched. Since disk cache is already clean, * flush2 will be finished very soon, so looks like flush2 is * folded to flush1. * Since the queue is hold, a flag is set to indicate the queue * should be restarted later. Please see flush_end_io() for * details. */ if (q->flush_pending_idx != q->flush_running_idx && !queue_flush_queueable(q)) { q->flush_queue_delayed = 1; return NULL; } |
3f3299d5c
|
94 |
if (unlikely(blk_queue_dying(q)) || |
22f746e23
|
95 |
!q->elevator->type->ops.elevator_dispatch_fn(q, 0)) |
158dbda00
|
96 97 98 99 100 101 102 |
return NULL; } } static inline void elv_activate_rq(struct request_queue *q, struct request *rq) { struct elevator_queue *e = q->elevator; |
22f746e23
|
103 104 |
if (e->type->ops.elevator_activate_req_fn) e->type->ops.elevator_activate_req_fn(q, rq); |
158dbda00
|
105 106 107 108 109 |
} static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq) { struct elevator_queue *e = q->elevator; |
22f746e23
|
110 111 |
if (e->type->ops.elevator_deactivate_req_fn) e->type->ops.elevator_deactivate_req_fn(q, rq); |
158dbda00
|
112 |
} |
581d4e28d
|
113 114 115 116 117 118 119 120 121 122 123 |
#ifdef CONFIG_FAIL_IO_TIMEOUT int blk_should_fake_timeout(struct request_queue *); ssize_t part_timeout_show(struct device *, struct device_attribute *, char *); ssize_t part_timeout_store(struct device *, struct device_attribute *, const char *, size_t); #else static inline int blk_should_fake_timeout(struct request_queue *q) { return 0; } #endif |
d6d481969
|
124 125 126 127 128 129 |
int ll_back_merge_fn(struct request_queue *q, struct request *req, struct bio *bio); int ll_front_merge_fn(struct request_queue *q, struct request *req, struct bio *bio); int attempt_back_merge(struct request_queue *q, struct request *rq); int attempt_front_merge(struct request_queue *q, struct request *rq); |
5e84ea3a9
|
130 131 |
int blk_attempt_req_merge(struct request_queue *q, struct request *rq, struct request *next); |
d6d481969
|
132 |
void blk_recalc_rq_segments(struct request *rq); |
80a761fd3
|
133 |
void blk_rq_set_mixed_merge(struct request *rq); |
050c8ea80
|
134 135 |
bool blk_rq_merge_ok(struct request *rq, struct bio *bio); int blk_try_merge(struct request *rq, struct bio *bio); |
d6d481969
|
136 |
|
8324aa91d
|
137 |
void blk_queue_congestion_threshold(struct request_queue *q); |
c246e80d8
|
138 |
void __blk_run_queue_uncond(struct request_queue *q); |
ff88972c8
|
139 |
int blk_dev_init(void); |
f253b86b4
|
140 |
|
8324aa91d
|
141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 |
/* * Return the threshold (number of used requests) at which the queue is * considered to be congested. It include a little hysteresis to keep the * context switch rate down. */ static inline int queue_congestion_on_threshold(struct request_queue *q) { return q->nr_congestion_on; } /* * The threshold at which a queue is considered to be uncongested */ static inline int queue_congestion_off_threshold(struct request_queue *q) { return q->nr_congestion_off; } |
c2553b584
|
158 159 160 161 162 |
/* * Contribute to IO statistics IFF: * * a) it's attached to a gendisk, and * b) the queue had IO stats enabled when this request was started, and |
e2a60da74
|
163 |
* c) it's a file system request |
c2553b584
|
164 |
*/ |
26308eab6
|
165 |
static inline int blk_do_io_stat(struct request *rq) |
fb8ec18c3
|
166 |
{ |
33659ebba
|
167 168 |
return rq->rq_disk && (rq->cmd_flags & REQ_IO_STAT) && |
e2a60da74
|
169 |
(rq->cmd_type == REQ_TYPE_FS); |
fb8ec18c3
|
170 |
} |
f2dbd76a0
|
171 172 173 174 |
/* * Internal io_context interface */ void get_io_context(struct io_context *ioc); |
47fdd4ca9
|
175 |
struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q); |
24acfc34f
|
176 177 |
struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q, gfp_t gfp_mask); |
7e5a87944
|
178 |
void ioc_clear_queue(struct request_queue *q); |
f2dbd76a0
|
179 |
|
24acfc34f
|
180 |
int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node); |
f2dbd76a0
|
181 182 183 |
/** * create_io_context - try to create task->io_context |
f2dbd76a0
|
184 185 186 |
* @gfp_mask: allocation mask * @node: allocation node * |
24acfc34f
|
187 188 189 |
* If %current->io_context is %NULL, allocate a new io_context and install * it. Returns the current %current->io_context which may be %NULL if * allocation failed. |
f2dbd76a0
|
190 191 |
* * Note that this function can't be called with IRQ disabled because |
24acfc34f
|
192 |
* task_lock which protects %current->io_context is IRQ-unsafe. |
f2dbd76a0
|
193 |
*/ |
24acfc34f
|
194 |
static inline struct io_context *create_io_context(gfp_t gfp_mask, int node) |
f2dbd76a0
|
195 196 |
{ WARN_ON_ONCE(irqs_disabled()); |
24acfc34f
|
197 198 199 |
if (unlikely(!current->io_context)) create_task_io_context(current, gfp_mask, node); return current->io_context; |
f2dbd76a0
|
200 201 202 203 204 |
} /* * Internal throttling interface */ |
bc9fcbf9c
|
205 |
#ifdef CONFIG_BLK_DEV_THROTTLING |
bc16a4f93
|
206 |
extern bool blk_throtl_bio(struct request_queue *q, struct bio *bio); |
c9a929dde
|
207 |
extern void blk_throtl_drain(struct request_queue *q); |
bc9fcbf9c
|
208 209 210 |
extern int blk_throtl_init(struct request_queue *q); extern void blk_throtl_exit(struct request_queue *q); #else /* CONFIG_BLK_DEV_THROTTLING */ |
bc16a4f93
|
211 |
static inline bool blk_throtl_bio(struct request_queue *q, struct bio *bio) |
bc9fcbf9c
|
212 |
{ |
bc16a4f93
|
213 |
return false; |
bc9fcbf9c
|
214 |
} |
c9a929dde
|
215 |
static inline void blk_throtl_drain(struct request_queue *q) { } |
bc9fcbf9c
|
216 217 218 219 220 |
static inline int blk_throtl_init(struct request_queue *q) { return 0; } static inline void blk_throtl_exit(struct request_queue *q) { } #endif /* CONFIG_BLK_DEV_THROTTLING */ #endif /* BLK_INTERNAL_H */ |