blob: 31e7a9375c1333cc35ab40d565c5c1ed4e8703e7 [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{
Martin K. Petersen8a783622010-02-26 00:20:39 -050094 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersene475bba2009-06-16 08:23:52 +020095 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050096 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersen5dee2472009-09-21 21:46:05 +020097 lim->max_sectors = BLK_DEF_MAX_SECTORS;
98 lim->max_hw_sectors = INT_MAX;
Martin K. Petersen86b37282009-11-10 11:50:21 +010099 lim->max_discard_sectors = 0;
100 lim->discard_granularity = 0;
101 lim->discard_alignment = 0;
102 lim->discard_misaligned = 0;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100103 lim->discard_zeroes_data = -1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200104 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200105 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200106 lim->alignment_offset = 0;
107 lim->io_opt = 0;
108 lim->misaligned = 0;
109 lim->no_cluster = 0;
110}
111EXPORT_SYMBOL(blk_set_default_limits);
112
113/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100114 * blk_queue_make_request - define an alternate make_request function for a device
115 * @q: the request queue for the device to be affected
116 * @mfn: the alternate make_request function
117 *
118 * Description:
119 * The normal way for &struct bios to be passed to a device
120 * driver is for them to be collected into requests on a request
121 * queue, and then to allow the device driver to select requests
122 * off that queue when it is ready. This works well for many block
123 * devices. However some block devices (typically virtual devices
124 * such as md or lvm) do not benefit from the processing on the
125 * request queue, and are served best by having the requests passed
126 * directly to them. This can be achieved by providing a function
127 * to blk_queue_make_request().
128 *
129 * Caveat:
130 * The driver that does this *must* be able to deal appropriately
131 * with buffers in "highmemory". This can be accomplished by either calling
132 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
133 * blk_queue_bounce() to create a buffer in normal memory.
134 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100135void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100136{
137 /*
138 * set defaults
139 */
140 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100141
Jens Axboe86db1e22008-01-29 14:53:40 +0100142 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100143 blk_queue_dma_alignment(q, 511);
144 blk_queue_congestion_threshold(q);
145 q->nr_batching = BLK_BATCH_REQ;
146
147 q->unplug_thresh = 4; /* hmm */
Randy Dunlapad5ebd22009-11-11 13:47:45 +0100148 q->unplug_delay = msecs_to_jiffies(3); /* 3 milliseconds */
Jens Axboe86db1e22008-01-29 14:53:40 +0100149 if (q->unplug_delay == 0)
150 q->unplug_delay = 1;
151
Jens Axboe86db1e22008-01-29 14:53:40 +0100152 q->unplug_timer.function = blk_unplug_timeout;
153 q->unplug_timer.data = (unsigned long)q;
154
Martin K. Petersene475bba2009-06-16 08:23:52 +0200155 blk_set_default_limits(&q->limits);
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500156 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200157
Jens Axboe86db1e22008-01-29 14:53:40 +0100158 /*
Jens Axboea4e7d462009-07-28 09:07:29 +0200159 * If the caller didn't supply a lock, fall back to our embedded
160 * per-queue locks
161 */
162 if (!q->queue_lock)
163 q->queue_lock = &q->__queue_lock;
164
165 /*
Jens Axboe86db1e22008-01-29 14:53:40 +0100166 * by default assume old behaviour and bounce for any highmem page
167 */
168 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
169}
Jens Axboe86db1e22008-01-29 14:53:40 +0100170EXPORT_SYMBOL(blk_queue_make_request);
171
172/**
173 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900174 * @q: the request queue for the device
175 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100176 *
177 * Description:
178 * Different hardware can have different requirements as to what pages
179 * it can do I/O directly to. A low level driver can call
180 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900181 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100182 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900183void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100184{
Tejun Heocd0aca22009-04-15 22:10:25 +0900185 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100186 int dma = 0;
187
188 q->bounce_gfp = GFP_NOIO;
189#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900190 /*
191 * Assume anything <= 4GB can be handled by IOMMU. Actually
192 * some IOMMUs can handle everything, but I don't know of a
193 * way to test this here.
194 */
195 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100196 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400197 q->limits.bounce_pfn = max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100198#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100199 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100200 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400201 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100202#endif
203 if (dma) {
204 init_emergency_isa_pool();
205 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400206 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100207 }
208}
Jens Axboe86db1e22008-01-29 14:53:40 +0100209EXPORT_SYMBOL(blk_queue_bounce_limit);
210
211/**
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500212 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100213 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500214 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100215 *
216 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500217 * Enables a low level driver to set a hard upper limit,
218 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
219 * the device driver based upon the combined capabilities of I/O
220 * controller and storage device.
221 *
222 * max_sectors is a soft limit imposed by the block layer for
223 * filesystem type requests. This value can be overridden on a
224 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
225 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100226 **/
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500227void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100228{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500229 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
230 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700231 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500232 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100233 }
234
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500235 q->limits.max_hw_sectors = max_hw_sectors;
236 q->limits.max_sectors = min_t(unsigned int, max_hw_sectors,
237 BLK_DEF_MAX_SECTORS);
Jens Axboe86db1e22008-01-29 14:53:40 +0100238}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500239EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100240
241/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200242 * blk_queue_max_discard_sectors - set max sectors for a single discard
243 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200244 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200245 **/
246void blk_queue_max_discard_sectors(struct request_queue *q,
247 unsigned int max_discard_sectors)
248{
249 q->limits.max_discard_sectors = max_discard_sectors;
250}
251EXPORT_SYMBOL(blk_queue_max_discard_sectors);
252
253/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500254 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100255 * @q: the request queue for the device
256 * @max_segments: max number of segments
257 *
258 * Description:
259 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500260 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100261 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500262void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100263{
264 if (!max_segments) {
265 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700266 printk(KERN_INFO "%s: set to minimum %d\n",
267 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100268 }
269
Martin K. Petersen8a783622010-02-26 00:20:39 -0500270 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100271}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500272EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100273
274/**
275 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
276 * @q: the request queue for the device
277 * @max_size: max size of segment in bytes
278 *
279 * Description:
280 * Enables a low level driver to set an upper limit on the size of a
281 * coalesced segment
282 **/
283void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
284{
285 if (max_size < PAGE_CACHE_SIZE) {
286 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700287 printk(KERN_INFO "%s: set to minimum %d\n",
288 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100289 }
290
Martin K. Petersen025146e2009-05-22 17:17:51 -0400291 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100292}
Jens Axboe86db1e22008-01-29 14:53:40 +0100293EXPORT_SYMBOL(blk_queue_max_segment_size);
294
295/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400296 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100297 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400298 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100299 *
300 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400301 * This should be set to the lowest possible block size that the
302 * storage device can address. The default of 512 covers most
303 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100304 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400305void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100306{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400307 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400308
309 if (q->limits.physical_block_size < size)
310 q->limits.physical_block_size = size;
311
312 if (q->limits.io_min < q->limits.physical_block_size)
313 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100314}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400315EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100316
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400317/**
318 * blk_queue_physical_block_size - set physical block size for the queue
319 * @q: the request queue for the device
320 * @size: the physical block size, in bytes
321 *
322 * Description:
323 * This should be set to the lowest possible sector size that the
324 * hardware can operate on without reverting to read-modify-write
325 * operations.
326 */
327void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
328{
329 q->limits.physical_block_size = size;
330
331 if (q->limits.physical_block_size < q->limits.logical_block_size)
332 q->limits.physical_block_size = q->limits.logical_block_size;
333
334 if (q->limits.io_min < q->limits.physical_block_size)
335 q->limits.io_min = q->limits.physical_block_size;
336}
337EXPORT_SYMBOL(blk_queue_physical_block_size);
338
339/**
340 * blk_queue_alignment_offset - set physical block alignment offset
341 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700342 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400343 *
344 * Description:
345 * Some devices are naturally misaligned to compensate for things like
346 * the legacy DOS partition table 63-sector offset. Low-level drivers
347 * should call this function for devices whose first sector is not
348 * naturally aligned.
349 */
350void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
351{
352 q->limits.alignment_offset =
353 offset & (q->limits.physical_block_size - 1);
354 q->limits.misaligned = 0;
355}
356EXPORT_SYMBOL(blk_queue_alignment_offset);
357
358/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400359 * blk_limits_io_min - set minimum request size for a device
360 * @limits: the queue limits
361 * @min: smallest I/O size in bytes
362 *
363 * Description:
364 * Some devices have an internal block size bigger than the reported
365 * hardware sector size. This function can be used to signal the
366 * smallest I/O the device can perform without incurring a performance
367 * penalty.
368 */
369void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
370{
371 limits->io_min = min;
372
373 if (limits->io_min < limits->logical_block_size)
374 limits->io_min = limits->logical_block_size;
375
376 if (limits->io_min < limits->physical_block_size)
377 limits->io_min = limits->physical_block_size;
378}
379EXPORT_SYMBOL(blk_limits_io_min);
380
381/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400382 * blk_queue_io_min - set minimum request size for the queue
383 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700384 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400385 *
386 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400387 * Storage devices may report a granularity or preferred minimum I/O
388 * size which is the smallest request the device can perform without
389 * incurring a performance penalty. For disk drives this is often the
390 * physical block size. For RAID arrays it is often the stripe chunk
391 * size. A properly aligned multiple of minimum_io_size is the
392 * preferred request size for workloads where a high number of I/O
393 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400394 */
395void blk_queue_io_min(struct request_queue *q, unsigned int min)
396{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400397 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400398}
399EXPORT_SYMBOL(blk_queue_io_min);
400
401/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200402 * blk_limits_io_opt - set optimal request size for a device
403 * @limits: the queue limits
404 * @opt: smallest I/O size in bytes
405 *
406 * Description:
407 * Storage devices may report an optimal I/O size, which is the
408 * device's preferred unit for sustained I/O. This is rarely reported
409 * for disk drives. For RAID arrays it is usually the stripe width or
410 * the internal track size. A properly aligned multiple of
411 * optimal_io_size is the preferred request size for workloads where
412 * sustained throughput is desired.
413 */
414void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
415{
416 limits->io_opt = opt;
417}
418EXPORT_SYMBOL(blk_limits_io_opt);
419
420/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400421 * blk_queue_io_opt - set optimal request size for the queue
422 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700423 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400424 *
425 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400426 * Storage devices may report an optimal I/O size, which is the
427 * device's preferred unit for sustained I/O. This is rarely reported
428 * for disk drives. For RAID arrays it is usually the stripe width or
429 * the internal track size. A properly aligned multiple of
430 * optimal_io_size is the preferred request size for workloads where
431 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400432 */
433void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
434{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200435 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400436}
437EXPORT_SYMBOL(blk_queue_io_opt);
438
Jens Axboe86db1e22008-01-29 14:53:40 +0100439/*
440 * Returns the minimum that is _not_ zero, unless both are zero.
441 */
442#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
443
444/**
445 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
446 * @t: the stacking driver (top)
447 * @b: the underlying device (bottom)
448 **/
449void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
450{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400451 blk_stack_limits(&t->limits, &b->limits, 0);
Martin K. Petersen025146e2009-05-22 17:17:51 -0400452
Neil Browne7e72bf2008-05-14 16:05:54 -0700453 if (!t->queue_lock)
454 WARN_ON_ONCE(1);
455 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
456 unsigned long flags;
457 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200458 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700459 spin_unlock_irqrestore(t->queue_lock, flags);
460 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100461}
Jens Axboe86db1e22008-01-29 14:53:40 +0100462EXPORT_SYMBOL(blk_queue_stack_limits);
463
Martin K. Petersen86b37282009-11-10 11:50:21 +0100464static unsigned int lcm(unsigned int a, unsigned int b)
465{
466 if (a && b)
467 return (a * b) / gcd(a, b);
468 else if (b)
469 return b;
470
471 return a;
472}
473
Jens Axboe86db1e22008-01-29 14:53:40 +0100474/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400475 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100476 * @t: the stacking driver limits (top device)
477 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500478 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400479 *
480 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100481 * This function is used by stacking drivers like MD and DM to ensure
482 * that all component devices have compatible block sizes and
483 * alignments. The stacking driver must provide a queue_limits
484 * struct (top) and then iteratively call the stacking function for
485 * all component (bottom) devices. The stacking function will
486 * attempt to combine the values and ensure proper alignment.
487 *
488 * Returns 0 if the top and bottom queue_limits are compatible. The
489 * top device's block sizes and alignment offsets may be adjusted to
490 * ensure alignment with the bottom device. If no compatible sizes
491 * and alignments exist, -1 is returned and the resulting top
492 * queue_limits will have the misaligned flag set to indicate that
493 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400494 */
495int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500496 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400497{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500498 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100499
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400500 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
501 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200502 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400503
504 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
505 b->seg_boundary_mask);
506
Martin K. Petersen8a783622010-02-26 00:20:39 -0500507 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400508
509 t->max_segment_size = min_not_zero(t->max_segment_size,
510 b->max_segment_size);
511
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500512 t->misaligned |= b->misaligned;
513
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500514 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100515
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100516 /* Bottom device has different alignment. Check that it is
517 * compatible with the current top alignment.
518 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100519 if (t->alignment_offset != alignment) {
520
521 top = max(t->physical_block_size, t->io_min)
522 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100523 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100524
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100525 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500526 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100527 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500528 ret = -1;
529 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100530 }
531
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400532 t->logical_block_size = max(t->logical_block_size,
533 b->logical_block_size);
534
535 t->physical_block_size = max(t->physical_block_size,
536 b->physical_block_size);
537
538 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100539 t->io_opt = lcm(t->io_opt, b->io_opt);
540
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400541 t->no_cluster |= b->no_cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100542 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400543
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100544 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100545 if (t->physical_block_size & (t->logical_block_size - 1)) {
546 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400547 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500548 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100549 }
550
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100551 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100552 if (t->io_min & (t->physical_block_size - 1)) {
553 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400554 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500555 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400556 }
557
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100558 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100559 if (t->io_opt & (t->physical_block_size - 1)) {
560 t->io_opt = 0;
561 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500562 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100563 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400564
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100565 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100566 t->alignment_offset = lcm(t->alignment_offset, alignment)
567 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400568
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100569 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500570 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500572 ret = -1;
573 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100574
575 /* Discard alignment and granularity */
576 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500577 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100578
579 if (t->discard_granularity != 0 &&
580 t->discard_alignment != alignment) {
581 top = t->discard_granularity + t->discard_alignment;
582 bottom = b->discard_granularity + alignment;
583
584 /* Verify that top and bottom intervals line up */
585 if (max(top, bottom) & (min(top, bottom) - 1))
586 t->discard_misaligned = 1;
587 }
588
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100589 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
590 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100591 t->discard_granularity = max(t->discard_granularity,
592 b->discard_granularity);
593 t->discard_alignment = lcm(t->discard_alignment, alignment) &
594 (t->discard_granularity - 1);
595 }
596
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500597 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400598}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200599EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400600
601/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500602 * bdev_stack_limits - adjust queue limits for stacked drivers
603 * @t: the stacking driver limits (top device)
604 * @bdev: the component block_device (bottom)
605 * @start: first data sector within component device
606 *
607 * Description:
608 * Merges queue limits for a top device and a block_device. Returns
609 * 0 if alignment didn't change. Returns -1 if adding the bottom
610 * device caused misalignment.
611 */
612int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
613 sector_t start)
614{
615 struct request_queue *bq = bdev_get_queue(bdev);
616
617 start += get_start_sect(bdev);
618
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500619 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500620}
621EXPORT_SYMBOL(bdev_stack_limits);
622
623/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400624 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200625 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400626 * @bdev: the underlying block device (bottom)
627 * @offset: offset to beginning of data within component device
628 *
629 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500630 * Merges the limits for a top level gendisk and a bottom level
631 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400632 */
633void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
634 sector_t offset)
635{
636 struct request_queue *t = disk->queue;
637 struct request_queue *b = bdev_get_queue(bdev);
638
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500639 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400640 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
641
642 disk_name(disk, 0, top);
643 bdevname(bdev, bottom);
644
645 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
646 top, bottom);
647 }
648
649 if (!t->queue_lock)
650 WARN_ON_ONCE(1);
651 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
652 unsigned long flags;
653
654 spin_lock_irqsave(t->queue_lock, flags);
655 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
656 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
657 spin_unlock_irqrestore(t->queue_lock, flags);
658 }
659}
660EXPORT_SYMBOL(disk_stack_limits);
661
662/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100663 * blk_queue_dma_pad - set pad mask
664 * @q: the request queue for the device
665 * @mask: pad mask
666 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200667 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100668 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200669 * Appending pad buffer to a request modifies the last entry of a
670 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100671 **/
672void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
673{
674 q->dma_pad_mask = mask;
675}
676EXPORT_SYMBOL(blk_queue_dma_pad);
677
678/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200679 * blk_queue_update_dma_pad - update pad mask
680 * @q: the request queue for the device
681 * @mask: pad mask
682 *
683 * Update dma pad mask.
684 *
685 * Appending pad buffer to a request modifies the last entry of a
686 * scatter list such that it includes the pad buffer.
687 **/
688void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
689{
690 if (mask > q->dma_pad_mask)
691 q->dma_pad_mask = mask;
692}
693EXPORT_SYMBOL(blk_queue_update_dma_pad);
694
695/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100696 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100697 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100698 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100699 * @buf: physically contiguous buffer
700 * @size: size of the buffer in bytes
701 *
702 * Some devices have excess DMA problems and can't simply discard (or
703 * zero fill) the unwanted piece of the transfer. They have to have a
704 * real area of memory to transfer it into. The use case for this is
705 * ATAPI devices in DMA mode. If the packet command causes a transfer
706 * bigger than the transfer size some HBAs will lock up if there
707 * aren't DMA elements to contain the excess transfer. What this API
708 * does is adjust the queue so that the buf is always appended
709 * silently to the scatterlist.
710 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500711 * Note: This routine adjusts max_hw_segments to make room for appending
712 * the drain buffer. If you call blk_queue_max_segments() after calling
713 * this routine, you must set the limit to one fewer than your device
714 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100715 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100716int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100717 dma_drain_needed_fn *dma_drain_needed,
718 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100719{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500720 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100721 return -EINVAL;
722 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500723 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100724 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100725 q->dma_drain_buffer = buf;
726 q->dma_drain_size = size;
727
728 return 0;
729}
Jens Axboe86db1e22008-01-29 14:53:40 +0100730EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
731
732/**
733 * blk_queue_segment_boundary - set boundary rules for segment merging
734 * @q: the request queue for the device
735 * @mask: the memory boundary mask
736 **/
737void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
738{
739 if (mask < PAGE_CACHE_SIZE - 1) {
740 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700741 printk(KERN_INFO "%s: set to minimum %lx\n",
742 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100743 }
744
Martin K. Petersen025146e2009-05-22 17:17:51 -0400745 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100746}
Jens Axboe86db1e22008-01-29 14:53:40 +0100747EXPORT_SYMBOL(blk_queue_segment_boundary);
748
749/**
750 * blk_queue_dma_alignment - set dma length and memory alignment
751 * @q: the request queue for the device
752 * @mask: alignment mask
753 *
754 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200755 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100756 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100757 *
758 **/
759void blk_queue_dma_alignment(struct request_queue *q, int mask)
760{
761 q->dma_alignment = mask;
762}
Jens Axboe86db1e22008-01-29 14:53:40 +0100763EXPORT_SYMBOL(blk_queue_dma_alignment);
764
765/**
766 * blk_queue_update_dma_alignment - update dma length and memory alignment
767 * @q: the request queue for the device
768 * @mask: alignment mask
769 *
770 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200771 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100772 * If the requested alignment is larger than the current alignment, then
773 * the current queue alignment is updated to the new value, otherwise it
774 * is left alone. The design of this is to allow multiple objects
775 * (driver, device, transport etc) to set their respective
776 * alignments without having them interfere.
777 *
778 **/
779void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
780{
781 BUG_ON(mask > PAGE_SIZE);
782
783 if (mask > q->dma_alignment)
784 q->dma_alignment = mask;
785}
Jens Axboe86db1e22008-01-29 14:53:40 +0100786EXPORT_SYMBOL(blk_queue_update_dma_alignment);
787
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200788static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100789{
790 blk_max_low_pfn = max_low_pfn - 1;
791 blk_max_pfn = max_pfn - 1;
792 return 0;
793}
794subsys_initcall(blk_settings_init);