blob: 8f7229b6f63e2c9a1f49f2937b375236ff6e4cee [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Jens Axboe8324aa92008-01-29 14:51:59 +01002#ifndef BLK_INTERNAL_H
3#define BLK_INTERNAL_H
4
Tejun Heoa73f7302011-12-14 00:33:37 +01005#include <linux/idr.h>
Ming Leif70ced02014-09-25 23:23:47 +08006#include <linux/blk-mq.h>
7#include "blk-mq.h"
Tejun Heoa73f7302011-12-14 00:33:37 +01008
Jens Axboe86db1e22008-01-29 14:53:40 +01009/* Amount of time in which a process may batch requests */
10#define BLK_BATCH_TIME (HZ/50UL)
11
12/* Number of requests a "batching" process may submit */
13#define BLK_BATCH_REQ 32
14
Jens Axboe0d2602c2014-05-13 15:10:52 -060015/* Max future timer expiry for timeouts */
16#define BLK_MAX_TIMEOUT (5 * HZ)
17
Omar Sandoval18fbda92017-01-31 14:53:20 -080018#ifdef CONFIG_DEBUG_FS
19extern struct dentry *blk_debugfs_root;
20#endif
21
Ming Lei7c94e1c2014-09-25 23:23:43 +080022struct blk_flush_queue {
23 unsigned int flush_queue_delayed:1;
24 unsigned int flush_pending_idx:1;
25 unsigned int flush_running_idx:1;
26 unsigned long flush_pending_since;
27 struct list_head flush_queue[2];
28 struct list_head flush_data_in_flight;
29 struct request *flush_rq;
Ming Lei0048b482015-08-09 03:41:51 -040030
31 /*
32 * flush_rq shares tag with this rq, both can't be active
33 * at the same time
34 */
35 struct request *orig_rq;
Ming Lei7c94e1c2014-09-25 23:23:43 +080036 spinlock_t mq_flush_lock;
37};
38
Jens Axboe8324aa92008-01-29 14:51:59 +010039extern struct kmem_cache *blk_requestq_cachep;
Jens Axboe320ae512013-10-24 09:20:05 +010040extern struct kmem_cache *request_cachep;
Jens Axboe8324aa92008-01-29 14:51:59 +010041extern struct kobj_type blk_queue_ktype;
Tejun Heoa73f7302011-12-14 00:33:37 +010042extern struct ida blk_queue_ida;
Jens Axboe8324aa92008-01-29 14:51:59 +010043
Bart Van Assche8a0ac142018-03-07 17:10:12 -080044/*
45 * @q->queue_lock is set while a queue is being initialized. Since we know
46 * that no other threads access the queue object before @q->queue_lock has
47 * been set, it is safe to manipulate queue flags without holding the
48 * queue_lock if @q->queue_lock == NULL. See also blk_alloc_queue_node() and
49 * blk_init_allocated_queue().
50 */
51static inline void queue_lockdep_assert_held(struct request_queue *q)
52{
53 if (q->queue_lock)
54 lockdep_assert_held(q->queue_lock);
55}
56
57static inline void queue_flag_set_unlocked(unsigned int flag,
58 struct request_queue *q)
59{
60 if (test_bit(QUEUE_FLAG_INIT_DONE, &q->queue_flags) &&
61 kref_read(&q->kobj.kref))
62 lockdep_assert_held(q->queue_lock);
63 __set_bit(flag, &q->queue_flags);
64}
65
66static inline void queue_flag_clear_unlocked(unsigned int flag,
67 struct request_queue *q)
68{
69 if (test_bit(QUEUE_FLAG_INIT_DONE, &q->queue_flags) &&
70 kref_read(&q->kobj.kref))
71 lockdep_assert_held(q->queue_lock);
72 __clear_bit(flag, &q->queue_flags);
73}
74
75static inline int queue_flag_test_and_clear(unsigned int flag,
76 struct request_queue *q)
77{
78 queue_lockdep_assert_held(q);
79
80 if (test_bit(flag, &q->queue_flags)) {
81 __clear_bit(flag, &q->queue_flags);
82 return 1;
83 }
84
85 return 0;
86}
87
88static inline int queue_flag_test_and_set(unsigned int flag,
89 struct request_queue *q)
90{
91 queue_lockdep_assert_held(q);
92
93 if (!test_bit(flag, &q->queue_flags)) {
94 __set_bit(flag, &q->queue_flags);
95 return 0;
96 }
97
98 return 1;
99}
100
101static inline void queue_flag_set(unsigned int flag, struct request_queue *q)
102{
103 queue_lockdep_assert_held(q);
104 __set_bit(flag, &q->queue_flags);
105}
106
107static inline void queue_flag_clear(unsigned int flag, struct request_queue *q)
108{
109 queue_lockdep_assert_held(q);
110 __clear_bit(flag, &q->queue_flags);
111}
112
Ming Lei7c94e1c2014-09-25 23:23:43 +0800113static inline struct blk_flush_queue *blk_get_flush_queue(
Ming Leie97c2932014-09-25 23:23:46 +0800114 struct request_queue *q, struct blk_mq_ctx *ctx)
Ming Lei7c94e1c2014-09-25 23:23:43 +0800115{
Christoph Hellwig7d7e0f92016-09-14 16:18:54 +0200116 if (q->mq_ops)
117 return blk_mq_map_queue(q, ctx->cpu)->fq;
118 return q->fq;
Ming Lei7c94e1c2014-09-25 23:23:43 +0800119}
120
Tejun Heo09ac46c2011-12-14 00:33:38 +0100121static inline void __blk_get_queue(struct request_queue *q)
122{
123 kobject_get(&q->kobj);
124}
125
Ming Leif70ced02014-09-25 23:23:47 +0800126struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
127 int node, int cmd_size);
128void blk_free_flush_queue(struct blk_flush_queue *q);
Ming Leif3552652014-09-25 23:23:40 +0800129
Tejun Heo5b788ce2012-06-04 20:40:59 -0700130int blk_init_rl(struct request_list *rl, struct request_queue *q,
131 gfp_t gfp_mask);
Bart Van Asscheb425e502017-05-31 14:43:45 -0700132void blk_exit_rl(struct request_queue *q, struct request_list *rl);
Bart Van Assche4cf63242018-08-09 07:53:37 -0700133void blk_exit_queue(struct request_queue *q);
Jens Axboe86db1e22008-01-29 14:53:40 +0100134void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
135 struct bio *bio);
Tejun Heod7325802012-03-05 13:14:58 -0800136void blk_queue_bypass_start(struct request_queue *q);
137void blk_queue_bypass_end(struct request_queue *q);
Jens Axboe8324aa92008-01-29 14:51:59 +0100138void __blk_queue_free_tags(struct request_queue *q);
Dan Williams3ef28e82015-10-21 13:20:12 -0400139void blk_freeze_queue(struct request_queue *q);
140
141static inline void blk_queue_enter_live(struct request_queue *q)
142{
143 /*
144 * Given that running in generic_make_request() context
145 * guarantees that a live reference against q_usage_counter has
146 * been established, further references under that same context
147 * need not check that the queue has been frozen (marked dead).
148 */
149 percpu_ref_get(&q->q_usage_counter);
150}
Jens Axboe8324aa92008-01-29 14:51:59 +0100151
Christoph Hellwig6a9f5f22018-09-24 09:43:50 +0200152#ifndef ARCH_BIOVEC_PHYS_MERGEABLE
153#define ARCH_BIOVEC_PHYS_MERGEABLE(vec1, vec2) true
154#endif
155
Christoph Hellwig3dccdae2018-09-24 09:43:52 +0200156static inline bool biovec_phys_mergeable(struct request_queue *q,
157 struct bio_vec *vec1, struct bio_vec *vec2)
Christoph Hellwig6a9f5f22018-09-24 09:43:50 +0200158{
Christoph Hellwig3dccdae2018-09-24 09:43:52 +0200159 unsigned long mask = queue_segment_boundary(q);
160 phys_addr_t addr1 = bvec_to_phys(vec1);
161 phys_addr_t addr2 = bvec_to_phys(vec2);
162
163 if (addr1 + vec1->bv_len != addr2)
Christoph Hellwig6a9f5f22018-09-24 09:43:50 +0200164 return false;
165 if (!ARCH_BIOVEC_PHYS_MERGEABLE(vec1, vec2))
166 return false;
Christoph Hellwig3dccdae2018-09-24 09:43:52 +0200167 if ((addr1 | mask) != ((addr2 + vec2->bv_len - 1) | mask))
168 return false;
Christoph Hellwig6a9f5f22018-09-24 09:43:50 +0200169 return true;
170}
171
Christoph Hellwig27ca1d42018-09-24 09:43:49 +0200172static inline bool __bvec_gap_to_prev(struct request_queue *q,
173 struct bio_vec *bprv, unsigned int offset)
174{
175 return offset ||
176 ((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
177}
178
179/*
180 * Check if adding a bio_vec after bprv with offset would create a gap in
181 * the SG list. Most drivers don't care about this, but some do.
182 */
183static inline bool bvec_gap_to_prev(struct request_queue *q,
184 struct bio_vec *bprv, unsigned int offset)
185{
186 if (!queue_virt_boundary(q))
187 return false;
188 return __bvec_gap_to_prev(q, bprv, offset);
189}
190
Dan Williams5a48fc12015-10-21 13:20:23 -0400191#ifdef CONFIG_BLK_DEV_INTEGRITY
192void blk_flush_integrity(void);
Christoph Hellwig7c20f112017-07-03 16:58:43 -0600193bool __bio_integrity_endio(struct bio *);
194static inline bool bio_integrity_endio(struct bio *bio)
195{
196 if (bio_integrity(bio))
197 return __bio_integrity_endio(bio);
198 return true;
199}
Christoph Hellwig43b729b2018-09-24 09:43:47 +0200200
201static inline bool integrity_req_gap_back_merge(struct request *req,
202 struct bio *next)
203{
204 struct bio_integrity_payload *bip = bio_integrity(req->bio);
205 struct bio_integrity_payload *bip_next = bio_integrity(next);
206
207 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
208 bip_next->bip_vec[0].bv_offset);
209}
210
211static inline bool integrity_req_gap_front_merge(struct request *req,
212 struct bio *bio)
213{
214 struct bio_integrity_payload *bip = bio_integrity(bio);
215 struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
216
217 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
218 bip_next->bip_vec[0].bv_offset);
219}
220#else /* CONFIG_BLK_DEV_INTEGRITY */
221static inline bool integrity_req_gap_back_merge(struct request *req,
222 struct bio *next)
223{
224 return false;
225}
226static inline bool integrity_req_gap_front_merge(struct request *req,
227 struct bio *bio)
228{
229 return false;
230}
231
Dan Williams5a48fc12015-10-21 13:20:23 -0400232static inline void blk_flush_integrity(void)
233{
234}
Christoph Hellwig7c20f112017-07-03 16:58:43 -0600235static inline bool bio_integrity_endio(struct bio *bio)
236{
237 return true;
238}
Christoph Hellwig43b729b2018-09-24 09:43:47 +0200239#endif /* CONFIG_BLK_DEV_INTEGRITY */
Jens Axboe8324aa92008-01-29 14:51:59 +0100240
Christoph Hellwig287922e2015-10-30 20:57:30 +0800241void blk_timeout_work(struct work_struct *work);
Jens Axboe0d2602c2014-05-13 15:10:52 -0600242unsigned long blk_rq_timeout(unsigned long timeout);
Jens Axboe87ee7b12014-04-24 08:51:47 -0600243void blk_add_timer(struct request *req);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700244void blk_delete_timer(struct request *);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700245
Jens Axboe320ae512013-10-24 09:20:05 +0100246
247bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
248 struct bio *bio);
249bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
250 struct bio *bio);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100251bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
252 struct bio *bio);
Jens Axboe320ae512013-10-24 09:20:05 +0100253bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
Shaohua Li5b3f3412015-05-08 10:51:33 -0700254 unsigned int *request_count,
255 struct request **same_queue_rq);
Jeff Moyer0809e3a2015-10-20 23:13:51 +0800256unsigned int blk_plug_queued_count(struct request_queue *q);
Jens Axboe320ae512013-10-24 09:20:05 +0100257
258void blk_account_io_start(struct request *req, bool new_io);
259void blk_account_io_completion(struct request *req, unsigned int bytes);
Omar Sandoval522a7772018-05-09 02:08:53 -0700260void blk_account_io_done(struct request *req, u64 now);
Jens Axboe320ae512013-10-24 09:20:05 +0100261
Jens Axboe242f9dc2008-09-14 05:55:09 -0700262/*
Jens Axboe242f9dc2008-09-14 05:55:09 -0700263 * EH timer and IO completion will both attempt to 'grab' the request, make
Jens Axboee14575b32018-01-10 11:34:25 -0700264 * sure that only one of them succeeds. Steal the bottom bit of the
265 * __deadline field for this.
Jens Axboe242f9dc2008-09-14 05:55:09 -0700266 */
267static inline int blk_mark_rq_complete(struct request *rq)
268{
Jens Axboee14575b32018-01-10 11:34:25 -0700269 return test_and_set_bit(0, &rq->__deadline);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700270}
271
272static inline void blk_clear_rq_complete(struct request *rq)
273{
Jens Axboee14575b32018-01-10 11:34:25 -0700274 clear_bit(0, &rq->__deadline);
275}
276
277static inline bool blk_rq_is_complete(struct request *rq)
278{
279 return test_bit(0, &rq->__deadline);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700280}
Jens Axboe86db1e22008-01-29 14:53:40 +0100281
Tejun Heo158dbda2009-04-23 11:05:18 +0900282/*
283 * Internal elevator interface
284 */
Christoph Hellwige8064022016-10-20 15:12:13 +0200285#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
Tejun Heo158dbda2009-04-23 11:05:18 +0900286
Tejun Heoae1b1532011-01-25 12:43:54 +0100287void blk_insert_flush(struct request *rq);
Tejun Heodd831002010-09-03 11:56:16 +0200288
Tejun Heo158dbda2009-04-23 11:05:18 +0900289static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
290{
291 struct elevator_queue *e = q->elevator;
292
Jens Axboec51ca6c2016-12-10 15:13:59 -0700293 if (e->type->ops.sq.elevator_activate_req_fn)
294 e->type->ops.sq.elevator_activate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900295}
296
297static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
298{
299 struct elevator_queue *e = q->elevator;
300
Jens Axboec51ca6c2016-12-10 15:13:59 -0700301 if (e->type->ops.sq.elevator_deactivate_req_fn)
302 e->type->ops.sq.elevator_deactivate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900303}
304
Christoph Hellwigddb72532018-05-31 19:11:38 +0200305int elevator_init(struct request_queue *);
Christoph Hellwig131d08e2018-05-31 19:11:40 +0200306int elevator_init_mq(struct request_queue *q);
Jianchao Wangd48ece22018-08-21 15:15:03 +0800307int elevator_switch_mq(struct request_queue *q,
308 struct elevator_type *new_e);
Christoph Hellwiga8a275c2018-05-31 19:11:37 +0200309void elevator_exit(struct request_queue *, struct elevator_queue *);
Bart Van Assche83d016a2018-01-17 11:48:08 -0800310int elv_register_queue(struct request_queue *q);
311void elv_unregister_queue(struct request_queue *q);
312
Christoph Hellwig807d4af2017-08-23 19:10:30 +0200313struct hd_struct *__disk_get_part(struct gendisk *disk, int partno);
314
Jens Axboe581d4e22008-09-14 05:56:33 -0700315#ifdef CONFIG_FAIL_IO_TIMEOUT
316int blk_should_fake_timeout(struct request_queue *);
317ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
318ssize_t part_timeout_store(struct device *, struct device_attribute *,
319 const char *, size_t);
320#else
321static inline int blk_should_fake_timeout(struct request_queue *q)
322{
323 return 0;
324}
325#endif
326
Jens Axboed6d48192008-01-29 14:04:06 +0100327int ll_back_merge_fn(struct request_queue *q, struct request *req,
328 struct bio *bio);
329int ll_front_merge_fn(struct request_queue *q, struct request *req,
330 struct bio *bio);
Jens Axboeb973cb72017-02-02 08:54:40 -0700331struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
332struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100333int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
334 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100335void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900336void blk_rq_set_mixed_merge(struct request *rq);
Tejun Heo050c8ea2012-02-08 09:19:38 +0100337bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
Christoph Hellwig34fe7c02017-02-08 14:46:48 +0100338enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
Jens Axboed6d48192008-01-29 14:04:06 +0100339
Jens Axboe8324aa92008-01-29 14:51:59 +0100340void blk_queue_congestion_threshold(struct request_queue *q);
341
Adrian Bunkff889722008-03-04 11:23:45 +0100342int blk_dev_init(void);
343
Jens Axboef253b862010-10-24 22:06:02 +0200344
Jens Axboe8324aa92008-01-29 14:51:59 +0100345/*
346 * Return the threshold (number of used requests) at which the queue is
347 * considered to be congested. It include a little hysteresis to keep the
348 * context switch rate down.
349 */
350static inline int queue_congestion_on_threshold(struct request_queue *q)
351{
352 return q->nr_congestion_on;
353}
354
355/*
356 * The threshold at which a queue is considered to be uncongested
357 */
358static inline int queue_congestion_off_threshold(struct request_queue *q)
359{
360 return q->nr_congestion_off;
361}
362
Jens Axboee3a2b3f2014-05-20 11:49:02 -0600363extern int blk_update_nr_requests(struct request_queue *, unsigned int);
364
Jens Axboec2553b52009-04-24 08:10:11 +0200365/*
366 * Contribute to IO statistics IFF:
367 *
368 * a) it's attached to a gendisk, and
369 * b) the queue had IO stats enabled when this request was started, and
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400370 * c) it's a file system request
Jens Axboec2553b52009-04-24 08:10:11 +0200371 */
Chengguang Xu599d0672018-08-16 22:51:40 +0800372static inline bool blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100373{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200374 return rq->rq_disk &&
Christoph Hellwige8064022016-10-20 15:12:13 +0200375 (rq->rq_flags & RQF_IO_STAT) &&
Christoph Hellwig57292b52017-01-31 16:57:29 +0100376 !blk_rq_is_passthrough(rq);
Jens Axboefb8ec182009-02-02 08:42:32 +0100377}
378
Christoph Hellwig6cf76772017-02-08 14:46:47 +0100379static inline void req_set_nomerge(struct request_queue *q, struct request *req)
380{
381 req->cmd_flags |= REQ_NOMERGE;
382 if (req == q->last_merge)
383 q->last_merge = NULL;
384}
385
Tejun Heof2dbd762011-12-14 00:33:40 +0100386/*
Jens Axboe0a72e7f2018-01-09 14:23:42 -0700387 * Steal a bit from this field for legacy IO path atomic IO marking. Note that
388 * setting the deadline clears the bottom bit, potentially clearing the
389 * completed bit. The user has to be OK with this (current ones are fine).
390 */
391static inline void blk_rq_set_deadline(struct request *rq, unsigned long time)
392{
393 rq->__deadline = time & ~0x1UL;
394}
395
396static inline unsigned long blk_rq_deadline(struct request *rq)
397{
398 return rq->__deadline & ~0x1UL;
399}
400
401/*
Tejun Heof2dbd762011-12-14 00:33:40 +0100402 * Internal io_context interface
403 */
404void get_io_context(struct io_context *ioc);
Tejun Heo47fdd4c2011-12-14 00:33:42 +0100405struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
Tejun Heo24acfc32012-03-05 13:15:24 -0800406struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
407 gfp_t gfp_mask);
Tejun Heo7e5a8792011-12-14 00:33:42 +0100408void ioc_clear_queue(struct request_queue *q);
Tejun Heof2dbd762011-12-14 00:33:40 +0100409
Tejun Heo24acfc32012-03-05 13:15:24 -0800410int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
Tejun Heof2dbd762011-12-14 00:33:40 +0100411
412/**
Jens Axboec23ecb42016-12-14 14:23:43 -0700413 * rq_ioc - determine io_context for request allocation
414 * @bio: request being allocated is for this bio (can be %NULL)
415 *
416 * Determine io_context to use for request allocation for @bio. May return
417 * %NULL if %current->io_context doesn't exist.
418 */
419static inline struct io_context *rq_ioc(struct bio *bio)
420{
421#ifdef CONFIG_BLK_CGROUP
422 if (bio && bio->bi_ioc)
423 return bio->bi_ioc;
424#endif
425 return current->io_context;
426}
427
428/**
Tejun Heof2dbd762011-12-14 00:33:40 +0100429 * create_io_context - try to create task->io_context
Tejun Heof2dbd762011-12-14 00:33:40 +0100430 * @gfp_mask: allocation mask
431 * @node: allocation node
432 *
Tejun Heo24acfc32012-03-05 13:15:24 -0800433 * If %current->io_context is %NULL, allocate a new io_context and install
434 * it. Returns the current %current->io_context which may be %NULL if
435 * allocation failed.
Tejun Heof2dbd762011-12-14 00:33:40 +0100436 *
437 * Note that this function can't be called with IRQ disabled because
Tejun Heo24acfc32012-03-05 13:15:24 -0800438 * task_lock which protects %current->io_context is IRQ-unsafe.
Tejun Heof2dbd762011-12-14 00:33:40 +0100439 */
Tejun Heo24acfc32012-03-05 13:15:24 -0800440static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
Tejun Heof2dbd762011-12-14 00:33:40 +0100441{
442 WARN_ON_ONCE(irqs_disabled());
Tejun Heo24acfc32012-03-05 13:15:24 -0800443 if (unlikely(!current->io_context))
444 create_task_io_context(current, gfp_mask, node);
445 return current->io_context;
Tejun Heof2dbd762011-12-14 00:33:40 +0100446}
447
448/*
449 * Internal throttling interface
450 */
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200451#ifdef CONFIG_BLK_DEV_THROTTLING
Tejun Heoc9a929d2011-10-19 14:42:16 +0200452extern void blk_throtl_drain(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200453extern int blk_throtl_init(struct request_queue *q);
454extern void blk_throtl_exit(struct request_queue *q);
Shaohua Lid61fcfa2017-03-27 10:51:38 -0700455extern void blk_throtl_register_queue(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200456#else /* CONFIG_BLK_DEV_THROTTLING */
Tejun Heoc9a929d2011-10-19 14:42:16 +0200457static inline void blk_throtl_drain(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200458static inline int blk_throtl_init(struct request_queue *q) { return 0; }
459static inline void blk_throtl_exit(struct request_queue *q) { }
Shaohua Lid61fcfa2017-03-27 10:51:38 -0700460static inline void blk_throtl_register_queue(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200461#endif /* CONFIG_BLK_DEV_THROTTLING */
Shaohua Li297e3d82017-03-27 10:51:37 -0700462#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
463extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
464extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
465 const char *page, size_t count);
Shaohua Li9e234ee2017-03-27 10:51:41 -0700466extern void blk_throtl_bio_endio(struct bio *bio);
Shaohua Lib9147dd2017-03-27 15:19:42 -0700467extern void blk_throtl_stat_add(struct request *rq, u64 time);
Shaohua Li9e234ee2017-03-27 10:51:41 -0700468#else
469static inline void blk_throtl_bio_endio(struct bio *bio) { }
Shaohua Lib9147dd2017-03-27 15:19:42 -0700470static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
Shaohua Li297e3d82017-03-27 10:51:37 -0700471#endif
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200472
Christoph Hellwig3bce0162017-06-19 09:26:21 +0200473#ifdef CONFIG_BOUNCE
474extern int init_emergency_isa_pool(void);
475extern void blk_queue_bounce(struct request_queue *q, struct bio **bio);
476#else
477static inline int init_emergency_isa_pool(void)
478{
479 return 0;
480}
481static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
482{
483}
484#endif /* CONFIG_BOUNCE */
485
Ming Lei454be722017-11-30 07:56:35 +0800486extern void blk_drain_queue(struct request_queue *q);
487
Josef Bacikd7067512018-07-03 11:15:01 -0400488#ifdef CONFIG_BLK_CGROUP_IOLATENCY
489extern int blk_iolatency_init(struct request_queue *q);
490#else
491static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
492#endif
493
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200494#endif /* BLK_INTERNAL_H */