blob: d1de71124656a911e09af299f34d0aad87b94fca [file] [log] [blame]
Jens Axboe86db1e22008-01-29 14:53:40 +01001/*
2 * Functions related to setting various queue properties from drivers
3 */
4#include <linux/kernel.h>
5#include <linux/module.h>
6#include <linux/init.h>
7#include <linux/bio.h>
8#include <linux/blkdev.h>
9#include <linux/bootmem.h> /* for max_pfn/max_low_pfn */
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -040010#include <linux/gcd.h>
Martin K. Petersen2cda2722010-03-15 12:46:51 +010011#include <linux/lcm.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010012#include <linux/jiffies.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090013#include <linux/gfp.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010014
15#include "blk.h"
Jens Axboe87760e52016-11-09 12:38:14 -070016#include "blk-wbt.h"
Jens Axboe86db1e22008-01-29 14:53:40 +010017
Jens Axboe6728cb02008-01-31 13:03:55 +010018unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010019EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010020
21unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010022
23/**
24 * blk_queue_prep_rq - set a prepare_request function for queue
25 * @q: queue
26 * @pfn: prepare_request function
27 *
28 * It's possible for a queue to register a prepare_request callback which
29 * is invoked before the request is handed to the request_fn. The goal of
30 * the function is to prepare a request for I/O, it can be used to build a
31 * cdb from the request data for instance.
32 *
33 */
34void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
35{
36 q->prep_rq_fn = pfn;
37}
Jens Axboe86db1e22008-01-29 14:53:40 +010038EXPORT_SYMBOL(blk_queue_prep_rq);
39
40/**
James Bottomley28018c22010-07-01 19:49:17 +090041 * blk_queue_unprep_rq - set an unprepare_request function for queue
42 * @q: queue
43 * @ufn: unprepare_request function
44 *
45 * It's possible for a queue to register an unprepare_request callback
46 * which is invoked before the request is finally completed. The goal
47 * of the function is to deallocate any data that was allocated in the
48 * prepare_request callback.
49 *
50 */
51void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
52{
53 q->unprep_rq_fn = ufn;
54}
55EXPORT_SYMBOL(blk_queue_unprep_rq);
56
Jens Axboe86db1e22008-01-29 14:53:40 +010057void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
58{
59 q->softirq_done_fn = fn;
60}
Jens Axboe86db1e22008-01-29 14:53:40 +010061EXPORT_SYMBOL(blk_queue_softirq_done);
62
Jens Axboe242f9dc2008-09-14 05:55:09 -070063void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
64{
65 q->rq_timeout = timeout;
66}
67EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
68
69void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
70{
Bart Van Assche130d7332017-08-23 10:56:29 -070071 WARN_ON_ONCE(q->mq_ops);
Jens Axboe242f9dc2008-09-14 05:55:09 -070072 q->rq_timed_out_fn = fn;
73}
74EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
75
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020076void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
77{
78 q->lld_busy_fn = fn;
79}
80EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
81
Jens Axboe86db1e22008-01-29 14:53:40 +010082/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020083 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020084 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020085 *
86 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010087 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020088 */
89void blk_set_default_limits(struct queue_limits *lim)
90{
Martin K. Petersen8a783622010-02-26 00:20:39 -050091 lim->max_segments = BLK_MAX_SEGMENTS;
Christoph Hellwig1e739732017-02-08 14:46:49 +010092 lim->max_discard_segments = 1;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020093 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020094 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070095 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050096 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070097 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
98 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060099 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400100 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800101 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100102 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -0600103 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100104 lim->discard_granularity = 0;
105 lim->discard_alignment = 0;
106 lim->discard_misaligned = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200107 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200108 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200109 lim->alignment_offset = 0;
110 lim->io_opt = 0;
111 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100112 lim->cluster = 1;
Damien Le Moal797476b2016-10-18 15:40:29 +0900113 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200114}
115EXPORT_SYMBOL(blk_set_default_limits);
116
117/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100118 * blk_set_stacking_limits - set default limits for stacking devices
119 * @lim: the queue_limits structure to reset
120 *
121 * Description:
122 * Returns a queue_limit struct to its default state. Should be used
123 * by stacking drivers like DM that have no internal limits.
124 */
125void blk_set_stacking_limits(struct queue_limits *lim)
126{
127 blk_set_default_limits(lim);
128
129 /* Inherit limits from component devices */
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100130 lim->max_segments = USHRT_MAX;
Christoph Hellwig1e739732017-02-08 14:46:49 +0100131 lim->max_discard_segments = 1;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100132 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -0600133 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +0200134 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500135 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400136 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800137 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100138}
139EXPORT_SYMBOL(blk_set_stacking_limits);
140
141/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100142 * blk_queue_make_request - define an alternate make_request function for a device
143 * @q: the request queue for the device to be affected
144 * @mfn: the alternate make_request function
145 *
146 * Description:
147 * The normal way for &struct bios to be passed to a device
148 * driver is for them to be collected into requests on a request
149 * queue, and then to allow the device driver to select requests
150 * off that queue when it is ready. This works well for many block
151 * devices. However some block devices (typically virtual devices
152 * such as md or lvm) do not benefit from the processing on the
153 * request queue, and are served best by having the requests passed
154 * directly to them. This can be achieved by providing a function
155 * to blk_queue_make_request().
156 *
157 * Caveat:
158 * The driver that does this *must* be able to deal appropriately
159 * with buffers in "highmemory". This can be accomplished by either calling
Christoph Hellwigd004a5e72017-11-08 19:13:48 +0100160 * kmap_atomic() to get a temporary kernel mapping, or by calling
Jens Axboe86db1e22008-01-29 14:53:40 +0100161 * blk_queue_bounce() to create a buffer in normal memory.
162 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100163void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100164{
165 /*
166 * set defaults
167 */
168 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100169
Jens Axboe86db1e22008-01-29 14:53:40 +0100170 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100171 blk_queue_dma_alignment(q, 511);
172 blk_queue_congestion_threshold(q);
173 q->nr_batching = BLK_BATCH_REQ;
174
Martin K. Petersene475bba2009-06-16 08:23:52 +0200175 blk_set_default_limits(&q->limits);
Jens Axboe86db1e22008-01-29 14:53:40 +0100176}
Jens Axboe86db1e22008-01-29 14:53:40 +0100177EXPORT_SYMBOL(blk_queue_make_request);
178
179/**
180 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900181 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100182 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100183 *
184 * Description:
185 * Different hardware can have different requirements as to what pages
186 * it can do I/O directly to. A low level driver can call
187 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100188 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100189 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100190void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100191{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100192 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100193 int dma = 0;
194
195 q->bounce_gfp = GFP_NOIO;
196#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900197 /*
198 * Assume anything <= 4GB can be handled by IOMMU. Actually
199 * some IOMMUs can handle everything, but I don't know of a
200 * way to test this here.
201 */
202 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100203 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200204 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100205#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100206 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100207 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200208 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200209#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100210 if (dma) {
211 init_emergency_isa_pool();
212 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200213 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100214 }
215}
Jens Axboe86db1e22008-01-29 14:53:40 +0100216EXPORT_SYMBOL(blk_queue_bounce_limit);
217
218/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500219 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
220 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500221 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100222 *
223 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500224 * Enables a low level driver to set a hard upper limit,
225 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400226 * the device driver based upon the capabilities of the I/O
227 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500228 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500229 * max_dev_sectors is a hard limit imposed by the storage device for
230 * READ/WRITE requests. It is set by the disk driver.
231 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500232 * max_sectors is a soft limit imposed by the block layer for
233 * filesystem type requests. This value can be overridden on a
234 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
235 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100236 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500237void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100238{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500239 struct queue_limits *limits = &q->limits;
240 unsigned int max_sectors;
241
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300242 if ((max_hw_sectors << 9) < PAGE_SIZE) {
243 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700244 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500245 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100246 }
247
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400248 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500249 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
250 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
251 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100252 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100253}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500254EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100255
256/**
Jens Axboe762380a2014-06-05 13:38:39 -0600257 * blk_queue_chunk_sectors - set size of the chunk for this queue
258 * @q: the request queue for the device
259 * @chunk_sectors: chunk sectors in the usual 512b unit
260 *
261 * Description:
262 * If a driver doesn't want IOs to cross a given chunk size, it can set
263 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600264 * must currently be a power-of-2 in sectors. Also note that the block
265 * layer must accept a page worth of data at any offset. So if the
266 * crossing of chunks is a hard limitation in the driver, it must still be
267 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600268 **/
269void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
270{
271 BUG_ON(!is_power_of_2(chunk_sectors));
272 q->limits.chunk_sectors = chunk_sectors;
273}
274EXPORT_SYMBOL(blk_queue_chunk_sectors);
275
276/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200277 * blk_queue_max_discard_sectors - set max sectors for a single discard
278 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200279 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200280 **/
281void blk_queue_max_discard_sectors(struct request_queue *q,
282 unsigned int max_discard_sectors)
283{
Jens Axboe0034af02015-07-16 09:14:26 -0600284 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200285 q->limits.max_discard_sectors = max_discard_sectors;
286}
287EXPORT_SYMBOL(blk_queue_max_discard_sectors);
288
289/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400290 * blk_queue_max_write_same_sectors - set max sectors for a single write same
291 * @q: the request queue for the device
292 * @max_write_same_sectors: maximum number of sectors to write per command
293 **/
294void blk_queue_max_write_same_sectors(struct request_queue *q,
295 unsigned int max_write_same_sectors)
296{
297 q->limits.max_write_same_sectors = max_write_same_sectors;
298}
299EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
300
301/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800302 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
303 * write zeroes
304 * @q: the request queue for the device
305 * @max_write_zeroes_sectors: maximum number of sectors to write per command
306 **/
307void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
308 unsigned int max_write_zeroes_sectors)
309{
310 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
311}
312EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
313
314/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500315 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100316 * @q: the request queue for the device
317 * @max_segments: max number of segments
318 *
319 * Description:
320 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500321 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100322 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500323void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100324{
325 if (!max_segments) {
326 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700327 printk(KERN_INFO "%s: set to minimum %d\n",
328 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100329 }
330
Martin K. Petersen8a783622010-02-26 00:20:39 -0500331 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100332}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500333EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100334
335/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100336 * blk_queue_max_discard_segments - set max segments for discard requests
337 * @q: the request queue for the device
338 * @max_segments: max number of segments
339 *
340 * Description:
341 * Enables a low level driver to set an upper limit on the number of
342 * segments in a discard request.
343 **/
344void blk_queue_max_discard_segments(struct request_queue *q,
345 unsigned short max_segments)
346{
347 q->limits.max_discard_segments = max_segments;
348}
349EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
350
351/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100352 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
353 * @q: the request queue for the device
354 * @max_size: max size of segment in bytes
355 *
356 * Description:
357 * Enables a low level driver to set an upper limit on the size of a
358 * coalesced segment
359 **/
360void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
361{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300362 if (max_size < PAGE_SIZE) {
363 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700364 printk(KERN_INFO "%s: set to minimum %d\n",
365 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100366 }
367
Martin K. Petersen025146e2009-05-22 17:17:51 -0400368 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100369}
Jens Axboe86db1e22008-01-29 14:53:40 +0100370EXPORT_SYMBOL(blk_queue_max_segment_size);
371
372/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400373 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100374 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400375 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100376 *
377 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400378 * This should be set to the lowest possible block size that the
379 * storage device can address. The default of 512 covers most
380 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100381 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400382void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100383{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400384 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400385
386 if (q->limits.physical_block_size < size)
387 q->limits.physical_block_size = size;
388
389 if (q->limits.io_min < q->limits.physical_block_size)
390 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100391}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400392EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100393
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400394/**
395 * blk_queue_physical_block_size - set physical block size for the queue
396 * @q: the request queue for the device
397 * @size: the physical block size, in bytes
398 *
399 * Description:
400 * This should be set to the lowest possible sector size that the
401 * hardware can operate on without reverting to read-modify-write
402 * operations.
403 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200404void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400405{
406 q->limits.physical_block_size = size;
407
408 if (q->limits.physical_block_size < q->limits.logical_block_size)
409 q->limits.physical_block_size = q->limits.logical_block_size;
410
411 if (q->limits.io_min < q->limits.physical_block_size)
412 q->limits.io_min = q->limits.physical_block_size;
413}
414EXPORT_SYMBOL(blk_queue_physical_block_size);
415
416/**
417 * blk_queue_alignment_offset - set physical block alignment offset
418 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700419 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400420 *
421 * Description:
422 * Some devices are naturally misaligned to compensate for things like
423 * the legacy DOS partition table 63-sector offset. Low-level drivers
424 * should call this function for devices whose first sector is not
425 * naturally aligned.
426 */
427void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
428{
429 q->limits.alignment_offset =
430 offset & (q->limits.physical_block_size - 1);
431 q->limits.misaligned = 0;
432}
433EXPORT_SYMBOL(blk_queue_alignment_offset);
434
435/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400436 * blk_limits_io_min - set minimum request size for a device
437 * @limits: the queue limits
438 * @min: smallest I/O size in bytes
439 *
440 * Description:
441 * Some devices have an internal block size bigger than the reported
442 * hardware sector size. This function can be used to signal the
443 * smallest I/O the device can perform without incurring a performance
444 * penalty.
445 */
446void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
447{
448 limits->io_min = min;
449
450 if (limits->io_min < limits->logical_block_size)
451 limits->io_min = limits->logical_block_size;
452
453 if (limits->io_min < limits->physical_block_size)
454 limits->io_min = limits->physical_block_size;
455}
456EXPORT_SYMBOL(blk_limits_io_min);
457
458/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400459 * blk_queue_io_min - set minimum request size for the queue
460 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700461 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400462 *
463 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400464 * Storage devices may report a granularity or preferred minimum I/O
465 * size which is the smallest request the device can perform without
466 * incurring a performance penalty. For disk drives this is often the
467 * physical block size. For RAID arrays it is often the stripe chunk
468 * size. A properly aligned multiple of minimum_io_size is the
469 * preferred request size for workloads where a high number of I/O
470 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400471 */
472void blk_queue_io_min(struct request_queue *q, unsigned int min)
473{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400474 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400475}
476EXPORT_SYMBOL(blk_queue_io_min);
477
478/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200479 * blk_limits_io_opt - set optimal request size for a device
480 * @limits: the queue limits
481 * @opt: smallest I/O size in bytes
482 *
483 * Description:
484 * Storage devices may report an optimal I/O size, which is the
485 * device's preferred unit for sustained I/O. This is rarely reported
486 * for disk drives. For RAID arrays it is usually the stripe width or
487 * the internal track size. A properly aligned multiple of
488 * optimal_io_size is the preferred request size for workloads where
489 * sustained throughput is desired.
490 */
491void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
492{
493 limits->io_opt = opt;
494}
495EXPORT_SYMBOL(blk_limits_io_opt);
496
497/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400498 * blk_queue_io_opt - set optimal request size for the queue
499 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700500 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400501 *
502 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400503 * Storage devices may report an optimal I/O size, which is the
504 * device's preferred unit for sustained I/O. This is rarely reported
505 * for disk drives. For RAID arrays it is usually the stripe width or
506 * the internal track size. A properly aligned multiple of
507 * optimal_io_size is the preferred request size for workloads where
508 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400509 */
510void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
511{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200512 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400513}
514EXPORT_SYMBOL(blk_queue_io_opt);
515
Jens Axboe86db1e22008-01-29 14:53:40 +0100516/**
517 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
518 * @t: the stacking driver (top)
519 * @b: the underlying device (bottom)
520 **/
521void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
522{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400523 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100524}
Jens Axboe86db1e22008-01-29 14:53:40 +0100525EXPORT_SYMBOL(blk_queue_stack_limits);
526
527/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400528 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100529 * @t: the stacking driver limits (top device)
530 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500531 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400532 *
533 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100534 * This function is used by stacking drivers like MD and DM to ensure
535 * that all component devices have compatible block sizes and
536 * alignments. The stacking driver must provide a queue_limits
537 * struct (top) and then iteratively call the stacking function for
538 * all component (bottom) devices. The stacking function will
539 * attempt to combine the values and ensure proper alignment.
540 *
541 * Returns 0 if the top and bottom queue_limits are compatible. The
542 * top device's block sizes and alignment offsets may be adjusted to
543 * ensure alignment with the bottom device. If no compatible sizes
544 * and alignments exist, -1 is returned and the resulting top
545 * queue_limits will have the misaligned flag set to indicate that
546 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400547 */
548int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500549 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400550{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500551 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100552
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400553 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
554 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500555 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400556 t->max_write_same_sectors = min(t->max_write_same_sectors,
557 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800558 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
559 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200560 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400561
562 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
563 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700564 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
565 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400566
Martin K. Petersen8a783622010-02-26 00:20:39 -0500567 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100568 t->max_discard_segments = min_not_zero(t->max_discard_segments,
569 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200570 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
571 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400572
573 t->max_segment_size = min_not_zero(t->max_segment_size,
574 b->max_segment_size);
575
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500576 t->misaligned |= b->misaligned;
577
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500578 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100579
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100580 /* Bottom device has different alignment. Check that it is
581 * compatible with the current top alignment.
582 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583 if (t->alignment_offset != alignment) {
584
585 top = max(t->physical_block_size, t->io_min)
586 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100587 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100588
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100589 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400590 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100591 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500592 ret = -1;
593 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100594 }
595
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400596 t->logical_block_size = max(t->logical_block_size,
597 b->logical_block_size);
598
599 t->physical_block_size = max(t->physical_block_size,
600 b->physical_block_size);
601
602 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400603 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100604
Martin K. Petersene692cb62010-12-01 19:41:49 +0100605 t->cluster &= b->cluster;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400606
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100607 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100608 if (t->physical_block_size & (t->logical_block_size - 1)) {
609 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400610 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500611 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100612 }
613
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100614 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100615 if (t->io_min & (t->physical_block_size - 1)) {
616 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400617 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500618 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400619 }
620
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100621 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100622 if (t->io_opt & (t->physical_block_size - 1)) {
623 t->io_opt = 0;
624 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500625 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100626 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400627
Kent Overstreetc78afc62013-07-11 22:39:53 -0700628 t->raid_partial_stripes_expensive =
629 max(t->raid_partial_stripes_expensive,
630 b->raid_partial_stripes_expensive);
631
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100632 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400633 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400634 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400635
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100636 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500637 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100638 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500639 ret = -1;
640 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100641
642 /* Discard alignment and granularity */
643 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500644 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100645
646 if (t->discard_granularity != 0 &&
647 t->discard_alignment != alignment) {
648 top = t->discard_granularity + t->discard_alignment;
649 bottom = b->discard_granularity + alignment;
650
651 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800652 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100653 t->discard_misaligned = 1;
654 }
655
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100656 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
657 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600658 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
659 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100660 t->discard_granularity = max(t->discard_granularity,
661 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400662 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800663 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100664 }
665
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900666 if (b->chunk_sectors)
667 t->chunk_sectors = min_not_zero(t->chunk_sectors,
668 b->chunk_sectors);
669
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500670 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400671}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200672EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400673
674/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500675 * bdev_stack_limits - adjust queue limits for stacked drivers
676 * @t: the stacking driver limits (top device)
677 * @bdev: the component block_device (bottom)
678 * @start: first data sector within component device
679 *
680 * Description:
681 * Merges queue limits for a top device and a block_device. Returns
682 * 0 if alignment didn't change. Returns -1 if adding the bottom
683 * device caused misalignment.
684 */
685int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
686 sector_t start)
687{
688 struct request_queue *bq = bdev_get_queue(bdev);
689
690 start += get_start_sect(bdev);
691
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500692 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500693}
694EXPORT_SYMBOL(bdev_stack_limits);
695
696/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400697 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200698 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400699 * @bdev: the underlying block device (bottom)
700 * @offset: offset to beginning of data within component device
701 *
702 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500703 * Merges the limits for a top level gendisk and a bottom level
704 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400705 */
706void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
707 sector_t offset)
708{
709 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400710
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500711 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400712 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
713
714 disk_name(disk, 0, top);
715 bdevname(bdev, bottom);
716
717 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
718 top, bottom);
719 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400720}
721EXPORT_SYMBOL(disk_stack_limits);
722
723/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100724 * blk_queue_dma_pad - set pad mask
725 * @q: the request queue for the device
726 * @mask: pad mask
727 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200728 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100729 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200730 * Appending pad buffer to a request modifies the last entry of a
731 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100732 **/
733void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
734{
735 q->dma_pad_mask = mask;
736}
737EXPORT_SYMBOL(blk_queue_dma_pad);
738
739/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200740 * blk_queue_update_dma_pad - update pad mask
741 * @q: the request queue for the device
742 * @mask: pad mask
743 *
744 * Update dma pad mask.
745 *
746 * Appending pad buffer to a request modifies the last entry of a
747 * scatter list such that it includes the pad buffer.
748 **/
749void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
750{
751 if (mask > q->dma_pad_mask)
752 q->dma_pad_mask = mask;
753}
754EXPORT_SYMBOL(blk_queue_update_dma_pad);
755
756/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100757 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100758 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100759 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100760 * @buf: physically contiguous buffer
761 * @size: size of the buffer in bytes
762 *
763 * Some devices have excess DMA problems and can't simply discard (or
764 * zero fill) the unwanted piece of the transfer. They have to have a
765 * real area of memory to transfer it into. The use case for this is
766 * ATAPI devices in DMA mode. If the packet command causes a transfer
767 * bigger than the transfer size some HBAs will lock up if there
768 * aren't DMA elements to contain the excess transfer. What this API
769 * does is adjust the queue so that the buf is always appended
770 * silently to the scatterlist.
771 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500772 * Note: This routine adjusts max_hw_segments to make room for appending
773 * the drain buffer. If you call blk_queue_max_segments() after calling
774 * this routine, you must set the limit to one fewer than your device
775 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100776 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100777int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100778 dma_drain_needed_fn *dma_drain_needed,
779 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100780{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500781 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100782 return -EINVAL;
783 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500784 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100785 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100786 q->dma_drain_buffer = buf;
787 q->dma_drain_size = size;
788
789 return 0;
790}
Jens Axboe86db1e22008-01-29 14:53:40 +0100791EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
792
793/**
794 * blk_queue_segment_boundary - set boundary rules for segment merging
795 * @q: the request queue for the device
796 * @mask: the memory boundary mask
797 **/
798void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
799{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300800 if (mask < PAGE_SIZE - 1) {
801 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700802 printk(KERN_INFO "%s: set to minimum %lx\n",
803 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100804 }
805
Martin K. Petersen025146e2009-05-22 17:17:51 -0400806 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100807}
Jens Axboe86db1e22008-01-29 14:53:40 +0100808EXPORT_SYMBOL(blk_queue_segment_boundary);
809
810/**
Keith Busch03100aa2015-08-19 14:24:05 -0700811 * blk_queue_virt_boundary - set boundary rules for bio merging
812 * @q: the request queue for the device
813 * @mask: the memory boundary mask
814 **/
815void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
816{
817 q->limits.virt_boundary_mask = mask;
818}
819EXPORT_SYMBOL(blk_queue_virt_boundary);
820
821/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100822 * blk_queue_dma_alignment - set dma length and memory alignment
823 * @q: the request queue for the device
824 * @mask: alignment mask
825 *
826 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200827 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100828 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100829 *
830 **/
831void blk_queue_dma_alignment(struct request_queue *q, int mask)
832{
833 q->dma_alignment = mask;
834}
Jens Axboe86db1e22008-01-29 14:53:40 +0100835EXPORT_SYMBOL(blk_queue_dma_alignment);
836
837/**
838 * blk_queue_update_dma_alignment - update dma length and memory alignment
839 * @q: the request queue for the device
840 * @mask: alignment mask
841 *
842 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200843 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100844 * If the requested alignment is larger than the current alignment, then
845 * the current queue alignment is updated to the new value, otherwise it
846 * is left alone. The design of this is to allow multiple objects
847 * (driver, device, transport etc) to set their respective
848 * alignments without having them interfere.
849 *
850 **/
851void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
852{
853 BUG_ON(mask > PAGE_SIZE);
854
855 if (mask > q->dma_alignment)
856 q->dma_alignment = mask;
857}
Jens Axboe86db1e22008-01-29 14:53:40 +0100858EXPORT_SYMBOL(blk_queue_update_dma_alignment);
859
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600860void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
861{
Jens Axboec888a8f2016-04-13 13:33:19 -0600862 if (queueable)
Bart Van Assche8814ce82018-03-07 17:10:04 -0800863 blk_queue_flag_clear(QUEUE_FLAG_FLUSH_NQ, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600864 else
Bart Van Assche8814ce82018-03-07 17:10:04 -0800865 blk_queue_flag_set(QUEUE_FLAG_FLUSH_NQ, q);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600866}
867EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
868
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600869/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600870 * blk_set_queue_depth - tell the block layer about the device queue depth
871 * @q: the request queue for the device
872 * @depth: queue depth
873 *
874 */
875void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
876{
877 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700878 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600879}
880EXPORT_SYMBOL(blk_set_queue_depth);
881
882/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600883 * blk_queue_write_cache - configure queue's write cache
884 * @q: the request queue for the device
885 * @wc: write back cache on or off
886 * @fua: device supports FUA writes, if true
887 *
888 * Tell the block layer about the write cache of @q.
889 */
890void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
891{
892 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f2016-04-13 13:33:19 -0600893 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600894 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600895 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600896 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600897 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600898 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600899 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600900 queue_flag_clear(QUEUE_FLAG_FUA, q);
901 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700902
903 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600904}
905EXPORT_SYMBOL_GPL(blk_queue_write_cache);
906
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200907static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100908{
909 blk_max_low_pfn = max_low_pfn - 1;
910 blk_max_pfn = max_pfn - 1;
911 return 0;
912}
913subsys_initcall(blk_settings_init);