blob: f47af5031eaae2006905a7a3da0d479e78824032 [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. 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;
129 lim->no_cluster = 0;
130}
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;
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;
Jens Axboe86db1e22008-01-29 14:53:40 +0100220#endif
Malahal Nainenic49825f2010-09-24 20:25:49 +0200221 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100222 if (dma) {
223 init_emergency_isa_pool();
224 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe86db1e22008-01-29 14:53:40 +0100225 }
226}
Jens Axboe86db1e22008-01-29 14:53:40 +0100227EXPORT_SYMBOL(blk_queue_bounce_limit);
228
229/**
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500230 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100231 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500232 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100233 *
234 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500235 * Enables a low level driver to set a hard upper limit,
236 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
237 * the device driver based upon the combined capabilities of I/O
238 * controller and storage device.
239 *
240 * max_sectors is a soft limit imposed by the block layer for
241 * filesystem type requests. This value can be overridden on a
242 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
243 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100244 **/
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500245void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100246{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500247 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
248 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700249 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500250 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100251 }
252
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500253 q->limits.max_hw_sectors = max_hw_sectors;
254 q->limits.max_sectors = min_t(unsigned int, max_hw_sectors,
255 BLK_DEF_MAX_SECTORS);
Jens Axboe86db1e22008-01-29 14:53:40 +0100256}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500257EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100258
259/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200260 * blk_queue_max_discard_sectors - set max sectors for a single discard
261 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200262 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200263 **/
264void blk_queue_max_discard_sectors(struct request_queue *q,
265 unsigned int max_discard_sectors)
266{
267 q->limits.max_discard_sectors = max_discard_sectors;
268}
269EXPORT_SYMBOL(blk_queue_max_discard_sectors);
270
271/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500272 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100273 * @q: the request queue for the device
274 * @max_segments: max number of segments
275 *
276 * Description:
277 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500278 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100279 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500280void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100281{
282 if (!max_segments) {
283 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700284 printk(KERN_INFO "%s: set to minimum %d\n",
285 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100286 }
287
Martin K. Petersen8a783622010-02-26 00:20:39 -0500288 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100289}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500290EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100291
292/**
293 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
294 * @q: the request queue for the device
295 * @max_size: max size of segment in bytes
296 *
297 * Description:
298 * Enables a low level driver to set an upper limit on the size of a
299 * coalesced segment
300 **/
301void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
302{
303 if (max_size < PAGE_CACHE_SIZE) {
304 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700305 printk(KERN_INFO "%s: set to minimum %d\n",
306 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100307 }
308
Martin K. Petersen025146e2009-05-22 17:17:51 -0400309 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100310}
Jens Axboe86db1e22008-01-29 14:53:40 +0100311EXPORT_SYMBOL(blk_queue_max_segment_size);
312
313/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400314 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100315 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400316 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100317 *
318 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400319 * This should be set to the lowest possible block size that the
320 * storage device can address. The default of 512 covers most
321 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100322 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400323void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100324{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400325 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400326
327 if (q->limits.physical_block_size < size)
328 q->limits.physical_block_size = size;
329
330 if (q->limits.io_min < q->limits.physical_block_size)
331 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100332}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400333EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100334
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400335/**
336 * blk_queue_physical_block_size - set physical block size for the queue
337 * @q: the request queue for the device
338 * @size: the physical block size, in bytes
339 *
340 * Description:
341 * This should be set to the lowest possible sector size that the
342 * hardware can operate on without reverting to read-modify-write
343 * operations.
344 */
345void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
346{
347 q->limits.physical_block_size = size;
348
349 if (q->limits.physical_block_size < q->limits.logical_block_size)
350 q->limits.physical_block_size = q->limits.logical_block_size;
351
352 if (q->limits.io_min < q->limits.physical_block_size)
353 q->limits.io_min = q->limits.physical_block_size;
354}
355EXPORT_SYMBOL(blk_queue_physical_block_size);
356
357/**
358 * blk_queue_alignment_offset - set physical block alignment offset
359 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700360 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400361 *
362 * Description:
363 * Some devices are naturally misaligned to compensate for things like
364 * the legacy DOS partition table 63-sector offset. Low-level drivers
365 * should call this function for devices whose first sector is not
366 * naturally aligned.
367 */
368void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
369{
370 q->limits.alignment_offset =
371 offset & (q->limits.physical_block_size - 1);
372 q->limits.misaligned = 0;
373}
374EXPORT_SYMBOL(blk_queue_alignment_offset);
375
376/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400377 * blk_limits_io_min - set minimum request size for a device
378 * @limits: the queue limits
379 * @min: smallest I/O size in bytes
380 *
381 * Description:
382 * Some devices have an internal block size bigger than the reported
383 * hardware sector size. This function can be used to signal the
384 * smallest I/O the device can perform without incurring a performance
385 * penalty.
386 */
387void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
388{
389 limits->io_min = min;
390
391 if (limits->io_min < limits->logical_block_size)
392 limits->io_min = limits->logical_block_size;
393
394 if (limits->io_min < limits->physical_block_size)
395 limits->io_min = limits->physical_block_size;
396}
397EXPORT_SYMBOL(blk_limits_io_min);
398
399/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400400 * blk_queue_io_min - set minimum request size for the queue
401 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700402 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400403 *
404 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400405 * Storage devices may report a granularity or preferred minimum I/O
406 * size which is the smallest request the device can perform without
407 * incurring a performance penalty. For disk drives this is often the
408 * physical block size. For RAID arrays it is often the stripe chunk
409 * size. A properly aligned multiple of minimum_io_size is the
410 * preferred request size for workloads where a high number of I/O
411 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400412 */
413void blk_queue_io_min(struct request_queue *q, unsigned int min)
414{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400415 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400416}
417EXPORT_SYMBOL(blk_queue_io_min);
418
419/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200420 * blk_limits_io_opt - set optimal request size for a device
421 * @limits: the queue limits
422 * @opt: smallest I/O size in bytes
423 *
424 * Description:
425 * Storage devices may report an optimal I/O size, which is the
426 * device's preferred unit for sustained I/O. This is rarely reported
427 * for disk drives. For RAID arrays it is usually the stripe width or
428 * the internal track size. A properly aligned multiple of
429 * optimal_io_size is the preferred request size for workloads where
430 * sustained throughput is desired.
431 */
432void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
433{
434 limits->io_opt = opt;
435}
436EXPORT_SYMBOL(blk_limits_io_opt);
437
438/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400439 * blk_queue_io_opt - set optimal request size for the queue
440 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700441 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400442 *
443 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400444 * Storage devices may report an optimal I/O size, which is the
445 * device's preferred unit for sustained I/O. This is rarely reported
446 * for disk drives. For RAID arrays it is usually the stripe width or
447 * the internal track size. A properly aligned multiple of
448 * optimal_io_size is the preferred request size for workloads where
449 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400450 */
451void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
452{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200453 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400454}
455EXPORT_SYMBOL(blk_queue_io_opt);
456
Jens Axboe86db1e22008-01-29 14:53:40 +0100457/**
458 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
459 * @t: the stacking driver (top)
460 * @b: the underlying device (bottom)
461 **/
462void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
463{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400464 blk_stack_limits(&t->limits, &b->limits, 0);
Martin K. Petersen025146e2009-05-22 17:17:51 -0400465
Neil Browne7e72bf2008-05-14 16:05:54 -0700466 if (!t->queue_lock)
467 WARN_ON_ONCE(1);
468 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
469 unsigned long flags;
470 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200471 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700472 spin_unlock_irqrestore(t->queue_lock, flags);
473 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100474}
Jens Axboe86db1e22008-01-29 14:53:40 +0100475EXPORT_SYMBOL(blk_queue_stack_limits);
476
477/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400478 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100479 * @t: the stacking driver limits (top device)
480 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500481 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400482 *
483 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100484 * This function is used by stacking drivers like MD and DM to ensure
485 * that all component devices have compatible block sizes and
486 * alignments. The stacking driver must provide a queue_limits
487 * struct (top) and then iteratively call the stacking function for
488 * all component (bottom) devices. The stacking function will
489 * attempt to combine the values and ensure proper alignment.
490 *
491 * Returns 0 if the top and bottom queue_limits are compatible. The
492 * top device's block sizes and alignment offsets may be adjusted to
493 * ensure alignment with the bottom device. If no compatible sizes
494 * and alignments exist, -1 is returned and the resulting top
495 * queue_limits will have the misaligned flag set to indicate that
496 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400497 */
498int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500499 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400500{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500501 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100502
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400503 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
504 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200505 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400506
507 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
508 b->seg_boundary_mask);
509
Martin K. Petersen8a783622010-02-26 00:20:39 -0500510 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200511 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
512 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400513
514 t->max_segment_size = min_not_zero(t->max_segment_size,
515 b->max_segment_size);
516
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500517 t->misaligned |= b->misaligned;
518
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500519 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100520
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100521 /* Bottom device has different alignment. Check that it is
522 * compatible with the current top alignment.
523 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100524 if (t->alignment_offset != alignment) {
525
526 top = max(t->physical_block_size, t->io_min)
527 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100528 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100529
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100530 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500531 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100532 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500533 ret = -1;
534 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100535 }
536
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400537 t->logical_block_size = max(t->logical_block_size,
538 b->logical_block_size);
539
540 t->physical_block_size = max(t->physical_block_size,
541 b->physical_block_size);
542
543 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100544 t->io_opt = lcm(t->io_opt, b->io_opt);
545
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400546 t->no_cluster |= b->no_cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100547 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400548
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100549 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100550 if (t->physical_block_size & (t->logical_block_size - 1)) {
551 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400552 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500553 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100554 }
555
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100556 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100557 if (t->io_min & (t->physical_block_size - 1)) {
558 t->io_min = t->physical_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. Petersenc72758f2009-05-22 17:17:53 -0400561 }
562
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100563 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100564 if (t->io_opt & (t->physical_block_size - 1)) {
565 t->io_opt = 0;
566 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500567 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100568 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400569
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100570 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571 t->alignment_offset = lcm(t->alignment_offset, alignment)
572 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400573
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100574 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500575 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100576 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500577 ret = -1;
578 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100579
580 /* Discard alignment and granularity */
581 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500582 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583
584 if (t->discard_granularity != 0 &&
585 t->discard_alignment != alignment) {
586 top = t->discard_granularity + t->discard_alignment;
587 bottom = b->discard_granularity + alignment;
588
589 /* Verify that top and bottom intervals line up */
590 if (max(top, bottom) & (min(top, bottom) - 1))
591 t->discard_misaligned = 1;
592 }
593
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100594 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
595 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100596 t->discard_granularity = max(t->discard_granularity,
597 b->discard_granularity);
598 t->discard_alignment = lcm(t->discard_alignment, alignment) &
599 (t->discard_granularity - 1);
600 }
601
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500602 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400603}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200604EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400605
606/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500607 * bdev_stack_limits - adjust queue limits for stacked drivers
608 * @t: the stacking driver limits (top device)
609 * @bdev: the component block_device (bottom)
610 * @start: first data sector within component device
611 *
612 * Description:
613 * Merges queue limits for a top device and a block_device. Returns
614 * 0 if alignment didn't change. Returns -1 if adding the bottom
615 * device caused misalignment.
616 */
617int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
618 sector_t start)
619{
620 struct request_queue *bq = bdev_get_queue(bdev);
621
622 start += get_start_sect(bdev);
623
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500624 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500625}
626EXPORT_SYMBOL(bdev_stack_limits);
627
628/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400629 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200630 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400631 * @bdev: the underlying block device (bottom)
632 * @offset: offset to beginning of data within component device
633 *
634 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500635 * Merges the limits for a top level gendisk and a bottom level
636 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400637 */
638void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
639 sector_t offset)
640{
641 struct request_queue *t = disk->queue;
642 struct request_queue *b = bdev_get_queue(bdev);
643
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500644 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400645 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
646
647 disk_name(disk, 0, top);
648 bdevname(bdev, bottom);
649
650 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
651 top, bottom);
652 }
653
654 if (!t->queue_lock)
655 WARN_ON_ONCE(1);
656 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
657 unsigned long flags;
658
659 spin_lock_irqsave(t->queue_lock, flags);
660 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
661 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
662 spin_unlock_irqrestore(t->queue_lock, flags);
663 }
664}
665EXPORT_SYMBOL(disk_stack_limits);
666
667/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100668 * blk_queue_dma_pad - set pad mask
669 * @q: the request queue for the device
670 * @mask: pad mask
671 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200672 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100673 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200674 * Appending pad buffer to a request modifies the last entry of a
675 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100676 **/
677void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
678{
679 q->dma_pad_mask = mask;
680}
681EXPORT_SYMBOL(blk_queue_dma_pad);
682
683/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200684 * blk_queue_update_dma_pad - update pad mask
685 * @q: the request queue for the device
686 * @mask: pad mask
687 *
688 * Update dma pad mask.
689 *
690 * Appending pad buffer to a request modifies the last entry of a
691 * scatter list such that it includes the pad buffer.
692 **/
693void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
694{
695 if (mask > q->dma_pad_mask)
696 q->dma_pad_mask = mask;
697}
698EXPORT_SYMBOL(blk_queue_update_dma_pad);
699
700/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100701 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100702 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100703 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100704 * @buf: physically contiguous buffer
705 * @size: size of the buffer in bytes
706 *
707 * Some devices have excess DMA problems and can't simply discard (or
708 * zero fill) the unwanted piece of the transfer. They have to have a
709 * real area of memory to transfer it into. The use case for this is
710 * ATAPI devices in DMA mode. If the packet command causes a transfer
711 * bigger than the transfer size some HBAs will lock up if there
712 * aren't DMA elements to contain the excess transfer. What this API
713 * does is adjust the queue so that the buf is always appended
714 * silently to the scatterlist.
715 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500716 * Note: This routine adjusts max_hw_segments to make room for appending
717 * the drain buffer. If you call blk_queue_max_segments() after calling
718 * this routine, you must set the limit to one fewer than your device
719 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100720 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100721int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100722 dma_drain_needed_fn *dma_drain_needed,
723 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100724{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500725 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100726 return -EINVAL;
727 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500728 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100729 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100730 q->dma_drain_buffer = buf;
731 q->dma_drain_size = size;
732
733 return 0;
734}
Jens Axboe86db1e22008-01-29 14:53:40 +0100735EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
736
737/**
738 * blk_queue_segment_boundary - set boundary rules for segment merging
739 * @q: the request queue for the device
740 * @mask: the memory boundary mask
741 **/
742void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
743{
744 if (mask < PAGE_CACHE_SIZE - 1) {
745 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700746 printk(KERN_INFO "%s: set to minimum %lx\n",
747 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100748 }
749
Martin K. Petersen025146e2009-05-22 17:17:51 -0400750 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100751}
Jens Axboe86db1e22008-01-29 14:53:40 +0100752EXPORT_SYMBOL(blk_queue_segment_boundary);
753
754/**
755 * blk_queue_dma_alignment - set dma length and memory alignment
756 * @q: the request queue for the device
757 * @mask: alignment mask
758 *
759 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200760 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100761 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100762 *
763 **/
764void blk_queue_dma_alignment(struct request_queue *q, int mask)
765{
766 q->dma_alignment = mask;
767}
Jens Axboe86db1e22008-01-29 14:53:40 +0100768EXPORT_SYMBOL(blk_queue_dma_alignment);
769
770/**
771 * blk_queue_update_dma_alignment - update dma length and memory alignment
772 * @q: the request queue for the device
773 * @mask: alignment mask
774 *
775 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200776 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100777 * If the requested alignment is larger than the current alignment, then
778 * the current queue alignment is updated to the new value, otherwise it
779 * is left alone. The design of this is to allow multiple objects
780 * (driver, device, transport etc) to set their respective
781 * alignments without having them interfere.
782 *
783 **/
784void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
785{
786 BUG_ON(mask > PAGE_SIZE);
787
788 if (mask > q->dma_alignment)
789 q->dma_alignment = mask;
790}
Jens Axboe86db1e22008-01-29 14:53:40 +0100791EXPORT_SYMBOL(blk_queue_update_dma_alignment);
792
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200793static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100794{
795 blk_max_low_pfn = max_low_pfn - 1;
796 blk_max_pfn = max_pfn - 1;
797 return 0;
798}
799subsys_initcall(blk_settings_init);