Blame view
block/blk.h
9.15 KB
8324aa91d
|
1 2 |
#ifndef BLK_INTERNAL_H #define BLK_INTERNAL_H |
a73f730d0
|
3 |
#include <linux/idr.h> |
f70ced091
|
4 5 |
#include <linux/blk-mq.h> #include "blk-mq.h" |
a73f730d0
|
6 |
|
86db1e297
|
7 8 9 10 11 |
/* 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 |
0d2602ca3
|
12 13 |
/* Max future timer expiry for timeouts */ #define BLK_MAX_TIMEOUT (5 * HZ) |
7c94e1c15
|
14 15 16 17 18 19 20 21 |
struct blk_flush_queue { unsigned int flush_queue_delayed:1; unsigned int flush_pending_idx:1; unsigned int flush_running_idx:1; unsigned long flush_pending_since; struct list_head flush_queue[2]; struct list_head flush_data_in_flight; struct request *flush_rq; |
0048b4837
|
22 23 24 25 26 27 |
/* * flush_rq shares tag with this rq, both can't be active * at the same time */ struct request *orig_rq; |
7c94e1c15
|
28 29 |
spinlock_t mq_flush_lock; }; |
8324aa91d
|
30 |
extern struct kmem_cache *blk_requestq_cachep; |
320ae51fe
|
31 |
extern struct kmem_cache *request_cachep; |
8324aa91d
|
32 |
extern struct kobj_type blk_queue_ktype; |
a73f730d0
|
33 |
extern struct ida blk_queue_ida; |
8324aa91d
|
34 |
|
7c94e1c15
|
35 |
static inline struct blk_flush_queue *blk_get_flush_queue( |
e97c293cd
|
36 |
struct request_queue *q, struct blk_mq_ctx *ctx) |
7c94e1c15
|
37 |
{ |
f70ced091
|
38 39 40 41 42 43 44 45 |
struct blk_mq_hw_ctx *hctx; if (!q->mq_ops) return q->fq; hctx = q->mq_ops->map_queue(q, ctx->cpu); return hctx->fq; |
7c94e1c15
|
46 |
} |
09ac46c42
|
47 48 49 50 |
static inline void __blk_get_queue(struct request_queue *q) { kobject_get(&q->kobj); } |
f70ced091
|
51 52 53 |
struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q, int node, int cmd_size); void blk_free_flush_queue(struct blk_flush_queue *q); |
f35526557
|
54 |
|
5b788ce3e
|
55 56 57 |
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
|
58 59 60 |
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
|
61 62 |
int blk_rq_append_bio(struct request_queue *q, struct request *rq, struct bio *bio); |
d732580b4
|
63 64 |
void blk_queue_bypass_start(struct request_queue *q); void blk_queue_bypass_end(struct request_queue *q); |
9934c8c04
|
65 |
void blk_dequeue_request(struct request *rq); |
8324aa91d
|
66 |
void __blk_queue_free_tags(struct request_queue *q); |
4853abaae
|
67 68 |
bool __blk_end_bidi_request(struct request *rq, int error, unsigned int nr_bytes, unsigned int bidi_bytes); |
3ef28e83a
|
69 70 71 72 73 74 75 76 77 78 79 80 |
void blk_freeze_queue(struct request_queue *q); static inline void blk_queue_enter_live(struct request_queue *q) { /* * Given that running in generic_make_request() context * guarantees that a live reference against q_usage_counter has * been established, further references under that same context * need not check that the queue has been frozen (marked dead). */ percpu_ref_get(&q->q_usage_counter); } |
8324aa91d
|
81 |
|
5a48fc147
|
82 83 84 85 86 87 88 |
#ifdef CONFIG_BLK_DEV_INTEGRITY void blk_flush_integrity(void); #else static inline void blk_flush_integrity(void) { } #endif |
8324aa91d
|
89 |
|
287922eb0
|
90 |
void blk_timeout_work(struct work_struct *work); |
0d2602ca3
|
91 |
unsigned long blk_rq_timeout(unsigned long timeout); |
87ee7b112
|
92 |
void blk_add_timer(struct request *req); |
242f9dcb8
|
93 |
void blk_delete_timer(struct request *); |
242f9dcb8
|
94 |
|
320ae51fe
|
95 96 97 98 99 100 |
bool bio_attempt_front_merge(struct request_queue *q, struct request *req, struct bio *bio); bool bio_attempt_back_merge(struct request_queue *q, struct request *req, struct bio *bio); bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, |
5b3f341f0
|
101 102 |
unsigned int *request_count, struct request **same_queue_rq); |
0809e3ac6
|
103 |
unsigned int blk_plug_queued_count(struct request_queue *q); |
320ae51fe
|
104 105 106 107 |
void blk_account_io_start(struct request *req, bool new_io); void blk_account_io_completion(struct request *req, unsigned int bytes); void blk_account_io_done(struct request *req); |
242f9dcb8
|
108 109 110 111 112 |
/* * Internal atomic flags for request handling */ enum rq_atomic_flags { REQ_ATOM_COMPLETE = 0, |
320ae51fe
|
113 |
REQ_ATOM_STARTED, |
242f9dcb8
|
114 115 116 117 |
}; /* * EH timer and IO completion will both attempt to 'grab' the request, make |
25985edce
|
118 |
* sure that only one of them succeeds |
242f9dcb8
|
119 120 121 122 123 124 125 126 127 128 |
*/ 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
|
129 |
|
158dbda00
|
130 131 132 |
/* * Internal elevator interface */ |
360f92c24
|
133 |
#define ELV_ON_HASH(rq) ((rq)->cmd_flags & REQ_HASHED) |
158dbda00
|
134 |
|
ae1b15396
|
135 |
void blk_insert_flush(struct request *rq); |
dd831006d
|
136 |
|
158dbda00
|
137 138 139 |
static inline struct request *__elv_next_request(struct request_queue *q) { struct request *rq; |
e97c293cd
|
140 |
struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL); |
158dbda00
|
141 142 |
while (1) { |
ae1b15396
|
143 |
if (!list_empty(&q->queue_head)) { |
158dbda00
|
144 |
rq = list_entry_rq(q->queue_head.next); |
ae1b15396
|
145 |
return rq; |
158dbda00
|
146 |
} |
3ac0cc450
|
147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 |
/* * 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. */ |
7c94e1c15
|
162 |
if (fq->flush_pending_idx != fq->flush_running_idx && |
3ac0cc450
|
163 |
!queue_flush_queueable(q)) { |
7c94e1c15
|
164 |
fq->flush_queue_delayed = 1; |
3ac0cc450
|
165 166 |
return NULL; } |
556ee818c
|
167 |
if (unlikely(blk_queue_bypass(q)) || |
22f746e23
|
168 |
!q->elevator->type->ops.elevator_dispatch_fn(q, 0)) |
158dbda00
|
169 170 171 172 173 174 175 |
return NULL; } } static inline void elv_activate_rq(struct request_queue *q, struct request *rq) { struct elevator_queue *e = q->elevator; |
22f746e23
|
176 177 |
if (e->type->ops.elevator_activate_req_fn) e->type->ops.elevator_activate_req_fn(q, rq); |
158dbda00
|
178 179 180 181 182 |
} static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq) { struct elevator_queue *e = q->elevator; |
22f746e23
|
183 184 |
if (e->type->ops.elevator_deactivate_req_fn) e->type->ops.elevator_deactivate_req_fn(q, rq); |
158dbda00
|
185 |
} |
581d4e28d
|
186 187 188 189 190 191 192 193 194 195 196 |
#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
|
197 198 199 200 201 202 |
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
|
203 204 |
int blk_attempt_req_merge(struct request_queue *q, struct request *rq, struct request *next); |
d6d481969
|
205 |
void blk_recalc_rq_segments(struct request *rq); |
80a761fd3
|
206 |
void blk_rq_set_mixed_merge(struct request *rq); |
050c8ea80
|
207 208 |
bool blk_rq_merge_ok(struct request *rq, struct bio *bio); int blk_try_merge(struct request *rq, struct bio *bio); |
d6d481969
|
209 |
|
8324aa91d
|
210 |
void blk_queue_congestion_threshold(struct request_queue *q); |
ff88972c8
|
211 |
int blk_dev_init(void); |
f253b86b4
|
212 |
|
8324aa91d
|
213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 |
/* * 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; } |
e3a2b3f93
|
230 |
extern int blk_update_nr_requests(struct request_queue *, unsigned int); |
c2553b584
|
231 232 233 234 235 |
/* * 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
|
236 |
* c) it's a file system request |
c2553b584
|
237 |
*/ |
26308eab6
|
238 |
static inline int blk_do_io_stat(struct request *rq) |
fb8ec18c3
|
239 |
{ |
33659ebba
|
240 241 |
return rq->rq_disk && (rq->cmd_flags & REQ_IO_STAT) && |
e2a60da74
|
242 |
(rq->cmd_type == REQ_TYPE_FS); |
fb8ec18c3
|
243 |
} |
f2dbd76a0
|
244 245 246 247 |
/* * Internal io_context interface */ void get_io_context(struct io_context *ioc); |
47fdd4ca9
|
248 |
struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q); |
24acfc34f
|
249 250 |
struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q, gfp_t gfp_mask); |
7e5a87944
|
251 |
void ioc_clear_queue(struct request_queue *q); |
f2dbd76a0
|
252 |
|
24acfc34f
|
253 |
int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node); |
f2dbd76a0
|
254 255 256 |
/** * create_io_context - try to create task->io_context |
f2dbd76a0
|
257 258 259 |
* @gfp_mask: allocation mask * @node: allocation node * |
24acfc34f
|
260 261 262 |
* 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
|
263 264 |
* * Note that this function can't be called with IRQ disabled because |
24acfc34f
|
265 |
* task_lock which protects %current->io_context is IRQ-unsafe. |
f2dbd76a0
|
266 |
*/ |
24acfc34f
|
267 |
static inline struct io_context *create_io_context(gfp_t gfp_mask, int node) |
f2dbd76a0
|
268 269 |
{ WARN_ON_ONCE(irqs_disabled()); |
24acfc34f
|
270 271 272 |
if (unlikely(!current->io_context)) create_task_io_context(current, gfp_mask, node); return current->io_context; |
f2dbd76a0
|
273 274 275 276 277 |
} /* * Internal throttling interface */ |
bc9fcbf9c
|
278 |
#ifdef CONFIG_BLK_DEV_THROTTLING |
c9a929dde
|
279 |
extern void blk_throtl_drain(struct request_queue *q); |
bc9fcbf9c
|
280 281 282 |
extern int blk_throtl_init(struct request_queue *q); extern void blk_throtl_exit(struct request_queue *q); #else /* CONFIG_BLK_DEV_THROTTLING */ |
c9a929dde
|
283 |
static inline void blk_throtl_drain(struct request_queue *q) { } |
bc9fcbf9c
|
284 285 286 287 288 |
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 */ |