blob: c3aa7f8ee388357c7b96b50cd58c6591910bba84 [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;
Keith Busch0512a752020-05-12 17:55:47 +090051 lim->max_zone_append_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010052 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -060053 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010054 lim->discard_granularity = 0;
55 lim->discard_alignment = 0;
56 lim->discard_misaligned = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020057 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +020058 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +020059 lim->alignment_offset = 0;
60 lim->io_opt = 0;
61 lim->misaligned = 0;
Damien Le Moal797476b2016-10-18 15:40:29 +090062 lim->zoned = BLK_ZONED_NONE;
Martin K. Petersene475bba2009-06-16 08:23:52 +020063}
64EXPORT_SYMBOL(blk_set_default_limits);
65
66/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010067 * blk_set_stacking_limits - set default limits for stacking devices
68 * @lim: the queue_limits structure to reset
69 *
70 * Description:
71 * Returns a queue_limit struct to its default state. Should be used
72 * by stacking drivers like DM that have no internal limits.
73 */
74void blk_set_stacking_limits(struct queue_limits *lim)
75{
76 blk_set_default_limits(lim);
77
78 /* Inherit limits from component devices */
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010079 lim->max_segments = USHRT_MAX;
Mike Snitzer42c9cdf2018-07-20 14:57:38 -040080 lim->max_discard_segments = USHRT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010081 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -060082 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +020083 lim->max_sectors = UINT_MAX;
Martin K. Petersenca369d52015-11-13 16:46:48 -050084 lim->max_dev_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040085 lim->max_write_same_sectors = UINT_MAX;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080086 lim->max_write_zeroes_sectors = UINT_MAX;
Keith Busch0512a752020-05-12 17:55:47 +090087 lim->max_zone_append_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010088}
89EXPORT_SYMBOL(blk_set_stacking_limits);
90
91/**
Jens Axboe86db1e22008-01-29 14:53:40 +010092 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +090093 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +010094 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +010095 *
96 * Description:
97 * Different hardware can have different requirements as to what pages
98 * it can do I/O directly to. A low level driver can call
99 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100100 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100101 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100102void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100103{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100104 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100105 int dma = 0;
106
107 q->bounce_gfp = GFP_NOIO;
108#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900109 /*
110 * Assume anything <= 4GB can be handled by IOMMU. Actually
111 * some IOMMUs can handle everything, but I don't know of a
112 * way to test this here.
113 */
114 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100115 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200116 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100117#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100118 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100119 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200120 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200121#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100122 if (dma) {
123 init_emergency_isa_pool();
124 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200125 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100126 }
127}
Jens Axboe86db1e22008-01-29 14:53:40 +0100128EXPORT_SYMBOL(blk_queue_bounce_limit);
129
130/**
Martin K. Petersenca369d52015-11-13 16:46:48 -0500131 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
132 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500133 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100134 *
135 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500136 * Enables a low level driver to set a hard upper limit,
137 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
Martin K. Petersen4f258a42015-06-23 12:13:59 -0400138 * the device driver based upon the capabilities of the I/O
139 * controller.
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500140 *
Martin K. Petersenca369d52015-11-13 16:46:48 -0500141 * max_dev_sectors is a hard limit imposed by the storage device for
142 * READ/WRITE requests. It is set by the disk driver.
143 *
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500144 * max_sectors is a soft limit imposed by the block layer for
145 * filesystem type requests. This value can be overridden on a
146 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
147 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100148 **/
Martin K. Petersenca369d52015-11-13 16:46:48 -0500149void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100150{
Martin K. Petersenca369d52015-11-13 16:46:48 -0500151 struct queue_limits *limits = &q->limits;
152 unsigned int max_sectors;
153
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300154 if ((max_hw_sectors << 9) < PAGE_SIZE) {
155 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700156 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500157 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100158 }
159
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400160 limits->max_hw_sectors = max_hw_sectors;
Martin K. Petersenca369d52015-11-13 16:46:48 -0500161 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
162 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
163 limits->max_sectors = max_sectors;
Jan Karadc3b17c2017-02-02 15:56:50 +0100164 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
Jens Axboe86db1e22008-01-29 14:53:40 +0100165}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500166EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100167
168/**
Jens Axboe762380a2014-06-05 13:38:39 -0600169 * blk_queue_chunk_sectors - set size of the chunk for this queue
170 * @q: the request queue for the device
171 * @chunk_sectors: chunk sectors in the usual 512b unit
172 *
173 * Description:
174 * If a driver doesn't want IOs to cross a given chunk size, it can set
Mike Snitzer07d098e2020-09-21 22:32:49 -0400175 * this limit and prevent merging across chunks. Note that the block layer
176 * must accept a page worth of data at any offset. So if the crossing of
177 * chunks is a hard limitation in the driver, it must still be prepared
178 * to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600179 **/
180void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
181{
Jens Axboe762380a2014-06-05 13:38:39 -0600182 q->limits.chunk_sectors = chunk_sectors;
183}
184EXPORT_SYMBOL(blk_queue_chunk_sectors);
185
186/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200187 * blk_queue_max_discard_sectors - set max sectors for a single discard
188 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200189 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200190 **/
191void blk_queue_max_discard_sectors(struct request_queue *q,
192 unsigned int max_discard_sectors)
193{
Jens Axboe0034af02015-07-16 09:14:26 -0600194 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200195 q->limits.max_discard_sectors = max_discard_sectors;
196}
197EXPORT_SYMBOL(blk_queue_max_discard_sectors);
198
199/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400200 * blk_queue_max_write_same_sectors - set max sectors for a single write same
201 * @q: the request queue for the device
202 * @max_write_same_sectors: maximum number of sectors to write per command
203 **/
204void blk_queue_max_write_same_sectors(struct request_queue *q,
205 unsigned int max_write_same_sectors)
206{
207 q->limits.max_write_same_sectors = max_write_same_sectors;
208}
209EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
210
211/**
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800212 * blk_queue_max_write_zeroes_sectors - set max sectors for a single
213 * write zeroes
214 * @q: the request queue for the device
215 * @max_write_zeroes_sectors: maximum number of sectors to write per command
216 **/
217void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
218 unsigned int max_write_zeroes_sectors)
219{
220 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
221}
222EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
223
224/**
Keith Busch0512a752020-05-12 17:55:47 +0900225 * blk_queue_max_zone_append_sectors - set max sectors for a single zone append
226 * @q: the request queue for the device
227 * @max_zone_append_sectors: maximum number of sectors to write per command
228 **/
229void blk_queue_max_zone_append_sectors(struct request_queue *q,
230 unsigned int max_zone_append_sectors)
231{
232 unsigned int max_sectors;
233
234 if (WARN_ON(!blk_queue_is_zoned(q)))
235 return;
236
237 max_sectors = min(q->limits.max_hw_sectors, max_zone_append_sectors);
238 max_sectors = min(q->limits.chunk_sectors, max_sectors);
239
240 /*
241 * Signal eventual driver bugs resulting in the max_zone_append sectors limit
242 * being 0 due to a 0 argument, the chunk_sectors limit (zone size) not set,
243 * or the max_hw_sectors limit not set.
244 */
245 WARN_ON(!max_sectors);
246
247 q->limits.max_zone_append_sectors = max_sectors;
248}
249EXPORT_SYMBOL_GPL(blk_queue_max_zone_append_sectors);
250
251/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500252 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100253 * @q: the request queue for the device
254 * @max_segments: max number of segments
255 *
256 * Description:
257 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500258 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100259 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500260void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100261{
262 if (!max_segments) {
263 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700264 printk(KERN_INFO "%s: set to minimum %d\n",
265 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100266 }
267
Martin K. Petersen8a783622010-02-26 00:20:39 -0500268 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100269}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500270EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100271
272/**
Christoph Hellwig1e739732017-02-08 14:46:49 +0100273 * blk_queue_max_discard_segments - set max segments for discard requests
274 * @q: the request queue for the device
275 * @max_segments: max number of segments
276 *
277 * Description:
278 * Enables a low level driver to set an upper limit on the number of
279 * segments in a discard request.
280 **/
281void blk_queue_max_discard_segments(struct request_queue *q,
282 unsigned short max_segments)
283{
284 q->limits.max_discard_segments = max_segments;
285}
286EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
287
288/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100289 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
290 * @q: the request queue for the device
291 * @max_size: max size of segment in bytes
292 *
293 * Description:
294 * Enables a low level driver to set an upper limit on the size of a
295 * coalesced segment
296 **/
297void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
298{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300299 if (max_size < PAGE_SIZE) {
300 max_size = PAGE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700301 printk(KERN_INFO "%s: set to minimum %d\n",
302 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100303 }
304
Christoph Hellwig09324d32019-05-21 09:01:41 +0200305 /* see blk_queue_virt_boundary() for the explanation */
306 WARN_ON_ONCE(q->limits.virt_boundary_mask);
307
Martin K. Petersen025146e2009-05-22 17:17:51 -0400308 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100309}
Jens Axboe86db1e22008-01-29 14:53:40 +0100310EXPORT_SYMBOL(blk_queue_max_segment_size);
311
312/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400313 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100314 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400315 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100316 *
317 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400318 * This should be set to the lowest possible block size that the
319 * storage device can address. The default of 512 covers most
320 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100321 **/
Mikulas Patockaad6bf882020-01-15 08:35:25 -0500322void blk_queue_logical_block_size(struct request_queue *q, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100323{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400324 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400325
326 if (q->limits.physical_block_size < size)
327 q->limits.physical_block_size = size;
328
329 if (q->limits.io_min < q->limits.physical_block_size)
330 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100331}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400332EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100333
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400334/**
335 * blk_queue_physical_block_size - set physical block size for the queue
336 * @q: the request queue for the device
337 * @size: the physical block size, in bytes
338 *
339 * Description:
340 * This should be set to the lowest possible sector size that the
341 * hardware can operate on without reverting to read-modify-write
342 * operations.
343 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200344void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400345{
346 q->limits.physical_block_size = size;
347
348 if (q->limits.physical_block_size < q->limits.logical_block_size)
349 q->limits.physical_block_size = q->limits.logical_block_size;
350
351 if (q->limits.io_min < q->limits.physical_block_size)
352 q->limits.io_min = q->limits.physical_block_size;
353}
354EXPORT_SYMBOL(blk_queue_physical_block_size);
355
356/**
357 * blk_queue_alignment_offset - set physical block alignment offset
358 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700359 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400360 *
361 * Description:
362 * Some devices are naturally misaligned to compensate for things like
363 * the legacy DOS partition table 63-sector offset. Low-level drivers
364 * should call this function for devices whose first sector is not
365 * naturally aligned.
366 */
367void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
368{
369 q->limits.alignment_offset =
370 offset & (q->limits.physical_block_size - 1);
371 q->limits.misaligned = 0;
372}
373EXPORT_SYMBOL(blk_queue_alignment_offset);
374
Christoph Hellwigc2e4cd52020-09-24 08:51:34 +0200375void blk_queue_update_readahead(struct request_queue *q)
376{
377 /*
378 * For read-ahead of large files to be effective, we need to read ahead
379 * at least twice the optimal I/O size.
380 */
381 q->backing_dev_info->ra_pages =
382 max(queue_io_opt(q) * 2 / PAGE_SIZE, VM_READAHEAD_PAGES);
383 q->backing_dev_info->io_pages =
384 queue_max_sectors(q) >> (PAGE_SHIFT - 9);
385}
386EXPORT_SYMBOL_GPL(blk_queue_update_readahead);
387
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400388/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400389 * blk_limits_io_min - set minimum request size for a device
390 * @limits: the queue limits
391 * @min: smallest I/O size in bytes
392 *
393 * Description:
394 * Some devices have an internal block size bigger than the reported
395 * hardware sector size. This function can be used to signal the
396 * smallest I/O the device can perform without incurring a performance
397 * penalty.
398 */
399void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
400{
401 limits->io_min = min;
402
403 if (limits->io_min < limits->logical_block_size)
404 limits->io_min = limits->logical_block_size;
405
406 if (limits->io_min < limits->physical_block_size)
407 limits->io_min = limits->physical_block_size;
408}
409EXPORT_SYMBOL(blk_limits_io_min);
410
411/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400412 * blk_queue_io_min - set minimum request size for the queue
413 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700414 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400415 *
416 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400417 * Storage devices may report a granularity or preferred minimum I/O
418 * size which is the smallest request the device can perform without
419 * incurring a performance penalty. For disk drives this is often the
420 * physical block size. For RAID arrays it is often the stripe chunk
421 * size. A properly aligned multiple of minimum_io_size is the
422 * preferred request size for workloads where a high number of I/O
423 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400424 */
425void blk_queue_io_min(struct request_queue *q, unsigned int min)
426{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400427 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400428}
429EXPORT_SYMBOL(blk_queue_io_min);
430
431/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200432 * blk_limits_io_opt - set optimal request size for a device
433 * @limits: the queue limits
434 * @opt: smallest I/O size in bytes
435 *
436 * Description:
437 * Storage devices may report an optimal I/O size, which is the
438 * device's preferred unit for sustained I/O. This is rarely reported
439 * for disk drives. For RAID arrays it is usually the stripe width or
440 * the internal track size. A properly aligned multiple of
441 * optimal_io_size is the preferred request size for workloads where
442 * sustained throughput is desired.
443 */
444void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
445{
446 limits->io_opt = opt;
447}
448EXPORT_SYMBOL(blk_limits_io_opt);
449
450/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400451 * blk_queue_io_opt - set optimal request size for the queue
452 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700453 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400454 *
455 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400456 * Storage devices may report an optimal I/O size, which is the
457 * device's preferred unit for sustained I/O. This is rarely reported
458 * for disk drives. For RAID arrays it is usually the stripe width or
459 * the internal track size. A properly aligned multiple of
460 * optimal_io_size is the preferred request size for workloads where
461 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400462 */
463void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
464{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200465 blk_limits_io_opt(&q->limits, opt);
Christoph Hellwigc2e4cd52020-09-24 08:51:34 +0200466 q->backing_dev_info->ra_pages =
467 max(queue_io_opt(q) * 2 / PAGE_SIZE, VM_READAHEAD_PAGES);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400468}
469EXPORT_SYMBOL(blk_queue_io_opt);
470
Mikulas Patocka556c5132021-02-23 19:25:30 -0700471static unsigned int blk_round_down_sectors(unsigned int sectors, unsigned int lbs)
472{
473 sectors = round_down(sectors, lbs >> SECTOR_SHIFT);
474 if (sectors < PAGE_SIZE >> SECTOR_SHIFT)
475 sectors = PAGE_SIZE >> SECTOR_SHIFT;
476 return sectors;
477}
478
Jens Axboe86db1e22008-01-29 14:53:40 +0100479/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400480 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100481 * @t: the stacking driver limits (top device)
482 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500483 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400484 *
485 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100486 * This function is used by stacking drivers like MD and DM to ensure
487 * that all component devices have compatible block sizes and
488 * alignments. The stacking driver must provide a queue_limits
489 * struct (top) and then iteratively call the stacking function for
490 * all component (bottom) devices. The stacking function will
491 * attempt to combine the values and ensure proper alignment.
492 *
493 * Returns 0 if the top and bottom queue_limits are compatible. The
494 * top device's block sizes and alignment offsets may be adjusted to
495 * ensure alignment with the bottom device. If no compatible sizes
496 * and alignments exist, -1 is returned and the resulting top
497 * queue_limits will have the misaligned flag set to indicate that
498 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400499 */
500int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500501 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400502{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500503 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100504
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400505 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
506 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersenca369d52015-11-13 16:46:48 -0500507 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400508 t->max_write_same_sectors = min(t->max_write_same_sectors,
509 b->max_write_same_sectors);
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800510 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
511 b->max_write_zeroes_sectors);
Keith Busch0512a752020-05-12 17:55:47 +0900512 t->max_zone_append_sectors = min(t->max_zone_append_sectors,
513 b->max_zone_append_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200514 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400515
516 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
517 b->seg_boundary_mask);
Keith Busch03100aa2015-08-19 14:24:05 -0700518 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
519 b->virt_boundary_mask);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400520
Martin K. Petersen8a783622010-02-26 00:20:39 -0500521 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Christoph Hellwig1e739732017-02-08 14:46:49 +0100522 t->max_discard_segments = min_not_zero(t->max_discard_segments,
523 b->max_discard_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200524 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
525 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400526
527 t->max_segment_size = min_not_zero(t->max_segment_size,
528 b->max_segment_size);
529
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500530 t->misaligned |= b->misaligned;
531
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500532 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100533
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100534 /* Bottom device has different alignment. Check that it is
535 * compatible with the current top alignment.
536 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100537 if (t->alignment_offset != alignment) {
538
539 top = max(t->physical_block_size, t->io_min)
540 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100541 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100542
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100543 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400544 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100545 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500546 ret = -1;
547 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100548 }
549
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400550 t->logical_block_size = max(t->logical_block_size,
551 b->logical_block_size);
552
553 t->physical_block_size = max(t->physical_block_size,
554 b->physical_block_size);
555
556 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400557 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Mike Snitzer7e7986f2020-12-01 11:07:09 -0500558
559 /* Set non-power-of-2 compatible chunk_sectors boundary */
560 if (b->chunk_sectors)
561 t->chunk_sectors = gcd(t->chunk_sectors, b->chunk_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100562
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100563 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100564 if (t->physical_block_size & (t->logical_block_size - 1)) {
565 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400566 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500567 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100568 }
569
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100570 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571 if (t->io_min & (t->physical_block_size - 1)) {
572 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400573 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500574 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400575 }
576
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100577 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100578 if (t->io_opt & (t->physical_block_size - 1)) {
579 t->io_opt = 0;
580 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500581 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100582 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400583
Mike Snitzer22ada802020-09-21 22:32:48 -0400584 /* chunk_sectors a multiple of the physical block size? */
585 if ((t->chunk_sectors << 9) & (t->physical_block_size - 1)) {
586 t->chunk_sectors = 0;
587 t->misaligned = 1;
588 ret = -1;
589 }
590
Kent Overstreetc78afc62013-07-11 22:39:53 -0700591 t->raid_partial_stripes_expensive =
592 max(t->raid_partial_stripes_expensive,
593 b->raid_partial_stripes_expensive);
594
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100595 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400596 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400597 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400598
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100599 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500600 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100601 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500602 ret = -1;
603 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100604
Mikulas Patocka556c5132021-02-23 19:25:30 -0700605 t->max_sectors = blk_round_down_sectors(t->max_sectors, t->logical_block_size);
606 t->max_hw_sectors = blk_round_down_sectors(t->max_hw_sectors, t->logical_block_size);
607 t->max_dev_sectors = blk_round_down_sectors(t->max_dev_sectors, t->logical_block_size);
608
Martin K. Petersen9504e082009-12-21 15:55:51 +0100609 /* Discard alignment and granularity */
610 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500611 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100612
613 if (t->discard_granularity != 0 &&
614 t->discard_alignment != alignment) {
615 top = t->discard_granularity + t->discard_alignment;
616 bottom = b->discard_granularity + alignment;
617
618 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800619 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100620 t->discard_misaligned = 1;
621 }
622
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100623 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
624 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600625 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
626 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100627 t->discard_granularity = max(t->discard_granularity,
628 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400629 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800630 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100631 }
632
Christoph Hellwig3093a472020-07-20 08:12:49 +0200633 t->zoned = max(t->zoned, b->zoned);
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500634 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400635}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200636EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400637
638/**
639 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200640 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400641 * @bdev: the underlying block device (bottom)
642 * @offset: offset to beginning of data within component device
643 *
644 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500645 * Merges the limits for a top level gendisk and a bottom level
646 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400647 */
648void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
649 sector_t offset)
650{
651 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400652
Christoph Hellwig9efa82e2020-07-20 08:12:50 +0200653 if (blk_stack_limits(&t->limits, &bdev_get_queue(bdev)->limits,
654 get_start_sect(bdev) + (offset >> 9)) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400655 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
656
657 disk_name(disk, 0, top);
658 bdevname(bdev, bottom);
659
660 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
661 top, bottom);
662 }
Konstantin Khlebnikove74d93e2020-02-28 17:51:48 +0300663
Christoph Hellwigc2e4cd52020-09-24 08:51:34 +0200664 blk_queue_update_readahead(disk->queue);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400665}
666EXPORT_SYMBOL(disk_stack_limits);
667
668/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200669 * blk_queue_update_dma_pad - update pad mask
670 * @q: the request queue for the device
671 * @mask: pad mask
672 *
673 * Update dma pad mask.
674 *
675 * Appending pad buffer to a request modifies the last entry of a
676 * scatter list such that it includes the pad buffer.
677 **/
678void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
679{
680 if (mask > q->dma_pad_mask)
681 q->dma_pad_mask = mask;
682}
683EXPORT_SYMBOL(blk_queue_update_dma_pad);
684
685/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100686 * blk_queue_segment_boundary - set boundary rules for segment merging
687 * @q: the request queue for the device
688 * @mask: the memory boundary mask
689 **/
690void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
691{
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300692 if (mask < PAGE_SIZE - 1) {
693 mask = PAGE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700694 printk(KERN_INFO "%s: set to minimum %lx\n",
695 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100696 }
697
Martin K. Petersen025146e2009-05-22 17:17:51 -0400698 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100699}
Jens Axboe86db1e22008-01-29 14:53:40 +0100700EXPORT_SYMBOL(blk_queue_segment_boundary);
701
702/**
Keith Busch03100aa2015-08-19 14:24:05 -0700703 * blk_queue_virt_boundary - set boundary rules for bio merging
704 * @q: the request queue for the device
705 * @mask: the memory boundary mask
706 **/
707void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
708{
709 q->limits.virt_boundary_mask = mask;
Christoph Hellwig09324d32019-05-21 09:01:41 +0200710
711 /*
712 * Devices that require a virtual boundary do not support scatter/gather
713 * I/O natively, but instead require a descriptor list entry for each
714 * page (which might not be idential to the Linux PAGE_SIZE). Because
715 * of that they are not limited by our notion of "segment size".
716 */
Christoph Hellwigc6c84f72019-07-24 18:26:56 +0200717 if (mask)
718 q->limits.max_segment_size = UINT_MAX;
Keith Busch03100aa2015-08-19 14:24:05 -0700719}
720EXPORT_SYMBOL(blk_queue_virt_boundary);
721
722/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100723 * blk_queue_dma_alignment - set dma length and memory alignment
724 * @q: the request queue for the device
725 * @mask: alignment mask
726 *
727 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200728 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100729 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100730 *
731 **/
732void blk_queue_dma_alignment(struct request_queue *q, int mask)
733{
734 q->dma_alignment = mask;
735}
Jens Axboe86db1e22008-01-29 14:53:40 +0100736EXPORT_SYMBOL(blk_queue_dma_alignment);
737
738/**
739 * blk_queue_update_dma_alignment - update dma length and memory alignment
740 * @q: the request queue for the device
741 * @mask: alignment mask
742 *
743 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200744 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100745 * If the requested alignment is larger than the current alignment, then
746 * the current queue alignment is updated to the new value, otherwise it
747 * is left alone. The design of this is to allow multiple objects
748 * (driver, device, transport etc) to set their respective
749 * alignments without having them interfere.
750 *
751 **/
752void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
753{
754 BUG_ON(mask > PAGE_SIZE);
755
756 if (mask > q->dma_alignment)
757 q->dma_alignment = mask;
758}
Jens Axboe86db1e22008-01-29 14:53:40 +0100759EXPORT_SYMBOL(blk_queue_update_dma_alignment);
760
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600761/**
Jens Axboed278d4a2016-03-30 10:21:08 -0600762 * blk_set_queue_depth - tell the block layer about the device queue depth
763 * @q: the request queue for the device
764 * @depth: queue depth
765 *
766 */
767void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
768{
769 q->queue_depth = depth;
Tejun Heo9677a3e2019-08-28 15:05:55 -0700770 rq_qos_queue_depth_changed(q);
Jens Axboed278d4a2016-03-30 10:21:08 -0600771}
772EXPORT_SYMBOL(blk_set_queue_depth);
773
774/**
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600775 * blk_queue_write_cache - configure queue's write cache
776 * @q: the request queue for the device
777 * @wc: write back cache on or off
778 * @fua: device supports FUA writes, if true
779 *
780 * Tell the block layer about the write cache of @q.
781 */
782void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
783{
Jens Axboec888a8f2016-04-13 13:33:19 -0600784 if (wc)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100785 blk_queue_flag_set(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600786 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100787 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600788 if (fua)
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100789 blk_queue_flag_set(QUEUE_FLAG_FUA, q);
Jens Axboec888a8f2016-04-13 13:33:19 -0600790 else
Christoph Hellwig57d74df2018-11-14 17:02:07 +0100791 blk_queue_flag_clear(QUEUE_FLAG_FUA, q);
Jens Axboe87760e52016-11-09 12:38:14 -0700792
Josef Bacika7905042018-07-03 09:32:35 -0600793 wbt_set_write_cache(q, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
Jens Axboe93e9d8e2016-04-12 12:32:46 -0600794}
795EXPORT_SYMBOL_GPL(blk_queue_write_cache);
796
Damien Le Moal68c43f12019-09-05 18:51:31 +0900797/**
798 * blk_queue_required_elevator_features - Set a queue required elevator features
799 * @q: the request queue for the target device
800 * @features: Required elevator features OR'ed together
801 *
802 * Tell the block layer that for the device controlled through @q, only the
803 * only elevators that can be used are those that implement at least the set of
804 * features specified by @features.
805 */
806void blk_queue_required_elevator_features(struct request_queue *q,
807 unsigned int features)
808{
809 q->required_elevator_features = features;
810}
811EXPORT_SYMBOL_GPL(blk_queue_required_elevator_features);
812
Linus Torvalds671df182019-09-19 13:27:23 -0700813/**
Yoshihiro Shimoda45147fb2019-08-28 21:35:42 +0900814 * blk_queue_can_use_dma_map_merging - configure queue for merging segments.
815 * @q: the request queue for the device
816 * @dev: the device pointer for dma
817 *
818 * Tell the block layer about merging the segments by dma map of @q.
819 */
820bool blk_queue_can_use_dma_map_merging(struct request_queue *q,
821 struct device *dev)
822{
823 unsigned long boundary = dma_get_merge_boundary(dev);
824
825 if (!boundary)
826 return false;
827
828 /* No need to update max_segment_size. see blk_queue_virt_boundary() */
829 blk_queue_virt_boundary(q, boundary);
830
831 return true;
832}
833EXPORT_SYMBOL_GPL(blk_queue_can_use_dma_map_merging);
834
Damien Le Moal27ba3e82020-09-15 16:33:46 +0900835/**
836 * blk_queue_set_zoned - configure a disk queue zoned model.
837 * @disk: the gendisk of the queue to configure
838 * @model: the zoned model to set
839 *
840 * Set the zoned model of the request queue of @disk according to @model.
841 * When @model is BLK_ZONED_HM (host managed), this should be called only
842 * if zoned block device support is enabled (CONFIG_BLK_DEV_ZONED option).
843 * If @model specifies BLK_ZONED_HA (host aware), the effective model used
844 * depends on CONFIG_BLK_DEV_ZONED settings and on the existence of partitions
845 * on the disk.
846 */
847void blk_queue_set_zoned(struct gendisk *disk, enum blk_zoned_model model)
848{
849 switch (model) {
850 case BLK_ZONED_HM:
851 /*
852 * Host managed devices are supported only if
853 * CONFIG_BLK_DEV_ZONED is enabled.
854 */
855 WARN_ON_ONCE(!IS_ENABLED(CONFIG_BLK_DEV_ZONED));
856 break;
857 case BLK_ZONED_HA:
858 /*
859 * Host aware devices can be treated either as regular block
860 * devices (similar to drive managed devices) or as zoned block
861 * devices to take advantage of the zone command set, similarly
862 * to host managed devices. We try the latter if there are no
863 * partitions and zoned block device support is enabled, else
864 * we do nothing special as far as the block layer is concerned.
865 */
866 if (!IS_ENABLED(CONFIG_BLK_DEV_ZONED) ||
867 disk_has_partitions(disk))
868 model = BLK_ZONED_NONE;
869 break;
870 case BLK_ZONED_NONE:
871 default:
872 if (WARN_ON_ONCE(model != BLK_ZONED_NONE))
873 model = BLK_ZONED_NONE;
874 break;
875 }
876
877 disk->queue->limits.zoned = model;
878}
879EXPORT_SYMBOL_GPL(blk_queue_set_zoned);
880
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200881static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100882{
883 blk_max_low_pfn = max_low_pfn - 1;
884 blk_max_pfn = max_pfn - 1;
885 return 0;
886}
887subsys_initcall(blk_settings_init);