blob: 1e7174ffc9d49d0757cf7cb7da1ffe822f7fbbd6 [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. Petersenb1bd0552012-01-11 16:27:11 +0100106 lim->discard_zeroes_data = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200107 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200108 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200109 lim->alignment_offset = 0;
110 lim->io_opt = 0;
111 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100112 lim->cluster = 1;
Damien Le Moal797476b2016-10-18 15:40:29 +0900113 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200114}
115EXPORT_SYMBOL(blk_set_default_limits);
116
117/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100118 * blk_set_stacking_limits - set default limits for stacking devices
119 * @lim: the queue_limits structure to reset
120 *
121 * Description:
122 * Returns a queue_limit struct to its default state. Should be used
123 * by stacking drivers like DM that have no internal limits.
124 */
125void blk_set_stacking_limits(struct queue_limits *lim)
126{
127 blk_set_default_limits(lim);
128
129 /* Inherit limits from component devices */
130 lim->discard_zeroes_data = 1;
131 lim->max_segments = USHRT_MAX;
Christoph Hellwig1e739732017-02-08 14:46:49 +0100132 lim->max_discard_segments = 1;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100133 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -0600134 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +0200135 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500136 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400137 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800138 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100139}
140EXPORT_SYMBOL(blk_set_stacking_limits);
141
142/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100143 * blk_queue_make_request - define an alternate make_request function for a device
144 * @q: the request queue for the device to be affected
145 * @mfn: the alternate make_request function
146 *
147 * Description:
148 * The normal way for &struct bios to be passed to a device
149 * driver is for them to be collected into requests on a request
150 * queue, and then to allow the device driver to select requests
151 * off that queue when it is ready. This works well for many block
152 * devices. However some block devices (typically virtual devices
153 * such as md or lvm) do not benefit from the processing on the
154 * request queue, and are served best by having the requests passed
155 * directly to them. This can be achieved by providing a function
156 * to blk_queue_make_request().
157 *
158 * Caveat:
159 * The driver that does this *must* be able to deal appropriately
160 * with buffers in "highmemory". This can be accomplished by either calling
161 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
162 * blk_queue_bounce() to create a buffer in normal memory.
163 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100164void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100165{
166 /*
167 * set defaults
168 */
169 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100170
Jens Axboe86db1e22008-01-29 14:53:40 +0100171 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100172 blk_queue_dma_alignment(q, 511);
173 blk_queue_congestion_threshold(q);
174 q->nr_batching = BLK_BATCH_REQ;
175
Martin K. Petersene475bba2009-06-16 08:23:52 +0200176 blk_set_default_limits(&q->limits);
177
Jens Axboe86db1e22008-01-29 14:53:40 +0100178 /*
179 * by default assume old behaviour and bounce for any highmem page
180 */
181 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
182}
Jens Axboe86db1e22008-01-29 14:53:40 +0100183EXPORT_SYMBOL(blk_queue_make_request);
184
185/**
186 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900187 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100188 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100189 *
190 * Description:
191 * Different hardware can have different requirements as to what pages
192 * it can do I/O directly to. A low level driver can call
193 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100194 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100195 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100196void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100197{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100198 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100199 int dma = 0;
200
201 q->bounce_gfp = GFP_NOIO;
202#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900203 /*
204 * Assume anything <= 4GB can be handled by IOMMU. Actually
205 * some IOMMUs can handle everything, but I don't know of a
206 * way to test this here.
207 */
208 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100209 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200210 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100211#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100212 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100213 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200214 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200215#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100216 if (dma) {
217 init_emergency_isa_pool();
218 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200219 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100220 }
221}
Jens Axboe86db1e22008-01-29 14:53:40 +0100222EXPORT_SYMBOL(blk_queue_bounce_limit);
223
224/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500225 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
226 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500227 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100228 *
229 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500230 * Enables a low level driver to set a hard upper limit,
231 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400232 * the device driver based upon the capabilities of the I/O
233 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500234 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500235 * max_dev_sectors is a hard limit imposed by the storage device for
236 * READ/WRITE requests. It is set by the disk driver.
237 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500238 * max_sectors is a soft limit imposed by the block layer for
239 * filesystem type requests. This value can be overridden on a
240 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
241 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100242 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500243void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100244{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500245 struct queue_limits *limits = &q->limits;
246 unsigned int max_sectors;
247
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300248 if ((max_hw_sectors << 9) < PAGE_SIZE) {
249 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700250 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500251 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100252 }
253
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400254 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500255 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
256 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
257 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100258 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100259}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500260EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100261
262/**
Jens Axboe762380a2014-06-05 13:38:39 -0600263 * blk_queue_chunk_sectors - set size of the chunk for this queue
264 * @q: the request queue for the device
265 * @chunk_sectors: chunk sectors in the usual 512b unit
266 *
267 * Description:
268 * If a driver doesn't want IOs to cross a given chunk size, it can set
269 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600270 * must currently be a power-of-2 in sectors. Also note that the block
271 * layer must accept a page worth of data at any offset. So if the
272 * crossing of chunks is a hard limitation in the driver, it must still be
273 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600274 **/
275void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
276{
277 BUG_ON(!is_power_of_2(chunk_sectors));
278 q->limits.chunk_sectors = chunk_sectors;
279}
280EXPORT_SYMBOL(blk_queue_chunk_sectors);
281
282/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200283 * blk_queue_max_discard_sectors - set max sectors for a single discard
284 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200285 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200286 **/
287void blk_queue_max_discard_sectors(struct request_queue *q,
288 unsigned int max_discard_sectors)
289{
Jens Axboe0034af02015-07-16 09:14:26 -0600290 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200291 q->limits.max_discard_sectors = max_discard_sectors;
292}
293EXPORT_SYMBOL(blk_queue_max_discard_sectors);
294
295/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400296 * blk_queue_max_write_same_sectors - set max sectors for a single write same
297 * @q: the request queue for the device
298 * @max_write_same_sectors: maximum number of sectors to write per command
299 **/
300void blk_queue_max_write_same_sectors(struct request_queue *q,
301 unsigned int max_write_same_sectors)
302{
303 q->limits.max_write_same_sectors = max_write_same_sectors;
304}
305EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
306
307/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800308 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
309 * write zeroes
310 * @q: the request queue for the device
311 * @max_write_zeroes_sectors: maximum number of sectors to write per command
312 **/
313void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
314 unsigned int max_write_zeroes_sectors)
315{
316 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
317}
318EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
319
320/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500321 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100322 * @q: the request queue for the device
323 * @max_segments: max number of segments
324 *
325 * Description:
326 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500327 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100328 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500329void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100330{
331 if (!max_segments) {
332 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700333 printk(KERN_INFO "%s: set to minimum %d\n",
334 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100335 }
336
Martin K. Petersen8a783622010-02-26 00:20:39 -0500337 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100338}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500339EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100340
341/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100342 * blk_queue_max_discard_segments - set max segments for discard requests
343 * @q: the request queue for the device
344 * @max_segments: max number of segments
345 *
346 * Description:
347 * Enables a low level driver to set an upper limit on the number of
348 * segments in a discard request.
349 **/
350void blk_queue_max_discard_segments(struct request_queue *q,
351 unsigned short max_segments)
352{
353 q->limits.max_discard_segments = max_segments;
354}
355EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
356
357/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100358 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
359 * @q: the request queue for the device
360 * @max_size: max size of segment in bytes
361 *
362 * Description:
363 * Enables a low level driver to set an upper limit on the size of a
364 * coalesced segment
365 **/
366void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
367{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300368 if (max_size < PAGE_SIZE) {
369 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700370 printk(KERN_INFO "%s: set to minimum %d\n",
371 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100372 }
373
Martin K. Petersen025146e2009-05-22 17:17:51 -0400374 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100375}
Jens Axboe86db1e22008-01-29 14:53:40 +0100376EXPORT_SYMBOL(blk_queue_max_segment_size);
377
378/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400379 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100380 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400381 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100382 *
383 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400384 * This should be set to the lowest possible block size that the
385 * storage device can address. The default of 512 covers most
386 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100387 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400388void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100389{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400390 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400391
392 if (q->limits.physical_block_size < size)
393 q->limits.physical_block_size = size;
394
395 if (q->limits.io_min < q->limits.physical_block_size)
396 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100397}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400398EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100399
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400400/**
401 * blk_queue_physical_block_size - set physical block size for the queue
402 * @q: the request queue for the device
403 * @size: the physical block size, in bytes
404 *
405 * Description:
406 * This should be set to the lowest possible sector size that the
407 * hardware can operate on without reverting to read-modify-write
408 * operations.
409 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200410void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400411{
412 q->limits.physical_block_size = size;
413
414 if (q->limits.physical_block_size < q->limits.logical_block_size)
415 q->limits.physical_block_size = q->limits.logical_block_size;
416
417 if (q->limits.io_min < q->limits.physical_block_size)
418 q->limits.io_min = q->limits.physical_block_size;
419}
420EXPORT_SYMBOL(blk_queue_physical_block_size);
421
422/**
423 * blk_queue_alignment_offset - set physical block alignment offset
424 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700425 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400426 *
427 * Description:
428 * Some devices are naturally misaligned to compensate for things like
429 * the legacy DOS partition table 63-sector offset. Low-level drivers
430 * should call this function for devices whose first sector is not
431 * naturally aligned.
432 */
433void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
434{
435 q->limits.alignment_offset =
436 offset & (q->limits.physical_block_size - 1);
437 q->limits.misaligned = 0;
438}
439EXPORT_SYMBOL(blk_queue_alignment_offset);
440
441/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400442 * blk_limits_io_min - set minimum request size for a device
443 * @limits: the queue limits
444 * @min: smallest I/O size in bytes
445 *
446 * Description:
447 * Some devices have an internal block size bigger than the reported
448 * hardware sector size. This function can be used to signal the
449 * smallest I/O the device can perform without incurring a performance
450 * penalty.
451 */
452void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
453{
454 limits->io_min = min;
455
456 if (limits->io_min < limits->logical_block_size)
457 limits->io_min = limits->logical_block_size;
458
459 if (limits->io_min < limits->physical_block_size)
460 limits->io_min = limits->physical_block_size;
461}
462EXPORT_SYMBOL(blk_limits_io_min);
463
464/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400465 * blk_queue_io_min - set minimum request size for the queue
466 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700467 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400468 *
469 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400470 * Storage devices may report a granularity or preferred minimum I/O
471 * size which is the smallest request the device can perform without
472 * incurring a performance penalty. For disk drives this is often the
473 * physical block size. For RAID arrays it is often the stripe chunk
474 * size. A properly aligned multiple of minimum_io_size is the
475 * preferred request size for workloads where a high number of I/O
476 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400477 */
478void blk_queue_io_min(struct request_queue *q, unsigned int min)
479{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400480 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400481}
482EXPORT_SYMBOL(blk_queue_io_min);
483
484/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200485 * blk_limits_io_opt - set optimal request size for a device
486 * @limits: the queue limits
487 * @opt: smallest I/O size in bytes
488 *
489 * Description:
490 * 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.
496 */
497void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
498{
499 limits->io_opt = opt;
500}
501EXPORT_SYMBOL(blk_limits_io_opt);
502
503/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400504 * blk_queue_io_opt - set optimal request size for the queue
505 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700506 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400507 *
508 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400509 * Storage devices may report an optimal I/O size, which is the
510 * device's preferred unit for sustained I/O. This is rarely reported
511 * for disk drives. For RAID arrays it is usually the stripe width or
512 * the internal track size. A properly aligned multiple of
513 * optimal_io_size is the preferred request size for workloads where
514 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400515 */
516void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
517{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200518 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400519}
520EXPORT_SYMBOL(blk_queue_io_opt);
521
Jens Axboe86db1e22008-01-29 14:53:40 +0100522/**
523 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
524 * @t: the stacking driver (top)
525 * @b: the underlying device (bottom)
526 **/
527void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
528{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400529 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100530}
Jens Axboe86db1e22008-01-29 14:53:40 +0100531EXPORT_SYMBOL(blk_queue_stack_limits);
532
533/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400534 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100535 * @t: the stacking driver limits (top device)
536 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500537 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400538 *
539 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100540 * This function is used by stacking drivers like MD and DM to ensure
541 * that all component devices have compatible block sizes and
542 * alignments. The stacking driver must provide a queue_limits
543 * struct (top) and then iteratively call the stacking function for
544 * all component (bottom) devices. The stacking function will
545 * attempt to combine the values and ensure proper alignment.
546 *
547 * Returns 0 if the top and bottom queue_limits are compatible. The
548 * top device's block sizes and alignment offsets may be adjusted to
549 * ensure alignment with the bottom device. If no compatible sizes
550 * and alignments exist, -1 is returned and the resulting top
551 * queue_limits will have the misaligned flag set to indicate that
552 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400553 */
554int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500555 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400556{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500557 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100558
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400559 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
560 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500561 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400562 t->max_write_same_sectors = min(t->max_write_same_sectors,
563 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800564 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
565 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200566 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400567
568 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
569 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700570 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
571 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400572
Martin K. Petersen8a783622010-02-26 00:20:39 -0500573 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100574 t->max_discard_segments = min_not_zero(t->max_discard_segments,
575 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200576 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
577 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400578
579 t->max_segment_size = min_not_zero(t->max_segment_size,
580 b->max_segment_size);
581
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500582 t->misaligned |= b->misaligned;
583
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500584 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100585
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100586 /* Bottom device has different alignment. Check that it is
587 * compatible with the current top alignment.
588 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100589 if (t->alignment_offset != alignment) {
590
591 top = max(t->physical_block_size, t->io_min)
592 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100593 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100594
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100595 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400596 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100597 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500598 ret = -1;
599 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100600 }
601
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400602 t->logical_block_size = max(t->logical_block_size,
603 b->logical_block_size);
604
605 t->physical_block_size = max(t->physical_block_size,
606 b->physical_block_size);
607
608 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400609 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100610
Martin K. Petersene692cb62010-12-01 19:41:49 +0100611 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100612 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400613
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100614 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100615 if (t->physical_block_size & (t->logical_block_size - 1)) {
616 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400617 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500618 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100619 }
620
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100621 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100622 if (t->io_min & (t->physical_block_size - 1)) {
623 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400624 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500625 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400626 }
627
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100628 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100629 if (t->io_opt & (t->physical_block_size - 1)) {
630 t->io_opt = 0;
631 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500632 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100633 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400634
Kent Overstreetc78afc62013-07-11 22:39:53 -0700635 t->raid_partial_stripes_expensive =
636 max(t->raid_partial_stripes_expensive,
637 b->raid_partial_stripes_expensive);
638
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100639 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400640 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400641 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400642
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100643 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500644 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100645 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500646 ret = -1;
647 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100648
649 /* Discard alignment and granularity */
650 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500651 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100652
653 if (t->discard_granularity != 0 &&
654 t->discard_alignment != alignment) {
655 top = t->discard_granularity + t->discard_alignment;
656 bottom = b->discard_granularity + alignment;
657
658 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800659 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100660 t->discard_misaligned = 1;
661 }
662
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100663 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
664 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600665 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
666 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100667 t->discard_granularity = max(t->discard_granularity,
668 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400669 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800670 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100671 }
672
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900673 if (b->chunk_sectors)
674 t->chunk_sectors = min_not_zero(t->chunk_sectors,
675 b->chunk_sectors);
676
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500677 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400678}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200679EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400680
681/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500682 * bdev_stack_limits - adjust queue limits for stacked drivers
683 * @t: the stacking driver limits (top device)
684 * @bdev: the component block_device (bottom)
685 * @start: first data sector within component device
686 *
687 * Description:
688 * Merges queue limits for a top device and a block_device. Returns
689 * 0 if alignment didn't change. Returns -1 if adding the bottom
690 * device caused misalignment.
691 */
692int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
693 sector_t start)
694{
695 struct request_queue *bq = bdev_get_queue(bdev);
696
697 start += get_start_sect(bdev);
698
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500699 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500700}
701EXPORT_SYMBOL(bdev_stack_limits);
702
703/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400704 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200705 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400706 * @bdev: the underlying block device (bottom)
707 * @offset: offset to beginning of data within component device
708 *
709 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500710 * Merges the limits for a top level gendisk and a bottom level
711 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400712 */
713void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
714 sector_t offset)
715{
716 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400717
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500718 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400719 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
720
721 disk_name(disk, 0, top);
722 bdevname(bdev, bottom);
723
724 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
725 top, bottom);
726 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400727}
728EXPORT_SYMBOL(disk_stack_limits);
729
730/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100731 * blk_queue_dma_pad - set pad mask
732 * @q: the request queue for the device
733 * @mask: pad mask
734 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200735 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100736 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200737 * Appending pad buffer to a request modifies the last entry of a
738 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100739 **/
740void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
741{
742 q->dma_pad_mask = mask;
743}
744EXPORT_SYMBOL(blk_queue_dma_pad);
745
746/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200747 * blk_queue_update_dma_pad - update pad mask
748 * @q: the request queue for the device
749 * @mask: pad mask
750 *
751 * Update dma pad mask.
752 *
753 * Appending pad buffer to a request modifies the last entry of a
754 * scatter list such that it includes the pad buffer.
755 **/
756void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
757{
758 if (mask > q->dma_pad_mask)
759 q->dma_pad_mask = mask;
760}
761EXPORT_SYMBOL(blk_queue_update_dma_pad);
762
763/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100764 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100765 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100766 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100767 * @buf: physically contiguous buffer
768 * @size: size of the buffer in bytes
769 *
770 * Some devices have excess DMA problems and can't simply discard (or
771 * zero fill) the unwanted piece of the transfer. They have to have a
772 * real area of memory to transfer it into. The use case for this is
773 * ATAPI devices in DMA mode. If the packet command causes a transfer
774 * bigger than the transfer size some HBAs will lock up if there
775 * aren't DMA elements to contain the excess transfer. What this API
776 * does is adjust the queue so that the buf is always appended
777 * silently to the scatterlist.
778 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500779 * Note: This routine adjusts max_hw_segments to make room for appending
780 * the drain buffer. If you call blk_queue_max_segments() after calling
781 * this routine, you must set the limit to one fewer than your device
782 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100783 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100784int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100785 dma_drain_needed_fn *dma_drain_needed,
786 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100787{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500788 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100789 return -EINVAL;
790 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500791 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100792 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100793 q->dma_drain_buffer = buf;
794 q->dma_drain_size = size;
795
796 return 0;
797}
Jens Axboe86db1e22008-01-29 14:53:40 +0100798EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
799
800/**
801 * blk_queue_segment_boundary - set boundary rules for segment merging
802 * @q: the request queue for the device
803 * @mask: the memory boundary mask
804 **/
805void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
806{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300807 if (mask < PAGE_SIZE - 1) {
808 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700809 printk(KERN_INFO "%s: set to minimum %lx\n",
810 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100811 }
812
Martin K. Petersen025146e2009-05-22 17:17:51 -0400813 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100814}
Jens Axboe86db1e22008-01-29 14:53:40 +0100815EXPORT_SYMBOL(blk_queue_segment_boundary);
816
817/**
Keith Busch03100aa2015-08-19 14:24:05 -0700818 * blk_queue_virt_boundary - set boundary rules for bio merging
819 * @q: the request queue for the device
820 * @mask: the memory boundary mask
821 **/
822void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
823{
824 q->limits.virt_boundary_mask = mask;
825}
826EXPORT_SYMBOL(blk_queue_virt_boundary);
827
828/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100829 * blk_queue_dma_alignment - set dma length and memory alignment
830 * @q: the request queue for the device
831 * @mask: alignment mask
832 *
833 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200834 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100835 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100836 *
837 **/
838void blk_queue_dma_alignment(struct request_queue *q, int mask)
839{
840 q->dma_alignment = mask;
841}
Jens Axboe86db1e22008-01-29 14:53:40 +0100842EXPORT_SYMBOL(blk_queue_dma_alignment);
843
844/**
845 * blk_queue_update_dma_alignment - update dma length and memory alignment
846 * @q: the request queue for the device
847 * @mask: alignment mask
848 *
849 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200850 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100851 * If the requested alignment is larger than the current alignment, then
852 * the current queue alignment is updated to the new value, otherwise it
853 * is left alone. The design of this is to allow multiple objects
854 * (driver, device, transport etc) to set their respective
855 * alignments without having them interfere.
856 *
857 **/
858void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
859{
860 BUG_ON(mask > PAGE_SIZE);
861
862 if (mask > q->dma_alignment)
863 q->dma_alignment = mask;
864}
Jens Axboe86db1e22008-01-29 14:53:40 +0100865EXPORT_SYMBOL(blk_queue_update_dma_alignment);
866
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600867void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
868{
Jens Axboec888a8f2016-04-13 13:33:19 -0600869 spin_lock_irq(q->queue_lock);
870 if (queueable)
871 clear_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
872 else
873 set_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
874 spin_unlock_irq(q->queue_lock);
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600875}
876EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
877
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600878/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600879 * blk_set_queue_depth - tell the block layer about the device queue depth
880 * @q: the request queue for the device
881 * @depth: queue depth
882 *
883 */
884void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
885{
886 q->queue_depth = depth;
Jens Axboe87760e52016-11-09 12:38:14 -0700887 wbt_set_queue_depth(q->rq_wb, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600888}
889EXPORT_SYMBOL(blk_set_queue_depth);
890
891/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600892 * blk_queue_write_cache - configure queue's write cache
893 * @q: the request queue for the device
894 * @wc: write back cache on or off
895 * @fua: device supports FUA writes, if true
896 *
897 * Tell the block layer about the write cache of @q.
898 */
899void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
900{
901 spin_lock_irq(q->queue_lock);
Jens Axboec888a8f2016-04-13 13:33:19 -0600902 if (wc)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600903 queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600904 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600905 queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600906 if (fua)
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600907 queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600908 else
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600909 queue_flag_clear(QUEUE_FLAG_FUA, q);
910 spin_unlock_irq(q->queue_lock);
Jens Axboe87760e52016-11-09 12:38:14 -0700911
912 wbt_set_write_cache(q->rq_wb, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600913}
914EXPORT_SYMBOL_GPL(blk_queue_write_cache);
915
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200916static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100917{
918 blk_max_low_pfn = max_low_pfn - 1;
919 blk_max_pfn = max_pfn - 1;
920 return 0;
921}
922subsys_initcall(blk_settings_init);