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