1
2#ifndef BLK_INTERNAL_H
3#define BLK_INTERNAL_H
4
5#include <linux/idr.h>
6#include <linux/blk-mq.h>
7#include <xen/xen.h>
8#include "blk-mq.h"
9#include "blk-mq-sched.h"
10
11
12#define BLK_MAX_TIMEOUT (5 * HZ)
13
14#ifdef CONFIG_DEBUG_FS
15extern struct dentry *blk_debugfs_root;
16#endif
17
18struct blk_flush_queue {
19 unsigned int flush_queue_delayed:1;
20 unsigned int flush_pending_idx:1;
21 unsigned int flush_running_idx:1;
22 unsigned long flush_pending_since;
23 struct list_head flush_queue[2];
24 struct list_head flush_data_in_flight;
25 struct request *flush_rq;
26
27
28
29
30
31 struct request *orig_rq;
32 spinlock_t mq_flush_lock;
33};
34
35extern struct kmem_cache *blk_requestq_cachep;
36extern struct kobj_type blk_queue_ktype;
37extern struct ida blk_queue_ida;
38
39static inline struct blk_flush_queue *
40blk_get_flush_queue(struct request_queue *q, struct blk_mq_ctx *ctx)
41{
42 return blk_mq_map_queue(q, REQ_OP_FLUSH, ctx)->fq;
43}
44
45static inline void __blk_get_queue(struct request_queue *q)
46{
47 kobject_get(&q->kobj);
48}
49
50struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
51 int node, int cmd_size, gfp_t flags);
52void blk_free_flush_queue(struct blk_flush_queue *q);
53
54void blk_freeze_queue(struct request_queue *q);
55
56static inline void blk_queue_enter_live(struct request_queue *q)
57{
58
59
60
61
62
63
64 percpu_ref_get(&q->q_usage_counter);
65}
66
67static inline bool biovec_phys_mergeable(struct request_queue *q,
68 struct bio_vec *vec1, struct bio_vec *vec2)
69{
70 unsigned long mask = queue_segment_boundary(q);
71 phys_addr_t addr1 = page_to_phys(vec1->bv_page) + vec1->bv_offset;
72 phys_addr_t addr2 = page_to_phys(vec2->bv_page) + vec2->bv_offset;
73
74 if (addr1 + vec1->bv_len != addr2)
75 return false;
76 if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
77 return false;
78 if ((addr1 | mask) != ((addr2 + vec2->bv_len - 1) | mask))
79 return false;
80 return true;
81}
82
83static inline bool __bvec_gap_to_prev(struct request_queue *q,
84 struct bio_vec *bprv, unsigned int offset)
85{
86 return (offset & queue_virt_boundary(q)) ||
87 ((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
88}
89
90
91
92
93
94static inline bool bvec_gap_to_prev(struct request_queue *q,
95 struct bio_vec *bprv, unsigned int offset)
96{
97 if (!queue_virt_boundary(q))
98 return false;
99 return __bvec_gap_to_prev(q, bprv, offset);
100}
101
102static inline void blk_rq_bio_prep(struct request *rq, struct bio *bio,
103 unsigned int nr_segs)
104{
105 rq->nr_phys_segments = nr_segs;
106 rq->__data_len = bio->bi_iter.bi_size;
107 rq->bio = rq->biotail = bio;
108 rq->ioprio = bio_prio(bio);
109
110 if (bio->bi_disk)
111 rq->rq_disk = bio->bi_disk;
112}
113
114#ifdef CONFIG_BLK_DEV_INTEGRITY
115void blk_flush_integrity(void);
116bool __bio_integrity_endio(struct bio *);
117static inline bool bio_integrity_endio(struct bio *bio)
118{
119 if (bio_integrity(bio))
120 return __bio_integrity_endio(bio);
121 return true;
122}
123
124static inline bool integrity_req_gap_back_merge(struct request *req,
125 struct bio *next)
126{
127 struct bio_integrity_payload *bip = bio_integrity(req->bio);
128 struct bio_integrity_payload *bip_next = bio_integrity(next);
129
130 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
131 bip_next->bip_vec[0].bv_offset);
132}
133
134static inline bool integrity_req_gap_front_merge(struct request *req,
135 struct bio *bio)
136{
137 struct bio_integrity_payload *bip = bio_integrity(bio);
138 struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
139
140 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
141 bip_next->bip_vec[0].bv_offset);
142}
143#else
144static inline bool integrity_req_gap_back_merge(struct request *req,
145 struct bio *next)
146{
147 return false;
148}
149static inline bool integrity_req_gap_front_merge(struct request *req,
150 struct bio *bio)
151{
152 return false;
153}
154
155static inline void blk_flush_integrity(void)
156{
157}
158static inline bool bio_integrity_endio(struct bio *bio)
159{
160 return true;
161}
162#endif
163
164unsigned long blk_rq_timeout(unsigned long timeout);
165void blk_add_timer(struct request *req);
166
167bool bio_attempt_front_merge(struct request *req, struct bio *bio,
168 unsigned int nr_segs);
169bool bio_attempt_back_merge(struct request *req, struct bio *bio,
170 unsigned int nr_segs);
171bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
172 struct bio *bio);
173bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
174 unsigned int nr_segs, struct request **same_queue_rq);
175
176void blk_account_io_start(struct request *req, bool new_io);
177void blk_account_io_completion(struct request *req, unsigned int bytes);
178void blk_account_io_done(struct request *req, u64 now);
179
180
181
182
183#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
184
185void blk_insert_flush(struct request *rq);
186
187int elevator_init_mq(struct request_queue *q);
188int elevator_switch_mq(struct request_queue *q,
189 struct elevator_type *new_e);
190void __elevator_exit(struct request_queue *, struct elevator_queue *);
191int elv_register_queue(struct request_queue *q);
192void elv_unregister_queue(struct request_queue *q);
193
194static inline void elevator_exit(struct request_queue *q,
195 struct elevator_queue *e)
196{
197 blk_mq_sched_free_requests(q);
198 __elevator_exit(q, e);
199}
200
201struct hd_struct *__disk_get_part(struct gendisk *disk, int partno);
202
203#ifdef CONFIG_FAIL_IO_TIMEOUT
204int blk_should_fake_timeout(struct request_queue *);
205ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
206ssize_t part_timeout_store(struct device *, struct device_attribute *,
207 const char *, size_t);
208#else
209static inline int blk_should_fake_timeout(struct request_queue *q)
210{
211 return 0;
212}
213#endif
214
215void __blk_queue_split(struct request_queue *q, struct bio **bio,
216 unsigned int *nr_segs);
217int ll_back_merge_fn(struct request *req, struct bio *bio,
218 unsigned int nr_segs);
219int ll_front_merge_fn(struct request *req, struct bio *bio,
220 unsigned int nr_segs);
221struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
222struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
223int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
224 struct request *next);
225unsigned int blk_recalc_rq_segments(struct request *rq);
226void blk_rq_set_mixed_merge(struct request *rq);
227bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
228enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
229
230int blk_dev_init(void);
231
232
233
234
235
236
237
238
239static inline bool blk_do_io_stat(struct request *rq)
240{
241 return rq->rq_disk &&
242 (rq->rq_flags & RQF_IO_STAT) &&
243 !blk_rq_is_passthrough(rq);
244}
245
246static inline void req_set_nomerge(struct request_queue *q, struct request *req)
247{
248 req->cmd_flags |= REQ_NOMERGE;
249 if (req == q->last_merge)
250 q->last_merge = NULL;
251}
252
253
254
255
256
257
258static inline unsigned int bio_allowed_max_sectors(struct request_queue *q)
259{
260 return round_down(UINT_MAX, queue_logical_block_size(q)) >> 9;
261}
262
263
264
265
266void get_io_context(struct io_context *ioc);
267struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
268struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
269 gfp_t gfp_mask);
270void ioc_clear_queue(struct request_queue *q);
271
272int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
273
274
275
276
277
278
279
280
281
282
283
284
285
286static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
287{
288 WARN_ON_ONCE(irqs_disabled());
289 if (unlikely(!current->io_context))
290 create_task_io_context(current, gfp_mask, node);
291 return current->io_context;
292}
293
294
295
296
297#ifdef CONFIG_BLK_DEV_THROTTLING
298extern void blk_throtl_drain(struct request_queue *q);
299extern int blk_throtl_init(struct request_queue *q);
300extern void blk_throtl_exit(struct request_queue *q);
301extern void blk_throtl_register_queue(struct request_queue *q);
302#else
303static inline void blk_throtl_drain(struct request_queue *q) { }
304static inline int blk_throtl_init(struct request_queue *q) { return 0; }
305static inline void blk_throtl_exit(struct request_queue *q) { }
306static inline void blk_throtl_register_queue(struct request_queue *q) { }
307#endif
308#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
309extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
310extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
311 const char *page, size_t count);
312extern void blk_throtl_bio_endio(struct bio *bio);
313extern void blk_throtl_stat_add(struct request *rq, u64 time);
314#else
315static inline void blk_throtl_bio_endio(struct bio *bio) { }
316static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
317#endif
318
319#ifdef CONFIG_BOUNCE
320extern int init_emergency_isa_pool(void);
321extern void blk_queue_bounce(struct request_queue *q, struct bio **bio);
322#else
323static inline int init_emergency_isa_pool(void)
324{
325 return 0;
326}
327static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
328{
329}
330#endif
331
332#ifdef CONFIG_BLK_CGROUP_IOLATENCY
333extern int blk_iolatency_init(struct request_queue *q);
334#else
335static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
336#endif
337
338struct bio *blk_next_bio(struct bio *bio, unsigned int nr_pages, gfp_t gfp);
339
340#ifdef CONFIG_BLK_DEV_ZONED
341void blk_queue_free_zone_bitmaps(struct request_queue *q);
342#else
343static inline void blk_queue_free_zone_bitmaps(struct request_queue *q) {}
344#endif
345
346#endif
347