blob: 6bd1e3b082d8e811da833070c4813a41bcfa11c4 [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>
Jens Axboe86db1e22008-01-29 14:53:40 +010015
16#include "blk.h"
Jens Axboe87760e52016-11-09 12:38:14 -070017#include "blk-wbt.h"
Jens Axboe86db1e22008-01-29 14:53:40 +010018
Jens Axboe6728cb02008-01-31 13:03:55 +010019unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010020EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010021
22unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010023
Jens Axboe242f9dc2008-09-14 05:55:09 -070024void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
25{
26 q->rq_timeout = timeout;
27}
28EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
29
Jens Axboe86db1e22008-01-29 14:53:40 +010030/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020031 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020032 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020033 *
34 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010035 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020036 */
37void blk_set_default_limits(struct queue_limits *lim)
38{
Martin K. Petersen8a783622010-02-26 00:20:39 -050039 lim->max_segments = BLK_MAX_SEGMENTS;
Christoph Hellwig1e739732017-02-08 14:46:49 +010040 lim->max_discard_segments = 1;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020041 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020042 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Keith Busch03100aa2015-08-19 14:24:05 -070043 lim->virt_boundary_mask = 0;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050044 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Keith Busch5f009d32016-02-10 16:52:47 -070045 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
46 lim->max_dev_sectors = 0;
Jens Axboe762380a2014-06-05 13:38:39 -060047 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040048 lim->max_write_same_sectors = 0;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080049 lim->max_write_zeroes_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010050 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -060051 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010052 lim->discard_granularity = 0;
53 lim->discard_alignment = 0;
54 lim->discard_misaligned = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020055 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +020056 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +020057 lim->alignment_offset = 0;
58 lim->io_opt = 0;
59 lim->misaligned = 0;
Damien Le Moal797476b2016-10-18 15:40:29 +090060 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +020061}
62EXPORT_SYMBOL(blk_set_default_limits);
63
64/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010065 * blk_set_stacking_limits - set default limits for stacking devices
66 * @lim: the queue_limits structure to reset
67 *
68 * Description:
69 * Returns a queue_limit struct to its default state. Should be used
70 * by stacking drivers like DM that have no internal limits.
71 */
72void blk_set_stacking_limits(struct queue_limits *lim)
73{
74 blk_set_default_limits(lim);
75
76 /* Inherit limits from component devices */
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010077 lim->max_segments = USHRT_MAX;
Mike Snitzer42c9cdf2018-07-20 14:57:38 -040078 lim->max_discard_segments = USHRT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010079 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -060080 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +020081 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -050082 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040083 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080084 lim->max_write_zeroes_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010085}
86EXPORT_SYMBOL(blk_set_stacking_limits);
87
88/**
Jens Axboe86db1e22008-01-29 14:53:40 +010089 * blk_queue_make_request - define an alternate make_request function for a device
90 * @q: the request queue for the device to be affected
91 * @mfn: the alternate make_request function
92 *
93 * Description:
94 * The normal way for &struct bios to be passed to a device
95 * driver is for them to be collected into requests on a request
96 * queue, and then to allow the device driver to select requests
97 * off that queue when it is ready. This works well for many block
98 * devices. However some block devices (typically virtual devices
99 * such as md or lvm) do not benefit from the processing on the
100 * request queue, and are served best by having the requests passed
101 * directly to them. This can be achieved by providing a function
102 * to blk_queue_make_request().
103 *
104 * Caveat:
105 * The driver that does this *must* be able to deal appropriately
106 * with buffers in "highmemory". This can be accomplished by either calling
Christoph Hellwigd004a5e72017-11-08 19:13:48 +0100107 * kmap_atomic() to get a temporary kernel mapping, or by calling
Jens Axboe86db1e22008-01-29 14:53:40 +0100108 * blk_queue_bounce() to create a buffer in normal memory.
109 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100110void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100111{
112 /*
113 * set defaults
114 */
115 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100116
Jens Axboe86db1e22008-01-29 14:53:40 +0100117 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100118 blk_queue_dma_alignment(q, 511);
Jens Axboe86db1e22008-01-29 14:53:40 +0100119
Martin K. Petersene475bba2009-06-16 08:23:52 +0200120 blk_set_default_limits(&q->limits);
Jens Axboe86db1e22008-01-29 14:53:40 +0100121}
Jens Axboe86db1e22008-01-29 14:53:40 +0100122EXPORT_SYMBOL(blk_queue_make_request);
123
124/**
125 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900126 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100127 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100128 *
129 * Description:
130 * Different hardware can have different requirements as to what pages
131 * it can do I/O directly to. A low level driver can call
132 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100133 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100134 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100135void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100136{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100137 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100138 int dma = 0;
139
140 q->bounce_gfp = GFP_NOIO;
141#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900142 /*
143 * Assume anything <= 4GB can be handled by IOMMU. Actually
144 * some IOMMUs can handle everything, but I don't know of a
145 * way to test this here.
146 */
147 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100148 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200149 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100150#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100151 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100152 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200153 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200154#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100155 if (dma) {
156 init_emergency_isa_pool();
157 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200158 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100159 }
160}
Jens Axboe86db1e22008-01-29 14:53:40 +0100161EXPORT_SYMBOL(blk_queue_bounce_limit);
162
163/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500164 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
165 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500166 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100167 *
168 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500169 * Enables a low level driver to set a hard upper limit,
170 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400171 * the device driver based upon the capabilities of the I/O
172 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500173 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500174 * max_dev_sectors is a hard limit imposed by the storage device for
175 * READ/WRITE requests. It is set by the disk driver.
176 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500177 * max_sectors is a soft limit imposed by the block layer for
178 * filesystem type requests. This value can be overridden on a
179 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
180 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100181 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500182void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100183{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500184 struct queue_limits *limits = &q->limits;
185 unsigned int max_sectors;
186
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300187 if ((max_hw_sectors << 9) < PAGE_SIZE) {
188 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700189 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500190 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100191 }
192
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400193 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500194 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
195 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
196 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100197 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100198}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500199EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100200
201/**
Jens Axboe762380a2014-06-05 13:38:39 -0600202 * blk_queue_chunk_sectors - set size of the chunk for this queue
203 * @q: the request queue for the device
204 * @chunk_sectors: chunk sectors in the usual 512b unit
205 *
206 * Description:
207 * If a driver doesn't want IOs to cross a given chunk size, it can set
208 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600209 * must currently be a power-of-2 in sectors. Also note that the block
210 * layer must accept a page worth of data at any offset. So if the
211 * crossing of chunks is a hard limitation in the driver, it must still be
212 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600213 **/
214void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
215{
216 BUG_ON(!is_power_of_2(chunk_sectors));
217 q->limits.chunk_sectors = chunk_sectors;
218}
219EXPORT_SYMBOL(blk_queue_chunk_sectors);
220
221/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200222 * blk_queue_max_discard_sectors - set max sectors for a single discard
223 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200224 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200225 **/
226void blk_queue_max_discard_sectors(struct request_queue *q,
227 unsigned int max_discard_sectors)
228{
Jens Axboe0034af02015-07-16 09:14:26 -0600229 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200230 q->limits.max_discard_sectors = max_discard_sectors;
231}
232EXPORT_SYMBOL(blk_queue_max_discard_sectors);
233
234/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400235 * blk_queue_max_write_same_sectors - set max sectors for a single write same
236 * @q: the request queue for the device
237 * @max_write_same_sectors: maximum number of sectors to write per command
238 **/
239void blk_queue_max_write_same_sectors(struct request_queue *q,
240 unsigned int max_write_same_sectors)
241{
242 q->limits.max_write_same_sectors = max_write_same_sectors;
243}
244EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
245
246/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800247 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
248 * write zeroes
249 * @q: the request queue for the device
250 * @max_write_zeroes_sectors: maximum number of sectors to write per command
251 **/
252void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
253 unsigned int max_write_zeroes_sectors)
254{
255 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
256}
257EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
258
259/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500260 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100261 * @q: the request queue for the device
262 * @max_segments: max number of segments
263 *
264 * Description:
265 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500266 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100267 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500268void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100269{
270 if (!max_segments) {
271 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700272 printk(KERN_INFO "%s: set to minimum %d\n",
273 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100274 }
275
Martin K. Petersen8a783622010-02-26 00:20:39 -0500276 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100277}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500278EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100279
280/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100281 * blk_queue_max_discard_segments - set max segments for discard requests
282 * @q: the request queue for the device
283 * @max_segments: max number of segments
284 *
285 * Description:
286 * Enables a low level driver to set an upper limit on the number of
287 * segments in a discard request.
288 **/
289void blk_queue_max_discard_segments(struct request_queue *q,
290 unsigned short max_segments)
291{
292 q->limits.max_discard_segments = max_segments;
293}
294EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
295
296/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100297 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
298 * @q: the request queue for the device
299 * @max_size: max size of segment in bytes
300 *
301 * Description:
302 * Enables a low level driver to set an upper limit on the size of a
303 * coalesced segment
304 **/
305void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
306{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300307 if (max_size < PAGE_SIZE) {
308 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700309 printk(KERN_INFO "%s: set to minimum %d\n",
310 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100311 }
312
Christoph Hellwig09324d32019-05-21 09:01:41 +0200313 /* see blk_queue_virt_boundary() for the explanation */
314 WARN_ON_ONCE(q->limits.virt_boundary_mask);
315
Martin K. Petersen025146e2009-05-22 17:17:51 -0400316 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100317}
Jens Axboe86db1e22008-01-29 14:53:40 +0100318EXPORT_SYMBOL(blk_queue_max_segment_size);
319
320/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400321 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100322 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400323 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100324 *
325 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400326 * This should be set to the lowest possible block size that the
327 * storage device can address. The default of 512 covers most
328 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100329 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400330void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100331{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400332 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400333
334 if (q->limits.physical_block_size < size)
335 q->limits.physical_block_size = size;
336
337 if (q->limits.io_min < q->limits.physical_block_size)
338 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100339}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400340EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100341
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400342/**
343 * blk_queue_physical_block_size - set physical block size for the queue
344 * @q: the request queue for the device
345 * @size: the physical block size, in bytes
346 *
347 * Description:
348 * This should be set to the lowest possible sector size that the
349 * hardware can operate on without reverting to read-modify-write
350 * operations.
351 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200352void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400353{
354 q->limits.physical_block_size = size;
355
356 if (q->limits.physical_block_size < q->limits.logical_block_size)
357 q->limits.physical_block_size = q->limits.logical_block_size;
358
359 if (q->limits.io_min < q->limits.physical_block_size)
360 q->limits.io_min = q->limits.physical_block_size;
361}
362EXPORT_SYMBOL(blk_queue_physical_block_size);
363
364/**
365 * blk_queue_alignment_offset - set physical block alignment offset
366 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700367 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400368 *
369 * Description:
370 * Some devices are naturally misaligned to compensate for things like
371 * the legacy DOS partition table 63-sector offset. Low-level drivers
372 * should call this function for devices whose first sector is not
373 * naturally aligned.
374 */
375void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
376{
377 q->limits.alignment_offset =
378 offset & (q->limits.physical_block_size - 1);
379 q->limits.misaligned = 0;
380}
381EXPORT_SYMBOL(blk_queue_alignment_offset);
382
383/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400384 * blk_limits_io_min - set minimum request size for a device
385 * @limits: the queue limits
386 * @min: smallest I/O size in bytes
387 *
388 * Description:
389 * Some devices have an internal block size bigger than the reported
390 * hardware sector size. This function can be used to signal the
391 * smallest I/O the device can perform without incurring a performance
392 * penalty.
393 */
394void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
395{
396 limits->io_min = min;
397
398 if (limits->io_min < limits->logical_block_size)
399 limits->io_min = limits->logical_block_size;
400
401 if (limits->io_min < limits->physical_block_size)
402 limits->io_min = limits->physical_block_size;
403}
404EXPORT_SYMBOL(blk_limits_io_min);
405
406/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400407 * blk_queue_io_min - set minimum request size for the queue
408 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700409 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400410 *
411 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400412 * Storage devices may report a granularity or preferred minimum I/O
413 * size which is the smallest request the device can perform without
414 * incurring a performance penalty. For disk drives this is often the
415 * physical block size. For RAID arrays it is often the stripe chunk
416 * size. A properly aligned multiple of minimum_io_size is the
417 * preferred request size for workloads where a high number of I/O
418 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400419 */
420void blk_queue_io_min(struct request_queue *q, unsigned int min)
421{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400422 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400423}
424EXPORT_SYMBOL(blk_queue_io_min);
425
426/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200427 * blk_limits_io_opt - set optimal request size for a device
428 * @limits: the queue limits
429 * @opt: smallest I/O size in bytes
430 *
431 * Description:
432 * Storage devices may report an optimal I/O size, which is the
433 * device's preferred unit for sustained I/O. This is rarely reported
434 * for disk drives. For RAID arrays it is usually the stripe width or
435 * the internal track size. A properly aligned multiple of
436 * optimal_io_size is the preferred request size for workloads where
437 * sustained throughput is desired.
438 */
439void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
440{
441 limits->io_opt = opt;
442}
443EXPORT_SYMBOL(blk_limits_io_opt);
444
445/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400446 * blk_queue_io_opt - set optimal request size for the queue
447 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700448 * @opt: optimal request 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 an optimal I/O size, which is the
452 * device's preferred unit for sustained I/O. This is rarely reported
453 * for disk drives. For RAID arrays it is usually the stripe width or
454 * the internal track size. A properly aligned multiple of
455 * optimal_io_size is the preferred request size for workloads where
456 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400457 */
458void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
459{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200460 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400461}
462EXPORT_SYMBOL(blk_queue_io_opt);
463
Jens Axboe86db1e22008-01-29 14:53:40 +0100464/**
465 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
466 * @t: the stacking driver (top)
467 * @b: the underlying device (bottom)
468 **/
469void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
470{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400471 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100472}
Jens Axboe86db1e22008-01-29 14:53:40 +0100473EXPORT_SYMBOL(blk_queue_stack_limits);
474
475/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400476 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100477 * @t: the stacking driver limits (top device)
478 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500479 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400480 *
481 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100482 * This function is used by stacking drivers like MD and DM to ensure
483 * that all component devices have compatible block sizes and
484 * alignments. The stacking driver must provide a queue_limits
485 * struct (top) and then iteratively call the stacking function for
486 * all component (bottom) devices. The stacking function will
487 * attempt to combine the values and ensure proper alignment.
488 *
489 * Returns 0 if the top and bottom queue_limits are compatible. The
490 * top device's block sizes and alignment offsets may be adjusted to
491 * ensure alignment with the bottom device. If no compatible sizes
492 * and alignments exist, -1 is returned and the resulting top
493 * queue_limits will have the misaligned flag set to indicate that
494 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400495 */
496int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500497 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400498{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500499 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100500
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400501 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
502 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500503 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400504 t->max_write_same_sectors = min(t->max_write_same_sectors,
505 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800506 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
507 b->max_write_zeroes_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200508 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400509
510 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
511 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700512 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
513 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400514
Martin K. Petersen8a783622010-02-26 00:20:39 -0500515 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100516 t->max_discard_segments = min_not_zero(t->max_discard_segments,
517 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200518 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
519 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400520
521 t->max_segment_size = min_not_zero(t->max_segment_size,
522 b->max_segment_size);
523
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500524 t->misaligned |= b->misaligned;
525
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500526 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100527
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100528 /* Bottom device has different alignment. Check that it is
529 * compatible with the current top alignment.
530 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100531 if (t->alignment_offset != alignment) {
532
533 top = max(t->physical_block_size, t->io_min)
534 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100535 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100536
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100537 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400538 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100539 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500540 ret = -1;
541 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100542 }
543
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400544 t->logical_block_size = max(t->logical_block_size,
545 b->logical_block_size);
546
547 t->physical_block_size = max(t->physical_block_size,
548 b->physical_block_size);
549
550 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400551 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100552
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100553 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100554 if (t->physical_block_size & (t->logical_block_size - 1)) {
555 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400556 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500557 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100558 }
559
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100560 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100561 if (t->io_min & (t->physical_block_size - 1)) {
562 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400563 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500564 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400565 }
566
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100567 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100568 if (t->io_opt & (t->physical_block_size - 1)) {
569 t->io_opt = 0;
570 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500571 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100572 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400573
Kent Overstreetc78afc62013-07-11 22:39:53 -0700574 t->raid_partial_stripes_expensive =
575 max(t->raid_partial_stripes_expensive,
576 b->raid_partial_stripes_expensive);
577
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100578 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400579 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400580 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400581
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100582 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500583 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100584 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500585 ret = -1;
586 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100587
588 /* Discard alignment and granularity */
589 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500590 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100591
592 if (t->discard_granularity != 0 &&
593 t->discard_alignment != alignment) {
594 top = t->discard_granularity + t->discard_alignment;
595 bottom = b->discard_granularity + alignment;
596
597 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800598 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100599 t->discard_misaligned = 1;
600 }
601
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100602 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
603 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600604 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
605 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100606 t->discard_granularity = max(t->discard_granularity,
607 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400608 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800609 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100610 }
611
Hannes Reinecke987b3b22016-10-18 15:40:31 +0900612 if (b->chunk_sectors)
613 t->chunk_sectors = min_not_zero(t->chunk_sectors,
614 b->chunk_sectors);
615
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500616 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400617}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200618EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400619
620/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500621 * bdev_stack_limits - adjust queue limits for stacked drivers
622 * @t: the stacking driver limits (top device)
623 * @bdev: the component block_device (bottom)
624 * @start: first data sector within component device
625 *
626 * Description:
627 * Merges queue limits for a top device and a block_device. Returns
628 * 0 if alignment didn't change. Returns -1 if adding the bottom
629 * device caused misalignment.
630 */
631int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
632 sector_t start)
633{
634 struct request_queue *bq = bdev_get_queue(bdev);
635
636 start += get_start_sect(bdev);
637
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500638 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500639}
640EXPORT_SYMBOL(bdev_stack_limits);
641
642/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400643 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200644 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400645 * @bdev: the underlying block device (bottom)
646 * @offset: offset to beginning of data within component device
647 *
648 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500649 * Merges the limits for a top level gendisk and a bottom level
650 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400651 */
652void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
653 sector_t offset)
654{
655 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400656
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500657 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400658 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
659
660 disk_name(disk, 0, top);
661 bdevname(bdev, bottom);
662
663 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
664 top, bottom);
665 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400666}
667EXPORT_SYMBOL(disk_stack_limits);
668
669/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200670 * blk_queue_update_dma_pad - update pad mask
671 * @q: the request queue for the device
672 * @mask: pad mask
673 *
674 * Update dma pad mask.
675 *
676 * Appending pad buffer to a request modifies the last entry of a
677 * scatter list such that it includes the pad buffer.
678 **/
679void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
680{
681 if (mask > q->dma_pad_mask)
682 q->dma_pad_mask = mask;
683}
684EXPORT_SYMBOL(blk_queue_update_dma_pad);
685
686/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100687 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100688 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100689 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100690 * @buf: physically contiguous buffer
691 * @size: size of the buffer in bytes
692 *
693 * Some devices have excess DMA problems and can't simply discard (or
694 * zero fill) the unwanted piece of the transfer. They have to have a
695 * real area of memory to transfer it into. The use case for this is
696 * ATAPI devices in DMA mode. If the packet command causes a transfer
697 * bigger than the transfer size some HBAs will lock up if there
698 * aren't DMA elements to contain the excess transfer. What this API
699 * does is adjust the queue so that the buf is always appended
700 * silently to the scatterlist.
701 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500702 * Note: This routine adjusts max_hw_segments to make room for appending
703 * the drain buffer. If you call blk_queue_max_segments() after calling
704 * this routine, you must set the limit to one fewer than your device
705 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100706 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100707int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100708 dma_drain_needed_fn *dma_drain_needed,
709 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100710{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500711 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100712 return -EINVAL;
713 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500714 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100715 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100716 q->dma_drain_buffer = buf;
717 q->dma_drain_size = size;
718
719 return 0;
720}
Jens Axboe86db1e22008-01-29 14:53:40 +0100721EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
722
723/**
724 * blk_queue_segment_boundary - set boundary rules for segment merging
725 * @q: the request queue for the device
726 * @mask: the memory boundary mask
727 **/
728void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
729{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300730 if (mask < PAGE_SIZE - 1) {
731 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700732 printk(KERN_INFO "%s: set to minimum %lx\n",
733 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100734 }
735
Martin K. Petersen025146e2009-05-22 17:17:51 -0400736 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100737}
Jens Axboe86db1e22008-01-29 14:53:40 +0100738EXPORT_SYMBOL(blk_queue_segment_boundary);
739
740/**
Keith Busch03100aa2015-08-19 14:24:05 -0700741 * blk_queue_virt_boundary - set boundary rules for bio merging
742 * @q: the request queue for the device
743 * @mask: the memory boundary mask
744 **/
745void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
746{
747 q->limits.virt_boundary_mask = mask;
Christoph Hellwig09324d32019-05-21 09:01:41 +0200748
749 /*
750 * Devices that require a virtual boundary do not support scatter/gather
751 * I/O natively, but instead require a descriptor list entry for each
752 * page (which might not be idential to the Linux PAGE_SIZE). Because
753 * of that they are not limited by our notion of "segment size".
754 */
Christoph Hellwigc6c84f72019-07-24 18:26:56 +0200755 if (mask)
756 q->limits.max_segment_size = UINT_MAX;
Keith Busch03100aa2015-08-19 14:24:05 -0700757}
758EXPORT_SYMBOL(blk_queue_virt_boundary);
759
760/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100761 * blk_queue_dma_alignment - set dma length and memory alignment
762 * @q: the request queue for the device
763 * @mask: alignment mask
764 *
765 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200766 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100767 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100768 *
769 **/
770void blk_queue_dma_alignment(struct request_queue *q, int mask)
771{
772 q->dma_alignment = mask;
773}
Jens Axboe86db1e22008-01-29 14:53:40 +0100774EXPORT_SYMBOL(blk_queue_dma_alignment);
775
776/**
777 * blk_queue_update_dma_alignment - update dma length and memory alignment
778 * @q: the request queue for the device
779 * @mask: alignment mask
780 *
781 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200782 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100783 * If the requested alignment is larger than the current alignment, then
784 * the current queue alignment is updated to the new value, otherwise it
785 * is left alone. The design of this is to allow multiple objects
786 * (driver, device, transport etc) to set their respective
787 * alignments without having them interfere.
788 *
789 **/
790void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
791{
792 BUG_ON(mask > PAGE_SIZE);
793
794 if (mask > q->dma_alignment)
795 q->dma_alignment = mask;
796}
Jens Axboe86db1e22008-01-29 14:53:40 +0100797EXPORT_SYMBOL(blk_queue_update_dma_alignment);
798
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600799/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600800 * blk_set_queue_depth - tell the block layer about the device queue depth
801 * @q: the request queue for the device
802 * @depth: queue depth
803 *
804 */
805void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
806{
807 q->queue_depth = depth;
Tejun Heo9677a3e2019-08-28 15:05:55 -0700808 rq_qos_queue_depth_changed(q);
Jens Axboed278d4a2016-03-30 10:21:08 -0600809}
810EXPORT_SYMBOL(blk_set_queue_depth);
811
812/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600813 * blk_queue_write_cache - configure queue's write cache
814 * @q: the request queue for the device
815 * @wc: write back cache on or off
816 * @fua: device supports FUA writes, if true
817 *
818 * Tell the block layer about the write cache of @q.
819 */
820void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
821{
Jens Axboec888a8f2016-04-13 13:33:19 -0600822 if (wc)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100823 blk_queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600824 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100825 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600826 if (fua)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100827 blk_queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600828 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100829 blk_queue_flag_clear(QUEUE_FLAG_FUA, q);
Jens Axboe87760e52016-11-09 12:38:14 -0700830
Josef Bacika7905042018-07-03 09:32:35 -0600831 wbt_set_write_cache(q, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600832}
833EXPORT_SYMBOL_GPL(blk_queue_write_cache);
834
Damien Le Moal68c43f12019-09-05 18:51:31 +0900835/**
836 * blk_queue_required_elevator_features - Set a queue required elevator features
837 * @q: the request queue for the target device
838 * @features: Required elevator features OR'ed together
839 *
840 * Tell the block layer that for the device controlled through @q, only the
841 * only elevators that can be used are those that implement at least the set of
842 * features specified by @features.
843 */
844void blk_queue_required_elevator_features(struct request_queue *q,
845 unsigned int features)
846{
847 q->required_elevator_features = features;
848}
849EXPORT_SYMBOL_GPL(blk_queue_required_elevator_features);
850
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200851static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100852{
853 blk_max_low_pfn = max_low_pfn - 1;
854 blk_max_pfn = max_pfn - 1;
855 return 0;
856}
857subsys_initcall(blk_settings_init);