blob: 36c8c1f2af18088fb5fa34f4889d2fead2556600 [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 Dunlapf740f5c2009-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. Petersen13f05c82010-09-10 20:50:10 +0200114 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200115 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -0500116 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersen5dee2472009-09-21 21:46:05 +0200117 lim->max_sectors = BLK_DEF_MAX_SECTORS;
118 lim->max_hw_sectors = INT_MAX;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100119 lim->max_discard_sectors = 0;
120 lim->discard_granularity = 0;
121 lim->discard_alignment = 0;
122 lim->discard_misaligned = 0;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100123 lim->discard_zeroes_data = -1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200124 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200125 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200126 lim->alignment_offset = 0;
127 lim->io_opt = 0;
128 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100129 lim->cluster = 1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200130}
131EXPORT_SYMBOL(blk_set_default_limits);
132
133/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100134 * blk_queue_make_request - define an alternate make_request function for a device
135 * @q: the request queue for the device to be affected
136 * @mfn: the alternate make_request function
137 *
138 * Description:
139 * The normal way for &struct bios to be passed to a device
140 * driver is for them to be collected into requests on a request
141 * queue, and then to allow the device driver to select requests
142 * off that queue when it is ready. This works well for many block
143 * devices. However some block devices (typically virtual devices
144 * such as md or lvm) do not benefit from the processing on the
145 * request queue, and are served best by having the requests passed
146 * directly to them. This can be achieved by providing a function
147 * to blk_queue_make_request().
148 *
149 * Caveat:
150 * The driver that does this *must* be able to deal appropriately
151 * with buffers in "highmemory". This can be accomplished by either calling
152 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
153 * blk_queue_bounce() to create a buffer in normal memory.
154 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100155void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100156{
157 /*
158 * set defaults
159 */
160 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100161
Jens Axboe86db1e22008-01-29 14:53:40 +0100162 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100163 blk_queue_dma_alignment(q, 511);
164 blk_queue_congestion_threshold(q);
165 q->nr_batching = BLK_BATCH_REQ;
166
167 q->unplug_thresh = 4; /* hmm */
Randy Dunlapad5ebd22009-11-11 13:47:45 +0100168 q->unplug_delay = msecs_to_jiffies(3); /* 3 milliseconds */
Jens Axboe86db1e22008-01-29 14:53:40 +0100169 if (q->unplug_delay == 0)
170 q->unplug_delay = 1;
171
Jens Axboe86db1e22008-01-29 14:53:40 +0100172 q->unplug_timer.function = blk_unplug_timeout;
173 q->unplug_timer.data = (unsigned long)q;
174
Martin K. Petersene475bba2009-06-16 08:23:52 +0200175 blk_set_default_limits(&q->limits);
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500176 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200177
Jens Axboe86db1e22008-01-29 14:53:40 +0100178 /*
Jens Axboea4e7d462009-07-28 09:07:29 +0200179 * If the caller didn't supply a lock, fall back to our embedded
180 * per-queue locks
181 */
182 if (!q->queue_lock)
183 q->queue_lock = &q->__queue_lock;
184
185 /*
Jens Axboe86db1e22008-01-29 14:53:40 +0100186 * by default assume old behaviour and bounce for any highmem page
187 */
188 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
189}
Jens Axboe86db1e22008-01-29 14:53:40 +0100190EXPORT_SYMBOL(blk_queue_make_request);
191
192/**
193 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900194 * @q: the request queue for the device
195 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100196 *
197 * Description:
198 * Different hardware can have different requirements as to what pages
199 * it can do I/O directly to. A low level driver can call
200 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900201 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100202 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900203void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100204{
Tejun Heocd0aca22009-04-15 22:10:25 +0900205 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100206 int dma = 0;
207
208 q->bounce_gfp = GFP_NOIO;
209#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900210 /*
211 * Assume anything <= 4GB can be handled by IOMMU. Actually
212 * some IOMMUs can handle everything, but I don't know of a
213 * way to test this here.
214 */
215 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100216 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200217 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100218#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100219 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100220 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200221 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200222#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100223 if (dma) {
224 init_emergency_isa_pool();
225 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200226 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100227 }
228}
Jens Axboe86db1e22008-01-29 14:53:40 +0100229EXPORT_SYMBOL(blk_queue_bounce_limit);
230
231/**
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100232 * blk_limits_max_hw_sectors - set hard and soft limit of max sectors for request
233 * @limits: the queue limits
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500234 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100235 *
236 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500237 * Enables a low level driver to set a hard upper limit,
238 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
239 * the device driver based upon the combined capabilities of I/O
240 * controller and storage device.
241 *
242 * max_sectors is a soft limit imposed by the block layer for
243 * filesystem type requests. This value can be overridden on a
244 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
245 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100246 **/
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100247void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100248{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500249 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
250 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700251 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500252 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100253 }
254
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100255 limits->max_hw_sectors = max_hw_sectors;
256 limits->max_sectors = min_t(unsigned int, max_hw_sectors,
257 BLK_DEF_MAX_SECTORS);
258}
259EXPORT_SYMBOL(blk_limits_max_hw_sectors);
260
261/**
262 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
263 * @q: the request queue for the device
264 * @max_hw_sectors: max hardware sectors in the usual 512b unit
265 *
266 * Description:
267 * See description for blk_limits_max_hw_sectors().
268 **/
269void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
270{
271 blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100272}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500273EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100274
275/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200276 * blk_queue_max_discard_sectors - set max sectors for a single discard
277 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200278 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200279 **/
280void blk_queue_max_discard_sectors(struct request_queue *q,
281 unsigned int max_discard_sectors)
282{
283 q->limits.max_discard_sectors = max_discard_sectors;
284}
285EXPORT_SYMBOL(blk_queue_max_discard_sectors);
286
287/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500288 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100289 * @q: the request queue for the device
290 * @max_segments: max number of segments
291 *
292 * Description:
293 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500294 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100295 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500296void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100297{
298 if (!max_segments) {
299 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700300 printk(KERN_INFO "%s: set to minimum %d\n",
301 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100302 }
303
Martin K. Petersen8a783622010-02-26 00:20:39 -0500304 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100305}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500306EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100307
308/**
309 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
310 * @q: the request queue for the device
311 * @max_size: max size of segment in bytes
312 *
313 * Description:
314 * Enables a low level driver to set an upper limit on the size of a
315 * coalesced segment
316 **/
317void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
318{
319 if (max_size < PAGE_CACHE_SIZE) {
320 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700321 printk(KERN_INFO "%s: set to minimum %d\n",
322 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100323 }
324
Martin K. Petersen025146e2009-05-22 17:17:51 -0400325 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100326}
Jens Axboe86db1e22008-01-29 14:53:40 +0100327EXPORT_SYMBOL(blk_queue_max_segment_size);
328
329/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400330 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100331 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400332 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100333 *
334 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400335 * This should be set to the lowest possible block size that the
336 * storage device can address. The default of 512 covers most
337 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100338 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400339void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100340{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400341 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400342
343 if (q->limits.physical_block_size < size)
344 q->limits.physical_block_size = size;
345
346 if (q->limits.io_min < q->limits.physical_block_size)
347 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100348}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400349EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100350
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400351/**
352 * blk_queue_physical_block_size - set physical block size for the queue
353 * @q: the request queue for the device
354 * @size: the physical block size, in bytes
355 *
356 * Description:
357 * This should be set to the lowest possible sector size that the
358 * hardware can operate on without reverting to read-modify-write
359 * operations.
360 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200361void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400362{
363 q->limits.physical_block_size = size;
364
365 if (q->limits.physical_block_size < q->limits.logical_block_size)
366 q->limits.physical_block_size = q->limits.logical_block_size;
367
368 if (q->limits.io_min < q->limits.physical_block_size)
369 q->limits.io_min = q->limits.physical_block_size;
370}
371EXPORT_SYMBOL(blk_queue_physical_block_size);
372
373/**
374 * blk_queue_alignment_offset - set physical block alignment offset
375 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700376 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400377 *
378 * Description:
379 * Some devices are naturally misaligned to compensate for things like
380 * the legacy DOS partition table 63-sector offset. Low-level drivers
381 * should call this function for devices whose first sector is not
382 * naturally aligned.
383 */
384void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
385{
386 q->limits.alignment_offset =
387 offset & (q->limits.physical_block_size - 1);
388 q->limits.misaligned = 0;
389}
390EXPORT_SYMBOL(blk_queue_alignment_offset);
391
392/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400393 * blk_limits_io_min - set minimum request size for a device
394 * @limits: the queue limits
395 * @min: smallest I/O size in bytes
396 *
397 * Description:
398 * Some devices have an internal block size bigger than the reported
399 * hardware sector size. This function can be used to signal the
400 * smallest I/O the device can perform without incurring a performance
401 * penalty.
402 */
403void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
404{
405 limits->io_min = min;
406
407 if (limits->io_min < limits->logical_block_size)
408 limits->io_min = limits->logical_block_size;
409
410 if (limits->io_min < limits->physical_block_size)
411 limits->io_min = limits->physical_block_size;
412}
413EXPORT_SYMBOL(blk_limits_io_min);
414
415/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400416 * blk_queue_io_min - set minimum request size for the queue
417 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700418 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400419 *
420 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400421 * Storage devices may report a granularity or preferred minimum I/O
422 * size which is the smallest request the device can perform without
423 * incurring a performance penalty. For disk drives this is often the
424 * physical block size. For RAID arrays it is often the stripe chunk
425 * size. A properly aligned multiple of minimum_io_size is the
426 * preferred request size for workloads where a high number of I/O
427 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400428 */
429void blk_queue_io_min(struct request_queue *q, unsigned int min)
430{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400431 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400432}
433EXPORT_SYMBOL(blk_queue_io_min);
434
435/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200436 * blk_limits_io_opt - set optimal request size for a device
437 * @limits: the queue limits
438 * @opt: smallest I/O size in bytes
439 *
440 * Description:
441 * Storage devices may report an optimal I/O size, which is the
442 * device's preferred unit for sustained I/O. This is rarely reported
443 * for disk drives. For RAID arrays it is usually the stripe width or
444 * the internal track size. A properly aligned multiple of
445 * optimal_io_size is the preferred request size for workloads where
446 * sustained throughput is desired.
447 */
448void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
449{
450 limits->io_opt = opt;
451}
452EXPORT_SYMBOL(blk_limits_io_opt);
453
454/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400455 * blk_queue_io_opt - set optimal request size for the queue
456 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700457 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400458 *
459 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400460 * Storage devices may report an optimal I/O size, which is the
461 * device's preferred unit for sustained I/O. This is rarely reported
462 * for disk drives. For RAID arrays it is usually the stripe width or
463 * the internal track size. A properly aligned multiple of
464 * optimal_io_size is the preferred request size for workloads where
465 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400466 */
467void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
468{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200469 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400470}
471EXPORT_SYMBOL(blk_queue_io_opt);
472
Jens Axboe86db1e22008-01-29 14:53:40 +0100473/**
474 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
475 * @t: the stacking driver (top)
476 * @b: the underlying device (bottom)
477 **/
478void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
479{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400480 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100481}
Jens Axboe86db1e22008-01-29 14:53:40 +0100482EXPORT_SYMBOL(blk_queue_stack_limits);
483
484/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400485 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100486 * @t: the stacking driver limits (top device)
487 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500488 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400489 *
490 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100491 * This function is used by stacking drivers like MD and DM to ensure
492 * that all component devices have compatible block sizes and
493 * alignments. The stacking driver must provide a queue_limits
494 * struct (top) and then iteratively call the stacking function for
495 * all component (bottom) devices. The stacking function will
496 * attempt to combine the values and ensure proper alignment.
497 *
498 * Returns 0 if the top and bottom queue_limits are compatible. The
499 * top device's block sizes and alignment offsets may be adjusted to
500 * ensure alignment with the bottom device. If no compatible sizes
501 * and alignments exist, -1 is returned and the resulting top
502 * queue_limits will have the misaligned flag set to indicate that
503 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400504 */
505int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500506 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400507{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500508 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100509
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400510 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
511 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200512 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400513
514 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
515 b->seg_boundary_mask);
516
Martin K. Petersen8a783622010-02-26 00:20:39 -0500517 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200518 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
519 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400520
521 t->max_segment_size = min_not_zero(t->max_segment_size,
522 b->max_segment_size);
523
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500524 t->misaligned |= b->misaligned;
525
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500526 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100527
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100528 /* Bottom device has different alignment. Check that it is
529 * compatible with the current top alignment.
530 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100531 if (t->alignment_offset != alignment) {
532
533 top = max(t->physical_block_size, t->io_min)
534 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100535 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100536
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100537 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500538 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100539 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500540 ret = -1;
541 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100542 }
543
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400544 t->logical_block_size = max(t->logical_block_size,
545 b->logical_block_size);
546
547 t->physical_block_size = max(t->physical_block_size,
548 b->physical_block_size);
549
550 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100551 t->io_opt = lcm(t->io_opt, b->io_opt);
552
Martin K. Petersene692cb62010-12-01 19:41:49 +0100553 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100554 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400555
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100556 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100557 if (t->physical_block_size & (t->logical_block_size - 1)) {
558 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400559 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500560 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100561 }
562
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100563 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100564 if (t->io_min & (t->physical_block_size - 1)) {
565 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400566 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500567 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400568 }
569
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100570 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571 if (t->io_opt & (t->physical_block_size - 1)) {
572 t->io_opt = 0;
573 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500574 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100575 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400576
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100577 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100578 t->alignment_offset = lcm(t->alignment_offset, alignment)
579 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400580
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100581 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500582 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500584 ret = -1;
585 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100586
587 /* Discard alignment and granularity */
588 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500589 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100590
591 if (t->discard_granularity != 0 &&
592 t->discard_alignment != alignment) {
593 top = t->discard_granularity + t->discard_alignment;
594 bottom = b->discard_granularity + alignment;
595
596 /* Verify that top and bottom intervals line up */
597 if (max(top, bottom) & (min(top, bottom) - 1))
598 t->discard_misaligned = 1;
599 }
600
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100601 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
602 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100603 t->discard_granularity = max(t->discard_granularity,
604 b->discard_granularity);
605 t->discard_alignment = lcm(t->discard_alignment, alignment) &
606 (t->discard_granularity - 1);
607 }
608
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500609 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400610}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200611EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400612
613/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500614 * bdev_stack_limits - adjust queue limits for stacked drivers
615 * @t: the stacking driver limits (top device)
616 * @bdev: the component block_device (bottom)
617 * @start: first data sector within component device
618 *
619 * Description:
620 * Merges queue limits for a top device and a block_device. Returns
621 * 0 if alignment didn't change. Returns -1 if adding the bottom
622 * device caused misalignment.
623 */
624int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
625 sector_t start)
626{
627 struct request_queue *bq = bdev_get_queue(bdev);
628
629 start += get_start_sect(bdev);
630
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500631 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500632}
633EXPORT_SYMBOL(bdev_stack_limits);
634
635/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400636 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200637 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400638 * @bdev: the underlying block device (bottom)
639 * @offset: offset to beginning of data within component device
640 *
641 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500642 * Merges the limits for a top level gendisk and a bottom level
643 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400644 */
645void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
646 sector_t offset)
647{
648 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400649
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500650 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400651 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
652
653 disk_name(disk, 0, top);
654 bdevname(bdev, bottom);
655
656 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
657 top, bottom);
658 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400659}
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
Tejun Heo4913efe2010-09-03 11:56:16 +0200788/**
789 * blk_queue_flush - configure queue's cache flush capability
790 * @q: the request queue for the device
791 * @flush: 0, REQ_FLUSH or REQ_FLUSH | REQ_FUA
792 *
793 * Tell block layer cache flush capability of @q. If it supports
794 * flushing, REQ_FLUSH should be set. If it supports bypassing
795 * write cache for individual writes, REQ_FUA should be set.
796 */
797void blk_queue_flush(struct request_queue *q, unsigned int flush)
798{
799 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
800
801 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
802 flush &= ~REQ_FUA;
803
804 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
805}
806EXPORT_SYMBOL_GPL(blk_queue_flush);
807
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200808static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100809{
810 blk_max_low_pfn = max_low_pfn - 1;
811 blk_max_pfn = max_pfn - 1;
812 return 0;
813}
814subsys_initcall(blk_settings_init);