blob: c3632fc6d54046566dad6a74835c99fdfb8be6ff [file] [log] [blame]
Christoph Hellwig3dcf60b2019-04-30 14:42:43 -04001// SPDX-License-Identifier: GPL-2.0
Jens Axboe86db1e22008-01-29 14:53:40 +01002/*
3 * Functions related to setting various queue properties from drivers
4 */
5#include <linux/kernel.h>
6#include <linux/module.h>
7#include <linux/init.h>
8#include <linux/bio.h>
9#include <linux/blkdev.h>
Mike Rapoport57c8a662018-10-30 15:09:49 -070010#include <linux/memblock.h> /* for max_pfn/max_low_pfn */
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -040011#include <linux/gcd.h>
Martin K. Petersen2cda2722010-03-15 12:46:51 +010012#include <linux/lcm.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010013#include <linux/jiffies.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090014#include <linux/gfp.h>
Yoshihiro Shimoda45147fb2019-08-28 21:35:42 +090015#include <linux/dma-mapping.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010016
17#include "blk.h"
Jens Axboe87760e52016-11-09 12:38:14 -070018#include "blk-wbt.h"
Jens Axboe86db1e22008-01-29 14:53:40 +010019
Jens Axboe6728cb02008-01-31 13:03:55 +010020unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010021EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010022
23unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010024
Jens Axboe242f9dc2008-09-14 05:55:09 -070025void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
26{
27 q->rq_timeout = timeout;
28}
29EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
30
Jens Axboe86db1e22008-01-29 14:53:40 +010031/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020032 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020033 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020034 *
35 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010036 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020037 */
38void blk_set_default_limits(struct queue_limits *lim)
39{
Martin K. Petersen8a783622010-02-26 00:20:39 -050040 lim->max_segments = BLK_MAX_SEGMENTS;
Christoph Hellwig1e739732017-02-08 14:46:49 +010041 lim->max_discard_segments = 1;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020042 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020043 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070044 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050045 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070046 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
47 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060048 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040049 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080050 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010051 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -060052 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010053 lim->discard_granularity = 0;
54 lim->discard_alignment = 0;
55 lim->discard_misaligned = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020056 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +020057 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +020058 lim->alignment_offset = 0;
59 lim->io_opt = 0;
60 lim->misaligned = 0;
Damien Le Moal797476b2016-10-18 15:40:29 +090061 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +020062}
63EXPORT_SYMBOL(blk_set_default_limits);
64
65/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010066 * blk_set_stacking_limits - set default limits for stacking devices
67 * @lim: the queue_limits structure to reset
68 *
69 * Description:
70 * Returns a queue_limit struct to its default state. Should be used
71 * by stacking drivers like DM that have no internal limits.
72 */
73void blk_set_stacking_limits(struct queue_limits *lim)
74{
75 blk_set_default_limits(lim);
76
77 /* Inherit limits from component devices */
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010078 lim->max_segments = USHRT_MAX;
Mike Snitzer42c9cdf2018-07-20 14:57:38 -040079 lim->max_discard_segments = USHRT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010080 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -060081 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +020082 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -050083 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040084 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080085 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010086}
87EXPORT_SYMBOL(blk_set_stacking_limits);
88
89/**
Jens Axboe86db1e22008-01-29 14:53:40 +010090 * blk_queue_make_request - define an alternate make_request function for a device
91 * @q: the request queue for the device to be affected
92 * @mfn: the alternate make_request function
93 *
94 * Description:
95 * The normal way for &struct bios to be passed to a device
96 * driver is for them to be collected into requests on a request
97 * queue, and then to allow the device driver to select requests
98 * off that queue when it is ready. This works well for many block
99 * devices. However some block devices (typically virtual devices
100 * such as md or lvm) do not benefit from the processing on the
101 * request queue, and are served best by having the requests passed
102 * directly to them. This can be achieved by providing a function
103 * to blk_queue_make_request().
104 *
105 * Caveat:
106 * The driver that does this *must* be able to deal appropriately
107 * with buffers in "highmemory". This can be accomplished by either calling
Christoph Hellwigd004a5e72017-11-08 19:13:48 +0100108 * kmap_atomic() to get a temporary kernel mapping, or by calling
Jens Axboe86db1e22008-01-29 14:53:40 +0100109 * blk_queue_bounce() to create a buffer in normal memory.
110 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100111void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100112{
113 /*
114 * set defaults
115 */
116 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100117
Jens Axboe86db1e22008-01-29 14:53:40 +0100118 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100119 blk_queue_dma_alignment(q, 511);
Jens Axboe86db1e22008-01-29 14:53:40 +0100120
Martin K. Petersene475bba2009-06-16 08:23:52 +0200121 blk_set_default_limits(&q->limits);
Jens Axboe86db1e22008-01-29 14:53:40 +0100122}
Jens Axboe86db1e22008-01-29 14:53:40 +0100123EXPORT_SYMBOL(blk_queue_make_request);
124
125/**
126 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900127 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100128 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100129 *
130 * Description:
131 * Different hardware can have different requirements as to what pages
132 * it can do I/O directly to. A low level driver can call
133 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100134 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100135 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100136void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100137{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100138 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100139 int dma = 0;
140
141 q->bounce_gfp = GFP_NOIO;
142#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900143 /*
144 * Assume anything <= 4GB can be handled by IOMMU. Actually
145 * some IOMMUs can handle everything, but I don't know of a
146 * way to test this here.
147 */
148 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100149 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200150 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100151#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100152 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100153 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200154 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200155#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100156 if (dma) {
157 init_emergency_isa_pool();
158 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200159 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100160 }
161}
Jens Axboe86db1e22008-01-29 14:53:40 +0100162EXPORT_SYMBOL(blk_queue_bounce_limit);
163
164/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500165 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
166 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500167 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100168 *
169 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500170 * Enables a low level driver to set a hard upper limit,
171 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400172 * the device driver based upon the capabilities of the I/O
173 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500174 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500175 * max_dev_sectors is a hard limit imposed by the storage device for
176 * READ/WRITE requests. It is set by the disk driver.
177 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500178 * max_sectors is a soft limit imposed by the block layer for
179 * filesystem type requests. This value can be overridden on a
180 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
181 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100182 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500183void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100184{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500185 struct queue_limits *limits = &q->limits;
186 unsigned int max_sectors;
187
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300188 if ((max_hw_sectors << 9) < PAGE_SIZE) {
189 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700190 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500191 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100192 }
193
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400194 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500195 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
196 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
197 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100198 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100199}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500200EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100201
202/**
Jens Axboe762380a2014-06-05 13:38:39 -0600203 * blk_queue_chunk_sectors - set size of the chunk for this queue
204 * @q: the request queue for the device
205 * @chunk_sectors: chunk sectors in the usual 512b unit
206 *
207 * Description:
208 * If a driver doesn't want IOs to cross a given chunk size, it can set
209 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600210 * must currently be a power-of-2 in sectors. Also note that the block
211 * layer must accept a page worth of data at any offset. So if the
212 * crossing of chunks is a hard limitation in the driver, it must still be
213 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600214 **/
215void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
216{
217 BUG_ON(!is_power_of_2(chunk_sectors));
218 q->limits.chunk_sectors = chunk_sectors;
219}
220EXPORT_SYMBOL(blk_queue_chunk_sectors);
221
222/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200223 * blk_queue_max_discard_sectors - set max sectors for a single discard
224 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200225 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200226 **/
227void blk_queue_max_discard_sectors(struct request_queue *q,
228 unsigned int max_discard_sectors)
229{
Jens Axboe0034af02015-07-16 09:14:26 -0600230 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200231 q->limits.max_discard_sectors = max_discard_sectors;
232}
233EXPORT_SYMBOL(blk_queue_max_discard_sectors);
234
235/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400236 * blk_queue_max_write_same_sectors - set max sectors for a single write same
237 * @q: the request queue for the device
238 * @max_write_same_sectors: maximum number of sectors to write per command
239 **/
240void blk_queue_max_write_same_sectors(struct request_queue *q,
241 unsigned int max_write_same_sectors)
242{
243 q->limits.max_write_same_sectors = max_write_same_sectors;
244}
245EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
246
247/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800248 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
249 * write zeroes
250 * @q: the request queue for the device
251 * @max_write_zeroes_sectors: maximum number of sectors to write per command
252 **/
253void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
254 unsigned int max_write_zeroes_sectors)
255{
256 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
257}
258EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
259
260/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500261 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100262 * @q: the request queue for the device
263 * @max_segments: max number of segments
264 *
265 * Description:
266 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500267 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100268 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500269void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100270{
271 if (!max_segments) {
272 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700273 printk(KERN_INFO "%s: set to minimum %d\n",
274 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100275 }
276
Martin K. Petersen8a783622010-02-26 00:20:39 -0500277 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100278}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500279EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100280
281/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100282 * blk_queue_max_discard_segments - set max segments for discard requests
283 * @q: the request queue for the device
284 * @max_segments: max number of segments
285 *
286 * Description:
287 * Enables a low level driver to set an upper limit on the number of
288 * segments in a discard request.
289 **/
290void blk_queue_max_discard_segments(struct request_queue *q,
291 unsigned short max_segments)
292{
293 q->limits.max_discard_segments = max_segments;
294}
295EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
296
297/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100298 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
299 * @q: the request queue for the device
300 * @max_size: max size of segment in bytes
301 *
302 * Description:
303 * Enables a low level driver to set an upper limit on the size of a
304 * coalesced segment
305 **/
306void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
307{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300308 if (max_size < PAGE_SIZE) {
309 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700310 printk(KERN_INFO "%s: set to minimum %d\n",
311 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100312 }
313
Christoph Hellwig09324d32019-05-21 09:01:41 +0200314 /* see blk_queue_virt_boundary() for the explanation */
315 WARN_ON_ONCE(q->limits.virt_boundary_mask);
316
Martin K. Petersen025146e2009-05-22 17:17:51 -0400317 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100318}
Jens Axboe86db1e22008-01-29 14:53:40 +0100319EXPORT_SYMBOL(blk_queue_max_segment_size);
320
321/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400322 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100323 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400324 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100325 *
326 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400327 * This should be set to the lowest possible block size that the
328 * storage device can address. The default of 512 covers most
329 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100330 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400331void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100332{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400333 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400334
335 if (q->limits.physical_block_size < size)
336 q->limits.physical_block_size = size;
337
338 if (q->limits.io_min < q->limits.physical_block_size)
339 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100340}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400341EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100342
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400343/**
344 * blk_queue_physical_block_size - set physical block size for the queue
345 * @q: the request queue for the device
346 * @size: the physical block size, in bytes
347 *
348 * Description:
349 * This should be set to the lowest possible sector size that the
350 * hardware can operate on without reverting to read-modify-write
351 * operations.
352 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200353void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400354{
355 q->limits.physical_block_size = size;
356
357 if (q->limits.physical_block_size < q->limits.logical_block_size)
358 q->limits.physical_block_size = q->limits.logical_block_size;
359
360 if (q->limits.io_min < q->limits.physical_block_size)
361 q->limits.io_min = q->limits.physical_block_size;
362}
363EXPORT_SYMBOL(blk_queue_physical_block_size);
364
365/**
366 * blk_queue_alignment_offset - set physical block alignment offset
367 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700368 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400369 *
370 * Description:
371 * Some devices are naturally misaligned to compensate for things like
372 * the legacy DOS partition table 63-sector offset. Low-level drivers
373 * should call this function for devices whose first sector is not
374 * naturally aligned.
375 */
376void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
377{
378 q->limits.alignment_offset =
379 offset & (q->limits.physical_block_size - 1);
380 q->limits.misaligned = 0;
381}
382EXPORT_SYMBOL(blk_queue_alignment_offset);
383
384/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400385 * blk_limits_io_min - set minimum request size for a device
386 * @limits: the queue limits
387 * @min: smallest I/O size in bytes
388 *
389 * Description:
390 * Some devices have an internal block size bigger than the reported
391 * hardware sector size. This function can be used to signal the
392 * smallest I/O the device can perform without incurring a performance
393 * penalty.
394 */
395void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
396{
397 limits->io_min = min;
398
399 if (limits->io_min < limits->logical_block_size)
400 limits->io_min = limits->logical_block_size;
401
402 if (limits->io_min < limits->physical_block_size)
403 limits->io_min = limits->physical_block_size;
404}
405EXPORT_SYMBOL(blk_limits_io_min);
406
407/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400408 * blk_queue_io_min - set minimum request size for the queue
409 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700410 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400411 *
412 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400413 * Storage devices may report a granularity or preferred minimum I/O
414 * size which is the smallest request the device can perform without
415 * incurring a performance penalty. For disk drives this is often the
416 * physical block size. For RAID arrays it is often the stripe chunk
417 * size. A properly aligned multiple of minimum_io_size is the
418 * preferred request size for workloads where a high number of I/O
419 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400420 */
421void blk_queue_io_min(struct request_queue *q, unsigned int min)
422{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400423 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400424}
425EXPORT_SYMBOL(blk_queue_io_min);
426
427/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200428 * blk_limits_io_opt - set optimal request size for a device
429 * @limits: the queue limits
430 * @opt: smallest I/O size in bytes
431 *
432 * Description:
433 * Storage devices may report an optimal I/O size, which is the
434 * device's preferred unit for sustained I/O. This is rarely reported
435 * for disk drives. For RAID arrays it is usually the stripe width or
436 * the internal track size. A properly aligned multiple of
437 * optimal_io_size is the preferred request size for workloads where
438 * sustained throughput is desired.
439 */
440void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
441{
442 limits->io_opt = opt;
443}
444EXPORT_SYMBOL(blk_limits_io_opt);
445
446/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400447 * blk_queue_io_opt - set optimal request size for the queue
448 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700449 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400450 *
451 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400452 * Storage devices may report an optimal I/O size, which is the
453 * device's preferred unit for sustained I/O. This is rarely reported
454 * for disk drives. For RAID arrays it is usually the stripe width or
455 * the internal track size. A properly aligned multiple of
456 * optimal_io_size is the preferred request size for workloads where
457 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400458 */
459void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
460{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200461 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400462}
463EXPORT_SYMBOL(blk_queue_io_opt);
464
Jens Axboe86db1e22008-01-29 14:53:40 +0100465/**
466 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
467 * @t: the stacking driver (top)
468 * @b: the underlying device (bottom)
469 **/
470void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
471{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400472 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100473}
Jens Axboe86db1e22008-01-29 14:53:40 +0100474EXPORT_SYMBOL(blk_queue_stack_limits);
475
476/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400477 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100478 * @t: the stacking driver limits (top device)
479 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500480 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400481 *
482 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100483 * This function is used by stacking drivers like MD and DM to ensure
484 * that all component devices have compatible block sizes and
485 * alignments. The stacking driver must provide a queue_limits
486 * struct (top) and then iteratively call the stacking function for
487 * all component (bottom) devices. The stacking function will
488 * attempt to combine the values and ensure proper alignment.
489 *
490 * Returns 0 if the top and bottom queue_limits are compatible. The
491 * top device's block sizes and alignment offsets may be adjusted to
492 * ensure alignment with the bottom device. If no compatible sizes
493 * and alignments exist, -1 is returned and the resulting top
494 * queue_limits will have the misaligned flag set to indicate that
495 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400496 */
497int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500498 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400499{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500500 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100501
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400502 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
503 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500504 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400505 t->max_write_same_sectors = min(t->max_write_same_sectors,
506 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800507 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
508 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200509 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400510
511 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
512 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700513 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
514 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400515
Martin K. Petersen8a783622010-02-26 00:20:39 -0500516 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100517 t->max_discard_segments = min_not_zero(t->max_discard_segments,
518 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200519 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
520 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400521
522 t->max_segment_size = min_not_zero(t->max_segment_size,
523 b->max_segment_size);
524
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500525 t->misaligned |= b->misaligned;
526
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500527 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100528
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100529 /* Bottom device has different alignment. Check that it is
530 * compatible with the current top alignment.
531 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100532 if (t->alignment_offset != alignment) {
533
534 top = max(t->physical_block_size, t->io_min)
535 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100536 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100537
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100538 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400539 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100540 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500541 ret = -1;
542 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100543 }
544
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400545 t->logical_block_size = max(t->logical_block_size,
546 b->logical_block_size);
547
548 t->physical_block_size = max(t->physical_block_size,
549 b->physical_block_size);
550
551 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400552 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100553
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100554 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100555 if (t->physical_block_size & (t->logical_block_size - 1)) {
556 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400557 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500558 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100559 }
560
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100561 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100562 if (t->io_min & (t->physical_block_size - 1)) {
563 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400564 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500565 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400566 }
567
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100568 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100569 if (t->io_opt & (t->physical_block_size - 1)) {
570 t->io_opt = 0;
571 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500572 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100573 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400574
Kent Overstreetc78afc62013-07-11 22:39:53 -0700575 t->raid_partial_stripes_expensive =
576 max(t->raid_partial_stripes_expensive,
577 b->raid_partial_stripes_expensive);
578
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100579 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400580 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400581 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400582
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100583 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500584 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100585 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500586 ret = -1;
587 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100588
589 /* Discard alignment and granularity */
590 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500591 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100592
593 if (t->discard_granularity != 0 &&
594 t->discard_alignment != alignment) {
595 top = t->discard_granularity + t->discard_alignment;
596 bottom = b->discard_granularity + alignment;
597
598 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800599 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100600 t->discard_misaligned = 1;
601 }
602
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100603 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
604 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600605 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
606 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100607 t->discard_granularity = max(t->discard_granularity,
608 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400609 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800610 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100611 }
612
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900613 if (b->chunk_sectors)
614 t->chunk_sectors = min_not_zero(t->chunk_sectors,
615 b->chunk_sectors);
616
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500617 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400618}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200619EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400620
621/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500622 * bdev_stack_limits - adjust queue limits for stacked drivers
623 * @t: the stacking driver limits (top device)
624 * @bdev: the component block_device (bottom)
625 * @start: first data sector within component device
626 *
627 * Description:
628 * Merges queue limits for a top device and a block_device. Returns
629 * 0 if alignment didn't change. Returns -1 if adding the bottom
630 * device caused misalignment.
631 */
632int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
633 sector_t start)
634{
635 struct request_queue *bq = bdev_get_queue(bdev);
636
637 start += get_start_sect(bdev);
638
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500639 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500640}
641EXPORT_SYMBOL(bdev_stack_limits);
642
643/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400644 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200645 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400646 * @bdev: the underlying block device (bottom)
647 * @offset: offset to beginning of data within component device
648 *
649 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500650 * Merges the limits for a top level gendisk and a bottom level
651 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400652 */
653void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
654 sector_t offset)
655{
656 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400657
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500658 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400659 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
660
661 disk_name(disk, 0, top);
662 bdevname(bdev, bottom);
663
664 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
665 top, bottom);
666 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400667}
668EXPORT_SYMBOL(disk_stack_limits);
669
670/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200671 * blk_queue_update_dma_pad - update pad mask
672 * @q: the request queue for the device
673 * @mask: pad mask
674 *
675 * Update dma pad mask.
676 *
677 * Appending pad buffer to a request modifies the last entry of a
678 * scatter list such that it includes the pad buffer.
679 **/
680void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
681{
682 if (mask > q->dma_pad_mask)
683 q->dma_pad_mask = mask;
684}
685EXPORT_SYMBOL(blk_queue_update_dma_pad);
686
687/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100688 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100689 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100690 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100691 * @buf: physically contiguous buffer
692 * @size: size of the buffer in bytes
693 *
694 * Some devices have excess DMA problems and can't simply discard (or
695 * zero fill) the unwanted piece of the transfer. They have to have a
696 * real area of memory to transfer it into. The use case for this is
697 * ATAPI devices in DMA mode. If the packet command causes a transfer
698 * bigger than the transfer size some HBAs will lock up if there
699 * aren't DMA elements to contain the excess transfer. What this API
700 * does is adjust the queue so that the buf is always appended
701 * silently to the scatterlist.
702 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500703 * Note: This routine adjusts max_hw_segments to make room for appending
704 * the drain buffer. If you call blk_queue_max_segments() after calling
705 * this routine, you must set the limit to one fewer than your device
706 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100707 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100708int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100709 dma_drain_needed_fn *dma_drain_needed,
710 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100711{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500712 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100713 return -EINVAL;
714 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500715 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100716 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100717 q->dma_drain_buffer = buf;
718 q->dma_drain_size = size;
719
720 return 0;
721}
Jens Axboe86db1e22008-01-29 14:53:40 +0100722EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
723
724/**
725 * blk_queue_segment_boundary - set boundary rules for segment merging
726 * @q: the request queue for the device
727 * @mask: the memory boundary mask
728 **/
729void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
730{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300731 if (mask < PAGE_SIZE - 1) {
732 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700733 printk(KERN_INFO "%s: set to minimum %lx\n",
734 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100735 }
736
Martin K. Petersen025146e2009-05-22 17:17:51 -0400737 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100738}
Jens Axboe86db1e22008-01-29 14:53:40 +0100739EXPORT_SYMBOL(blk_queue_segment_boundary);
740
741/**
Keith Busch03100aa2015-08-19 14:24:05 -0700742 * blk_queue_virt_boundary - set boundary rules for bio merging
743 * @q: the request queue for the device
744 * @mask: the memory boundary mask
745 **/
746void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
747{
748 q->limits.virt_boundary_mask = mask;
Christoph Hellwig09324d32019-05-21 09:01:41 +0200749
750 /*
751 * Devices that require a virtual boundary do not support scatter/gather
752 * I/O natively, but instead require a descriptor list entry for each
753 * page (which might not be idential to the Linux PAGE_SIZE). Because
754 * of that they are not limited by our notion of "segment size".
755 */
Christoph Hellwigc6c84f72019-07-24 18:26:56 +0200756 if (mask)
757 q->limits.max_segment_size = UINT_MAX;
Keith Busch03100aa2015-08-19 14:24:05 -0700758}
759EXPORT_SYMBOL(blk_queue_virt_boundary);
760
761/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100762 * blk_queue_dma_alignment - set dma length and memory alignment
763 * @q: the request queue for the device
764 * @mask: alignment mask
765 *
766 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200767 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100768 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100769 *
770 **/
771void blk_queue_dma_alignment(struct request_queue *q, int mask)
772{
773 q->dma_alignment = mask;
774}
Jens Axboe86db1e22008-01-29 14:53:40 +0100775EXPORT_SYMBOL(blk_queue_dma_alignment);
776
777/**
778 * blk_queue_update_dma_alignment - update dma length and memory alignment
779 * @q: the request queue for the device
780 * @mask: alignment mask
781 *
782 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200783 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100784 * If the requested alignment is larger than the current alignment, then
785 * the current queue alignment is updated to the new value, otherwise it
786 * is left alone. The design of this is to allow multiple objects
787 * (driver, device, transport etc) to set their respective
788 * alignments without having them interfere.
789 *
790 **/
791void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
792{
793 BUG_ON(mask > PAGE_SIZE);
794
795 if (mask > q->dma_alignment)
796 q->dma_alignment = mask;
797}
Jens Axboe86db1e22008-01-29 14:53:40 +0100798EXPORT_SYMBOL(blk_queue_update_dma_alignment);
799
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600800/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600801 * blk_set_queue_depth - tell the block layer about the device queue depth
802 * @q: the request queue for the device
803 * @depth: queue depth
804 *
805 */
806void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
807{
808 q->queue_depth = depth;
Josef Bacika7905042018-07-03 09:32:35 -0600809 wbt_set_queue_depth(q, depth);
Jens Axboed278d4a2016-03-30 10:21:08 -0600810}
811EXPORT_SYMBOL(blk_set_queue_depth);
812
813/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600814 * blk_queue_write_cache - configure queue's write cache
815 * @q: the request queue for the device
816 * @wc: write back cache on or off
817 * @fua: device supports FUA writes, if true
818 *
819 * Tell the block layer about the write cache of @q.
820 */
821void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
822{
Jens Axboec888a8f2016-04-13 13:33:19 -0600823 if (wc)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100824 blk_queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600825 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100826 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600827 if (fua)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100828 blk_queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600829 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100830 blk_queue_flag_clear(QUEUE_FLAG_FUA, q);
Jens Axboe87760e52016-11-09 12:38:14 -0700831
Josef Bacika7905042018-07-03 09:32:35 -0600832 wbt_set_write_cache(q, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600833}
834EXPORT_SYMBOL_GPL(blk_queue_write_cache);
835
Yoshihiro Shimoda45147fb2019-08-28 21:35:42 +0900836/**
837 * blk_queue_can_use_dma_map_merging - configure queue for merging segments.
838 * @q: the request queue for the device
839 * @dev: the device pointer for dma
840 *
841 * Tell the block layer about merging the segments by dma map of @q.
842 */
843bool blk_queue_can_use_dma_map_merging(struct request_queue *q,
844 struct device *dev)
845{
846 unsigned long boundary = dma_get_merge_boundary(dev);
847
848 if (!boundary)
849 return false;
850
851 /* No need to update max_segment_size. see blk_queue_virt_boundary() */
852 blk_queue_virt_boundary(q, boundary);
853
854 return true;
855}
856EXPORT_SYMBOL_GPL(blk_queue_can_use_dma_map_merging);
857
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200858static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100859{
860 blk_max_low_pfn = max_low_pfn - 1;
861 blk_max_pfn = max_pfn - 1;
862 return 0;
863}
864subsys_initcall(blk_settings_init);