blob: 61afae9dbc6d373c93f866382187dabd136b4655 [file] [log] [blame]
Jens Axboe86db1e22008-01-29 14:53:40 +01001/*
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>
9#include <linux/bootmem.h> /* for max_pfn/max_low_pfn */
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -040010#include <linux/gcd.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010011#include <linux/jiffies.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010012
13#include "blk.h"
14
Jens Axboe6728cb02008-01-31 13:03:55 +010015unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010016EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010017
18unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010019
20/**
21 * blk_queue_prep_rq - set a prepare_request function for queue
22 * @q: queue
23 * @pfn: prepare_request function
24 *
25 * It's possible for a queue to register a prepare_request callback which
26 * is invoked before the request is handed to the request_fn. The goal of
27 * the function is to prepare a request for I/O, it can be used to build a
28 * cdb from the request data for instance.
29 *
30 */
31void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
32{
33 q->prep_rq_fn = pfn;
34}
Jens Axboe86db1e22008-01-29 14:53:40 +010035EXPORT_SYMBOL(blk_queue_prep_rq);
36
37/**
38 * blk_queue_merge_bvec - set a merge_bvec function for queue
39 * @q: queue
40 * @mbfn: merge_bvec_fn
41 *
42 * Usually queues have static limitations on the max sectors or segments that
43 * we can put in a request. Stacking drivers may have some settings that
44 * are dynamic, and thus we have to query the queue whether it is ok to
45 * add a new bio_vec to a bio at a given offset or not. If the block device
46 * has such limitations, it needs to register a merge_bvec_fn to control
47 * the size of bio's sent to it. Note that a block device *must* allow a
48 * single page to be added to an empty bio. The block device driver may want
49 * to use the bio_split() function to deal with these bio's. By default
50 * no merge_bvec_fn is defined for a queue, and only the fixed limits are
51 * honored.
52 */
53void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
54{
55 q->merge_bvec_fn = mbfn;
56}
Jens Axboe86db1e22008-01-29 14:53:40 +010057EXPORT_SYMBOL(blk_queue_merge_bvec);
58
59void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
60{
61 q->softirq_done_fn = fn;
62}
Jens Axboe86db1e22008-01-29 14:53:40 +010063EXPORT_SYMBOL(blk_queue_softirq_done);
64
Jens Axboe242f9dc2008-09-14 05:55:09 -070065void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
66{
67 q->rq_timeout = timeout;
68}
69EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
70
71void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
72{
73 q->rq_timed_out_fn = fn;
74}
75EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
76
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020077void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
78{
79 q->lld_busy_fn = fn;
80}
81EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
82
Jens Axboe86db1e22008-01-29 14:53:40 +010083/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020084 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020085 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020086 *
87 * Description:
88 * Returns a queue_limit struct to its default state. Can be used by
89 * stacking drivers like DM that stage table swaps and reuse an
90 * existing device queue.
91 */
92void blk_set_default_limits(struct queue_limits *lim)
93{
94 lim->max_phys_segments = MAX_PHYS_SEGMENTS;
95 lim->max_hw_segments = MAX_HW_SEGMENTS;
96 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050097 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersen5dee2472009-09-21 21:46:05 +020098 lim->max_sectors = BLK_DEF_MAX_SECTORS;
99 lim->max_hw_sectors = INT_MAX;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100100 lim->max_discard_sectors = 0;
101 lim->discard_granularity = 0;
102 lim->discard_alignment = 0;
103 lim->discard_misaligned = 0;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100104 lim->discard_zeroes_data = -1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200105 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200106 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200107 lim->alignment_offset = 0;
108 lim->io_opt = 0;
109 lim->misaligned = 0;
110 lim->no_cluster = 0;
111}
112EXPORT_SYMBOL(blk_set_default_limits);
113
114/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100115 * blk_queue_make_request - define an alternate make_request function for a device
116 * @q: the request queue for the device to be affected
117 * @mfn: the alternate make_request function
118 *
119 * Description:
120 * The normal way for &struct bios to be passed to a device
121 * driver is for them to be collected into requests on a request
122 * queue, and then to allow the device driver to select requests
123 * off that queue when it is ready. This works well for many block
124 * devices. However some block devices (typically virtual devices
125 * such as md or lvm) do not benefit from the processing on the
126 * request queue, and are served best by having the requests passed
127 * directly to them. This can be achieved by providing a function
128 * to blk_queue_make_request().
129 *
130 * Caveat:
131 * The driver that does this *must* be able to deal appropriately
132 * with buffers in "highmemory". This can be accomplished by either calling
133 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
134 * blk_queue_bounce() to create a buffer in normal memory.
135 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100136void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100137{
138 /*
139 * set defaults
140 */
141 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100142
Jens Axboe86db1e22008-01-29 14:53:40 +0100143 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100144 blk_queue_dma_alignment(q, 511);
145 blk_queue_congestion_threshold(q);
146 q->nr_batching = BLK_BATCH_REQ;
147
148 q->unplug_thresh = 4; /* hmm */
Randy Dunlapad5ebd22009-11-11 13:47:45 +0100149 q->unplug_delay = msecs_to_jiffies(3); /* 3 milliseconds */
Jens Axboe86db1e22008-01-29 14:53:40 +0100150 if (q->unplug_delay == 0)
151 q->unplug_delay = 1;
152
Jens Axboe86db1e22008-01-29 14:53:40 +0100153 q->unplug_timer.function = blk_unplug_timeout;
154 q->unplug_timer.data = (unsigned long)q;
155
Martin K. Petersene475bba2009-06-16 08:23:52 +0200156 blk_set_default_limits(&q->limits);
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500157 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200158
Jens Axboe86db1e22008-01-29 14:53:40 +0100159 /*
Jens Axboea4e7d462009-07-28 09:07:29 +0200160 * If the caller didn't supply a lock, fall back to our embedded
161 * per-queue locks
162 */
163 if (!q->queue_lock)
164 q->queue_lock = &q->__queue_lock;
165
166 /*
Jens Axboe86db1e22008-01-29 14:53:40 +0100167 * by default assume old behaviour and bounce for any highmem page
168 */
169 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
170}
Jens Axboe86db1e22008-01-29 14:53:40 +0100171EXPORT_SYMBOL(blk_queue_make_request);
172
173/**
174 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900175 * @q: the request queue for the device
176 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100177 *
178 * Description:
179 * Different hardware can have different requirements as to what pages
180 * it can do I/O directly to. A low level driver can call
181 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900182 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100183 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900184void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100185{
Tejun Heocd0aca22009-04-15 22:10:25 +0900186 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100187 int dma = 0;
188
189 q->bounce_gfp = GFP_NOIO;
190#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900191 /*
192 * Assume anything <= 4GB can be handled by IOMMU. Actually
193 * some IOMMUs can handle everything, but I don't know of a
194 * way to test this here.
195 */
196 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100197 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400198 q->limits.bounce_pfn = max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100199#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100200 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100201 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400202 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100203#endif
204 if (dma) {
205 init_emergency_isa_pool();
206 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400207 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100208 }
209}
Jens Axboe86db1e22008-01-29 14:53:40 +0100210EXPORT_SYMBOL(blk_queue_bounce_limit);
211
212/**
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500213 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100214 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500215 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100216 *
217 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500218 * Enables a low level driver to set a hard upper limit,
219 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
220 * the device driver based upon the combined capabilities of I/O
221 * controller and storage device.
222 *
223 * max_sectors is a soft limit imposed by the block layer for
224 * filesystem type requests. This value can be overridden on a
225 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
226 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100227 **/
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500228void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100229{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500230 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
231 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700232 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500233 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100234 }
235
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 q->limits.max_hw_sectors = max_hw_sectors;
237 q->limits.max_sectors = min_t(unsigned int, max_hw_sectors,
238 BLK_DEF_MAX_SECTORS);
Jens Axboe86db1e22008-01-29 14:53:40 +0100239}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500240EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100241
242/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200243 * blk_queue_max_discard_sectors - set max sectors for a single discard
244 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200245 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200246 **/
247void blk_queue_max_discard_sectors(struct request_queue *q,
248 unsigned int max_discard_sectors)
249{
250 q->limits.max_discard_sectors = max_discard_sectors;
251}
252EXPORT_SYMBOL(blk_queue_max_discard_sectors);
253
254/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100255 * blk_queue_max_phys_segments - set max phys segments for a request for this queue
256 * @q: the request queue for the device
257 * @max_segments: max number of segments
258 *
259 * Description:
260 * Enables a low level driver to set an upper limit on the number of
261 * physical data segments in a request. This would be the largest sized
262 * scatter list the driver could handle.
263 **/
264void blk_queue_max_phys_segments(struct request_queue *q,
265 unsigned short max_segments)
266{
267 if (!max_segments) {
268 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700269 printk(KERN_INFO "%s: set to minimum %d\n",
270 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100271 }
272
Martin K. Petersen025146e2009-05-22 17:17:51 -0400273 q->limits.max_phys_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100274}
Jens Axboe86db1e22008-01-29 14:53:40 +0100275EXPORT_SYMBOL(blk_queue_max_phys_segments);
276
277/**
278 * blk_queue_max_hw_segments - set max hw segments for a request for this queue
279 * @q: the request queue for the device
280 * @max_segments: max number of segments
281 *
282 * Description:
283 * Enables a low level driver to set an upper limit on the number of
284 * hw data segments in a request. This would be the largest number of
Randy Dunlap710027a2008-08-19 20:13:11 +0200285 * address/length pairs the host adapter can actually give at once
Jens Axboe86db1e22008-01-29 14:53:40 +0100286 * to the device.
287 **/
288void blk_queue_max_hw_segments(struct request_queue *q,
289 unsigned short max_segments)
290{
291 if (!max_segments) {
292 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700293 printk(KERN_INFO "%s: set to minimum %d\n",
294 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100295 }
296
Martin K. Petersen025146e2009-05-22 17:17:51 -0400297 q->limits.max_hw_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100298}
Jens Axboe86db1e22008-01-29 14:53:40 +0100299EXPORT_SYMBOL(blk_queue_max_hw_segments);
300
301/**
302 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
303 * @q: the request queue for the device
304 * @max_size: max size of segment in bytes
305 *
306 * Description:
307 * Enables a low level driver to set an upper limit on the size of a
308 * coalesced segment
309 **/
310void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
311{
312 if (max_size < PAGE_CACHE_SIZE) {
313 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700314 printk(KERN_INFO "%s: set to minimum %d\n",
315 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100316 }
317
Martin K. Petersen025146e2009-05-22 17:17:51 -0400318 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100319}
Jens Axboe86db1e22008-01-29 14:53:40 +0100320EXPORT_SYMBOL(blk_queue_max_segment_size);
321
322/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400323 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100324 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400325 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100326 *
327 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400328 * This should be set to the lowest possible block size that the
329 * storage device can address. The default of 512 covers most
330 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100331 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400332void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100333{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400334 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400335
336 if (q->limits.physical_block_size < size)
337 q->limits.physical_block_size = size;
338
339 if (q->limits.io_min < q->limits.physical_block_size)
340 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100341}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400342EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100343
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400344/**
345 * blk_queue_physical_block_size - set physical block size for the queue
346 * @q: the request queue for the device
347 * @size: the physical block size, in bytes
348 *
349 * Description:
350 * This should be set to the lowest possible sector size that the
351 * hardware can operate on without reverting to read-modify-write
352 * operations.
353 */
354void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
355{
356 q->limits.physical_block_size = size;
357
358 if (q->limits.physical_block_size < q->limits.logical_block_size)
359 q->limits.physical_block_size = q->limits.logical_block_size;
360
361 if (q->limits.io_min < q->limits.physical_block_size)
362 q->limits.io_min = q->limits.physical_block_size;
363}
364EXPORT_SYMBOL(blk_queue_physical_block_size);
365
366/**
367 * blk_queue_alignment_offset - set physical block alignment offset
368 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700369 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400370 *
371 * Description:
372 * Some devices are naturally misaligned to compensate for things like
373 * the legacy DOS partition table 63-sector offset. Low-level drivers
374 * should call this function for devices whose first sector is not
375 * naturally aligned.
376 */
377void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
378{
379 q->limits.alignment_offset =
380 offset & (q->limits.physical_block_size - 1);
381 q->limits.misaligned = 0;
382}
383EXPORT_SYMBOL(blk_queue_alignment_offset);
384
385/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400386 * blk_limits_io_min - set minimum request size for a device
387 * @limits: the queue limits
388 * @min: smallest I/O size in bytes
389 *
390 * Description:
391 * Some devices have an internal block size bigger than the reported
392 * hardware sector size. This function can be used to signal the
393 * smallest I/O the device can perform without incurring a performance
394 * penalty.
395 */
396void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
397{
398 limits->io_min = min;
399
400 if (limits->io_min < limits->logical_block_size)
401 limits->io_min = limits->logical_block_size;
402
403 if (limits->io_min < limits->physical_block_size)
404 limits->io_min = limits->physical_block_size;
405}
406EXPORT_SYMBOL(blk_limits_io_min);
407
408/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400409 * blk_queue_io_min - set minimum request size for the queue
410 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700411 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400412 *
413 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400414 * Storage devices may report a granularity or preferred minimum I/O
415 * size which is the smallest request the device can perform without
416 * incurring a performance penalty. For disk drives this is often the
417 * physical block size. For RAID arrays it is often the stripe chunk
418 * size. A properly aligned multiple of minimum_io_size is the
419 * preferred request size for workloads where a high number of I/O
420 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400421 */
422void blk_queue_io_min(struct request_queue *q, unsigned int min)
423{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400424 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400425}
426EXPORT_SYMBOL(blk_queue_io_min);
427
428/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200429 * blk_limits_io_opt - set optimal request size for a device
430 * @limits: the queue limits
431 * @opt: smallest I/O size in bytes
432 *
433 * Description:
434 * Storage devices may report an optimal I/O size, which is the
435 * device's preferred unit for sustained I/O. This is rarely reported
436 * for disk drives. For RAID arrays it is usually the stripe width or
437 * the internal track size. A properly aligned multiple of
438 * optimal_io_size is the preferred request size for workloads where
439 * sustained throughput is desired.
440 */
441void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
442{
443 limits->io_opt = opt;
444}
445EXPORT_SYMBOL(blk_limits_io_opt);
446
447/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400448 * blk_queue_io_opt - set optimal request size for the queue
449 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700450 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400451 *
452 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400453 * Storage devices may report an optimal I/O size, which is the
454 * device's preferred unit for sustained I/O. This is rarely reported
455 * for disk drives. For RAID arrays it is usually the stripe width or
456 * the internal track size. A properly aligned multiple of
457 * optimal_io_size is the preferred request size for workloads where
458 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400459 */
460void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
461{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200462 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400463}
464EXPORT_SYMBOL(blk_queue_io_opt);
465
Jens Axboe86db1e22008-01-29 14:53:40 +0100466/*
467 * Returns the minimum that is _not_ zero, unless both are zero.
468 */
469#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
470
471/**
472 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
473 * @t: the stacking driver (top)
474 * @b: the underlying device (bottom)
475 **/
476void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
477{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400478 blk_stack_limits(&t->limits, &b->limits, 0);
Martin K. Petersen025146e2009-05-22 17:17:51 -0400479
Neil Browne7e72bf2008-05-14 16:05:54 -0700480 if (!t->queue_lock)
481 WARN_ON_ONCE(1);
482 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
483 unsigned long flags;
484 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200485 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700486 spin_unlock_irqrestore(t->queue_lock, flags);
487 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100488}
Jens Axboe86db1e22008-01-29 14:53:40 +0100489EXPORT_SYMBOL(blk_queue_stack_limits);
490
Martin K. Petersen86b37282009-11-10 11:50:21 +0100491static unsigned int lcm(unsigned int a, unsigned int b)
492{
493 if (a && b)
494 return (a * b) / gcd(a, b);
495 else if (b)
496 return b;
497
498 return a;
499}
500
Jens Axboe86db1e22008-01-29 14:53:40 +0100501/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400502 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100503 * @t: the stacking driver limits (top device)
504 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500505 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400506 *
507 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100508 * This function is used by stacking drivers like MD and DM to ensure
509 * that all component devices have compatible block sizes and
510 * alignments. The stacking driver must provide a queue_limits
511 * struct (top) and then iteratively call the stacking function for
512 * all component (bottom) devices. The stacking function will
513 * attempt to combine the values and ensure proper alignment.
514 *
515 * Returns 0 if the top and bottom queue_limits are compatible. The
516 * top device's block sizes and alignment offsets may be adjusted to
517 * ensure alignment with the bottom device. If no compatible sizes
518 * and alignments exist, -1 is returned and the resulting top
519 * queue_limits will have the misaligned flag set to indicate that
520 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400521 */
522int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500523 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400524{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500525 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100526
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400527 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
528 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200529 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400530
531 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
532 b->seg_boundary_mask);
533
534 t->max_phys_segments = min_not_zero(t->max_phys_segments,
535 b->max_phys_segments);
536
537 t->max_hw_segments = min_not_zero(t->max_hw_segments,
538 b->max_hw_segments);
539
540 t->max_segment_size = min_not_zero(t->max_segment_size,
541 b->max_segment_size);
542
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500543 t->misaligned |= b->misaligned;
544
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500545 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100546
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100547 /* Bottom device has different alignment. Check that it is
548 * compatible with the current top alignment.
549 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100550 if (t->alignment_offset != alignment) {
551
552 top = max(t->physical_block_size, t->io_min)
553 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100554 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100555
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100556 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500557 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100558 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500559 ret = -1;
560 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100561 }
562
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400563 t->logical_block_size = max(t->logical_block_size,
564 b->logical_block_size);
565
566 t->physical_block_size = max(t->physical_block_size,
567 b->physical_block_size);
568
569 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100570 t->io_opt = lcm(t->io_opt, b->io_opt);
571
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400572 t->no_cluster |= b->no_cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100573 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400574
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100575 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100576 if (t->physical_block_size & (t->logical_block_size - 1)) {
577 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400578 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500579 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100580 }
581
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100582 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583 if (t->io_min & (t->physical_block_size - 1)) {
584 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400585 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500586 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400587 }
588
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100589 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100590 if (t->io_opt & (t->physical_block_size - 1)) {
591 t->io_opt = 0;
592 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500593 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100594 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400595
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100596 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100597 t->alignment_offset = lcm(t->alignment_offset, alignment)
598 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400599
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100600 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500601 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100602 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500603 ret = -1;
604 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100605
606 /* Discard alignment and granularity */
607 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500608 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100609
610 if (t->discard_granularity != 0 &&
611 t->discard_alignment != alignment) {
612 top = t->discard_granularity + t->discard_alignment;
613 bottom = b->discard_granularity + alignment;
614
615 /* Verify that top and bottom intervals line up */
616 if (max(top, bottom) & (min(top, bottom) - 1))
617 t->discard_misaligned = 1;
618 }
619
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100620 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
621 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100622 t->discard_granularity = max(t->discard_granularity,
623 b->discard_granularity);
624 t->discard_alignment = lcm(t->discard_alignment, alignment) &
625 (t->discard_granularity - 1);
626 }
627
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500628 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400629}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200630EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400631
632/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500633 * bdev_stack_limits - adjust queue limits for stacked drivers
634 * @t: the stacking driver limits (top device)
635 * @bdev: the component block_device (bottom)
636 * @start: first data sector within component device
637 *
638 * Description:
639 * Merges queue limits for a top device and a block_device. Returns
640 * 0 if alignment didn't change. Returns -1 if adding the bottom
641 * device caused misalignment.
642 */
643int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
644 sector_t start)
645{
646 struct request_queue *bq = bdev_get_queue(bdev);
647
648 start += get_start_sect(bdev);
649
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500650 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500651}
652EXPORT_SYMBOL(bdev_stack_limits);
653
654/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400655 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200656 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400657 * @bdev: the underlying block device (bottom)
658 * @offset: offset to beginning of data within component device
659 *
660 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500661 * Merges the limits for a top level gendisk and a bottom level
662 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400663 */
664void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
665 sector_t offset)
666{
667 struct request_queue *t = disk->queue;
668 struct request_queue *b = bdev_get_queue(bdev);
669
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500670 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400671 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
672
673 disk_name(disk, 0, top);
674 bdevname(bdev, bottom);
675
676 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
677 top, bottom);
678 }
679
680 if (!t->queue_lock)
681 WARN_ON_ONCE(1);
682 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
683 unsigned long flags;
684
685 spin_lock_irqsave(t->queue_lock, flags);
686 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
687 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
688 spin_unlock_irqrestore(t->queue_lock, flags);
689 }
690}
691EXPORT_SYMBOL(disk_stack_limits);
692
693/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100694 * blk_queue_dma_pad - set pad mask
695 * @q: the request queue for the device
696 * @mask: pad mask
697 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200698 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100699 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200700 * Appending pad buffer to a request modifies the last entry of a
701 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100702 **/
703void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
704{
705 q->dma_pad_mask = mask;
706}
707EXPORT_SYMBOL(blk_queue_dma_pad);
708
709/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200710 * blk_queue_update_dma_pad - update pad mask
711 * @q: the request queue for the device
712 * @mask: pad mask
713 *
714 * Update dma pad mask.
715 *
716 * Appending pad buffer to a request modifies the last entry of a
717 * scatter list such that it includes the pad buffer.
718 **/
719void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
720{
721 if (mask > q->dma_pad_mask)
722 q->dma_pad_mask = mask;
723}
724EXPORT_SYMBOL(blk_queue_update_dma_pad);
725
726/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100727 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100728 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100729 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100730 * @buf: physically contiguous buffer
731 * @size: size of the buffer in bytes
732 *
733 * Some devices have excess DMA problems and can't simply discard (or
734 * zero fill) the unwanted piece of the transfer. They have to have a
735 * real area of memory to transfer it into. The use case for this is
736 * ATAPI devices in DMA mode. If the packet command causes a transfer
737 * bigger than the transfer size some HBAs will lock up if there
738 * aren't DMA elements to contain the excess transfer. What this API
739 * does is adjust the queue so that the buf is always appended
740 * silently to the scatterlist.
741 *
742 * Note: This routine adjusts max_hw_segments to make room for
743 * appending the drain buffer. If you call
744 * blk_queue_max_hw_segments() or blk_queue_max_phys_segments() after
745 * calling this routine, you must set the limit to one fewer than your
746 * device can support otherwise there won't be room for the drain
747 * buffer.
748 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100749int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100750 dma_drain_needed_fn *dma_drain_needed,
751 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100752{
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400753 if (queue_max_hw_segments(q) < 2 || queue_max_phys_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100754 return -EINVAL;
755 /* make room for appending the drain */
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400756 blk_queue_max_hw_segments(q, queue_max_hw_segments(q) - 1);
757 blk_queue_max_phys_segments(q, queue_max_phys_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100758 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100759 q->dma_drain_buffer = buf;
760 q->dma_drain_size = size;
761
762 return 0;
763}
Jens Axboe86db1e22008-01-29 14:53:40 +0100764EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
765
766/**
767 * blk_queue_segment_boundary - set boundary rules for segment merging
768 * @q: the request queue for the device
769 * @mask: the memory boundary mask
770 **/
771void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
772{
773 if (mask < PAGE_CACHE_SIZE - 1) {
774 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700775 printk(KERN_INFO "%s: set to minimum %lx\n",
776 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100777 }
778
Martin K. Petersen025146e2009-05-22 17:17:51 -0400779 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100780}
Jens Axboe86db1e22008-01-29 14:53:40 +0100781EXPORT_SYMBOL(blk_queue_segment_boundary);
782
783/**
784 * blk_queue_dma_alignment - set dma length and memory alignment
785 * @q: the request queue for the device
786 * @mask: alignment mask
787 *
788 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200789 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100790 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100791 *
792 **/
793void blk_queue_dma_alignment(struct request_queue *q, int mask)
794{
795 q->dma_alignment = mask;
796}
Jens Axboe86db1e22008-01-29 14:53:40 +0100797EXPORT_SYMBOL(blk_queue_dma_alignment);
798
799/**
800 * blk_queue_update_dma_alignment - update dma length and memory alignment
801 * @q: the request queue for the device
802 * @mask: alignment mask
803 *
804 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200805 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100806 * If the requested alignment is larger than the current alignment, then
807 * the current queue alignment is updated to the new value, otherwise it
808 * is left alone. The design of this is to allow multiple objects
809 * (driver, device, transport etc) to set their respective
810 * alignments without having them interfere.
811 *
812 **/
813void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
814{
815 BUG_ON(mask > PAGE_SIZE);
816
817 if (mask > q->dma_alignment)
818 q->dma_alignment = mask;
819}
Jens Axboe86db1e22008-01-29 14:53:40 +0100820EXPORT_SYMBOL(blk_queue_update_dma_alignment);
821
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200822static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100823{
824 blk_max_low_pfn = max_low_pfn - 1;
825 blk_max_pfn = max_pfn - 1;
826 return 0;
827}
828subsys_initcall(blk_settings_init);