blob: 9b18afcfe9257145ed9ec7abeb1298929f854ec4 [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>
Martin K. Petersen2cda2722010-03-15 12:46:51 +010011#include <linux/lcm.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010012#include <linux/jiffies.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090013#include <linux/gfp.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010014
15#include "blk.h"
16
Jens Axboe6728cb02008-01-31 13:03:55 +010017unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010018EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010019
20unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010021
22/**
23 * blk_queue_prep_rq - set a prepare_request function for queue
24 * @q: queue
25 * @pfn: prepare_request function
26 *
27 * It's possible for a queue to register a prepare_request callback which
28 * is invoked before the request is handed to the request_fn. The goal of
29 * the function is to prepare a request for I/O, it can be used to build a
30 * cdb from the request data for instance.
31 *
32 */
33void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
34{
35 q->prep_rq_fn = pfn;
36}
Jens Axboe86db1e22008-01-29 14:53:40 +010037EXPORT_SYMBOL(blk_queue_prep_rq);
38
39/**
James Bottomley28018c22010-07-01 19:49:17 +090040 * blk_queue_unprep_rq - set an unprepare_request function for queue
41 * @q: queue
42 * @ufn: unprepare_request function
43 *
44 * It's possible for a queue to register an unprepare_request callback
45 * which is invoked before the request is finally completed. The goal
46 * of the function is to deallocate any data that was allocated in the
47 * prepare_request callback.
48 *
49 */
50void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
51{
52 q->unprep_rq_fn = ufn;
53}
54EXPORT_SYMBOL(blk_queue_unprep_rq);
55
56/**
Jens Axboe86db1e22008-01-29 14:53:40 +010057 * blk_queue_merge_bvec - set a merge_bvec function for queue
58 * @q: queue
59 * @mbfn: merge_bvec_fn
60 *
61 * Usually queues have static limitations on the max sectors or segments that
62 * we can put in a request. Stacking drivers may have some settings that
63 * are dynamic, and thus we have to query the queue whether it is ok to
64 * add a new bio_vec to a bio at a given offset or not. If the block device
65 * has such limitations, it needs to register a merge_bvec_fn to control
66 * the size of bio's sent to it. Note that a block device *must* allow a
67 * single page to be added to an empty bio. The block device driver may want
68 * to use the bio_split() function to deal with these bio's. By default
69 * no merge_bvec_fn is defined for a queue, and only the fixed limits are
70 * honored.
71 */
72void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
73{
74 q->merge_bvec_fn = mbfn;
75}
Jens Axboe86db1e22008-01-29 14:53:40 +010076EXPORT_SYMBOL(blk_queue_merge_bvec);
77
78void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
79{
80 q->softirq_done_fn = fn;
81}
Jens Axboe86db1e22008-01-29 14:53:40 +010082EXPORT_SYMBOL(blk_queue_softirq_done);
83
Jens Axboe242f9dc2008-09-14 05:55:09 -070084void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
85{
86 q->rq_timeout = timeout;
87}
88EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
89
90void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
91{
92 q->rq_timed_out_fn = fn;
93}
94EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
95
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020096void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
97{
98 q->lld_busy_fn = fn;
99}
100EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
101
Jens Axboe86db1e22008-01-29 14:53:40 +0100102/**
Martin K. Petersene475bba2009-06-16 08:23:52 +0200103 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +0200104 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +0200105 *
106 * Description:
107 * Returns a queue_limit struct to its default state. Can be used by
108 * stacking drivers like DM that stage table swaps and reuse an
109 * existing device queue.
110 */
111void blk_set_default_limits(struct queue_limits *lim)
112{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500113 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200114 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -0500115 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersen5dee2472009-09-21 21:46:05 +0200116 lim->max_sectors = BLK_DEF_MAX_SECTORS;
117 lim->max_hw_sectors = INT_MAX;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100118 lim->max_discard_sectors = 0;
119 lim->discard_granularity = 0;
120 lim->discard_alignment = 0;
121 lim->discard_misaligned = 0;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100122 lim->discard_zeroes_data = -1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200123 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200124 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200125 lim->alignment_offset = 0;
126 lim->io_opt = 0;
127 lim->misaligned = 0;
128 lim->no_cluster = 0;
129}
130EXPORT_SYMBOL(blk_set_default_limits);
131
132/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100133 * blk_queue_make_request - define an alternate make_request function for a device
134 * @q: the request queue for the device to be affected
135 * @mfn: the alternate make_request function
136 *
137 * Description:
138 * The normal way for &struct bios to be passed to a device
139 * driver is for them to be collected into requests on a request
140 * queue, and then to allow the device driver to select requests
141 * off that queue when it is ready. This works well for many block
142 * devices. However some block devices (typically virtual devices
143 * such as md or lvm) do not benefit from the processing on the
144 * request queue, and are served best by having the requests passed
145 * directly to them. This can be achieved by providing a function
146 * to blk_queue_make_request().
147 *
148 * Caveat:
149 * The driver that does this *must* be able to deal appropriately
150 * with buffers in "highmemory". This can be accomplished by either calling
151 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
152 * blk_queue_bounce() to create a buffer in normal memory.
153 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100154void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100155{
156 /*
157 * set defaults
158 */
159 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100160
Jens Axboe86db1e22008-01-29 14:53:40 +0100161 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100162 blk_queue_dma_alignment(q, 511);
163 blk_queue_congestion_threshold(q);
164 q->nr_batching = BLK_BATCH_REQ;
165
166 q->unplug_thresh = 4; /* hmm */
Randy Dunlapad5ebd22009-11-11 13:47:45 +0100167 q->unplug_delay = msecs_to_jiffies(3); /* 3 milliseconds */
Jens Axboe86db1e22008-01-29 14:53:40 +0100168 if (q->unplug_delay == 0)
169 q->unplug_delay = 1;
170
Jens Axboe86db1e22008-01-29 14:53:40 +0100171 q->unplug_timer.function = blk_unplug_timeout;
172 q->unplug_timer.data = (unsigned long)q;
173
Martin K. Petersene475bba2009-06-16 08:23:52 +0200174 blk_set_default_limits(&q->limits);
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500175 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200176
Jens Axboe86db1e22008-01-29 14:53:40 +0100177 /*
Jens Axboea4e7d462009-07-28 09:07:29 +0200178 * If the caller didn't supply a lock, fall back to our embedded
179 * per-queue locks
180 */
181 if (!q->queue_lock)
182 q->queue_lock = &q->__queue_lock;
183
184 /*
Jens Axboe86db1e22008-01-29 14:53:40 +0100185 * by default assume old behaviour and bounce for any highmem page
186 */
187 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
188}
Jens Axboe86db1e22008-01-29 14:53:40 +0100189EXPORT_SYMBOL(blk_queue_make_request);
190
191/**
192 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900193 * @q: the request queue for the device
194 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100195 *
196 * Description:
197 * Different hardware can have different requirements as to what pages
198 * it can do I/O directly to. A low level driver can call
199 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900200 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100201 **/
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900202void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100203{
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900204 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100205 int dma = 0;
206
207 q->bounce_gfp = GFP_NOIO;
208#if BITS_PER_LONG == 64
Tejun Heocd0aca2d2009-04-15 22:10:25 +0900209 /*
210 * Assume anything <= 4GB can be handled by IOMMU. Actually
211 * some IOMMUs can handle everything, but I don't know of a
212 * way to test this here.
213 */
214 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100215 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400216 q->limits.bounce_pfn = max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100217#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100218 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100219 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400220 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100221#endif
222 if (dma) {
223 init_emergency_isa_pool();
224 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400225 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100226 }
227}
Jens Axboe86db1e22008-01-29 14:53:40 +0100228EXPORT_SYMBOL(blk_queue_bounce_limit);
229
230/**
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500231 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100232 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500233 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100234 *
235 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 * Enables a low level driver to set a hard upper limit,
237 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
238 * the device driver based upon the combined capabilities of I/O
239 * controller and storage device.
240 *
241 * max_sectors is a soft limit imposed by the block layer for
242 * filesystem type requests. This value can be overridden on a
243 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
244 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100245 **/
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500246void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100247{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500248 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
249 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700250 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500251 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100252 }
253
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500254 q->limits.max_hw_sectors = max_hw_sectors;
255 q->limits.max_sectors = min_t(unsigned int, max_hw_sectors,
256 BLK_DEF_MAX_SECTORS);
Jens Axboe86db1e22008-01-29 14:53:40 +0100257}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500258EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100259
260/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200261 * blk_queue_max_discard_sectors - set max sectors for a single discard
262 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200263 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200264 **/
265void blk_queue_max_discard_sectors(struct request_queue *q,
266 unsigned int max_discard_sectors)
267{
268 q->limits.max_discard_sectors = max_discard_sectors;
269}
270EXPORT_SYMBOL(blk_queue_max_discard_sectors);
271
272/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500273 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100274 * @q: the request queue for the device
275 * @max_segments: max number of segments
276 *
277 * Description:
278 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500279 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100280 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500281void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100282{
283 if (!max_segments) {
284 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700285 printk(KERN_INFO "%s: set to minimum %d\n",
286 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100287 }
288
Martin K. Petersen8a783622010-02-26 00:20:39 -0500289 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100290}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500291EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100292
293/**
294 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
295 * @q: the request queue for the device
296 * @max_size: max size of segment in bytes
297 *
298 * Description:
299 * Enables a low level driver to set an upper limit on the size of a
300 * coalesced segment
301 **/
302void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
303{
304 if (max_size < PAGE_CACHE_SIZE) {
305 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700306 printk(KERN_INFO "%s: set to minimum %d\n",
307 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100308 }
309
Martin K. Petersen025146e2009-05-22 17:17:51 -0400310 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100311}
Jens Axboe86db1e22008-01-29 14:53:40 +0100312EXPORT_SYMBOL(blk_queue_max_segment_size);
313
314/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400315 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100316 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400317 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100318 *
319 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400320 * This should be set to the lowest possible block size that the
321 * storage device can address. The default of 512 covers most
322 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100323 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400324void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100325{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400326 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400327
328 if (q->limits.physical_block_size < size)
329 q->limits.physical_block_size = size;
330
331 if (q->limits.io_min < q->limits.physical_block_size)
332 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100333}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400334EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100335
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400336/**
337 * blk_queue_physical_block_size - set physical block size for the queue
338 * @q: the request queue for the device
339 * @size: the physical block size, in bytes
340 *
341 * Description:
342 * This should be set to the lowest possible sector size that the
343 * hardware can operate on without reverting to read-modify-write
344 * operations.
345 */
346void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
347{
348 q->limits.physical_block_size = size;
349
350 if (q->limits.physical_block_size < q->limits.logical_block_size)
351 q->limits.physical_block_size = q->limits.logical_block_size;
352
353 if (q->limits.io_min < q->limits.physical_block_size)
354 q->limits.io_min = q->limits.physical_block_size;
355}
356EXPORT_SYMBOL(blk_queue_physical_block_size);
357
358/**
359 * blk_queue_alignment_offset - set physical block alignment offset
360 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700361 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400362 *
363 * Description:
364 * Some devices are naturally misaligned to compensate for things like
365 * the legacy DOS partition table 63-sector offset. Low-level drivers
366 * should call this function for devices whose first sector is not
367 * naturally aligned.
368 */
369void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
370{
371 q->limits.alignment_offset =
372 offset & (q->limits.physical_block_size - 1);
373 q->limits.misaligned = 0;
374}
375EXPORT_SYMBOL(blk_queue_alignment_offset);
376
377/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400378 * blk_limits_io_min - set minimum request size for a device
379 * @limits: the queue limits
380 * @min: smallest I/O size in bytes
381 *
382 * Description:
383 * Some devices have an internal block size bigger than the reported
384 * hardware sector size. This function can be used to signal the
385 * smallest I/O the device can perform without incurring a performance
386 * penalty.
387 */
388void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
389{
390 limits->io_min = min;
391
392 if (limits->io_min < limits->logical_block_size)
393 limits->io_min = limits->logical_block_size;
394
395 if (limits->io_min < limits->physical_block_size)
396 limits->io_min = limits->physical_block_size;
397}
398EXPORT_SYMBOL(blk_limits_io_min);
399
400/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400401 * blk_queue_io_min - set minimum request size for the queue
402 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700403 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400404 *
405 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400406 * Storage devices may report a granularity or preferred minimum I/O
407 * size which is the smallest request the device can perform without
408 * incurring a performance penalty. For disk drives this is often the
409 * physical block size. For RAID arrays it is often the stripe chunk
410 * size. A properly aligned multiple of minimum_io_size is the
411 * preferred request size for workloads where a high number of I/O
412 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400413 */
414void blk_queue_io_min(struct request_queue *q, unsigned int min)
415{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400416 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400417}
418EXPORT_SYMBOL(blk_queue_io_min);
419
420/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200421 * blk_limits_io_opt - set optimal request size for a device
422 * @limits: the queue limits
423 * @opt: smallest I/O size in bytes
424 *
425 * Description:
426 * 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.
432 */
433void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
434{
435 limits->io_opt = opt;
436}
437EXPORT_SYMBOL(blk_limits_io_opt);
438
439/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400440 * blk_queue_io_opt - set optimal request size for the queue
441 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700442 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400443 *
444 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400445 * Storage devices may report an optimal I/O size, which is the
446 * device's preferred unit for sustained I/O. This is rarely reported
447 * for disk drives. For RAID arrays it is usually the stripe width or
448 * the internal track size. A properly aligned multiple of
449 * optimal_io_size is the preferred request size for workloads where
450 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400451 */
452void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
453{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200454 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400455}
456EXPORT_SYMBOL(blk_queue_io_opt);
457
Jens Axboe86db1e22008-01-29 14:53:40 +0100458/*
459 * Returns the minimum that is _not_ zero, unless both are zero.
460 */
461#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
462
463/**
464 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
465 * @t: the stacking driver (top)
466 * @b: the underlying device (bottom)
467 **/
468void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
469{
Martin K. Petersenfef246672009-07-31 11:49:10 -0400470 blk_stack_limits(&t->limits, &b->limits, 0);
Martin K. Petersen025146e2009-05-22 17:17:51 -0400471
Neil Browne7e72bf2008-05-14 16:05:54 -0700472 if (!t->queue_lock)
473 WARN_ON_ONCE(1);
474 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
475 unsigned long flags;
476 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200477 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700478 spin_unlock_irqrestore(t->queue_lock, flags);
479 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100480}
Jens Axboe86db1e22008-01-29 14:53:40 +0100481EXPORT_SYMBOL(blk_queue_stack_limits);
482
483/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400484 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100485 * @t: the stacking driver limits (top device)
486 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500487 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400488 *
489 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100490 * This function is used by stacking drivers like MD and DM to ensure
491 * that all component devices have compatible block sizes and
492 * alignments. The stacking driver must provide a queue_limits
493 * struct (top) and then iteratively call the stacking function for
494 * all component (bottom) devices. The stacking function will
495 * attempt to combine the values and ensure proper alignment.
496 *
497 * Returns 0 if the top and bottom queue_limits are compatible. The
498 * top device's block sizes and alignment offsets may be adjusted to
499 * ensure alignment with the bottom device. If no compatible sizes
500 * and alignments exist, -1 is returned and the resulting top
501 * queue_limits will have the misaligned flag set to indicate that
502 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400503 */
504int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500505 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400506{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500507 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100508
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400509 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
510 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200511 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400512
513 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
514 b->seg_boundary_mask);
515
Martin K. Petersen8a783622010-02-26 00:20:39 -0500516 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400517
518 t->max_segment_size = min_not_zero(t->max_segment_size,
519 b->max_segment_size);
520
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500521 t->misaligned |= b->misaligned;
522
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500523 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100524
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100525 /* Bottom device has different alignment. Check that it is
526 * compatible with the current top alignment.
527 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100528 if (t->alignment_offset != alignment) {
529
530 top = max(t->physical_block_size, t->io_min)
531 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100532 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100533
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100534 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500535 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100536 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500537 ret = -1;
538 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100539 }
540
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400541 t->logical_block_size = max(t->logical_block_size,
542 b->logical_block_size);
543
544 t->physical_block_size = max(t->physical_block_size,
545 b->physical_block_size);
546
547 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100548 t->io_opt = lcm(t->io_opt, b->io_opt);
549
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400550 t->no_cluster |= b->no_cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100551 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400552
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100553 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100554 if (t->physical_block_size & (t->logical_block_size - 1)) {
555 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400556 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500557 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100558 }
559
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100560 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100561 if (t->io_min & (t->physical_block_size - 1)) {
562 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400563 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500564 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400565 }
566
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100567 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100568 if (t->io_opt & (t->physical_block_size - 1)) {
569 t->io_opt = 0;
570 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500571 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100572 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400573
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100574 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100575 t->alignment_offset = lcm(t->alignment_offset, alignment)
576 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400577
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100578 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500579 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100580 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500581 ret = -1;
582 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583
584 /* Discard alignment and granularity */
585 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500586 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100587
588 if (t->discard_granularity != 0 &&
589 t->discard_alignment != alignment) {
590 top = t->discard_granularity + t->discard_alignment;
591 bottom = b->discard_granularity + alignment;
592
593 /* Verify that top and bottom intervals line up */
594 if (max(top, bottom) & (min(top, bottom) - 1))
595 t->discard_misaligned = 1;
596 }
597
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100598 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
599 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100600 t->discard_granularity = max(t->discard_granularity,
601 b->discard_granularity);
602 t->discard_alignment = lcm(t->discard_alignment, alignment) &
603 (t->discard_granularity - 1);
604 }
605
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500606 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400607}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200608EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400609
610/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500611 * bdev_stack_limits - adjust queue limits for stacked drivers
612 * @t: the stacking driver limits (top device)
613 * @bdev: the component block_device (bottom)
614 * @start: first data sector within component device
615 *
616 * Description:
617 * Merges queue limits for a top device and a block_device. Returns
618 * 0 if alignment didn't change. Returns -1 if adding the bottom
619 * device caused misalignment.
620 */
621int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
622 sector_t start)
623{
624 struct request_queue *bq = bdev_get_queue(bdev);
625
626 start += get_start_sect(bdev);
627
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500628 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500629}
630EXPORT_SYMBOL(bdev_stack_limits);
631
632/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400633 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200634 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400635 * @bdev: the underlying block device (bottom)
636 * @offset: offset to beginning of data within component device
637 *
638 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500639 * Merges the limits for a top level gendisk and a bottom level
640 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400641 */
642void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
643 sector_t offset)
644{
645 struct request_queue *t = disk->queue;
646 struct request_queue *b = bdev_get_queue(bdev);
647
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500648 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400649 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
650
651 disk_name(disk, 0, top);
652 bdevname(bdev, bottom);
653
654 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
655 top, bottom);
656 }
657
658 if (!t->queue_lock)
659 WARN_ON_ONCE(1);
660 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
661 unsigned long flags;
662
663 spin_lock_irqsave(t->queue_lock, flags);
664 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
665 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
666 spin_unlock_irqrestore(t->queue_lock, flags);
667 }
668}
669EXPORT_SYMBOL(disk_stack_limits);
670
671/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100672 * blk_queue_dma_pad - set pad mask
673 * @q: the request queue for the device
674 * @mask: pad mask
675 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200676 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100677 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200678 * Appending pad buffer to a request modifies the last entry of a
679 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100680 **/
681void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
682{
683 q->dma_pad_mask = mask;
684}
685EXPORT_SYMBOL(blk_queue_dma_pad);
686
687/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200688 * blk_queue_update_dma_pad - update pad mask
689 * @q: the request queue for the device
690 * @mask: pad mask
691 *
692 * Update dma pad mask.
693 *
694 * Appending pad buffer to a request modifies the last entry of a
695 * scatter list such that it includes the pad buffer.
696 **/
697void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
698{
699 if (mask > q->dma_pad_mask)
700 q->dma_pad_mask = mask;
701}
702EXPORT_SYMBOL(blk_queue_update_dma_pad);
703
704/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100705 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100706 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100707 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100708 * @buf: physically contiguous buffer
709 * @size: size of the buffer in bytes
710 *
711 * Some devices have excess DMA problems and can't simply discard (or
712 * zero fill) the unwanted piece of the transfer. They have to have a
713 * real area of memory to transfer it into. The use case for this is
714 * ATAPI devices in DMA mode. If the packet command causes a transfer
715 * bigger than the transfer size some HBAs will lock up if there
716 * aren't DMA elements to contain the excess transfer. What this API
717 * does is adjust the queue so that the buf is always appended
718 * silently to the scatterlist.
719 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500720 * Note: This routine adjusts max_hw_segments to make room for appending
721 * the drain buffer. If you call blk_queue_max_segments() after calling
722 * this routine, you must set the limit to one fewer than your device
723 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100724 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100725int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100726 dma_drain_needed_fn *dma_drain_needed,
727 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100728{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500729 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100730 return -EINVAL;
731 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500732 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100733 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100734 q->dma_drain_buffer = buf;
735 q->dma_drain_size = size;
736
737 return 0;
738}
Jens Axboe86db1e22008-01-29 14:53:40 +0100739EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
740
741/**
742 * blk_queue_segment_boundary - set boundary rules for segment merging
743 * @q: the request queue for the device
744 * @mask: the memory boundary mask
745 **/
746void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
747{
748 if (mask < PAGE_CACHE_SIZE - 1) {
749 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700750 printk(KERN_INFO "%s: set to minimum %lx\n",
751 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100752 }
753
Martin K. Petersen025146e2009-05-22 17:17:51 -0400754 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100755}
Jens Axboe86db1e22008-01-29 14:53:40 +0100756EXPORT_SYMBOL(blk_queue_segment_boundary);
757
758/**
759 * blk_queue_dma_alignment - set dma length and memory alignment
760 * @q: the request queue for the device
761 * @mask: alignment mask
762 *
763 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200764 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100765 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100766 *
767 **/
768void blk_queue_dma_alignment(struct request_queue *q, int mask)
769{
770 q->dma_alignment = mask;
771}
Jens Axboe86db1e22008-01-29 14:53:40 +0100772EXPORT_SYMBOL(blk_queue_dma_alignment);
773
774/**
775 * blk_queue_update_dma_alignment - update dma length and memory alignment
776 * @q: the request queue for the device
777 * @mask: alignment mask
778 *
779 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200780 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100781 * If the requested alignment is larger than the current alignment, then
782 * the current queue alignment is updated to the new value, otherwise it
783 * is left alone. The design of this is to allow multiple objects
784 * (driver, device, transport etc) to set their respective
785 * alignments without having them interfere.
786 *
787 **/
788void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
789{
790 BUG_ON(mask > PAGE_SIZE);
791
792 if (mask > q->dma_alignment)
793 q->dma_alignment = mask;
794}
Jens Axboe86db1e22008-01-29 14:53:40 +0100795EXPORT_SYMBOL(blk_queue_update_dma_alignment);
796
Tejun Heo4913efe2010-09-03 11:56:16 +0200797/**
798 * blk_queue_flush - configure queue's cache flush capability
799 * @q: the request queue for the device
800 * @flush: 0, REQ_FLUSH or REQ_FLUSH | REQ_FUA
801 *
802 * Tell block layer cache flush capability of @q. If it supports
803 * flushing, REQ_FLUSH should be set. If it supports bypassing
804 * write cache for individual writes, REQ_FUA should be set.
805 */
806void blk_queue_flush(struct request_queue *q, unsigned int flush)
807{
808 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
809
810 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
811 flush &= ~REQ_FUA;
812
813 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
814}
815EXPORT_SYMBOL_GPL(blk_queue_flush);
816
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200817static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100818{
819 blk_max_low_pfn = max_low_pfn - 1;
820 blk_max_pfn = max_pfn - 1;
821 return 0;
822}
823subsys_initcall(blk_settings_init);