blob: 4fa81ed383cab4ec1f543fa33e0536cbac8d7540 [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;
Christoph Hellwig1e739732017-02-08 14:46:49 +010091 lim->max_discard_segments = 1;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020092 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020093 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070094 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050095 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070096 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
97 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060098 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040099 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800100 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100101 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -0600102 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100103 lim->discard_granularity = 0;
104 lim->discard_alignment = 0;
105 lim->discard_misaligned = 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 */
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100129 lim->max_segments = USHRT_MAX;
Christoph Hellwig1e739732017-02-08 14:46:49 +0100130 lim->max_discard_segments = 1;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100131 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;
Jan Karadc3b17c2017-02-02 15:56:50 +0100256 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/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100340 * blk_queue_max_discard_segments - set max segments for discard requests
341 * @q: the request queue for the device
342 * @max_segments: max number of segments
343 *
344 * Description:
345 * Enables a low level driver to set an upper limit on the number of
346 * segments in a discard request.
347 **/
348void blk_queue_max_discard_segments(struct request_queue *q,
349 unsigned short max_segments)
350{
351 q->limits.max_discard_segments = max_segments;
352}
353EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
354
355/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100356 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
357 * @q: the request queue for the device
358 * @max_size: max size of segment in bytes
359 *
360 * Description:
361 * Enables a low level driver to set an upper limit on the size of a
362 * coalesced segment
363 **/
364void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
365{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300366 if (max_size < PAGE_SIZE) {
367 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700368 printk(KERN_INFO "%s: set to minimum %d\n",
369 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100370 }
371
Martin K. Petersen025146e2009-05-22 17:17:51 -0400372 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100373}
Jens Axboe86db1e22008-01-29 14:53:40 +0100374EXPORT_SYMBOL(blk_queue_max_segment_size);
375
376/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400377 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100378 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400379 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100380 *
381 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400382 * This should be set to the lowest possible block size that the
383 * storage device can address. The default of 512 covers most
384 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100385 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400386void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100387{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400388 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400389
390 if (q->limits.physical_block_size < size)
391 q->limits.physical_block_size = size;
392
393 if (q->limits.io_min < q->limits.physical_block_size)
394 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100395}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400396EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100397
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400398/**
399 * blk_queue_physical_block_size - set physical block size for the queue
400 * @q: the request queue for the device
401 * @size: the physical block size, in bytes
402 *
403 * Description:
404 * This should be set to the lowest possible sector size that the
405 * hardware can operate on without reverting to read-modify-write
406 * operations.
407 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200408void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400409{
410 q->limits.physical_block_size = size;
411
412 if (q->limits.physical_block_size < q->limits.logical_block_size)
413 q->limits.physical_block_size = q->limits.logical_block_size;
414
415 if (q->limits.io_min < q->limits.physical_block_size)
416 q->limits.io_min = q->limits.physical_block_size;
417}
418EXPORT_SYMBOL(blk_queue_physical_block_size);
419
420/**
421 * blk_queue_alignment_offset - set physical block alignment offset
422 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700423 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400424 *
425 * Description:
426 * Some devices are naturally misaligned to compensate for things like
427 * the legacy DOS partition table 63-sector offset. Low-level drivers
428 * should call this function for devices whose first sector is not
429 * naturally aligned.
430 */
431void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
432{
433 q->limits.alignment_offset =
434 offset & (q->limits.physical_block_size - 1);
435 q->limits.misaligned = 0;
436}
437EXPORT_SYMBOL(blk_queue_alignment_offset);
438
439/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400440 * blk_limits_io_min - set minimum request size for a device
441 * @limits: the queue limits
442 * @min: smallest I/O size in bytes
443 *
444 * Description:
445 * Some devices have an internal block size bigger than the reported
446 * hardware sector size. This function can be used to signal the
447 * smallest I/O the device can perform without incurring a performance
448 * penalty.
449 */
450void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
451{
452 limits->io_min = min;
453
454 if (limits->io_min < limits->logical_block_size)
455 limits->io_min = limits->logical_block_size;
456
457 if (limits->io_min < limits->physical_block_size)
458 limits->io_min = limits->physical_block_size;
459}
460EXPORT_SYMBOL(blk_limits_io_min);
461
462/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400463 * blk_queue_io_min - set minimum request size for the queue
464 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700465 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400466 *
467 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400468 * Storage devices may report a granularity or preferred minimum I/O
469 * size which is the smallest request the device can perform without
470 * incurring a performance penalty. For disk drives this is often the
471 * physical block size. For RAID arrays it is often the stripe chunk
472 * size. A properly aligned multiple of minimum_io_size is the
473 * preferred request size for workloads where a high number of I/O
474 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400475 */
476void blk_queue_io_min(struct request_queue *q, unsigned int min)
477{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400478 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400479}
480EXPORT_SYMBOL(blk_queue_io_min);
481
482/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200483 * blk_limits_io_opt - set optimal request size for a device
484 * @limits: the queue limits
485 * @opt: smallest I/O size in bytes
486 *
487 * Description:
488 * Storage devices may report an optimal I/O size, which is the
489 * device's preferred unit for sustained I/O. This is rarely reported
490 * for disk drives. For RAID arrays it is usually the stripe width or
491 * the internal track size. A properly aligned multiple of
492 * optimal_io_size is the preferred request size for workloads where
493 * sustained throughput is desired.
494 */
495void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
496{
497 limits->io_opt = opt;
498}
499EXPORT_SYMBOL(blk_limits_io_opt);
500
501/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400502 * blk_queue_io_opt - set optimal request size for the queue
503 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700504 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400505 *
506 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400507 * Storage devices may report an optimal I/O size, which is the
508 * device's preferred unit for sustained I/O. This is rarely reported
509 * for disk drives. For RAID arrays it is usually the stripe width or
510 * the internal track size. A properly aligned multiple of
511 * optimal_io_size is the preferred request size for workloads where
512 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400513 */
514void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
515{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200516 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400517}
518EXPORT_SYMBOL(blk_queue_io_opt);
519
Jens Axboe86db1e22008-01-29 14:53:40 +0100520/**
521 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
522 * @t: the stacking driver (top)
523 * @b: the underlying device (bottom)
524 **/
525void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
526{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400527 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100528}
Jens Axboe86db1e22008-01-29 14:53:40 +0100529EXPORT_SYMBOL(blk_queue_stack_limits);
530
531/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400532 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100533 * @t: the stacking driver limits (top device)
534 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500535 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400536 *
537 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100538 * This function is used by stacking drivers like MD and DM to ensure
539 * that all component devices have compatible block sizes and
540 * alignments. The stacking driver must provide a queue_limits
541 * struct (top) and then iteratively call the stacking function for
542 * all component (bottom) devices. The stacking function will
543 * attempt to combine the values and ensure proper alignment.
544 *
545 * Returns 0 if the top and bottom queue_limits are compatible. The
546 * top device's block sizes and alignment offsets may be adjusted to
547 * ensure alignment with the bottom device. If no compatible sizes
548 * and alignments exist, -1 is returned and the resulting top
549 * queue_limits will have the misaligned flag set to indicate that
550 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400551 */
552int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500553 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400554{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500555 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100556
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400557 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
558 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500559 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400560 t->max_write_same_sectors = min(t->max_write_same_sectors,
561 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800562 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
563 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200564 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400565
566 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
567 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700568 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
569 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400570
Martin K. Petersen8a783622010-02-26 00:20:39 -0500571 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100572 t->max_discard_segments = min_not_zero(t->max_discard_segments,
573 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200574 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
575 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400576
577 t->max_segment_size = min_not_zero(t->max_segment_size,
578 b->max_segment_size);
579
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500580 t->misaligned |= b->misaligned;
581
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500582 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100584 /* Bottom device has different alignment. Check that it is
585 * compatible with the current top alignment.
586 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100587 if (t->alignment_offset != alignment) {
588
589 top = max(t->physical_block_size, t->io_min)
590 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100591 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100592
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100593 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400594 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100595 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500596 ret = -1;
597 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100598 }
599
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400600 t->logical_block_size = max(t->logical_block_size,
601 b->logical_block_size);
602
603 t->physical_block_size = max(t->physical_block_size,
604 b->physical_block_size);
605
606 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400607 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100608
Martin K. Petersene692cb62010-12-01 19:41:49 +0100609 t->cluster &= b->cluster;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400610
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100611 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100612 if (t->physical_block_size & (t->logical_block_size - 1)) {
613 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400614 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500615 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100616 }
617
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100618 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100619 if (t->io_min & (t->physical_block_size - 1)) {
620 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400621 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500622 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400623 }
624
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100625 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100626 if (t->io_opt & (t->physical_block_size - 1)) {
627 t->io_opt = 0;
628 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500629 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100630 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400631
Kent Overstreetc78afc62013-07-11 22:39:53 -0700632 t->raid_partial_stripes_expensive =
633 max(t->raid_partial_stripes_expensive,
634 b->raid_partial_stripes_expensive);
635
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100636 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400637 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400638 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400639
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100640 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500641 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100642 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500643 ret = -1;
644 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100645
646 /* Discard alignment and granularity */
647 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500648 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100649
650 if (t->discard_granularity != 0 &&
651 t->discard_alignment != alignment) {
652 top = t->discard_granularity + t->discard_alignment;
653 bottom = b->discard_granularity + alignment;
654
655 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800656 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100657 t->discard_misaligned = 1;
658 }
659
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100660 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
661 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600662 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
663 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100664 t->discard_granularity = max(t->discard_granularity,
665 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400666 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800667 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100668 }
669
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900670 if (b->chunk_sectors)
671 t->chunk_sectors = min_not_zero(t->chunk_sectors,
672 b->chunk_sectors);
673
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500674 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400675}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200676EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400677
678/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500679 * bdev_stack_limits - adjust queue limits for stacked drivers
680 * @t: the stacking driver limits (top device)
681 * @bdev: the component block_device (bottom)
682 * @start: first data sector within component device
683 *
684 * Description:
685 * Merges queue limits for a top device and a block_device. Returns
686 * 0 if alignment didn't change. Returns -1 if adding the bottom
687 * device caused misalignment.
688 */
689int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
690 sector_t start)
691{
692 struct request_queue *bq = bdev_get_queue(bdev);
693
694 start += get_start_sect(bdev);
695
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500696 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500697}
698EXPORT_SYMBOL(bdev_stack_limits);
699
700/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400701 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200702 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400703 * @bdev: the underlying block device (bottom)
704 * @offset: offset to beginning of data within component device
705 *
706 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500707 * Merges the limits for a top level gendisk and a bottom level
708 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400709 */
710void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
711 sector_t offset)
712{
713 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400714
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500715 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400716 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
717
718 disk_name(disk, 0, top);
719 bdevname(bdev, bottom);
720
721 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
722 top, bottom);
723 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400724}
725EXPORT_SYMBOL(disk_stack_limits);
726
727/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100728 * blk_queue_dma_pad - set pad mask
729 * @q: the request queue for the device
730 * @mask: pad mask
731 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200732 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100733 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200734 * Appending pad buffer to a request modifies the last entry of a
735 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100736 **/
737void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
738{
739 q->dma_pad_mask = mask;
740}
741EXPORT_SYMBOL(blk_queue_dma_pad);
742
743/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200744 * blk_queue_update_dma_pad - update pad mask
745 * @q: the request queue for the device
746 * @mask: pad mask
747 *
748 * Update dma pad mask.
749 *
750 * Appending pad buffer to a request modifies the last entry of a
751 * scatter list such that it includes the pad buffer.
752 **/
753void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
754{
755 if (mask > q->dma_pad_mask)
756 q->dma_pad_mask = mask;
757}
758EXPORT_SYMBOL(blk_queue_update_dma_pad);
759
760/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100761 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100762 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100763 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100764 * @buf: physically contiguous buffer
765 * @size: size of the buffer in bytes
766 *
767 * Some devices have excess DMA problems and can't simply discard (or
768 * zero fill) the unwanted piece of the transfer. They have to have a
769 * real area of memory to transfer it into. The use case for this is
770 * ATAPI devices in DMA mode. If the packet command causes a transfer
771 * bigger than the transfer size some HBAs will lock up if there
772 * aren't DMA elements to contain the excess transfer. What this API
773 * does is adjust the queue so that the buf is always appended
774 * silently to the scatterlist.
775 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500776 * Note: This routine adjusts max_hw_segments to make room for appending
777 * the drain buffer. If you call blk_queue_max_segments() after calling
778 * this routine, you must set the limit to one fewer than your device
779 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100780 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100781int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100782 dma_drain_needed_fn *dma_drain_needed,
783 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100784{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500785 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100786 return -EINVAL;
787 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500788 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100789 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100790 q->dma_drain_buffer = buf;
791 q->dma_drain_size = size;
792
793 return 0;
794}
Jens Axboe86db1e22008-01-29 14:53:40 +0100795EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
796
797/**
798 * blk_queue_segment_boundary - set boundary rules for segment merging
799 * @q: the request queue for the device
800 * @mask: the memory boundary mask
801 **/
802void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
803{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300804 if (mask < PAGE_SIZE - 1) {
805 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700806 printk(KERN_INFO "%s: set to minimum %lx\n",
807 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100808 }
809
Martin K. Petersen025146e2009-05-22 17:17:51 -0400810 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100811}
Jens Axboe86db1e22008-01-29 14:53:40 +0100812EXPORT_SYMBOL(blk_queue_segment_boundary);
813
814/**
Keith Busch03100aa2015-08-19 14:24:05 -0700815 * blk_queue_virt_boundary - set boundary rules for bio merging
816 * @q: the request queue for the device
817 * @mask: the memory boundary mask
818 **/
819void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
820{
821 q->limits.virt_boundary_mask = mask;
822}
823EXPORT_SYMBOL(blk_queue_virt_boundary);
824
825/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100826 * blk_queue_dma_alignment - set dma length and memory alignment
827 * @q: the request queue for the device
828 * @mask: alignment mask
829 *
830 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200831 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100832 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100833 *
834 **/
835void blk_queue_dma_alignment(struct request_queue *q, int mask)
836{
837 q->dma_alignment = mask;
838}
Jens Axboe86db1e22008-01-29 14:53:40 +0100839EXPORT_SYMBOL(blk_queue_dma_alignment);
840
841/**
842 * blk_queue_update_dma_alignment - update dma length and memory alignment
843 * @q: the request queue for the device
844 * @mask: alignment mask
845 *
846 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200847 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100848 * If the requested alignment is larger than the current alignment, then
849 * the current queue alignment is updated to the new value, otherwise it
850 * is left alone. The design of this is to allow multiple objects
851 * (driver, device, transport etc) to set their respective
852 * alignments without having them interfere.
853 *
854 **/
855void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
856{
857 BUG_ON(mask > PAGE_SIZE);
858
859 if (mask > q->dma_alignment)
860 q->dma_alignment = mask;
861}
Jens Axboe86db1e22008-01-29 14:53:40 +0100862EXPORT_SYMBOL(blk_queue_update_dma_alignment);
863
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600864void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
865{
Jens Axboec888a8f2016-04-13 13:33:19 -0600866 spin_lock_irq(q->queue_lock);
867 if (queueable)
868 clear_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
869 else
870 set_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
871 spin_unlock_irq(q->queue_lock);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600872}
873EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
874
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600875/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600876 * blk_set_queue_depth - tell the block layer about the device queue depth
877 * @q: the request queue for the device
878 * @depth: queue depth
879 *
880 */
881void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
882{
883 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700884 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600885}
886EXPORT_SYMBOL(blk_set_queue_depth);
887
888/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600889 * blk_queue_write_cache - configure queue's write cache
890 * @q: the request queue for the device
891 * @wc: write back cache on or off
892 * @fua: device supports FUA writes, if true
893 *
894 * Tell the block layer about the write cache of @q.
895 */
896void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
897{
898 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f2016-04-13 13:33:19 -0600899 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600900 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600901 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600902 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600903 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600904 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600905 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600906 queue_flag_clear(QUEUE_FLAG_FUA, q);
907 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700908
909 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600910}
911EXPORT_SYMBOL_GPL(blk_queue_write_cache);
912
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200913static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100914{
915 blk_max_low_pfn = max_low_pfn - 1;
916 blk_max_pfn = max_pfn - 1;
917 return 0;
918}
919subsys_initcall(blk_settings_init);