blob: 529e55f52a03d7126fbbb77d0eef771e3d7ebe2d [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{
71 q->rq_timed_out_fn = fn;
72}
73EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
74
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020075void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
76{
77 q->lld_busy_fn = fn;
78}
79EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
80
Jens Axboe86db1e22008-01-29 14:53:40 +010081/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020082 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020083 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020084 *
85 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010086 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020087 */
88void blk_set_default_limits(struct queue_limits *lim)
89{
Martin K. Petersen8a783622010-02-26 00:20:39 -050090 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020091 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020092 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070093 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050094 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070095 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
96 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060097 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040098 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080099 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100100 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -0600101 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100102 lim->discard_granularity = 0;
103 lim->discard_alignment = 0;
104 lim->discard_misaligned = 0;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100105 lim->discard_zeroes_data = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200106 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200107 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200108 lim->alignment_offset = 0;
109 lim->io_opt = 0;
110 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100111 lim->cluster = 1;
Damien Le Moal797476b2016-10-18 15:40:29 +0900112 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200113}
114EXPORT_SYMBOL(blk_set_default_limits);
115
116/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100117 * blk_set_stacking_limits - set default limits for stacking devices
118 * @lim: the queue_limits structure to reset
119 *
120 * Description:
121 * Returns a queue_limit struct to its default state. Should be used
122 * by stacking drivers like DM that have no internal limits.
123 */
124void blk_set_stacking_limits(struct queue_limits *lim)
125{
126 blk_set_default_limits(lim);
127
128 /* Inherit limits from component devices */
129 lim->discard_zeroes_data = 1;
130 lim->max_segments = USHRT_MAX;
131 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -0600132 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +0200133 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500134 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400135 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800136 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100137}
138EXPORT_SYMBOL(blk_set_stacking_limits);
139
140/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100141 * blk_queue_make_request - define an alternate make_request function for a device
142 * @q: the request queue for the device to be affected
143 * @mfn: the alternate make_request function
144 *
145 * Description:
146 * The normal way for &struct bios to be passed to a device
147 * driver is for them to be collected into requests on a request
148 * queue, and then to allow the device driver to select requests
149 * off that queue when it is ready. This works well for many block
150 * devices. However some block devices (typically virtual devices
151 * such as md or lvm) do not benefit from the processing on the
152 * request queue, and are served best by having the requests passed
153 * directly to them. This can be achieved by providing a function
154 * to blk_queue_make_request().
155 *
156 * Caveat:
157 * The driver that does this *must* be able to deal appropriately
158 * with buffers in "highmemory". This can be accomplished by either calling
159 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
160 * blk_queue_bounce() to create a buffer in normal memory.
161 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100162void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100163{
164 /*
165 * set defaults
166 */
167 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100168
Jens Axboe86db1e22008-01-29 14:53:40 +0100169 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100170 blk_queue_dma_alignment(q, 511);
171 blk_queue_congestion_threshold(q);
172 q->nr_batching = BLK_BATCH_REQ;
173
Martin K. Petersene475bba2009-06-16 08:23:52 +0200174 blk_set_default_limits(&q->limits);
175
Jens Axboe86db1e22008-01-29 14:53:40 +0100176 /*
177 * by default assume old behaviour and bounce for any highmem page
178 */
179 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
180}
Jens Axboe86db1e22008-01-29 14:53:40 +0100181EXPORT_SYMBOL(blk_queue_make_request);
182
183/**
184 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900185 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100186 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100187 *
188 * Description:
189 * Different hardware can have different requirements as to what pages
190 * it can do I/O directly to. A low level driver can call
191 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100192 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100193 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100194void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100195{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100196 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100197 int dma = 0;
198
199 q->bounce_gfp = GFP_NOIO;
200#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900201 /*
202 * Assume anything <= 4GB can be handled by IOMMU. Actually
203 * some IOMMUs can handle everything, but I don't know of a
204 * way to test this here.
205 */
206 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100207 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200208 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100209#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100210 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100211 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200212 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200213#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100214 if (dma) {
215 init_emergency_isa_pool();
216 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200217 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100218 }
219}
Jens Axboe86db1e22008-01-29 14:53:40 +0100220EXPORT_SYMBOL(blk_queue_bounce_limit);
221
222/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500223 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
224 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500225 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100226 *
227 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500228 * Enables a low level driver to set a hard upper limit,
229 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400230 * the device driver based upon the capabilities of the I/O
231 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500232 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500233 * max_dev_sectors is a hard limit imposed by the storage device for
234 * READ/WRITE requests. It is set by the disk driver.
235 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 * max_sectors is a soft limit imposed by the block layer for
237 * filesystem type requests. This value can be overridden on a
238 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
239 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100240 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500241void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100242{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500243 struct queue_limits *limits = &q->limits;
244 unsigned int max_sectors;
245
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300246 if ((max_hw_sectors << 9) < PAGE_SIZE) {
247 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700248 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500249 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100250 }
251
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400252 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500253 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
254 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
255 limits->max_sectors = max_sectors;
Jens Axboe9491ae42016-12-12 16:43:26 -0800256 q->backing_dev_info.io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100257}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500258EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100259
260/**
Jens Axboe762380a2014-06-05 13:38:39 -0600261 * blk_queue_chunk_sectors - set size of the chunk for this queue
262 * @q: the request queue for the device
263 * @chunk_sectors: chunk sectors in the usual 512b unit
264 *
265 * Description:
266 * If a driver doesn't want IOs to cross a given chunk size, it can set
267 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600268 * must currently be a power-of-2 in sectors. Also note that the block
269 * layer must accept a page worth of data at any offset. So if the
270 * crossing of chunks is a hard limitation in the driver, it must still be
271 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600272 **/
273void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
274{
275 BUG_ON(!is_power_of_2(chunk_sectors));
276 q->limits.chunk_sectors = chunk_sectors;
277}
278EXPORT_SYMBOL(blk_queue_chunk_sectors);
279
280/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200281 * blk_queue_max_discard_sectors - set max sectors for a single discard
282 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200283 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200284 **/
285void blk_queue_max_discard_sectors(struct request_queue *q,
286 unsigned int max_discard_sectors)
287{
Jens Axboe0034af02015-07-16 09:14:26 -0600288 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200289 q->limits.max_discard_sectors = max_discard_sectors;
290}
291EXPORT_SYMBOL(blk_queue_max_discard_sectors);
292
293/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400294 * blk_queue_max_write_same_sectors - set max sectors for a single write same
295 * @q: the request queue for the device
296 * @max_write_same_sectors: maximum number of sectors to write per command
297 **/
298void blk_queue_max_write_same_sectors(struct request_queue *q,
299 unsigned int max_write_same_sectors)
300{
301 q->limits.max_write_same_sectors = max_write_same_sectors;
302}
303EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
304
305/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800306 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
307 * write zeroes
308 * @q: the request queue for the device
309 * @max_write_zeroes_sectors: maximum number of sectors to write per command
310 **/
311void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
312 unsigned int max_write_zeroes_sectors)
313{
314 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
315}
316EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
317
318/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500319 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100320 * @q: the request queue for the device
321 * @max_segments: max number of segments
322 *
323 * Description:
324 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500325 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100326 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500327void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100328{
329 if (!max_segments) {
330 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700331 printk(KERN_INFO "%s: set to minimum %d\n",
332 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100333 }
334
Martin K. Petersen8a783622010-02-26 00:20:39 -0500335 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100336}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500337EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100338
339/**
340 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
341 * @q: the request queue for the device
342 * @max_size: max size of segment in bytes
343 *
344 * Description:
345 * Enables a low level driver to set an upper limit on the size of a
346 * coalesced segment
347 **/
348void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
349{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300350 if (max_size < PAGE_SIZE) {
351 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700352 printk(KERN_INFO "%s: set to minimum %d\n",
353 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100354 }
355
Martin K. Petersen025146e2009-05-22 17:17:51 -0400356 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100357}
Jens Axboe86db1e22008-01-29 14:53:40 +0100358EXPORT_SYMBOL(blk_queue_max_segment_size);
359
360/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400361 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100362 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400363 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100364 *
365 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400366 * This should be set to the lowest possible block size that the
367 * storage device can address. The default of 512 covers most
368 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100369 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400370void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100371{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400372 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400373
374 if (q->limits.physical_block_size < size)
375 q->limits.physical_block_size = size;
376
377 if (q->limits.io_min < q->limits.physical_block_size)
378 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100379}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400380EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100381
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400382/**
383 * blk_queue_physical_block_size - set physical block size for the queue
384 * @q: the request queue for the device
385 * @size: the physical block size, in bytes
386 *
387 * Description:
388 * This should be set to the lowest possible sector size that the
389 * hardware can operate on without reverting to read-modify-write
390 * operations.
391 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200392void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400393{
394 q->limits.physical_block_size = size;
395
396 if (q->limits.physical_block_size < q->limits.logical_block_size)
397 q->limits.physical_block_size = q->limits.logical_block_size;
398
399 if (q->limits.io_min < q->limits.physical_block_size)
400 q->limits.io_min = q->limits.physical_block_size;
401}
402EXPORT_SYMBOL(blk_queue_physical_block_size);
403
404/**
405 * blk_queue_alignment_offset - set physical block alignment offset
406 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700407 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400408 *
409 * Description:
410 * Some devices are naturally misaligned to compensate for things like
411 * the legacy DOS partition table 63-sector offset. Low-level drivers
412 * should call this function for devices whose first sector is not
413 * naturally aligned.
414 */
415void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
416{
417 q->limits.alignment_offset =
418 offset & (q->limits.physical_block_size - 1);
419 q->limits.misaligned = 0;
420}
421EXPORT_SYMBOL(blk_queue_alignment_offset);
422
423/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400424 * blk_limits_io_min - set minimum request size for a device
425 * @limits: the queue limits
426 * @min: smallest I/O size in bytes
427 *
428 * Description:
429 * Some devices have an internal block size bigger than the reported
430 * hardware sector size. This function can be used to signal the
431 * smallest I/O the device can perform without incurring a performance
432 * penalty.
433 */
434void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
435{
436 limits->io_min = min;
437
438 if (limits->io_min < limits->logical_block_size)
439 limits->io_min = limits->logical_block_size;
440
441 if (limits->io_min < limits->physical_block_size)
442 limits->io_min = limits->physical_block_size;
443}
444EXPORT_SYMBOL(blk_limits_io_min);
445
446/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400447 * blk_queue_io_min - set minimum request size for the queue
448 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700449 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400450 *
451 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400452 * Storage devices may report a granularity or preferred minimum I/O
453 * size which is the smallest request the device can perform without
454 * incurring a performance penalty. For disk drives this is often the
455 * physical block size. For RAID arrays it is often the stripe chunk
456 * size. A properly aligned multiple of minimum_io_size is the
457 * preferred request size for workloads where a high number of I/O
458 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400459 */
460void blk_queue_io_min(struct request_queue *q, unsigned int min)
461{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400462 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400463}
464EXPORT_SYMBOL(blk_queue_io_min);
465
466/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200467 * blk_limits_io_opt - set optimal request size for a device
468 * @limits: the queue limits
469 * @opt: smallest I/O size in bytes
470 *
471 * Description:
472 * Storage devices may report an optimal I/O size, which is the
473 * device's preferred unit for sustained I/O. This is rarely reported
474 * for disk drives. For RAID arrays it is usually the stripe width or
475 * the internal track size. A properly aligned multiple of
476 * optimal_io_size is the preferred request size for workloads where
477 * sustained throughput is desired.
478 */
479void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
480{
481 limits->io_opt = opt;
482}
483EXPORT_SYMBOL(blk_limits_io_opt);
484
485/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400486 * blk_queue_io_opt - set optimal request size for the queue
487 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700488 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400489 *
490 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400491 * Storage devices may report an optimal I/O size, which is the
492 * device's preferred unit for sustained I/O. This is rarely reported
493 * for disk drives. For RAID arrays it is usually the stripe width or
494 * the internal track size. A properly aligned multiple of
495 * optimal_io_size is the preferred request size for workloads where
496 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400497 */
498void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
499{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200500 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400501}
502EXPORT_SYMBOL(blk_queue_io_opt);
503
Jens Axboe86db1e22008-01-29 14:53:40 +0100504/**
505 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
506 * @t: the stacking driver (top)
507 * @b: the underlying device (bottom)
508 **/
509void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
510{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400511 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100512}
Jens Axboe86db1e22008-01-29 14:53:40 +0100513EXPORT_SYMBOL(blk_queue_stack_limits);
514
515/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400516 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100517 * @t: the stacking driver limits (top device)
518 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500519 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400520 *
521 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100522 * This function is used by stacking drivers like MD and DM to ensure
523 * that all component devices have compatible block sizes and
524 * alignments. The stacking driver must provide a queue_limits
525 * struct (top) and then iteratively call the stacking function for
526 * all component (bottom) devices. The stacking function will
527 * attempt to combine the values and ensure proper alignment.
528 *
529 * Returns 0 if the top and bottom queue_limits are compatible. The
530 * top device's block sizes and alignment offsets may be adjusted to
531 * ensure alignment with the bottom device. If no compatible sizes
532 * and alignments exist, -1 is returned and the resulting top
533 * queue_limits will have the misaligned flag set to indicate that
534 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400535 */
536int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500537 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400538{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500539 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100540
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400541 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
542 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500543 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400544 t->max_write_same_sectors = min(t->max_write_same_sectors,
545 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800546 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
547 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200548 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400549
550 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
551 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700552 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
553 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400554
Martin K. Petersen8a783622010-02-26 00:20:39 -0500555 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200556 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
557 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400558
559 t->max_segment_size = min_not_zero(t->max_segment_size,
560 b->max_segment_size);
561
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500562 t->misaligned |= b->misaligned;
563
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500564 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100565
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100566 /* Bottom device has different alignment. Check that it is
567 * compatible with the current top alignment.
568 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100569 if (t->alignment_offset != alignment) {
570
571 top = max(t->physical_block_size, t->io_min)
572 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100573 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100574
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100575 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400576 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100577 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500578 ret = -1;
579 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100580 }
581
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400582 t->logical_block_size = max(t->logical_block_size,
583 b->logical_block_size);
584
585 t->physical_block_size = max(t->physical_block_size,
586 b->physical_block_size);
587
588 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400589 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100590
Martin K. Petersene692cb62010-12-01 19:41:49 +0100591 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100592 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400593
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100594 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100595 if (t->physical_block_size & (t->logical_block_size - 1)) {
596 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400597 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500598 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100599 }
600
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100601 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100602 if (t->io_min & (t->physical_block_size - 1)) {
603 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400604 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500605 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400606 }
607
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100608 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100609 if (t->io_opt & (t->physical_block_size - 1)) {
610 t->io_opt = 0;
611 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500612 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100613 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400614
Kent Overstreetc78afc62013-07-11 22:39:53 -0700615 t->raid_partial_stripes_expensive =
616 max(t->raid_partial_stripes_expensive,
617 b->raid_partial_stripes_expensive);
618
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100619 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400620 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400621 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400622
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100623 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500624 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100625 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500626 ret = -1;
627 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100628
629 /* Discard alignment and granularity */
630 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500631 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100632
633 if (t->discard_granularity != 0 &&
634 t->discard_alignment != alignment) {
635 top = t->discard_granularity + t->discard_alignment;
636 bottom = b->discard_granularity + alignment;
637
638 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800639 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100640 t->discard_misaligned = 1;
641 }
642
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100643 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
644 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600645 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
646 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100647 t->discard_granularity = max(t->discard_granularity,
648 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400649 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800650 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100651 }
652
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900653 if (b->chunk_sectors)
654 t->chunk_sectors = min_not_zero(t->chunk_sectors,
655 b->chunk_sectors);
656
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500657 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400658}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200659EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400660
661/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500662 * bdev_stack_limits - adjust queue limits for stacked drivers
663 * @t: the stacking driver limits (top device)
664 * @bdev: the component block_device (bottom)
665 * @start: first data sector within component device
666 *
667 * Description:
668 * Merges queue limits for a top device and a block_device. Returns
669 * 0 if alignment didn't change. Returns -1 if adding the bottom
670 * device caused misalignment.
671 */
672int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
673 sector_t start)
674{
675 struct request_queue *bq = bdev_get_queue(bdev);
676
677 start += get_start_sect(bdev);
678
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500679 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500680}
681EXPORT_SYMBOL(bdev_stack_limits);
682
683/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400684 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200685 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400686 * @bdev: the underlying block device (bottom)
687 * @offset: offset to beginning of data within component device
688 *
689 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500690 * Merges the limits for a top level gendisk and a bottom level
691 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400692 */
693void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
694 sector_t offset)
695{
696 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400697
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500698 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400699 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
700
701 disk_name(disk, 0, top);
702 bdevname(bdev, bottom);
703
704 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
705 top, bottom);
706 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400707}
708EXPORT_SYMBOL(disk_stack_limits);
709
710/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100711 * blk_queue_dma_pad - set pad mask
712 * @q: the request queue for the device
713 * @mask: pad mask
714 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200715 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100716 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200717 * Appending pad buffer to a request modifies the last entry of a
718 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100719 **/
720void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
721{
722 q->dma_pad_mask = mask;
723}
724EXPORT_SYMBOL(blk_queue_dma_pad);
725
726/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200727 * blk_queue_update_dma_pad - update pad mask
728 * @q: the request queue for the device
729 * @mask: pad mask
730 *
731 * Update dma pad mask.
732 *
733 * Appending pad buffer to a request modifies the last entry of a
734 * scatter list such that it includes the pad buffer.
735 **/
736void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
737{
738 if (mask > q->dma_pad_mask)
739 q->dma_pad_mask = mask;
740}
741EXPORT_SYMBOL(blk_queue_update_dma_pad);
742
743/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100744 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100745 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100746 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100747 * @buf: physically contiguous buffer
748 * @size: size of the buffer in bytes
749 *
750 * Some devices have excess DMA problems and can't simply discard (or
751 * zero fill) the unwanted piece of the transfer. They have to have a
752 * real area of memory to transfer it into. The use case for this is
753 * ATAPI devices in DMA mode. If the packet command causes a transfer
754 * bigger than the transfer size some HBAs will lock up if there
755 * aren't DMA elements to contain the excess transfer. What this API
756 * does is adjust the queue so that the buf is always appended
757 * silently to the scatterlist.
758 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500759 * Note: This routine adjusts max_hw_segments to make room for appending
760 * the drain buffer. If you call blk_queue_max_segments() after calling
761 * this routine, you must set the limit to one fewer than your device
762 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100763 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100764int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100765 dma_drain_needed_fn *dma_drain_needed,
766 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100767{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500768 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100769 return -EINVAL;
770 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500771 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100772 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100773 q->dma_drain_buffer = buf;
774 q->dma_drain_size = size;
775
776 return 0;
777}
Jens Axboe86db1e22008-01-29 14:53:40 +0100778EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
779
780/**
781 * blk_queue_segment_boundary - set boundary rules for segment merging
782 * @q: the request queue for the device
783 * @mask: the memory boundary mask
784 **/
785void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
786{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300787 if (mask < PAGE_SIZE - 1) {
788 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700789 printk(KERN_INFO "%s: set to minimum %lx\n",
790 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100791 }
792
Martin K. Petersen025146e2009-05-22 17:17:51 -0400793 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100794}
Jens Axboe86db1e22008-01-29 14:53:40 +0100795EXPORT_SYMBOL(blk_queue_segment_boundary);
796
797/**
Keith Busch03100aa2015-08-19 14:24:05 -0700798 * blk_queue_virt_boundary - set boundary rules for bio merging
799 * @q: the request queue for the device
800 * @mask: the memory boundary mask
801 **/
802void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
803{
804 q->limits.virt_boundary_mask = mask;
805}
806EXPORT_SYMBOL(blk_queue_virt_boundary);
807
808/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100809 * blk_queue_dma_alignment - set dma length and memory alignment
810 * @q: the request queue for the device
811 * @mask: alignment mask
812 *
813 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200814 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100815 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100816 *
817 **/
818void blk_queue_dma_alignment(struct request_queue *q, int mask)
819{
820 q->dma_alignment = mask;
821}
Jens Axboe86db1e22008-01-29 14:53:40 +0100822EXPORT_SYMBOL(blk_queue_dma_alignment);
823
824/**
825 * blk_queue_update_dma_alignment - update dma length and memory alignment
826 * @q: the request queue for the device
827 * @mask: alignment mask
828 *
829 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200830 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100831 * If the requested alignment is larger than the current alignment, then
832 * the current queue alignment is updated to the new value, otherwise it
833 * is left alone. The design of this is to allow multiple objects
834 * (driver, device, transport etc) to set their respective
835 * alignments without having them interfere.
836 *
837 **/
838void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
839{
840 BUG_ON(mask > PAGE_SIZE);
841
842 if (mask > q->dma_alignment)
843 q->dma_alignment = mask;
844}
Jens Axboe86db1e22008-01-29 14:53:40 +0100845EXPORT_SYMBOL(blk_queue_update_dma_alignment);
846
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600847void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
848{
Jens Axboec888a8f2016-04-13 13:33:19 -0600849 spin_lock_irq(q->queue_lock);
850 if (queueable)
851 clear_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
852 else
853 set_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
854 spin_unlock_irq(q->queue_lock);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600855}
856EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
857
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600858/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600859 * blk_set_queue_depth - tell the block layer about the device queue depth
860 * @q: the request queue for the device
861 * @depth: queue depth
862 *
863 */
864void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
865{
866 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700867 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600868}
869EXPORT_SYMBOL(blk_set_queue_depth);
870
871/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600872 * blk_queue_write_cache - configure queue's write cache
873 * @q: the request queue for the device
874 * @wc: write back cache on or off
875 * @fua: device supports FUA writes, if true
876 *
877 * Tell the block layer about the write cache of @q.
878 */
879void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
880{
881 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f2016-04-13 13:33:19 -0600882 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600883 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600884 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600885 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600886 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600887 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600888 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600889 queue_flag_clear(QUEUE_FLAG_FUA, q);
890 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700891
892 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600893}
894EXPORT_SYMBOL_GPL(blk_queue_write_cache);
895
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200896static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100897{
898 blk_max_low_pfn = max_low_pfn - 1;
899 blk_max_pfn = max_pfn - 1;
900 return 0;
901}
902subsys_initcall(blk_settings_init);