Commit | Line | Data |
---|---|---|
86db1e29 JA |
1 | /* |
2 | * Functions related to setting various queue properties from drivers | |
3 | */ | |
4 | #include <linux/kernel.h> | |
5 | #include <linux/module.h> | |
6 | #include <linux/init.h> | |
7 | #include <linux/bio.h> | |
8 | #include <linux/blkdev.h> | |
57c8a661 | 9 | #include <linux/memblock.h> /* for max_pfn/max_low_pfn */ |
70dd5bf3 | 10 | #include <linux/gcd.h> |
2cda2728 | 11 | #include <linux/lcm.h> |
ad5ebd2f | 12 | #include <linux/jiffies.h> |
5a0e3ad6 | 13 | #include <linux/gfp.h> |
86db1e29 JA |
14 | |
15 | #include "blk.h" | |
87760e5e | 16 | #include "blk-wbt.h" |
86db1e29 | 17 | |
6728cb0e | 18 | unsigned long blk_max_low_pfn; |
86db1e29 | 19 | EXPORT_SYMBOL(blk_max_low_pfn); |
6728cb0e JA |
20 | |
21 | unsigned long blk_max_pfn; | |
86db1e29 JA |
22 | |
23 | /** | |
24 | * blk_queue_prep_rq - set a prepare_request function for queue | |
25 | * @q: queue | |
26 | * @pfn: prepare_request function | |
27 | * | |
28 | * It's possible for a queue to register a prepare_request callback which | |
29 | * is invoked before the request is handed to the request_fn. The goal of | |
30 | * the function is to prepare a request for I/O, it can be used to build a | |
31 | * cdb from the request data for instance. | |
32 | * | |
33 | */ | |
34 | void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn) | |
35 | { | |
36 | q->prep_rq_fn = pfn; | |
37 | } | |
86db1e29 JA |
38 | EXPORT_SYMBOL(blk_queue_prep_rq); |
39 | ||
28018c24 JB |
40 | /** |
41 | * blk_queue_unprep_rq - set an unprepare_request function for queue | |
42 | * @q: queue | |
43 | * @ufn: unprepare_request function | |
44 | * | |
45 | * It's possible for a queue to register an unprepare_request callback | |
46 | * which is invoked before the request is finally completed. The goal | |
47 | * of the function is to deallocate any data that was allocated in the | |
48 | * prepare_request callback. | |
49 | * | |
50 | */ | |
51 | void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn) | |
52 | { | |
53 | q->unprep_rq_fn = ufn; | |
54 | } | |
55 | EXPORT_SYMBOL(blk_queue_unprep_rq); | |
56 | ||
86db1e29 JA |
57 | void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn) |
58 | { | |
59 | q->softirq_done_fn = fn; | |
60 | } | |
86db1e29 JA |
61 | EXPORT_SYMBOL(blk_queue_softirq_done); |
62 | ||
242f9dcb JA |
63 | void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout) |
64 | { | |
65 | q->rq_timeout = timeout; | |
66 | } | |
67 | EXPORT_SYMBOL_GPL(blk_queue_rq_timeout); | |
68 | ||
69 | void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn) | |
70 | { | |
130d733a | 71 | WARN_ON_ONCE(q->mq_ops); |
242f9dcb JA |
72 | q->rq_timed_out_fn = fn; |
73 | } | |
74 | EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out); | |
75 | ||
ef9e3fac KU |
76 | void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn) |
77 | { | |
78 | q->lld_busy_fn = fn; | |
79 | } | |
80 | EXPORT_SYMBOL_GPL(blk_queue_lld_busy); | |
81 | ||
e475bba2 MP |
82 | /** |
83 | * blk_set_default_limits - reset limits to default values | |
f740f5ca | 84 | * @lim: the queue_limits structure to reset |
e475bba2 MP |
85 | * |
86 | * Description: | |
b1bd055d | 87 | * Returns a queue_limit struct to its default state. |
e475bba2 MP |
88 | */ |
89 | void blk_set_default_limits(struct queue_limits *lim) | |
90 | { | |
8a78362c | 91 | lim->max_segments = BLK_MAX_SEGMENTS; |
1e739730 | 92 | lim->max_discard_segments = 1; |
13f05c8d | 93 | lim->max_integrity_segments = 0; |
e475bba2 | 94 | lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK; |
03100aad | 95 | lim->virt_boundary_mask = 0; |
eb28d31b | 96 | lim->max_segment_size = BLK_MAX_SEGMENT_SIZE; |
5f009d3f KB |
97 | lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS; |
98 | lim->max_dev_sectors = 0; | |
762380ad | 99 | lim->chunk_sectors = 0; |
4363ac7c | 100 | lim->max_write_same_sectors = 0; |
a6f0788e | 101 | lim->max_write_zeroes_sectors = 0; |
86b37281 | 102 | lim->max_discard_sectors = 0; |
0034af03 | 103 | lim->max_hw_discard_sectors = 0; |
86b37281 MP |
104 | lim->discard_granularity = 0; |
105 | lim->discard_alignment = 0; | |
106 | lim->discard_misaligned = 0; | |
e475bba2 | 107 | lim->logical_block_size = lim->physical_block_size = lim->io_min = 512; |
3a02c8e8 | 108 | lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT); |
e475bba2 MP |
109 | lim->alignment_offset = 0; |
110 | lim->io_opt = 0; | |
111 | lim->misaligned = 0; | |
e692cb66 | 112 | lim->cluster = 1; |
797476b8 | 113 | lim->zoned = BLK_ZONED_NONE; |
e475bba2 MP |
114 | } |
115 | EXPORT_SYMBOL(blk_set_default_limits); | |
116 | ||
b1bd055d MP |
117 | /** |
118 | * blk_set_stacking_limits - set default limits for stacking devices | |
119 | * @lim: the queue_limits structure to reset | |
120 | * | |
121 | * Description: | |
122 | * Returns a queue_limit struct to its default state. Should be used | |
123 | * by stacking drivers like DM that have no internal limits. | |
124 | */ | |
125 | void blk_set_stacking_limits(struct queue_limits *lim) | |
126 | { | |
127 | blk_set_default_limits(lim); | |
128 | ||
129 | /* Inherit limits from component devices */ | |
b1bd055d | 130 | lim->max_segments = USHRT_MAX; |
42c9cdfe | 131 | lim->max_discard_segments = USHRT_MAX; |
b1bd055d | 132 | lim->max_hw_sectors = UINT_MAX; |
d82ae52e | 133 | lim->max_segment_size = UINT_MAX; |
fe86cdce | 134 | lim->max_sectors = UINT_MAX; |
ca369d51 | 135 | lim->max_dev_sectors = UINT_MAX; |
4363ac7c | 136 | lim->max_write_same_sectors = UINT_MAX; |
a6f0788e | 137 | lim->max_write_zeroes_sectors = UINT_MAX; |
b1bd055d MP |
138 | } |
139 | EXPORT_SYMBOL(blk_set_stacking_limits); | |
140 | ||
86db1e29 JA |
141 | /** |
142 | * blk_queue_make_request - define an alternate make_request function for a device | |
143 | * @q: the request queue for the device to be affected | |
144 | * @mfn: the alternate make_request function | |
145 | * | |
146 | * Description: | |
147 | * The normal way for &struct bios to be passed to a device | |
148 | * driver is for them to be collected into requests on a request | |
149 | * queue, and then to allow the device driver to select requests | |
150 | * off that queue when it is ready. This works well for many block | |
151 | * devices. However some block devices (typically virtual devices | |
152 | * such as md or lvm) do not benefit from the processing on the | |
153 | * request queue, and are served best by having the requests passed | |
154 | * directly to them. This can be achieved by providing a function | |
155 | * to blk_queue_make_request(). | |
156 | * | |
157 | * Caveat: | |
158 | * The driver that does this *must* be able to deal appropriately | |
159 | * with buffers in "highmemory". This can be accomplished by either calling | |
d004a5e7 | 160 | * kmap_atomic() to get a temporary kernel mapping, or by calling |
86db1e29 JA |
161 | * blk_queue_bounce() to create a buffer in normal memory. |
162 | **/ | |
6728cb0e | 163 | void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn) |
86db1e29 JA |
164 | { |
165 | /* | |
166 | * set defaults | |
167 | */ | |
168 | q->nr_requests = BLKDEV_MAX_RQ; | |
0e435ac2 | 169 | |
86db1e29 | 170 | q->make_request_fn = mfn; |
86db1e29 JA |
171 | blk_queue_dma_alignment(q, 511); |
172 | blk_queue_congestion_threshold(q); | |
173 | q->nr_batching = BLK_BATCH_REQ; | |
174 | ||
e475bba2 | 175 | blk_set_default_limits(&q->limits); |
86db1e29 | 176 | } |
86db1e29 JA |
177 | EXPORT_SYMBOL(blk_queue_make_request); |
178 | ||
179 | /** | |
180 | * blk_queue_bounce_limit - set bounce buffer limit for queue | |
cd0aca2d | 181 | * @q: the request queue for the device |
9f7e45d8 | 182 | * @max_addr: the maximum address the device can handle |
86db1e29 JA |
183 | * |
184 | * Description: | |
185 | * Different hardware can have different requirements as to what pages | |
186 | * it can do I/O directly to. A low level driver can call | |
187 | * blk_queue_bounce_limit to have lower memory pages allocated as bounce | |
9f7e45d8 | 188 | * buffers for doing I/O to pages residing above @max_addr. |
86db1e29 | 189 | **/ |
9f7e45d8 | 190 | void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr) |
86db1e29 | 191 | { |
9f7e45d8 | 192 | unsigned long b_pfn = max_addr >> PAGE_SHIFT; |
86db1e29 JA |
193 | int dma = 0; |
194 | ||
195 | q->bounce_gfp = GFP_NOIO; | |
196 | #if BITS_PER_LONG == 64 | |
cd0aca2d TH |
197 | /* |
198 | * Assume anything <= 4GB can be handled by IOMMU. Actually | |
199 | * some IOMMUs can handle everything, but I don't know of a | |
200 | * way to test this here. | |
201 | */ | |
202 | if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT)) | |
86db1e29 | 203 | dma = 1; |
efb012b3 | 204 | q->limits.bounce_pfn = max(max_low_pfn, b_pfn); |
86db1e29 | 205 | #else |
6728cb0e | 206 | if (b_pfn < blk_max_low_pfn) |
86db1e29 | 207 | dma = 1; |
c49825fa | 208 | q->limits.bounce_pfn = b_pfn; |
260a67a9 | 209 | #endif |
86db1e29 JA |
210 | if (dma) { |
211 | init_emergency_isa_pool(); | |
212 | q->bounce_gfp = GFP_NOIO | GFP_DMA; | |
260a67a9 | 213 | q->limits.bounce_pfn = b_pfn; |
86db1e29 JA |
214 | } |
215 | } | |
86db1e29 JA |
216 | EXPORT_SYMBOL(blk_queue_bounce_limit); |
217 | ||
218 | /** | |
ca369d51 MP |
219 | * blk_queue_max_hw_sectors - set max sectors for a request for this queue |
220 | * @q: the request queue for the device | |
2800aac1 | 221 | * @max_hw_sectors: max hardware sectors in the usual 512b unit |
86db1e29 JA |
222 | * |
223 | * Description: | |
2800aac1 MP |
224 | * Enables a low level driver to set a hard upper limit, |
225 | * max_hw_sectors, on the size of requests. max_hw_sectors is set by | |
4f258a46 MP |
226 | * the device driver based upon the capabilities of the I/O |
227 | * controller. | |
2800aac1 | 228 | * |
ca369d51 MP |
229 | * max_dev_sectors is a hard limit imposed by the storage device for |
230 | * READ/WRITE requests. It is set by the disk driver. | |
231 | * | |
2800aac1 MP |
232 | * max_sectors is a soft limit imposed by the block layer for |
233 | * filesystem type requests. This value can be overridden on a | |
234 | * per-device basis in /sys/block/<device>/queue/max_sectors_kb. | |
235 | * The soft limit can not exceed max_hw_sectors. | |
86db1e29 | 236 | **/ |
ca369d51 | 237 | void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors) |
86db1e29 | 238 | { |
ca369d51 MP |
239 | struct queue_limits *limits = &q->limits; |
240 | unsigned int max_sectors; | |
241 | ||
09cbfeaf KS |
242 | if ((max_hw_sectors << 9) < PAGE_SIZE) { |
243 | max_hw_sectors = 1 << (PAGE_SHIFT - 9); | |
24c03d47 | 244 | printk(KERN_INFO "%s: set to minimum %d\n", |
2800aac1 | 245 | __func__, max_hw_sectors); |
86db1e29 JA |
246 | } |
247 | ||
30e2bc08 | 248 | limits->max_hw_sectors = max_hw_sectors; |
ca369d51 MP |
249 | max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors); |
250 | max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS); | |
251 | limits->max_sectors = max_sectors; | |
dc3b17cc | 252 | q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9); |
86db1e29 | 253 | } |
086fa5ff | 254 | EXPORT_SYMBOL(blk_queue_max_hw_sectors); |
86db1e29 | 255 | |
762380ad JA |
256 | /** |
257 | * blk_queue_chunk_sectors - set size of the chunk for this queue | |
258 | * @q: the request queue for the device | |
259 | * @chunk_sectors: chunk sectors in the usual 512b unit | |
260 | * | |
261 | * Description: | |
262 | * If a driver doesn't want IOs to cross a given chunk size, it can set | |
263 | * this limit and prevent merging across chunks. Note that the chunk size | |
58a4915a JA |
264 | * must currently be a power-of-2 in sectors. Also note that the block |
265 | * layer must accept a page worth of data at any offset. So if the | |
266 | * crossing of chunks is a hard limitation in the driver, it must still be | |
267 | * prepared to split single page bios. | |
762380ad JA |
268 | **/ |
269 | void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors) | |
270 | { | |
271 | BUG_ON(!is_power_of_2(chunk_sectors)); | |
272 | q->limits.chunk_sectors = chunk_sectors; | |
273 | } | |
274 | EXPORT_SYMBOL(blk_queue_chunk_sectors); | |
275 | ||
67efc925 CH |
276 | /** |
277 | * blk_queue_max_discard_sectors - set max sectors for a single discard | |
278 | * @q: the request queue for the device | |
c7ebf065 | 279 | * @max_discard_sectors: maximum number of sectors to discard |
67efc925 CH |
280 | **/ |
281 | void blk_queue_max_discard_sectors(struct request_queue *q, | |
282 | unsigned int max_discard_sectors) | |
283 | { | |
0034af03 | 284 | q->limits.max_hw_discard_sectors = max_discard_sectors; |
67efc925 CH |
285 | q->limits.max_discard_sectors = max_discard_sectors; |
286 | } | |
287 | EXPORT_SYMBOL(blk_queue_max_discard_sectors); | |
288 | ||
4363ac7c MP |
289 | /** |
290 | * blk_queue_max_write_same_sectors - set max sectors for a single write same | |
291 | * @q: the request queue for the device | |
292 | * @max_write_same_sectors: maximum number of sectors to write per command | |
293 | **/ | |
294 | void blk_queue_max_write_same_sectors(struct request_queue *q, | |
295 | unsigned int max_write_same_sectors) | |
296 | { | |
297 | q->limits.max_write_same_sectors = max_write_same_sectors; | |
298 | } | |
299 | EXPORT_SYMBOL(blk_queue_max_write_same_sectors); | |
300 | ||
a6f0788e CK |
301 | /** |
302 | * blk_queue_max_write_zeroes_sectors - set max sectors for a single | |
303 | * write zeroes | |
304 | * @q: the request queue for the device | |
305 | * @max_write_zeroes_sectors: maximum number of sectors to write per command | |
306 | **/ | |
307 | void blk_queue_max_write_zeroes_sectors(struct request_queue *q, | |
308 | unsigned int max_write_zeroes_sectors) | |
309 | { | |
310 | q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors; | |
311 | } | |
312 | EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors); | |
313 | ||
86db1e29 | 314 | /** |
8a78362c | 315 | * blk_queue_max_segments - set max hw segments for a request for this queue |
86db1e29 JA |
316 | * @q: the request queue for the device |
317 | * @max_segments: max number of segments | |
318 | * | |
319 | * Description: | |
320 | * Enables a low level driver to set an upper limit on the number of | |
8a78362c | 321 | * hw data segments in a request. |
86db1e29 | 322 | **/ |
8a78362c | 323 | void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments) |
86db1e29 JA |
324 | { |
325 | if (!max_segments) { | |
326 | max_segments = 1; | |
24c03d47 HH |
327 | printk(KERN_INFO "%s: set to minimum %d\n", |
328 | __func__, max_segments); | |
86db1e29 JA |
329 | } |
330 | ||
8a78362c | 331 | q->limits.max_segments = max_segments; |
86db1e29 | 332 | } |
8a78362c | 333 | EXPORT_SYMBOL(blk_queue_max_segments); |
86db1e29 | 334 | |
1e739730 CH |
335 | /** |
336 | * blk_queue_max_discard_segments - set max segments for discard requests | |
337 | * @q: the request queue for the device | |
338 | * @max_segments: max number of segments | |
339 | * | |
340 | * Description: | |
341 | * Enables a low level driver to set an upper limit on the number of | |
342 | * segments in a discard request. | |
343 | **/ | |
344 | void blk_queue_max_discard_segments(struct request_queue *q, | |
345 | unsigned short max_segments) | |
346 | { | |
347 | q->limits.max_discard_segments = max_segments; | |
348 | } | |
349 | EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments); | |
350 | ||
86db1e29 JA |
351 | /** |
352 | * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg | |
353 | * @q: the request queue for the device | |
354 | * @max_size: max size of segment in bytes | |
355 | * | |
356 | * Description: | |
357 | * Enables a low level driver to set an upper limit on the size of a | |
358 | * coalesced segment | |
359 | **/ | |
360 | void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size) | |
361 | { | |
09cbfeaf KS |
362 | if (max_size < PAGE_SIZE) { |
363 | max_size = PAGE_SIZE; | |
24c03d47 HH |
364 | printk(KERN_INFO "%s: set to minimum %d\n", |
365 | __func__, max_size); | |
86db1e29 JA |
366 | } |
367 | ||
025146e1 | 368 | q->limits.max_segment_size = max_size; |
86db1e29 | 369 | } |
86db1e29 JA |
370 | EXPORT_SYMBOL(blk_queue_max_segment_size); |
371 | ||
372 | /** | |
e1defc4f | 373 | * blk_queue_logical_block_size - set logical block size for the queue |
86db1e29 | 374 | * @q: the request queue for the device |
e1defc4f | 375 | * @size: the logical block size, in bytes |
86db1e29 JA |
376 | * |
377 | * Description: | |
e1defc4f MP |
378 | * This should be set to the lowest possible block size that the |
379 | * storage device can address. The default of 512 covers most | |
380 | * hardware. | |
86db1e29 | 381 | **/ |
e1defc4f | 382 | void blk_queue_logical_block_size(struct request_queue *q, unsigned short size) |
86db1e29 | 383 | { |
025146e1 | 384 | q->limits.logical_block_size = size; |
c72758f3 MP |
385 | |
386 | if (q->limits.physical_block_size < size) | |
387 | q->limits.physical_block_size = size; | |
388 | ||
389 | if (q->limits.io_min < q->limits.physical_block_size) | |
390 | q->limits.io_min = q->limits.physical_block_size; | |
86db1e29 | 391 | } |
e1defc4f | 392 | EXPORT_SYMBOL(blk_queue_logical_block_size); |
86db1e29 | 393 | |
c72758f3 MP |
394 | /** |
395 | * blk_queue_physical_block_size - set physical block size for the queue | |
396 | * @q: the request queue for the device | |
397 | * @size: the physical block size, in bytes | |
398 | * | |
399 | * Description: | |
400 | * This should be set to the lowest possible sector size that the | |
401 | * hardware can operate on without reverting to read-modify-write | |
402 | * operations. | |
403 | */ | |
892b6f90 | 404 | void blk_queue_physical_block_size(struct request_queue *q, unsigned int size) |
c72758f3 MP |
405 | { |
406 | q->limits.physical_block_size = size; | |
407 | ||
408 | if (q->limits.physical_block_size < q->limits.logical_block_size) | |
409 | q->limits.physical_block_size = q->limits.logical_block_size; | |
410 | ||
411 | if (q->limits.io_min < q->limits.physical_block_size) | |
412 | q->limits.io_min = q->limits.physical_block_size; | |
413 | } | |
414 | EXPORT_SYMBOL(blk_queue_physical_block_size); | |
415 | ||
416 | /** | |
417 | * blk_queue_alignment_offset - set physical block alignment offset | |
418 | * @q: the request queue for the device | |
8ebf9756 | 419 | * @offset: alignment offset in bytes |
c72758f3 MP |
420 | * |
421 | * Description: | |
422 | * Some devices are naturally misaligned to compensate for things like | |
423 | * the legacy DOS partition table 63-sector offset. Low-level drivers | |
424 | * should call this function for devices whose first sector is not | |
425 | * naturally aligned. | |
426 | */ | |
427 | void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset) | |
428 | { | |
429 | q->limits.alignment_offset = | |
430 | offset & (q->limits.physical_block_size - 1); | |
431 | q->limits.misaligned = 0; | |
432 | } | |
433 | EXPORT_SYMBOL(blk_queue_alignment_offset); | |
434 | ||
7c958e32 MP |
435 | /** |
436 | * blk_limits_io_min - set minimum request size for a device | |
437 | * @limits: the queue limits | |
438 | * @min: smallest I/O size in bytes | |
439 | * | |
440 | * Description: | |
441 | * Some devices have an internal block size bigger than the reported | |
442 | * hardware sector size. This function can be used to signal the | |
443 | * smallest I/O the device can perform without incurring a performance | |
444 | * penalty. | |
445 | */ | |
446 | void blk_limits_io_min(struct queue_limits *limits, unsigned int min) | |
447 | { | |
448 | limits->io_min = min; | |
449 | ||
450 | if (limits->io_min < limits->logical_block_size) | |
451 | limits->io_min = limits->logical_block_size; | |
452 | ||
453 | if (limits->io_min < limits->physical_block_size) | |
454 | limits->io_min = limits->physical_block_size; | |
455 | } | |
456 | EXPORT_SYMBOL(blk_limits_io_min); | |
457 | ||
c72758f3 MP |
458 | /** |
459 | * blk_queue_io_min - set minimum request size for the queue | |
460 | * @q: the request queue for the device | |
8ebf9756 | 461 | * @min: smallest I/O size in bytes |
c72758f3 MP |
462 | * |
463 | * Description: | |
7e5f5fb0 MP |
464 | * Storage devices may report a granularity or preferred minimum I/O |
465 | * size which is the smallest request the device can perform without | |
466 | * incurring a performance penalty. For disk drives this is often the | |
467 | * physical block size. For RAID arrays it is often the stripe chunk | |
468 | * size. A properly aligned multiple of minimum_io_size is the | |
469 | * preferred request size for workloads where a high number of I/O | |
470 | * operations is desired. | |
c72758f3 MP |
471 | */ |
472 | void blk_queue_io_min(struct request_queue *q, unsigned int min) | |
473 | { | |
7c958e32 | 474 | blk_limits_io_min(&q->limits, min); |
c72758f3 MP |
475 | } |
476 | EXPORT_SYMBOL(blk_queue_io_min); | |
477 | ||
3c5820c7 MP |
478 | /** |
479 | * blk_limits_io_opt - set optimal request size for a device | |
480 | * @limits: the queue limits | |
481 | * @opt: smallest I/O size in bytes | |
482 | * | |
483 | * Description: | |
484 | * Storage devices may report an optimal I/O size, which is the | |
485 | * device's preferred unit for sustained I/O. This is rarely reported | |
486 | * for disk drives. For RAID arrays it is usually the stripe width or | |
487 | * the internal track size. A properly aligned multiple of | |
488 | * optimal_io_size is the preferred request size for workloads where | |
489 | * sustained throughput is desired. | |
490 | */ | |
491 | void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt) | |
492 | { | |
493 | limits->io_opt = opt; | |
494 | } | |
495 | EXPORT_SYMBOL(blk_limits_io_opt); | |
496 | ||
c72758f3 MP |
497 | /** |
498 | * blk_queue_io_opt - set optimal request size for the queue | |
499 | * @q: the request queue for the device | |
8ebf9756 | 500 | * @opt: optimal request size in bytes |
c72758f3 MP |
501 | * |
502 | * Description: | |
7e5f5fb0 MP |
503 | * Storage devices may report an optimal I/O size, which is the |
504 | * device's preferred unit for sustained I/O. This is rarely reported | |
505 | * for disk drives. For RAID arrays it is usually the stripe width or | |
506 | * the internal track size. A properly aligned multiple of | |
507 | * optimal_io_size is the preferred request size for workloads where | |
508 | * sustained throughput is desired. | |
c72758f3 MP |
509 | */ |
510 | void blk_queue_io_opt(struct request_queue *q, unsigned int opt) | |
511 | { | |
3c5820c7 | 512 | blk_limits_io_opt(&q->limits, opt); |
c72758f3 MP |
513 | } |
514 | EXPORT_SYMBOL(blk_queue_io_opt); | |
515 | ||
86db1e29 JA |
516 | /** |
517 | * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers | |
518 | * @t: the stacking driver (top) | |
519 | * @b: the underlying device (bottom) | |
520 | **/ | |
521 | void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b) | |
522 | { | |
fef24667 | 523 | blk_stack_limits(&t->limits, &b->limits, 0); |
86db1e29 | 524 | } |
86db1e29 JA |
525 | EXPORT_SYMBOL(blk_queue_stack_limits); |
526 | ||
c72758f3 MP |
527 | /** |
528 | * blk_stack_limits - adjust queue_limits for stacked devices | |
81744ee4 MP |
529 | * @t: the stacking driver limits (top device) |
530 | * @b: the underlying queue limits (bottom, component device) | |
e03a72e1 | 531 | * @start: first data sector within component device |
c72758f3 MP |
532 | * |
533 | * Description: | |
81744ee4 MP |
534 | * This function is used by stacking drivers like MD and DM to ensure |
535 | * that all component devices have compatible block sizes and | |
536 | * alignments. The stacking driver must provide a queue_limits | |
537 | * struct (top) and then iteratively call the stacking function for | |
538 | * all component (bottom) devices. The stacking function will | |
539 | * attempt to combine the values and ensure proper alignment. | |
540 | * | |
541 | * Returns 0 if the top and bottom queue_limits are compatible. The | |
542 | * top device's block sizes and alignment offsets may be adjusted to | |
543 | * ensure alignment with the bottom device. If no compatible sizes | |
544 | * and alignments exist, -1 is returned and the resulting top | |
545 | * queue_limits will have the misaligned flag set to indicate that | |
546 | * the alignment_offset is undefined. | |
c72758f3 MP |
547 | */ |
548 | int blk_stack_limits(struct queue_limits *t, struct queue_limits *b, | |
e03a72e1 | 549 | sector_t start) |
c72758f3 | 550 | { |
e03a72e1 | 551 | unsigned int top, bottom, alignment, ret = 0; |
86b37281 | 552 | |
c72758f3 MP |
553 | t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors); |
554 | t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors); | |
ca369d51 | 555 | t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors); |
4363ac7c MP |
556 | t->max_write_same_sectors = min(t->max_write_same_sectors, |
557 | b->max_write_same_sectors); | |
a6f0788e CK |
558 | t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors, |
559 | b->max_write_zeroes_sectors); | |
77634f33 | 560 | t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn); |
c72758f3 MP |
561 | |
562 | t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask, | |
563 | b->seg_boundary_mask); | |
03100aad KB |
564 | t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask, |
565 | b->virt_boundary_mask); | |
c72758f3 | 566 | |
8a78362c | 567 | t->max_segments = min_not_zero(t->max_segments, b->max_segments); |
1e739730 CH |
568 | t->max_discard_segments = min_not_zero(t->max_discard_segments, |
569 | b->max_discard_segments); | |
13f05c8d MP |
570 | t->max_integrity_segments = min_not_zero(t->max_integrity_segments, |
571 | b->max_integrity_segments); | |
c72758f3 MP |
572 | |
573 | t->max_segment_size = min_not_zero(t->max_segment_size, | |
574 | b->max_segment_size); | |
575 | ||
fe0b393f MP |
576 | t->misaligned |= b->misaligned; |
577 | ||
e03a72e1 | 578 | alignment = queue_limit_alignment_offset(b, start); |
9504e086 | 579 | |
81744ee4 MP |
580 | /* Bottom device has different alignment. Check that it is |
581 | * compatible with the current top alignment. | |
582 | */ | |
9504e086 MP |
583 | if (t->alignment_offset != alignment) { |
584 | ||
585 | top = max(t->physical_block_size, t->io_min) | |
586 | + t->alignment_offset; | |
81744ee4 | 587 | bottom = max(b->physical_block_size, b->io_min) + alignment; |
9504e086 | 588 | |
81744ee4 | 589 | /* Verify that top and bottom intervals line up */ |
b8839b8c | 590 | if (max(top, bottom) % min(top, bottom)) { |
9504e086 | 591 | t->misaligned = 1; |
fe0b393f MP |
592 | ret = -1; |
593 | } | |
9504e086 MP |
594 | } |
595 | ||
c72758f3 MP |
596 | t->logical_block_size = max(t->logical_block_size, |
597 | b->logical_block_size); | |
598 | ||
599 | t->physical_block_size = max(t->physical_block_size, | |
600 | b->physical_block_size); | |
601 | ||
602 | t->io_min = max(t->io_min, b->io_min); | |
e9637415 | 603 | t->io_opt = lcm_not_zero(t->io_opt, b->io_opt); |
9504e086 | 604 | |
e692cb66 | 605 | t->cluster &= b->cluster; |
c72758f3 | 606 | |
81744ee4 | 607 | /* Physical block size a multiple of the logical block size? */ |
9504e086 MP |
608 | if (t->physical_block_size & (t->logical_block_size - 1)) { |
609 | t->physical_block_size = t->logical_block_size; | |
c72758f3 | 610 | t->misaligned = 1; |
fe0b393f | 611 | ret = -1; |
86b37281 MP |
612 | } |
613 | ||
81744ee4 | 614 | /* Minimum I/O a multiple of the physical block size? */ |
9504e086 MP |
615 | if (t->io_min & (t->physical_block_size - 1)) { |
616 | t->io_min = t->physical_block_size; | |
617 | t->misaligned = 1; | |
fe0b393f | 618 | ret = -1; |
c72758f3 MP |
619 | } |
620 | ||
81744ee4 | 621 | /* Optimal I/O a multiple of the physical block size? */ |
9504e086 MP |
622 | if (t->io_opt & (t->physical_block_size - 1)) { |
623 | t->io_opt = 0; | |
624 | t->misaligned = 1; | |
fe0b393f | 625 | ret = -1; |
9504e086 | 626 | } |
c72758f3 | 627 | |
c78afc62 KO |
628 | t->raid_partial_stripes_expensive = |
629 | max(t->raid_partial_stripes_expensive, | |
630 | b->raid_partial_stripes_expensive); | |
631 | ||
81744ee4 | 632 | /* Find lowest common alignment_offset */ |
e9637415 | 633 | t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment) |
b8839b8c | 634 | % max(t->physical_block_size, t->io_min); |
86b37281 | 635 | |
81744ee4 | 636 | /* Verify that new alignment_offset is on a logical block boundary */ |
fe0b393f | 637 | if (t->alignment_offset & (t->logical_block_size - 1)) { |
c72758f3 | 638 | t->misaligned = 1; |
fe0b393f MP |
639 | ret = -1; |
640 | } | |
c72758f3 | 641 | |
9504e086 MP |
642 | /* Discard alignment and granularity */ |
643 | if (b->discard_granularity) { | |
e03a72e1 | 644 | alignment = queue_limit_discard_alignment(b, start); |
9504e086 MP |
645 | |
646 | if (t->discard_granularity != 0 && | |
647 | t->discard_alignment != alignment) { | |
648 | top = t->discard_granularity + t->discard_alignment; | |
649 | bottom = b->discard_granularity + alignment; | |
70dd5bf3 | 650 | |
9504e086 | 651 | /* Verify that top and bottom intervals line up */ |
8dd2cb7e | 652 | if ((max(top, bottom) % min(top, bottom)) != 0) |
9504e086 MP |
653 | t->discard_misaligned = 1; |
654 | } | |
655 | ||
81744ee4 MP |
656 | t->max_discard_sectors = min_not_zero(t->max_discard_sectors, |
657 | b->max_discard_sectors); | |
0034af03 JA |
658 | t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors, |
659 | b->max_hw_discard_sectors); | |
9504e086 MP |
660 | t->discard_granularity = max(t->discard_granularity, |
661 | b->discard_granularity); | |
e9637415 | 662 | t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) % |
8dd2cb7e | 663 | t->discard_granularity; |
9504e086 | 664 | } |
70dd5bf3 | 665 | |
987b3b26 HR |
666 | if (b->chunk_sectors) |
667 | t->chunk_sectors = min_not_zero(t->chunk_sectors, | |
668 | b->chunk_sectors); | |
669 | ||
fe0b393f | 670 | return ret; |
c72758f3 | 671 | } |
5d85d324 | 672 | EXPORT_SYMBOL(blk_stack_limits); |
c72758f3 | 673 | |
17be8c24 MP |
674 | /** |
675 | * bdev_stack_limits - adjust queue limits for stacked drivers | |
676 | * @t: the stacking driver limits (top device) | |
677 | * @bdev: the component block_device (bottom) | |
678 | * @start: first data sector within component device | |
679 | * | |
680 | * Description: | |
681 | * Merges queue limits for a top device and a block_device. Returns | |
682 | * 0 if alignment didn't change. Returns -1 if adding the bottom | |
683 | * device caused misalignment. | |
684 | */ | |
685 | int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev, | |
686 | sector_t start) | |
687 | { | |
688 | struct request_queue *bq = bdev_get_queue(bdev); | |
689 | ||
690 | start += get_start_sect(bdev); | |
691 | ||
e03a72e1 | 692 | return blk_stack_limits(t, &bq->limits, start); |
17be8c24 MP |
693 | } |
694 | EXPORT_SYMBOL(bdev_stack_limits); | |
695 | ||
c72758f3 MP |
696 | /** |
697 | * disk_stack_limits - adjust queue limits for stacked drivers | |
77634f33 | 698 | * @disk: MD/DM gendisk (top) |
c72758f3 MP |
699 | * @bdev: the underlying block device (bottom) |
700 | * @offset: offset to beginning of data within component device | |
701 | * | |
702 | * Description: | |
e03a72e1 MP |
703 | * Merges the limits for a top level gendisk and a bottom level |
704 | * block_device. | |
c72758f3 MP |
705 | */ |
706 | void disk_stack_limits(struct gendisk *disk, struct block_device *bdev, | |
707 | sector_t offset) | |
708 | { | |
709 | struct request_queue *t = disk->queue; | |
c72758f3 | 710 | |
e03a72e1 | 711 | if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) { |
c72758f3 MP |
712 | char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE]; |
713 | ||
714 | disk_name(disk, 0, top); | |
715 | bdevname(bdev, bottom); | |
716 | ||
717 | printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n", | |
718 | top, bottom); | |
719 | } | |
c72758f3 MP |
720 | } |
721 | EXPORT_SYMBOL(disk_stack_limits); | |
722 | ||
e3790c7d TH |
723 | /** |
724 | * blk_queue_dma_pad - set pad mask | |
725 | * @q: the request queue for the device | |
726 | * @mask: pad mask | |
727 | * | |
27f8221a | 728 | * Set dma pad mask. |
e3790c7d | 729 | * |
27f8221a FT |
730 | * Appending pad buffer to a request modifies the last entry of a |
731 | * scatter list such that it includes the pad buffer. | |
e3790c7d TH |
732 | **/ |
733 | void blk_queue_dma_pad(struct request_queue *q, unsigned int mask) | |
734 | { | |
735 | q->dma_pad_mask = mask; | |
736 | } | |
737 | EXPORT_SYMBOL(blk_queue_dma_pad); | |
738 | ||
27f8221a FT |
739 | /** |
740 | * blk_queue_update_dma_pad - update pad mask | |
741 | * @q: the request queue for the device | |
742 | * @mask: pad mask | |
743 | * | |
744 | * Update dma pad mask. | |
745 | * | |
746 | * Appending pad buffer to a request modifies the last entry of a | |
747 | * scatter list such that it includes the pad buffer. | |
748 | **/ | |
749 | void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask) | |
750 | { | |
751 | if (mask > q->dma_pad_mask) | |
752 | q->dma_pad_mask = mask; | |
753 | } | |
754 | EXPORT_SYMBOL(blk_queue_update_dma_pad); | |
755 | ||
86db1e29 JA |
756 | /** |
757 | * blk_queue_dma_drain - Set up a drain buffer for excess dma. | |
86db1e29 | 758 | * @q: the request queue for the device |
2fb98e84 | 759 | * @dma_drain_needed: fn which returns non-zero if drain is necessary |
86db1e29 JA |
760 | * @buf: physically contiguous buffer |
761 | * @size: size of the buffer in bytes | |
762 | * | |
763 | * Some devices have excess DMA problems and can't simply discard (or | |
764 | * zero fill) the unwanted piece of the transfer. They have to have a | |
765 | * real area of memory to transfer it into. The use case for this is | |
766 | * ATAPI devices in DMA mode. If the packet command causes a transfer | |
767 | * bigger than the transfer size some HBAs will lock up if there | |
768 | * aren't DMA elements to contain the excess transfer. What this API | |
769 | * does is adjust the queue so that the buf is always appended | |
770 | * silently to the scatterlist. | |
771 | * | |
8a78362c MP |
772 | * Note: This routine adjusts max_hw_segments to make room for appending |
773 | * the drain buffer. If you call blk_queue_max_segments() after calling | |
774 | * this routine, you must set the limit to one fewer than your device | |
775 | * can support otherwise there won't be room for the drain buffer. | |
86db1e29 | 776 | */ |
448da4d2 | 777 | int blk_queue_dma_drain(struct request_queue *q, |
2fb98e84 TH |
778 | dma_drain_needed_fn *dma_drain_needed, |
779 | void *buf, unsigned int size) | |
86db1e29 | 780 | { |
8a78362c | 781 | if (queue_max_segments(q) < 2) |
86db1e29 JA |
782 | return -EINVAL; |
783 | /* make room for appending the drain */ | |
8a78362c | 784 | blk_queue_max_segments(q, queue_max_segments(q) - 1); |
2fb98e84 | 785 | q->dma_drain_needed = dma_drain_needed; |
86db1e29 JA |
786 | q->dma_drain_buffer = buf; |
787 | q->dma_drain_size = size; | |
788 | ||
789 | return 0; | |
790 | } | |
86db1e29 JA |
791 | EXPORT_SYMBOL_GPL(blk_queue_dma_drain); |
792 | ||
793 | /** | |
794 | * blk_queue_segment_boundary - set boundary rules for segment merging | |
795 | * @q: the request queue for the device | |
796 | * @mask: the memory boundary mask | |
797 | **/ | |
798 | void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask) | |
799 | { | |
09cbfeaf KS |
800 | if (mask < PAGE_SIZE - 1) { |
801 | mask = PAGE_SIZE - 1; | |
24c03d47 HH |
802 | printk(KERN_INFO "%s: set to minimum %lx\n", |
803 | __func__, mask); | |
86db1e29 JA |
804 | } |
805 | ||
025146e1 | 806 | q->limits.seg_boundary_mask = mask; |
86db1e29 | 807 | } |
86db1e29 JA |
808 | EXPORT_SYMBOL(blk_queue_segment_boundary); |
809 | ||
03100aad KB |
810 | /** |
811 | * blk_queue_virt_boundary - set boundary rules for bio merging | |
812 | * @q: the request queue for the device | |
813 | * @mask: the memory boundary mask | |
814 | **/ | |
815 | void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask) | |
816 | { | |
817 | q->limits.virt_boundary_mask = mask; | |
818 | } | |
819 | EXPORT_SYMBOL(blk_queue_virt_boundary); | |
820 | ||
86db1e29 JA |
821 | /** |
822 | * blk_queue_dma_alignment - set dma length and memory alignment | |
823 | * @q: the request queue for the device | |
824 | * @mask: alignment mask | |
825 | * | |
826 | * description: | |
710027a4 | 827 | * set required memory and length alignment for direct dma transactions. |
8feb4d20 | 828 | * this is used when building direct io requests for the queue. |
86db1e29 JA |
829 | * |
830 | **/ | |
831 | void blk_queue_dma_alignment(struct request_queue *q, int mask) | |
832 | { | |
833 | q->dma_alignment = mask; | |
834 | } | |
86db1e29 JA |
835 | EXPORT_SYMBOL(blk_queue_dma_alignment); |
836 | ||
837 | /** | |
838 | * blk_queue_update_dma_alignment - update dma length and memory alignment | |
839 | * @q: the request queue for the device | |
840 | * @mask: alignment mask | |
841 | * | |
842 | * description: | |
710027a4 | 843 | * update required memory and length alignment for direct dma transactions. |
86db1e29 JA |
844 | * If the requested alignment is larger than the current alignment, then |
845 | * the current queue alignment is updated to the new value, otherwise it | |
846 | * is left alone. The design of this is to allow multiple objects | |
847 | * (driver, device, transport etc) to set their respective | |
848 | * alignments without having them interfere. | |
849 | * | |
850 | **/ | |
851 | void blk_queue_update_dma_alignment(struct request_queue *q, int mask) | |
852 | { | |
853 | BUG_ON(mask > PAGE_SIZE); | |
854 | ||
855 | if (mask > q->dma_alignment) | |
856 | q->dma_alignment = mask; | |
857 | } | |
86db1e29 JA |
858 | EXPORT_SYMBOL(blk_queue_update_dma_alignment); |
859 | ||
f3876930 | 860 | void blk_queue_flush_queueable(struct request_queue *q, bool queueable) |
861 | { | |
c888a8f9 | 862 | if (queueable) |
8814ce8a | 863 | blk_queue_flag_clear(QUEUE_FLAG_FLUSH_NQ, q); |
c888a8f9 | 864 | else |
8814ce8a | 865 | blk_queue_flag_set(QUEUE_FLAG_FLUSH_NQ, q); |
f3876930 | 866 | } |
867 | EXPORT_SYMBOL_GPL(blk_queue_flush_queueable); | |
868 | ||
d278d4a8 JA |
869 | /** |
870 | * blk_set_queue_depth - tell the block layer about the device queue depth | |
871 | * @q: the request queue for the device | |
872 | * @depth: queue depth | |
873 | * | |
874 | */ | |
875 | void blk_set_queue_depth(struct request_queue *q, unsigned int depth) | |
876 | { | |
877 | q->queue_depth = depth; | |
a7905043 | 878 | wbt_set_queue_depth(q, depth); |
d278d4a8 JA |
879 | } |
880 | EXPORT_SYMBOL(blk_set_queue_depth); | |
881 | ||
93e9d8e8 JA |
882 | /** |
883 | * blk_queue_write_cache - configure queue's write cache | |
884 | * @q: the request queue for the device | |
885 | * @wc: write back cache on or off | |
886 | * @fua: device supports FUA writes, if true | |
887 | * | |
888 | * Tell the block layer about the write cache of @q. | |
889 | */ | |
890 | void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua) | |
891 | { | |
892 | spin_lock_irq(q->queue_lock); | |
c888a8f9 | 893 | if (wc) |
93e9d8e8 | 894 | queue_flag_set(QUEUE_FLAG_WC, q); |
c888a8f9 | 895 | else |
93e9d8e8 | 896 | queue_flag_clear(QUEUE_FLAG_WC, q); |
c888a8f9 | 897 | if (fua) |
93e9d8e8 | 898 | queue_flag_set(QUEUE_FLAG_FUA, q); |
c888a8f9 | 899 | else |
93e9d8e8 JA |
900 | queue_flag_clear(QUEUE_FLAG_FUA, q); |
901 | spin_unlock_irq(q->queue_lock); | |
87760e5e | 902 | |
a7905043 | 903 | wbt_set_write_cache(q, test_bit(QUEUE_FLAG_WC, &q->queue_flags)); |
93e9d8e8 JA |
904 | } |
905 | EXPORT_SYMBOL_GPL(blk_queue_write_cache); | |
906 | ||
aeb3d3a8 | 907 | static int __init blk_settings_init(void) |
86db1e29 JA |
908 | { |
909 | blk_max_low_pfn = max_low_pfn - 1; | |
910 | blk_max_pfn = max_pfn - 1; | |
911 | return 0; | |
912 | } | |
913 | subsys_initcall(blk_settings_init); |