blob: be1f115b538b3f874a8db5fd4eef000621821ad6 [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);
Jens Axboe86db1e22008-01-29 14:53:40 +0100175}
Jens Axboe86db1e22008-01-29 14:53:40 +0100176EXPORT_SYMBOL(blk_queue_make_request);
177
178/**
179 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900180 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100181 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100182 *
183 * Description:
184 * Different hardware can have different requirements as to what pages
185 * it can do I/O directly to. A low level driver can call
186 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100187 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100188 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100189void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100190{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100191 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100192 int dma = 0;
193
194 q->bounce_gfp = GFP_NOIO;
195#if BITS_PER_LONG == 64
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900196 /*
197 * Assume anything <= 4GB can be handled by IOMMU. Actually
198 * some IOMMUs can handle everything, but I don't know of a
199 * way to test this here.
200 */
201 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100202 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200203 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100204#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100205 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100206 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200207 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200208#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100209 if (dma) {
210 init_emergency_isa_pool();
211 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200212 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100213 }
214}
Jens Axboe86db1e22008-01-29 14:53:40 +0100215EXPORT_SYMBOL(blk_queue_bounce_limit);
216
217/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500218 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
219 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500220 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100221 *
222 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500223 * Enables a low level driver to set a hard upper limit,
224 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400225 * the device driver based upon the capabilities of the I/O
226 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500227 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500228 * max_dev_sectors is a hard limit imposed by the storage device for
229 * READ/WRITE requests. It is set by the disk driver.
230 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500231 * max_sectors is a soft limit imposed by the block layer for
232 * filesystem type requests. This value can be overridden on a
233 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
234 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100235 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500236void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100237{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500238 struct queue_limits *limits = &q->limits;
239 unsigned int max_sectors;
240
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300241 if ((max_hw_sectors << 9) < PAGE_SIZE) {
242 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700243 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500244 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100245 }
246
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400247 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500248 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
249 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
250 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100251 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100252}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500253EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100254
255/**
Jens Axboe762380a2014-06-05 13:38:39 -0600256 * blk_queue_chunk_sectors - set size of the chunk for this queue
257 * @q: the request queue for the device
258 * @chunk_sectors: chunk sectors in the usual 512b unit
259 *
260 * Description:
261 * If a driver doesn't want IOs to cross a given chunk size, it can set
262 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600263 * must currently be a power-of-2 in sectors. Also note that the block
264 * layer must accept a page worth of data at any offset. So if the
265 * crossing of chunks is a hard limitation in the driver, it must still be
266 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600267 **/
268void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
269{
270 BUG_ON(!is_power_of_2(chunk_sectors));
271 q->limits.chunk_sectors = chunk_sectors;
272}
273EXPORT_SYMBOL(blk_queue_chunk_sectors);
274
275/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200276 * blk_queue_max_discard_sectors - set max sectors for a single discard
277 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200278 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200279 **/
280void blk_queue_max_discard_sectors(struct request_queue *q,
281 unsigned int max_discard_sectors)
282{
Jens Axboe0034af02015-07-16 09:14:26 -0600283 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200284 q->limits.max_discard_sectors = max_discard_sectors;
285}
286EXPORT_SYMBOL(blk_queue_max_discard_sectors);
287
288/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400289 * blk_queue_max_write_same_sectors - set max sectors for a single write same
290 * @q: the request queue for the device
291 * @max_write_same_sectors: maximum number of sectors to write per command
292 **/
293void blk_queue_max_write_same_sectors(struct request_queue *q,
294 unsigned int max_write_same_sectors)
295{
296 q->limits.max_write_same_sectors = max_write_same_sectors;
297}
298EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
299
300/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800301 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
302 * write zeroes
303 * @q: the request queue for the device
304 * @max_write_zeroes_sectors: maximum number of sectors to write per command
305 **/
306void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
307 unsigned int max_write_zeroes_sectors)
308{
309 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
310}
311EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
312
313/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500314 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100315 * @q: the request queue for the device
316 * @max_segments: max number of segments
317 *
318 * Description:
319 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500320 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100321 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500322void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100323{
324 if (!max_segments) {
325 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700326 printk(KERN_INFO "%s: set to minimum %d\n",
327 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100328 }
329
Martin K. Petersen8a783622010-02-26 00:20:39 -0500330 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100331}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500332EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100333
334/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100335 * blk_queue_max_discard_segments - set max segments for discard requests
336 * @q: the request queue for the device
337 * @max_segments: max number of segments
338 *
339 * Description:
340 * Enables a low level driver to set an upper limit on the number of
341 * segments in a discard request.
342 **/
343void blk_queue_max_discard_segments(struct request_queue *q,
344 unsigned short max_segments)
345{
346 q->limits.max_discard_segments = max_segments;
347}
348EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
349
350/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100351 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
352 * @q: the request queue for the device
353 * @max_size: max size of segment in bytes
354 *
355 * Description:
356 * Enables a low level driver to set an upper limit on the size of a
357 * coalesced segment
358 **/
359void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
360{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300361 if (max_size < PAGE_SIZE) {
362 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700363 printk(KERN_INFO "%s: set to minimum %d\n",
364 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100365 }
366
Martin K. Petersen025146e2009-05-22 17:17:51 -0400367 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100368}
Jens Axboe86db1e22008-01-29 14:53:40 +0100369EXPORT_SYMBOL(blk_queue_max_segment_size);
370
371/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400372 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100373 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400374 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100375 *
376 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400377 * This should be set to the lowest possible block size that the
378 * storage device can address. The default of 512 covers most
379 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100380 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400381void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100382{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400383 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400384
385 if (q->limits.physical_block_size < size)
386 q->limits.physical_block_size = size;
387
388 if (q->limits.io_min < q->limits.physical_block_size)
389 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100390}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400391EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100392
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400393/**
394 * blk_queue_physical_block_size - set physical block size for the queue
395 * @q: the request queue for the device
396 * @size: the physical block size, in bytes
397 *
398 * Description:
399 * This should be set to the lowest possible sector size that the
400 * hardware can operate on without reverting to read-modify-write
401 * operations.
402 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200403void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400404{
405 q->limits.physical_block_size = size;
406
407 if (q->limits.physical_block_size < q->limits.logical_block_size)
408 q->limits.physical_block_size = q->limits.logical_block_size;
409
410 if (q->limits.io_min < q->limits.physical_block_size)
411 q->limits.io_min = q->limits.physical_block_size;
412}
413EXPORT_SYMBOL(blk_queue_physical_block_size);
414
415/**
416 * blk_queue_alignment_offset - set physical block alignment offset
417 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700418 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400419 *
420 * Description:
421 * Some devices are naturally misaligned to compensate for things like
422 * the legacy DOS partition table 63-sector offset. Low-level drivers
423 * should call this function for devices whose first sector is not
424 * naturally aligned.
425 */
426void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
427{
428 q->limits.alignment_offset =
429 offset & (q->limits.physical_block_size - 1);
430 q->limits.misaligned = 0;
431}
432EXPORT_SYMBOL(blk_queue_alignment_offset);
433
434/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400435 * blk_limits_io_min - set minimum request size for a device
436 * @limits: the queue limits
437 * @min: smallest I/O size in bytes
438 *
439 * Description:
440 * Some devices have an internal block size bigger than the reported
441 * hardware sector size. This function can be used to signal the
442 * smallest I/O the device can perform without incurring a performance
443 * penalty.
444 */
445void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
446{
447 limits->io_min = min;
448
449 if (limits->io_min < limits->logical_block_size)
450 limits->io_min = limits->logical_block_size;
451
452 if (limits->io_min < limits->physical_block_size)
453 limits->io_min = limits->physical_block_size;
454}
455EXPORT_SYMBOL(blk_limits_io_min);
456
457/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400458 * blk_queue_io_min - set minimum request size for the queue
459 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700460 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400461 *
462 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400463 * Storage devices may report a granularity or preferred minimum I/O
464 * size which is the smallest request the device can perform without
465 * incurring a performance penalty. For disk drives this is often the
466 * physical block size. For RAID arrays it is often the stripe chunk
467 * size. A properly aligned multiple of minimum_io_size is the
468 * preferred request size for workloads where a high number of I/O
469 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400470 */
471void blk_queue_io_min(struct request_queue *q, unsigned int min)
472{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400473 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400474}
475EXPORT_SYMBOL(blk_queue_io_min);
476
477/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200478 * blk_limits_io_opt - set optimal request size for a device
479 * @limits: the queue limits
480 * @opt: smallest I/O size in bytes
481 *
482 * Description:
483 * Storage devices may report an optimal I/O size, which is the
484 * device's preferred unit for sustained I/O. This is rarely reported
485 * for disk drives. For RAID arrays it is usually the stripe width or
486 * the internal track size. A properly aligned multiple of
487 * optimal_io_size is the preferred request size for workloads where
488 * sustained throughput is desired.
489 */
490void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
491{
492 limits->io_opt = opt;
493}
494EXPORT_SYMBOL(blk_limits_io_opt);
495
496/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400497 * blk_queue_io_opt - set optimal request size for the queue
498 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700499 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400500 *
501 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400502 * Storage devices may report an optimal I/O size, which is the
503 * device's preferred unit for sustained I/O. This is rarely reported
504 * for disk drives. For RAID arrays it is usually the stripe width or
505 * the internal track size. A properly aligned multiple of
506 * optimal_io_size is the preferred request size for workloads where
507 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400508 */
509void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
510{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200511 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400512}
513EXPORT_SYMBOL(blk_queue_io_opt);
514
Jens Axboe86db1e22008-01-29 14:53:40 +0100515/**
516 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
517 * @t: the stacking driver (top)
518 * @b: the underlying device (bottom)
519 **/
520void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
521{
Martin K. Petersenfef246672009-07-31 11:49:10 -0400522 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100523}
Jens Axboe86db1e22008-01-29 14:53:40 +0100524EXPORT_SYMBOL(blk_queue_stack_limits);
525
526/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400527 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100528 * @t: the stacking driver limits (top device)
529 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500530 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400531 *
532 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100533 * This function is used by stacking drivers like MD and DM to ensure
534 * that all component devices have compatible block sizes and
535 * alignments. The stacking driver must provide a queue_limits
536 * struct (top) and then iteratively call the stacking function for
537 * all component (bottom) devices. The stacking function will
538 * attempt to combine the values and ensure proper alignment.
539 *
540 * Returns 0 if the top and bottom queue_limits are compatible. The
541 * top device's block sizes and alignment offsets may be adjusted to
542 * ensure alignment with the bottom device. If no compatible sizes
543 * and alignments exist, -1 is returned and the resulting top
544 * queue_limits will have the misaligned flag set to indicate that
545 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400546 */
547int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500548 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400549{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500550 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100551
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400552 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
553 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500554 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400555 t->max_write_same_sectors = min(t->max_write_same_sectors,
556 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800557 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
558 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200559 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400560
561 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
562 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700563 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
564 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400565
Martin K. Petersen8a783622010-02-26 00:20:39 -0500566 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100567 t->max_discard_segments = min_not_zero(t->max_discard_segments,
568 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200569 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
570 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400571
572 t->max_segment_size = min_not_zero(t->max_segment_size,
573 b->max_segment_size);
574
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500575 t->misaligned |= b->misaligned;
576
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500577 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100578
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100579 /* Bottom device has different alignment. Check that it is
580 * compatible with the current top alignment.
581 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100582 if (t->alignment_offset != alignment) {
583
584 top = max(t->physical_block_size, t->io_min)
585 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100586 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100587
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100588 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400589 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100590 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500591 ret = -1;
592 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100593 }
594
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400595 t->logical_block_size = max(t->logical_block_size,
596 b->logical_block_size);
597
598 t->physical_block_size = max(t->physical_block_size,
599 b->physical_block_size);
600
601 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400602 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100603
Martin K. Petersene692cb62010-12-01 19:41:49 +0100604 t->cluster &= b->cluster;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400605
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100606 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100607 if (t->physical_block_size & (t->logical_block_size - 1)) {
608 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400609 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500610 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100611 }
612
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100613 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100614 if (t->io_min & (t->physical_block_size - 1)) {
615 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400616 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500617 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400618 }
619
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100620 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100621 if (t->io_opt & (t->physical_block_size - 1)) {
622 t->io_opt = 0;
623 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500624 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100625 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400626
Kent Overstreetc78afc62013-07-11 22:39:53 -0700627 t->raid_partial_stripes_expensive =
628 max(t->raid_partial_stripes_expensive,
629 b->raid_partial_stripes_expensive);
630
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100631 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400632 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400633 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400634
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100635 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500636 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100637 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500638 ret = -1;
639 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100640
641 /* Discard alignment and granularity */
642 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500643 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100644
645 if (t->discard_granularity != 0 &&
646 t->discard_alignment != alignment) {
647 top = t->discard_granularity + t->discard_alignment;
648 bottom = b->discard_granularity + alignment;
649
650 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800651 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100652 t->discard_misaligned = 1;
653 }
654
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100655 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
656 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600657 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
658 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100659 t->discard_granularity = max(t->discard_granularity,
660 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400661 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800662 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100663 }
664
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900665 if (b->chunk_sectors)
666 t->chunk_sectors = min_not_zero(t->chunk_sectors,
667 b->chunk_sectors);
668
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500669 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400670}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200671EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400672
673/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500674 * bdev_stack_limits - adjust queue limits for stacked drivers
675 * @t: the stacking driver limits (top device)
676 * @bdev: the component block_device (bottom)
677 * @start: first data sector within component device
678 *
679 * Description:
680 * Merges queue limits for a top device and a block_device. Returns
681 * 0 if alignment didn't change. Returns -1 if adding the bottom
682 * device caused misalignment.
683 */
684int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
685 sector_t start)
686{
687 struct request_queue *bq = bdev_get_queue(bdev);
688
689 start += get_start_sect(bdev);
690
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500691 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500692}
693EXPORT_SYMBOL(bdev_stack_limits);
694
695/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400696 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200697 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400698 * @bdev: the underlying block device (bottom)
699 * @offset: offset to beginning of data within component device
700 *
701 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500702 * Merges the limits for a top level gendisk and a bottom level
703 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400704 */
705void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
706 sector_t offset)
707{
708 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400709
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500710 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400711 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
712
713 disk_name(disk, 0, top);
714 bdevname(bdev, bottom);
715
716 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
717 top, bottom);
718 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400719}
720EXPORT_SYMBOL(disk_stack_limits);
721
722/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100723 * blk_queue_dma_pad - set pad mask
724 * @q: the request queue for the device
725 * @mask: pad mask
726 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200727 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100728 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200729 * Appending pad buffer to a request modifies the last entry of a
730 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100731 **/
732void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
733{
734 q->dma_pad_mask = mask;
735}
736EXPORT_SYMBOL(blk_queue_dma_pad);
737
738/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200739 * blk_queue_update_dma_pad - update pad mask
740 * @q: the request queue for the device
741 * @mask: pad mask
742 *
743 * Update dma pad mask.
744 *
745 * Appending pad buffer to a request modifies the last entry of a
746 * scatter list such that it includes the pad buffer.
747 **/
748void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
749{
750 if (mask > q->dma_pad_mask)
751 q->dma_pad_mask = mask;
752}
753EXPORT_SYMBOL(blk_queue_update_dma_pad);
754
755/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100756 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100757 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100758 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100759 * @buf: physically contiguous buffer
760 * @size: size of the buffer in bytes
761 *
762 * Some devices have excess DMA problems and can't simply discard (or
763 * zero fill) the unwanted piece of the transfer. They have to have a
764 * real area of memory to transfer it into. The use case for this is
765 * ATAPI devices in DMA mode. If the packet command causes a transfer
766 * bigger than the transfer size some HBAs will lock up if there
767 * aren't DMA elements to contain the excess transfer. What this API
768 * does is adjust the queue so that the buf is always appended
769 * silently to the scatterlist.
770 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500771 * Note: This routine adjusts max_hw_segments to make room for appending
772 * the drain buffer. If you call blk_queue_max_segments() after calling
773 * this routine, you must set the limit to one fewer than your device
774 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100775 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100776int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100777 dma_drain_needed_fn *dma_drain_needed,
778 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100779{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500780 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100781 return -EINVAL;
782 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500783 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100784 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100785 q->dma_drain_buffer = buf;
786 q->dma_drain_size = size;
787
788 return 0;
789}
Jens Axboe86db1e22008-01-29 14:53:40 +0100790EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
791
792/**
793 * blk_queue_segment_boundary - set boundary rules for segment merging
794 * @q: the request queue for the device
795 * @mask: the memory boundary mask
796 **/
797void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
798{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300799 if (mask < PAGE_SIZE - 1) {
800 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700801 printk(KERN_INFO "%s: set to minimum %lx\n",
802 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100803 }
804
Martin K. Petersen025146e2009-05-22 17:17:51 -0400805 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100806}
Jens Axboe86db1e22008-01-29 14:53:40 +0100807EXPORT_SYMBOL(blk_queue_segment_boundary);
808
809/**
Keith Busch03100aa2015-08-19 14:24:05 -0700810 * blk_queue_virt_boundary - set boundary rules for bio merging
811 * @q: the request queue for the device
812 * @mask: the memory boundary mask
813 **/
814void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
815{
816 q->limits.virt_boundary_mask = mask;
817}
818EXPORT_SYMBOL(blk_queue_virt_boundary);
819
820/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100821 * blk_queue_dma_alignment - set dma length and memory alignment
822 * @q: the request queue for the device
823 * @mask: alignment mask
824 *
825 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200826 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100827 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100828 *
829 **/
830void blk_queue_dma_alignment(struct request_queue *q, int mask)
831{
832 q->dma_alignment = mask;
833}
Jens Axboe86db1e22008-01-29 14:53:40 +0100834EXPORT_SYMBOL(blk_queue_dma_alignment);
835
836/**
837 * blk_queue_update_dma_alignment - update dma length and memory alignment
838 * @q: the request queue for the device
839 * @mask: alignment mask
840 *
841 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200842 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100843 * If the requested alignment is larger than the current alignment, then
844 * the current queue alignment is updated to the new value, otherwise it
845 * is left alone. The design of this is to allow multiple objects
846 * (driver, device, transport etc) to set their respective
847 * alignments without having them interfere.
848 *
849 **/
850void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
851{
852 BUG_ON(mask > PAGE_SIZE);
853
854 if (mask > q->dma_alignment)
855 q->dma_alignment = mask;
856}
Jens Axboe86db1e22008-01-29 14:53:40 +0100857EXPORT_SYMBOL(blk_queue_update_dma_alignment);
858
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600859void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
860{
Jens Axboec888a8f92016-04-13 13:33:19 -0600861 spin_lock_irq(q->queue_lock);
862 if (queueable)
863 clear_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
864 else
865 set_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
866 spin_unlock_irq(q->queue_lock);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600867}
868EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
869
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600870/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600871 * blk_set_queue_depth - tell the block layer about the device queue depth
872 * @q: the request queue for the device
873 * @depth: queue depth
874 *
875 */
876void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
877{
878 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700879 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600880}
881EXPORT_SYMBOL(blk_set_queue_depth);
882
883/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600884 * blk_queue_write_cache - configure queue's write cache
885 * @q: the request queue for the device
886 * @wc: write back cache on or off
887 * @fua: device supports FUA writes, if true
888 *
889 * Tell the block layer about the write cache of @q.
890 */
891void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
892{
893 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f92016-04-13 13:33:19 -0600894 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600895 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f92016-04-13 13:33:19 -0600896 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600897 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f92016-04-13 13:33:19 -0600898 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600899 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f92016-04-13 13:33:19 -0600900 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600901 queue_flag_clear(QUEUE_FLAG_FUA, q);
902 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700903
904 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600905}
906EXPORT_SYMBOL_GPL(blk_queue_write_cache);
907
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200908static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100909{
910 blk_max_low_pfn = max_low_pfn - 1;
911 blk_max_pfn = max_pfn - 1;
912 return 0;
913}
914subsys_initcall(blk_settings_init);