blob: aed99cbc1bcab14eeb550ecc32e4a484383aa514 [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
156static inline bool biovec_phys_mergeable(const struct bio_vec *vec1,
157 const struct bio_vec *vec2)
158{
159 if (bvec_to_phys(vec1) + vec1->bv_len != bvec_to_phys(vec2))
160 return false;
161 if (!ARCH_BIOVEC_PHYS_MERGEABLE(vec1, vec2))
162 return false;
163 return true;
164}
165
Christoph Hellwig27ca1d42018-09-24 09:43:49 +0200166static inline bool __bvec_gap_to_prev(struct request_queue *q,
167 struct bio_vec *bprv, unsigned int offset)
168{
169 return offset ||
170 ((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
171}
172
173/*
174 * Check if adding a bio_vec after bprv with offset would create a gap in
175 * the SG list. Most drivers don't care about this, but some do.
176 */
177static inline bool bvec_gap_to_prev(struct request_queue *q,
178 struct bio_vec *bprv, unsigned int offset)
179{
180 if (!queue_virt_boundary(q))
181 return false;
182 return __bvec_gap_to_prev(q, bprv, offset);
183}
184
Dan Williams5a48fc12015-10-21 13:20:23 -0400185#ifdef CONFIG_BLK_DEV_INTEGRITY
186void blk_flush_integrity(void);
Christoph Hellwig7c20f112017-07-03 16:58:43 -0600187bool __bio_integrity_endio(struct bio *);
188static inline bool bio_integrity_endio(struct bio *bio)
189{
190 if (bio_integrity(bio))
191 return __bio_integrity_endio(bio);
192 return true;
193}
Christoph Hellwig43b729b2018-09-24 09:43:47 +0200194
195static inline bool integrity_req_gap_back_merge(struct request *req,
196 struct bio *next)
197{
198 struct bio_integrity_payload *bip = bio_integrity(req->bio);
199 struct bio_integrity_payload *bip_next = bio_integrity(next);
200
201 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
202 bip_next->bip_vec[0].bv_offset);
203}
204
205static inline bool integrity_req_gap_front_merge(struct request *req,
206 struct bio *bio)
207{
208 struct bio_integrity_payload *bip = bio_integrity(bio);
209 struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
210
211 return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
212 bip_next->bip_vec[0].bv_offset);
213}
214#else /* CONFIG_BLK_DEV_INTEGRITY */
215static inline bool integrity_req_gap_back_merge(struct request *req,
216 struct bio *next)
217{
218 return false;
219}
220static inline bool integrity_req_gap_front_merge(struct request *req,
221 struct bio *bio)
222{
223 return false;
224}
225
Dan Williams5a48fc12015-10-21 13:20:23 -0400226static inline void blk_flush_integrity(void)
227{
228}
Christoph Hellwig7c20f112017-07-03 16:58:43 -0600229static inline bool bio_integrity_endio(struct bio *bio)
230{
231 return true;
232}
Christoph Hellwig43b729b2018-09-24 09:43:47 +0200233#endif /* CONFIG_BLK_DEV_INTEGRITY */
Jens Axboe8324aa92008-01-29 14:51:59 +0100234
Christoph Hellwig287922e2015-10-30 20:57:30 +0800235void blk_timeout_work(struct work_struct *work);
Jens Axboe0d2602c2014-05-13 15:10:52 -0600236unsigned long blk_rq_timeout(unsigned long timeout);
Jens Axboe87ee7b12014-04-24 08:51:47 -0600237void blk_add_timer(struct request *req);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700238void blk_delete_timer(struct request *);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700239
Jens Axboe320ae512013-10-24 09:20:05 +0100240
241bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
242 struct bio *bio);
243bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
244 struct bio *bio);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100245bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
246 struct bio *bio);
Jens Axboe320ae512013-10-24 09:20:05 +0100247bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
Shaohua Li5b3f3412015-05-08 10:51:33 -0700248 unsigned int *request_count,
249 struct request **same_queue_rq);
Jeff Moyer0809e3a2015-10-20 23:13:51 +0800250unsigned int blk_plug_queued_count(struct request_queue *q);
Jens Axboe320ae512013-10-24 09:20:05 +0100251
252void blk_account_io_start(struct request *req, bool new_io);
253void blk_account_io_completion(struct request *req, unsigned int bytes);
Omar Sandoval522a7772018-05-09 02:08:53 -0700254void blk_account_io_done(struct request *req, u64 now);
Jens Axboe320ae512013-10-24 09:20:05 +0100255
Jens Axboe242f9dc2008-09-14 05:55:09 -0700256/*
Jens Axboe242f9dc2008-09-14 05:55:09 -0700257 * EH timer and IO completion will both attempt to 'grab' the request, make
Jens Axboee14575b32018-01-10 11:34:25 -0700258 * sure that only one of them succeeds. Steal the bottom bit of the
259 * __deadline field for this.
Jens Axboe242f9dc2008-09-14 05:55:09 -0700260 */
261static inline int blk_mark_rq_complete(struct request *rq)
262{
Jens Axboee14575b32018-01-10 11:34:25 -0700263 return test_and_set_bit(0, &rq->__deadline);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700264}
265
266static inline void blk_clear_rq_complete(struct request *rq)
267{
Jens Axboee14575b32018-01-10 11:34:25 -0700268 clear_bit(0, &rq->__deadline);
269}
270
271static inline bool blk_rq_is_complete(struct request *rq)
272{
273 return test_bit(0, &rq->__deadline);
Jens Axboe242f9dc2008-09-14 05:55:09 -0700274}
Jens Axboe86db1e22008-01-29 14:53:40 +0100275
Tejun Heo158dbda2009-04-23 11:05:18 +0900276/*
277 * Internal elevator interface
278 */
Christoph Hellwige8064022016-10-20 15:12:13 +0200279#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
Tejun Heo158dbda2009-04-23 11:05:18 +0900280
Tejun Heoae1b1532011-01-25 12:43:54 +0100281void blk_insert_flush(struct request *rq);
Tejun Heodd831002010-09-03 11:56:16 +0200282
Tejun Heo158dbda2009-04-23 11:05:18 +0900283static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
284{
285 struct elevator_queue *e = q->elevator;
286
Jens Axboec51ca6c2016-12-10 15:13:59 -0700287 if (e->type->ops.sq.elevator_activate_req_fn)
288 e->type->ops.sq.elevator_activate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900289}
290
291static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
292{
293 struct elevator_queue *e = q->elevator;
294
Jens Axboec51ca6c2016-12-10 15:13:59 -0700295 if (e->type->ops.sq.elevator_deactivate_req_fn)
296 e->type->ops.sq.elevator_deactivate_req_fn(q, rq);
Tejun Heo158dbda2009-04-23 11:05:18 +0900297}
298
Christoph Hellwigddb72532018-05-31 19:11:38 +0200299int elevator_init(struct request_queue *);
Christoph Hellwig131d08e2018-05-31 19:11:40 +0200300int elevator_init_mq(struct request_queue *q);
Jianchao Wangd48ece22018-08-21 15:15:03 +0800301int elevator_switch_mq(struct request_queue *q,
302 struct elevator_type *new_e);
Christoph Hellwiga8a275c2018-05-31 19:11:37 +0200303void elevator_exit(struct request_queue *, struct elevator_queue *);
Bart Van Assche83d016a2018-01-17 11:48:08 -0800304int elv_register_queue(struct request_queue *q);
305void elv_unregister_queue(struct request_queue *q);
306
Christoph Hellwig807d4af2017-08-23 19:10:30 +0200307struct hd_struct *__disk_get_part(struct gendisk *disk, int partno);
308
Jens Axboe581d4e22008-09-14 05:56:33 -0700309#ifdef CONFIG_FAIL_IO_TIMEOUT
310int blk_should_fake_timeout(struct request_queue *);
311ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
312ssize_t part_timeout_store(struct device *, struct device_attribute *,
313 const char *, size_t);
314#else
315static inline int blk_should_fake_timeout(struct request_queue *q)
316{
317 return 0;
318}
319#endif
320
Jens Axboed6d48192008-01-29 14:04:06 +0100321int ll_back_merge_fn(struct request_queue *q, struct request *req,
322 struct bio *bio);
323int ll_front_merge_fn(struct request_queue *q, struct request *req,
324 struct bio *bio);
Jens Axboeb973cb72017-02-02 08:54:40 -0700325struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
326struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
Jens Axboe5e84ea32011-03-21 10:14:27 +0100327int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
328 struct request *next);
Jens Axboed6d48192008-01-29 14:04:06 +0100329void blk_recalc_rq_segments(struct request *rq);
Tejun Heo80a761f2009-07-03 17:48:17 +0900330void blk_rq_set_mixed_merge(struct request *rq);
Tejun Heo050c8ea2012-02-08 09:19:38 +0100331bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
Christoph Hellwig34fe7c02017-02-08 14:46:48 +0100332enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
Jens Axboed6d48192008-01-29 14:04:06 +0100333
Jens Axboe8324aa92008-01-29 14:51:59 +0100334void blk_queue_congestion_threshold(struct request_queue *q);
335
Adrian Bunkff889722008-03-04 11:23:45 +0100336int blk_dev_init(void);
337
Jens Axboef253b862010-10-24 22:06:02 +0200338
Jens Axboe8324aa92008-01-29 14:51:59 +0100339/*
340 * Return the threshold (number of used requests) at which the queue is
341 * considered to be congested. It include a little hysteresis to keep the
342 * context switch rate down.
343 */
344static inline int queue_congestion_on_threshold(struct request_queue *q)
345{
346 return q->nr_congestion_on;
347}
348
349/*
350 * The threshold at which a queue is considered to be uncongested
351 */
352static inline int queue_congestion_off_threshold(struct request_queue *q)
353{
354 return q->nr_congestion_off;
355}
356
Jens Axboee3a2b3f2014-05-20 11:49:02 -0600357extern int blk_update_nr_requests(struct request_queue *, unsigned int);
358
Jens Axboec2553b52009-04-24 08:10:11 +0200359/*
360 * Contribute to IO statistics IFF:
361 *
362 * a) it's attached to a gendisk, and
363 * b) the queue had IO stats enabled when this request was started, and
Martin K. Petersene2a60da2012-09-18 12:19:25 -0400364 * c) it's a file system request
Jens Axboec2553b52009-04-24 08:10:11 +0200365 */
Chengguang Xu599d0672018-08-16 22:51:40 +0800366static inline bool blk_do_io_stat(struct request *rq)
Jens Axboefb8ec182009-02-02 08:42:32 +0100367{
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200368 return rq->rq_disk &&
Christoph Hellwige8064022016-10-20 15:12:13 +0200369 (rq->rq_flags & RQF_IO_STAT) &&
Christoph Hellwig57292b52017-01-31 16:57:29 +0100370 !blk_rq_is_passthrough(rq);
Jens Axboefb8ec182009-02-02 08:42:32 +0100371}
372
Christoph Hellwig6cf76772017-02-08 14:46:47 +0100373static inline void req_set_nomerge(struct request_queue *q, struct request *req)
374{
375 req->cmd_flags |= REQ_NOMERGE;
376 if (req == q->last_merge)
377 q->last_merge = NULL;
378}
379
Tejun Heof2dbd762011-12-14 00:33:40 +0100380/*
Jens Axboe0a72e7f2018-01-09 14:23:42 -0700381 * Steal a bit from this field for legacy IO path atomic IO marking. Note that
382 * setting the deadline clears the bottom bit, potentially clearing the
383 * completed bit. The user has to be OK with this (current ones are fine).
384 */
385static inline void blk_rq_set_deadline(struct request *rq, unsigned long time)
386{
387 rq->__deadline = time & ~0x1UL;
388}
389
390static inline unsigned long blk_rq_deadline(struct request *rq)
391{
392 return rq->__deadline & ~0x1UL;
393}
394
395/*
Tejun Heof2dbd762011-12-14 00:33:40 +0100396 * Internal io_context interface
397 */
398void get_io_context(struct io_context *ioc);
Tejun Heo47fdd4c2011-12-14 00:33:42 +0100399struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
Tejun Heo24acfc32012-03-05 13:15:24 -0800400struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
401 gfp_t gfp_mask);
Tejun Heo7e5a8792011-12-14 00:33:42 +0100402void ioc_clear_queue(struct request_queue *q);
Tejun Heof2dbd762011-12-14 00:33:40 +0100403
Tejun Heo24acfc32012-03-05 13:15:24 -0800404int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
Tejun Heof2dbd762011-12-14 00:33:40 +0100405
406/**
Jens Axboec23ecb42016-12-14 14:23:43 -0700407 * rq_ioc - determine io_context for request allocation
408 * @bio: request being allocated is for this bio (can be %NULL)
409 *
410 * Determine io_context to use for request allocation for @bio. May return
411 * %NULL if %current->io_context doesn't exist.
412 */
413static inline struct io_context *rq_ioc(struct bio *bio)
414{
415#ifdef CONFIG_BLK_CGROUP
416 if (bio && bio->bi_ioc)
417 return bio->bi_ioc;
418#endif
419 return current->io_context;
420}
421
422/**
Tejun Heof2dbd762011-12-14 00:33:40 +0100423 * create_io_context - try to create task->io_context
Tejun Heof2dbd762011-12-14 00:33:40 +0100424 * @gfp_mask: allocation mask
425 * @node: allocation node
426 *
Tejun Heo24acfc32012-03-05 13:15:24 -0800427 * If %current->io_context is %NULL, allocate a new io_context and install
428 * it. Returns the current %current->io_context which may be %NULL if
429 * allocation failed.
Tejun Heof2dbd762011-12-14 00:33:40 +0100430 *
431 * Note that this function can't be called with IRQ disabled because
Tejun Heo24acfc32012-03-05 13:15:24 -0800432 * task_lock which protects %current->io_context is IRQ-unsafe.
Tejun Heof2dbd762011-12-14 00:33:40 +0100433 */
Tejun Heo24acfc32012-03-05 13:15:24 -0800434static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
Tejun Heof2dbd762011-12-14 00:33:40 +0100435{
436 WARN_ON_ONCE(irqs_disabled());
Tejun Heo24acfc32012-03-05 13:15:24 -0800437 if (unlikely(!current->io_context))
438 create_task_io_context(current, gfp_mask, node);
439 return current->io_context;
Tejun Heof2dbd762011-12-14 00:33:40 +0100440}
441
442/*
443 * Internal throttling interface
444 */
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200445#ifdef CONFIG_BLK_DEV_THROTTLING
Tejun Heoc9a929d2011-10-19 14:42:16 +0200446extern void blk_throtl_drain(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200447extern int blk_throtl_init(struct request_queue *q);
448extern void blk_throtl_exit(struct request_queue *q);
Shaohua Lid61fcfa2017-03-27 10:51:38 -0700449extern void blk_throtl_register_queue(struct request_queue *q);
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200450#else /* CONFIG_BLK_DEV_THROTTLING */
Tejun Heoc9a929d2011-10-19 14:42:16 +0200451static inline void blk_throtl_drain(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200452static inline int blk_throtl_init(struct request_queue *q) { return 0; }
453static inline void blk_throtl_exit(struct request_queue *q) { }
Shaohua Lid61fcfa2017-03-27 10:51:38 -0700454static inline void blk_throtl_register_queue(struct request_queue *q) { }
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200455#endif /* CONFIG_BLK_DEV_THROTTLING */
Shaohua Li297e3d82017-03-27 10:51:37 -0700456#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
457extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
458extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
459 const char *page, size_t count);
Shaohua Li9e234ee2017-03-27 10:51:41 -0700460extern void blk_throtl_bio_endio(struct bio *bio);
Shaohua Lib9147dd2017-03-27 15:19:42 -0700461extern void blk_throtl_stat_add(struct request *rq, u64 time);
Shaohua Li9e234ee2017-03-27 10:51:41 -0700462#else
463static inline void blk_throtl_bio_endio(struct bio *bio) { }
Shaohua Lib9147dd2017-03-27 15:19:42 -0700464static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
Shaohua Li297e3d82017-03-27 10:51:37 -0700465#endif
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200466
Christoph Hellwig3bce0162017-06-19 09:26:21 +0200467#ifdef CONFIG_BOUNCE
468extern int init_emergency_isa_pool(void);
469extern void blk_queue_bounce(struct request_queue *q, struct bio **bio);
470#else
471static inline int init_emergency_isa_pool(void)
472{
473 return 0;
474}
475static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
476{
477}
478#endif /* CONFIG_BOUNCE */
479
Ming Lei454be722017-11-30 07:56:35 +0800480extern void blk_drain_queue(struct request_queue *q);
481
Josef Bacikd7067512018-07-03 11:15:01 -0400482#ifdef CONFIG_BLK_CGROUP_IOLATENCY
483extern int blk_iolatency_init(struct request_queue *q);
484#else
485static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
486#endif
487
Tejun Heobc9fcbf2011-10-19 14:31:18 +0200488#endif /* BLK_INTERNAL_H */