blob: 8a2bc124a6840f2542355bdd01b543404a333796 [file] [log] [blame]
Jens Axboe86db1e22008-01-29 14:53:40 +01001/*
2 * Functions related to setting various queue properties from drivers
3 */
4#include <linux/kernel.h>
5#include <linux/module.h>
6#include <linux/init.h>
7#include <linux/bio.h>
8#include <linux/blkdev.h>
9#include <linux/bootmem.h> /* for max_pfn/max_low_pfn */
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -040010#include <linux/gcd.h>
Martin K. Petersen2cda2722010-03-15 12:46:51 +010011#include <linux/lcm.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010012#include <linux/jiffies.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090013#include <linux/gfp.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010014
15#include "blk.h"
Jens Axboe87760e52016-11-09 12:38:14 -070016#include "blk-wbt.h"
Jens Axboe86db1e22008-01-29 14:53:40 +010017
Jens Axboe6728cb02008-01-31 13:03:55 +010018unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010019EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010020
21unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010022
23/**
24 * blk_queue_prep_rq - set a prepare_request function for queue
25 * @q: queue
26 * @pfn: prepare_request function
27 *
28 * It's possible for a queue to register a prepare_request callback which
29 * is invoked before the request is handed to the request_fn. The goal of
30 * the function is to prepare a request for I/O, it can be used to build a
31 * cdb from the request data for instance.
32 *
33 */
34void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
35{
36 q->prep_rq_fn = pfn;
37}
Jens Axboe86db1e22008-01-29 14:53:40 +010038EXPORT_SYMBOL(blk_queue_prep_rq);
39
40/**
James Bottomley28018c22010-07-01 19:49:17 +090041 * blk_queue_unprep_rq - set an unprepare_request function for queue
42 * @q: queue
43 * @ufn: unprepare_request function
44 *
45 * It's possible for a queue to register an unprepare_request callback
46 * which is invoked before the request is finally completed. The goal
47 * of the function is to deallocate any data that was allocated in the
48 * prepare_request callback.
49 *
50 */
51void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
52{
53 q->unprep_rq_fn = ufn;
54}
55EXPORT_SYMBOL(blk_queue_unprep_rq);
56
Jens Axboe86db1e22008-01-29 14:53:40 +010057void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
58{
59 q->softirq_done_fn = fn;
60}
Jens Axboe86db1e22008-01-29 14:53:40 +010061EXPORT_SYMBOL(blk_queue_softirq_done);
62
Jens Axboe242f9dc2008-09-14 05:55:09 -070063void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
64{
65 q->rq_timeout = timeout;
66}
67EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
68
69void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
70{
71 q->rq_timed_out_fn = fn;
72}
73EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
74
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020075void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
76{
77 q->lld_busy_fn = fn;
78}
79EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
80
Jens Axboe86db1e22008-01-29 14:53:40 +010081/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020082 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020083 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020084 *
85 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010086 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020087 */
88void blk_set_default_limits(struct queue_limits *lim)
89{
Martin K. Petersen8a783622010-02-26 00:20:39 -050090 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020091 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020092 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070093 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050094 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070095 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
96 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060097 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040098 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080099 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100100 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -0600101 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100102 lim->discard_granularity = 0;
103 lim->discard_alignment = 0;
104 lim->discard_misaligned = 0;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100105 lim->discard_zeroes_data = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200106 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200107 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200108 lim->alignment_offset = 0;
109 lim->io_opt = 0;
110 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100111 lim->cluster = 1;
Damien Le Moal797476b2016-10-18 15:40:29 +0900112 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200113}
114EXPORT_SYMBOL(blk_set_default_limits);
115
116/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100117 * blk_set_stacking_limits - set default limits for stacking devices
118 * @lim: the queue_limits structure to reset
119 *
120 * Description:
121 * Returns a queue_limit struct to its default state. Should be used
122 * by stacking drivers like DM that have no internal limits.
123 */
124void blk_set_stacking_limits(struct queue_limits *lim)
125{
126 blk_set_default_limits(lim);
127
128 /* Inherit limits from component devices */
129 lim->discard_zeroes_data = 1;
130 lim->max_segments = USHRT_MAX;
131 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -0600132 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +0200133 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500134 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400135 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800136 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100137}
138EXPORT_SYMBOL(blk_set_stacking_limits);
139
140/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100141 * blk_queue_make_request - define an alternate make_request function for a device
142 * @q: the request queue for the device to be affected
143 * @mfn: the alternate make_request function
144 *
145 * Description:
146 * The normal way for &struct bios to be passed to a device
147 * driver is for them to be collected into requests on a request
148 * queue, and then to allow the device driver to select requests
149 * off that queue when it is ready. This works well for many block
150 * devices. However some block devices (typically virtual devices
151 * such as md or lvm) do not benefit from the processing on the
152 * request queue, and are served best by having the requests passed
153 * directly to them. This can be achieved by providing a function
154 * to blk_queue_make_request().
155 *
156 * Caveat:
157 * The driver that does this *must* be able to deal appropriately
158 * with buffers in "highmemory". This can be accomplished by either calling
159 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
160 * blk_queue_bounce() to create a buffer in normal memory.
161 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100162void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100163{
164 /*
165 * set defaults
166 */
167 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100168
Jens Axboe86db1e22008-01-29 14:53:40 +0100169 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100170 blk_queue_dma_alignment(q, 511);
171 blk_queue_congestion_threshold(q);
172 q->nr_batching = BLK_BATCH_REQ;
173
Martin K. Petersene475bba2009-06-16 08:23:52 +0200174 blk_set_default_limits(&q->limits);
175
Jens Axboe86db1e22008-01-29 14:53:40 +0100176 /*
177 * by default assume old behaviour and bounce for any highmem page
178 */
179 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
180}
Jens Axboe86db1e22008-01-29 14:53:40 +0100181EXPORT_SYMBOL(blk_queue_make_request);
182
183/**
184 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900185 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100186 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100187 *
188 * Description:
189 * Different hardware can have different requirements as to what pages
190 * it can do I/O directly to. A low level driver can call
191 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100192 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100193 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100194void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100195{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100196 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100197 int dma = 0;
198
199 q->bounce_gfp = GFP_NOIO;
200#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900201 /*
202 * Assume anything <= 4GB can be handled by IOMMU. Actually
203 * some IOMMUs can handle everything, but I don't know of a
204 * way to test this here.
205 */
206 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100207 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200208 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100209#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100210 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100211 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200212 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200213#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100214 if (dma) {
215 init_emergency_isa_pool();
216 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200217 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100218 }
219}
Jens Axboe86db1e22008-01-29 14:53:40 +0100220EXPORT_SYMBOL(blk_queue_bounce_limit);
221
222/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500223 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
224 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500225 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100226 *
227 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500228 * Enables a low level driver to set a hard upper limit,
229 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400230 * the device driver based upon the capabilities of the I/O
231 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500232 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500233 * max_dev_sectors is a hard limit imposed by the storage device for
234 * READ/WRITE requests. It is set by the disk driver.
235 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 * max_sectors is a soft limit imposed by the block layer for
237 * filesystem type requests. This value can be overridden on a
238 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
239 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100240 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500241void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100242{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500243 struct queue_limits *limits = &q->limits;
244 unsigned int max_sectors;
245
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300246 if ((max_hw_sectors << 9) < PAGE_SIZE) {
247 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700248 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500249 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100250 }
251
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400252 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500253 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
254 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
255 limits->max_sectors = max_sectors;
Jens Axboe86db1e22008-01-29 14:53:40 +0100256}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500257EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100258
259/**
Jens Axboe762380a2014-06-05 13:38:39 -0600260 * blk_queue_chunk_sectors - set size of the chunk for this queue
261 * @q: the request queue for the device
262 * @chunk_sectors: chunk sectors in the usual 512b unit
263 *
264 * Description:
265 * If a driver doesn't want IOs to cross a given chunk size, it can set
266 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600267 * must currently be a power-of-2 in sectors. Also note that the block
268 * layer must accept a page worth of data at any offset. So if the
269 * crossing of chunks is a hard limitation in the driver, it must still be
270 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600271 **/
272void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
273{
274 BUG_ON(!is_power_of_2(chunk_sectors));
275 q->limits.chunk_sectors = chunk_sectors;
276}
277EXPORT_SYMBOL(blk_queue_chunk_sectors);
278
279/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200280 * blk_queue_max_discard_sectors - set max sectors for a single discard
281 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200282 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200283 **/
284void blk_queue_max_discard_sectors(struct request_queue *q,
285 unsigned int max_discard_sectors)
286{
Jens Axboe0034af02015-07-16 09:14:26 -0600287 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200288 q->limits.max_discard_sectors = max_discard_sectors;
289}
290EXPORT_SYMBOL(blk_queue_max_discard_sectors);
291
292/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400293 * blk_queue_max_write_same_sectors - set max sectors for a single write same
294 * @q: the request queue for the device
295 * @max_write_same_sectors: maximum number of sectors to write per command
296 **/
297void blk_queue_max_write_same_sectors(struct request_queue *q,
298 unsigned int max_write_same_sectors)
299{
300 q->limits.max_write_same_sectors = max_write_same_sectors;
301}
302EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
303
304/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800305 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
306 * write zeroes
307 * @q: the request queue for the device
308 * @max_write_zeroes_sectors: maximum number of sectors to write per command
309 **/
310void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
311 unsigned int max_write_zeroes_sectors)
312{
313 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
314}
315EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
316
317/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500318 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100319 * @q: the request queue for the device
320 * @max_segments: max number of segments
321 *
322 * Description:
323 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500324 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100325 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500326void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100327{
328 if (!max_segments) {
329 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700330 printk(KERN_INFO "%s: set to minimum %d\n",
331 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100332 }
333
Martin K. Petersen8a783622010-02-26 00:20:39 -0500334 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100335}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500336EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100337
338/**
339 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
340 * @q: the request queue for the device
341 * @max_size: max size of segment in bytes
342 *
343 * Description:
344 * Enables a low level driver to set an upper limit on the size of a
345 * coalesced segment
346 **/
347void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
348{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300349 if (max_size < PAGE_SIZE) {
350 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700351 printk(KERN_INFO "%s: set to minimum %d\n",
352 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100353 }
354
Martin K. Petersen025146e2009-05-22 17:17:51 -0400355 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100356}
Jens Axboe86db1e22008-01-29 14:53:40 +0100357EXPORT_SYMBOL(blk_queue_max_segment_size);
358
359/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400360 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100361 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400362 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100363 *
364 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400365 * This should be set to the lowest possible block size that the
366 * storage device can address. The default of 512 covers most
367 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100368 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400369void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100370{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400371 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400372
373 if (q->limits.physical_block_size < size)
374 q->limits.physical_block_size = size;
375
376 if (q->limits.io_min < q->limits.physical_block_size)
377 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100378}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400379EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100380
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400381/**
382 * blk_queue_physical_block_size - set physical block size for the queue
383 * @q: the request queue for the device
384 * @size: the physical block size, in bytes
385 *
386 * Description:
387 * This should be set to the lowest possible sector size that the
388 * hardware can operate on without reverting to read-modify-write
389 * operations.
390 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200391void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400392{
393 q->limits.physical_block_size = size;
394
395 if (q->limits.physical_block_size < q->limits.logical_block_size)
396 q->limits.physical_block_size = q->limits.logical_block_size;
397
398 if (q->limits.io_min < q->limits.physical_block_size)
399 q->limits.io_min = q->limits.physical_block_size;
400}
401EXPORT_SYMBOL(blk_queue_physical_block_size);
402
403/**
404 * blk_queue_alignment_offset - set physical block alignment offset
405 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700406 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400407 *
408 * Description:
409 * Some devices are naturally misaligned to compensate for things like
410 * the legacy DOS partition table 63-sector offset. Low-level drivers
411 * should call this function for devices whose first sector is not
412 * naturally aligned.
413 */
414void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
415{
416 q->limits.alignment_offset =
417 offset & (q->limits.physical_block_size - 1);
418 q->limits.misaligned = 0;
419}
420EXPORT_SYMBOL(blk_queue_alignment_offset);
421
422/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400423 * blk_limits_io_min - set minimum request size for a device
424 * @limits: the queue limits
425 * @min: smallest I/O size in bytes
426 *
427 * Description:
428 * Some devices have an internal block size bigger than the reported
429 * hardware sector size. This function can be used to signal the
430 * smallest I/O the device can perform without incurring a performance
431 * penalty.
432 */
433void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
434{
435 limits->io_min = min;
436
437 if (limits->io_min < limits->logical_block_size)
438 limits->io_min = limits->logical_block_size;
439
440 if (limits->io_min < limits->physical_block_size)
441 limits->io_min = limits->physical_block_size;
442}
443EXPORT_SYMBOL(blk_limits_io_min);
444
445/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400446 * blk_queue_io_min - set minimum request size for the queue
447 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700448 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400449 *
450 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400451 * Storage devices may report a granularity or preferred minimum I/O
452 * size which is the smallest request the device can perform without
453 * incurring a performance penalty. For disk drives this is often the
454 * physical block size. For RAID arrays it is often the stripe chunk
455 * size. A properly aligned multiple of minimum_io_size is the
456 * preferred request size for workloads where a high number of I/O
457 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400458 */
459void blk_queue_io_min(struct request_queue *q, unsigned int min)
460{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400461 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400462}
463EXPORT_SYMBOL(blk_queue_io_min);
464
465/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200466 * blk_limits_io_opt - set optimal request size for a device
467 * @limits: the queue limits
468 * @opt: smallest I/O size in bytes
469 *
470 * Description:
471 * Storage devices may report an optimal I/O size, which is the
472 * device's preferred unit for sustained I/O. This is rarely reported
473 * for disk drives. For RAID arrays it is usually the stripe width or
474 * the internal track size. A properly aligned multiple of
475 * optimal_io_size is the preferred request size for workloads where
476 * sustained throughput is desired.
477 */
478void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
479{
480 limits->io_opt = opt;
481}
482EXPORT_SYMBOL(blk_limits_io_opt);
483
484/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400485 * blk_queue_io_opt - set optimal request size for the queue
486 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700487 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400488 *
489 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400490 * Storage devices may report an optimal I/O size, which is the
491 * device's preferred unit for sustained I/O. This is rarely reported
492 * for disk drives. For RAID arrays it is usually the stripe width or
493 * the internal track size. A properly aligned multiple of
494 * optimal_io_size is the preferred request size for workloads where
495 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400496 */
497void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
498{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200499 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400500}
501EXPORT_SYMBOL(blk_queue_io_opt);
502
Jens Axboe86db1e22008-01-29 14:53:40 +0100503/**
504 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
505 * @t: the stacking driver (top)
506 * @b: the underlying device (bottom)
507 **/
508void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
509{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400510 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100511}
Jens Axboe86db1e22008-01-29 14:53:40 +0100512EXPORT_SYMBOL(blk_queue_stack_limits);
513
514/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400515 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100516 * @t: the stacking driver limits (top device)
517 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500518 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400519 *
520 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100521 * This function is used by stacking drivers like MD and DM to ensure
522 * that all component devices have compatible block sizes and
523 * alignments. The stacking driver must provide a queue_limits
524 * struct (top) and then iteratively call the stacking function for
525 * all component (bottom) devices. The stacking function will
526 * attempt to combine the values and ensure proper alignment.
527 *
528 * Returns 0 if the top and bottom queue_limits are compatible. The
529 * top device's block sizes and alignment offsets may be adjusted to
530 * ensure alignment with the bottom device. If no compatible sizes
531 * and alignments exist, -1 is returned and the resulting top
532 * queue_limits will have the misaligned flag set to indicate that
533 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400534 */
535int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500536 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400537{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500538 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100539
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400540 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
541 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500542 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400543 t->max_write_same_sectors = min(t->max_write_same_sectors,
544 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800545 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
546 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200547 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400548
549 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
550 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700551 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
552 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400553
Martin K. Petersen8a783622010-02-26 00:20:39 -0500554 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200555 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
556 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400557
558 t->max_segment_size = min_not_zero(t->max_segment_size,
559 b->max_segment_size);
560
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500561 t->misaligned |= b->misaligned;
562
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500563 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100564
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100565 /* Bottom device has different alignment. Check that it is
566 * compatible with the current top alignment.
567 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100568 if (t->alignment_offset != alignment) {
569
570 top = max(t->physical_block_size, t->io_min)
571 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100572 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100573
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100574 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400575 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100576 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500577 ret = -1;
578 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100579 }
580
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400581 t->logical_block_size = max(t->logical_block_size,
582 b->logical_block_size);
583
584 t->physical_block_size = max(t->physical_block_size,
585 b->physical_block_size);
586
587 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400588 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100589
Martin K. Petersene692cb62010-12-01 19:41:49 +0100590 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100591 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400592
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100593 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100594 if (t->physical_block_size & (t->logical_block_size - 1)) {
595 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400596 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500597 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100598 }
599
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100600 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100601 if (t->io_min & (t->physical_block_size - 1)) {
602 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400603 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500604 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400605 }
606
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100607 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100608 if (t->io_opt & (t->physical_block_size - 1)) {
609 t->io_opt = 0;
610 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500611 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100612 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400613
Kent Overstreetc78afc62013-07-11 22:39:53 -0700614 t->raid_partial_stripes_expensive =
615 max(t->raid_partial_stripes_expensive,
616 b->raid_partial_stripes_expensive);
617
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100618 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400619 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400620 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400621
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100622 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500623 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100624 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500625 ret = -1;
626 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100627
628 /* Discard alignment and granularity */
629 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500630 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100631
632 if (t->discard_granularity != 0 &&
633 t->discard_alignment != alignment) {
634 top = t->discard_granularity + t->discard_alignment;
635 bottom = b->discard_granularity + alignment;
636
637 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800638 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100639 t->discard_misaligned = 1;
640 }
641
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100642 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
643 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600644 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
645 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100646 t->discard_granularity = max(t->discard_granularity,
647 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400648 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800649 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100650 }
651
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900652 if (b->chunk_sectors)
653 t->chunk_sectors = min_not_zero(t->chunk_sectors,
654 b->chunk_sectors);
655
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500656 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400657}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200658EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400659
660/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500661 * bdev_stack_limits - adjust queue limits for stacked drivers
662 * @t: the stacking driver limits (top device)
663 * @bdev: the component block_device (bottom)
664 * @start: first data sector within component device
665 *
666 * Description:
667 * Merges queue limits for a top device and a block_device. Returns
668 * 0 if alignment didn't change. Returns -1 if adding the bottom
669 * device caused misalignment.
670 */
671int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
672 sector_t start)
673{
674 struct request_queue *bq = bdev_get_queue(bdev);
675
676 start += get_start_sect(bdev);
677
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500678 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500679}
680EXPORT_SYMBOL(bdev_stack_limits);
681
682/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400683 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200684 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400685 * @bdev: the underlying block device (bottom)
686 * @offset: offset to beginning of data within component device
687 *
688 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500689 * Merges the limits for a top level gendisk and a bottom level
690 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400691 */
692void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
693 sector_t offset)
694{
695 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400696
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500697 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400698 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
699
700 disk_name(disk, 0, top);
701 bdevname(bdev, bottom);
702
703 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
704 top, bottom);
705 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400706}
707EXPORT_SYMBOL(disk_stack_limits);
708
709/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100710 * blk_queue_dma_pad - set pad mask
711 * @q: the request queue for the device
712 * @mask: pad mask
713 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200714 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100715 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200716 * Appending pad buffer to a request modifies the last entry of a
717 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100718 **/
719void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
720{
721 q->dma_pad_mask = mask;
722}
723EXPORT_SYMBOL(blk_queue_dma_pad);
724
725/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200726 * blk_queue_update_dma_pad - update pad mask
727 * @q: the request queue for the device
728 * @mask: pad mask
729 *
730 * Update dma pad mask.
731 *
732 * Appending pad buffer to a request modifies the last entry of a
733 * scatter list such that it includes the pad buffer.
734 **/
735void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
736{
737 if (mask > q->dma_pad_mask)
738 q->dma_pad_mask = mask;
739}
740EXPORT_SYMBOL(blk_queue_update_dma_pad);
741
742/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100743 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100744 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100745 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100746 * @buf: physically contiguous buffer
747 * @size: size of the buffer in bytes
748 *
749 * Some devices have excess DMA problems and can't simply discard (or
750 * zero fill) the unwanted piece of the transfer. They have to have a
751 * real area of memory to transfer it into. The use case for this is
752 * ATAPI devices in DMA mode. If the packet command causes a transfer
753 * bigger than the transfer size some HBAs will lock up if there
754 * aren't DMA elements to contain the excess transfer. What this API
755 * does is adjust the queue so that the buf is always appended
756 * silently to the scatterlist.
757 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500758 * Note: This routine adjusts max_hw_segments to make room for appending
759 * the drain buffer. If you call blk_queue_max_segments() after calling
760 * this routine, you must set the limit to one fewer than your device
761 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100762 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100763int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100764 dma_drain_needed_fn *dma_drain_needed,
765 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100766{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500767 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100768 return -EINVAL;
769 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500770 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100771 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100772 q->dma_drain_buffer = buf;
773 q->dma_drain_size = size;
774
775 return 0;
776}
Jens Axboe86db1e22008-01-29 14:53:40 +0100777EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
778
779/**
780 * blk_queue_segment_boundary - set boundary rules for segment merging
781 * @q: the request queue for the device
782 * @mask: the memory boundary mask
783 **/
784void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
785{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300786 if (mask < PAGE_SIZE - 1) {
787 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700788 printk(KERN_INFO "%s: set to minimum %lx\n",
789 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100790 }
791
Martin K. Petersen025146e2009-05-22 17:17:51 -0400792 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100793}
Jens Axboe86db1e22008-01-29 14:53:40 +0100794EXPORT_SYMBOL(blk_queue_segment_boundary);
795
796/**
Keith Busch03100aa2015-08-19 14:24:05 -0700797 * blk_queue_virt_boundary - set boundary rules for bio merging
798 * @q: the request queue for the device
799 * @mask: the memory boundary mask
800 **/
801void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
802{
803 q->limits.virt_boundary_mask = mask;
804}
805EXPORT_SYMBOL(blk_queue_virt_boundary);
806
807/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100808 * blk_queue_dma_alignment - set dma length and memory alignment
809 * @q: the request queue for the device
810 * @mask: alignment mask
811 *
812 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200813 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100814 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100815 *
816 **/
817void blk_queue_dma_alignment(struct request_queue *q, int mask)
818{
819 q->dma_alignment = mask;
820}
Jens Axboe86db1e22008-01-29 14:53:40 +0100821EXPORT_SYMBOL(blk_queue_dma_alignment);
822
823/**
824 * blk_queue_update_dma_alignment - update dma length and memory alignment
825 * @q: the request queue for the device
826 * @mask: alignment mask
827 *
828 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200829 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100830 * If the requested alignment is larger than the current alignment, then
831 * the current queue alignment is updated to the new value, otherwise it
832 * is left alone. The design of this is to allow multiple objects
833 * (driver, device, transport etc) to set their respective
834 * alignments without having them interfere.
835 *
836 **/
837void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
838{
839 BUG_ON(mask > PAGE_SIZE);
840
841 if (mask > q->dma_alignment)
842 q->dma_alignment = mask;
843}
Jens Axboe86db1e22008-01-29 14:53:40 +0100844EXPORT_SYMBOL(blk_queue_update_dma_alignment);
845
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600846void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
847{
Jens Axboec888a8f2016-04-13 13:33:19 -0600848 spin_lock_irq(q->queue_lock);
849 if (queueable)
850 clear_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
851 else
852 set_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
853 spin_unlock_irq(q->queue_lock);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600854}
855EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
856
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600857/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600858 * blk_set_queue_depth - tell the block layer about the device queue depth
859 * @q: the request queue for the device
860 * @depth: queue depth
861 *
862 */
863void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
864{
865 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700866 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600867}
868EXPORT_SYMBOL(blk_set_queue_depth);
869
870/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600871 * blk_queue_write_cache - configure queue's write cache
872 * @q: the request queue for the device
873 * @wc: write back cache on or off
874 * @fua: device supports FUA writes, if true
875 *
876 * Tell the block layer about the write cache of @q.
877 */
878void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
879{
880 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f2016-04-13 13:33:19 -0600881 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600882 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600883 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600884 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600885 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600886 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600887 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600888 queue_flag_clear(QUEUE_FLAG_FUA, q);
889 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700890
891 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600892}
893EXPORT_SYMBOL_GPL(blk_queue_write_cache);
894
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200895static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100896{
897 blk_max_low_pfn = max_low_pfn - 1;
898 blk_max_pfn = max_pfn - 1;
899 return 0;
900}
901subsys_initcall(blk_settings_init);