blob: 579328cff6df3b6db372392d6664d14c52626a38 [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/**
Tatyana Brokhman88fd1b42012-12-04 16:04:15 +0200103 * blk_urgent_request() - Set an urgent_request handler function for queue
104 * @q: queue
105 * @fn: handler for urgent requests
106 *
107 */
108void blk_urgent_request(struct request_queue *q, request_fn_proc *fn)
109{
110 q->urgent_request_fn = fn;
111}
112EXPORT_SYMBOL(blk_urgent_request);
113
114/**
Martin K. Petersene475bba2009-06-16 08:23:52 +0200115 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5c2009-06-19 09:18:32 +0200116 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +0200117 *
118 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100119 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +0200120 */
121void blk_set_default_limits(struct queue_limits *lim)
122{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500123 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200124 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200125 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -0500126 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100127 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100128 lim->max_discard_sectors = 0;
129 lim->discard_granularity = 0;
130 lim->discard_alignment = 0;
131 lim->discard_misaligned = 0;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100132 lim->discard_zeroes_data = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200133 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200134 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200135 lim->alignment_offset = 0;
136 lim->io_opt = 0;
137 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100138 lim->cluster = 1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200139}
140EXPORT_SYMBOL(blk_set_default_limits);
141
142/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100143 * blk_set_stacking_limits - set default limits for stacking devices
144 * @lim: the queue_limits structure to reset
145 *
146 * Description:
147 * Returns a queue_limit struct to its default state. Should be used
148 * by stacking drivers like DM that have no internal limits.
149 */
150void blk_set_stacking_limits(struct queue_limits *lim)
151{
152 blk_set_default_limits(lim);
153
154 /* Inherit limits from component devices */
155 lim->discard_zeroes_data = 1;
156 lim->max_segments = USHRT_MAX;
157 lim->max_hw_sectors = UINT_MAX;
158
159 lim->max_sectors = BLK_DEF_MAX_SECTORS;
160}
161EXPORT_SYMBOL(blk_set_stacking_limits);
162
163/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100164 * blk_queue_make_request - define an alternate make_request function for a device
165 * @q: the request queue for the device to be affected
166 * @mfn: the alternate make_request function
167 *
168 * Description:
169 * The normal way for &struct bios to be passed to a device
170 * driver is for them to be collected into requests on a request
171 * queue, and then to allow the device driver to select requests
172 * off that queue when it is ready. This works well for many block
173 * devices. However some block devices (typically virtual devices
174 * such as md or lvm) do not benefit from the processing on the
175 * request queue, and are served best by having the requests passed
176 * directly to them. This can be achieved by providing a function
177 * to blk_queue_make_request().
178 *
179 * Caveat:
180 * The driver that does this *must* be able to deal appropriately
181 * with buffers in "highmemory". This can be accomplished by either calling
182 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
183 * blk_queue_bounce() to create a buffer in normal memory.
184 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100185void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100186{
187 /*
188 * set defaults
189 */
190 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100191
Jens Axboe86db1e22008-01-29 14:53:40 +0100192 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100193 blk_queue_dma_alignment(q, 511);
194 blk_queue_congestion_threshold(q);
195 q->nr_batching = BLK_BATCH_REQ;
196
Martin K. Petersene475bba2009-06-16 08:23:52 +0200197 blk_set_default_limits(&q->limits);
198
Jens Axboe86db1e22008-01-29 14:53:40 +0100199 /*
200 * by default assume old behaviour and bounce for any highmem page
201 */
202 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
203}
Jens Axboe86db1e22008-01-29 14:53:40 +0100204EXPORT_SYMBOL(blk_queue_make_request);
205
206/**
207 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900208 * @q: the request queue for the device
209 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100210 *
211 * Description:
212 * Different hardware can have different requirements as to what pages
213 * it can do I/O directly to. A low level driver can call
214 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900215 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100216 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900217void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100218{
Tejun Heocd0aca22009-04-15 22:10:25 +0900219 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100220 int dma = 0;
221
222 q->bounce_gfp = GFP_NOIO;
223#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900224 /*
225 * Assume anything <= 4GB can be handled by IOMMU. Actually
226 * some IOMMUs can handle everything, but I don't know of a
227 * way to test this here.
228 */
229 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100230 dma = 1;
Malahal Naineniefb012b2010-10-01 14:45:27 +0200231 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100232#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100233 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100234 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200235 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200236#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100237 if (dma) {
238 init_emergency_isa_pool();
239 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200240 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100241 }
242}
Jens Axboe86db1e22008-01-29 14:53:40 +0100243EXPORT_SYMBOL(blk_queue_bounce_limit);
244
245/**
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100246 * blk_limits_max_hw_sectors - set hard and soft limit of max sectors for request
247 * @limits: the queue limits
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500248 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100249 *
250 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500251 * Enables a low level driver to set a hard upper limit,
252 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
253 * the device driver based upon the combined capabilities of I/O
254 * controller and storage device.
255 *
256 * max_sectors is a soft limit imposed by the block layer for
257 * filesystem type requests. This value can be overridden on a
258 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
259 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100260 **/
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100261void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100262{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500263 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
264 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700265 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500266 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100267 }
268
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100269 limits->max_hw_sectors = max_hw_sectors;
270 limits->max_sectors = min_t(unsigned int, max_hw_sectors,
271 BLK_DEF_MAX_SECTORS);
272}
273EXPORT_SYMBOL(blk_limits_max_hw_sectors);
274
275/**
276 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
277 * @q: the request queue for the device
278 * @max_hw_sectors: max hardware sectors in the usual 512b unit
279 *
280 * Description:
281 * See description for blk_limits_max_hw_sectors().
282 **/
283void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
284{
285 blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100286}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500287EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100288
289/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200290 * blk_queue_max_discard_sectors - set max sectors for a single discard
291 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200292 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200293 **/
294void blk_queue_max_discard_sectors(struct request_queue *q,
295 unsigned int max_discard_sectors)
296{
297 q->limits.max_discard_sectors = max_discard_sectors;
298}
299EXPORT_SYMBOL(blk_queue_max_discard_sectors);
300
301/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500302 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100303 * @q: the request queue for the device
304 * @max_segments: max number of segments
305 *
306 * Description:
307 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500308 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100309 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500310void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100311{
312 if (!max_segments) {
313 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700314 printk(KERN_INFO "%s: set to minimum %d\n",
315 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100316 }
317
Martin K. Petersen8a783622010-02-26 00:20:39 -0500318 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100319}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500320EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100321
322/**
323 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
324 * @q: the request queue for the device
325 * @max_size: max size of segment in bytes
326 *
327 * Description:
328 * Enables a low level driver to set an upper limit on the size of a
329 * coalesced segment
330 **/
331void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
332{
333 if (max_size < PAGE_CACHE_SIZE) {
334 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700335 printk(KERN_INFO "%s: set to minimum %d\n",
336 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100337 }
338
Martin K. Petersen025146e2009-05-22 17:17:51 -0400339 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100340}
Jens Axboe86db1e22008-01-29 14:53:40 +0100341EXPORT_SYMBOL(blk_queue_max_segment_size);
342
343/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400344 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100345 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400346 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100347 *
348 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400349 * This should be set to the lowest possible block size that the
350 * storage device can address. The default of 512 covers most
351 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100352 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400353void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100354{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400355 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400356
357 if (q->limits.physical_block_size < size)
358 q->limits.physical_block_size = size;
359
360 if (q->limits.io_min < q->limits.physical_block_size)
361 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100362}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400363EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100364
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400365/**
366 * blk_queue_physical_block_size - set physical block size for the queue
367 * @q: the request queue for the device
368 * @size: the physical block size, in bytes
369 *
370 * Description:
371 * This should be set to the lowest possible sector size that the
372 * hardware can operate on without reverting to read-modify-write
373 * operations.
374 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200375void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400376{
377 q->limits.physical_block_size = size;
378
379 if (q->limits.physical_block_size < q->limits.logical_block_size)
380 q->limits.physical_block_size = q->limits.logical_block_size;
381
382 if (q->limits.io_min < q->limits.physical_block_size)
383 q->limits.io_min = q->limits.physical_block_size;
384}
385EXPORT_SYMBOL(blk_queue_physical_block_size);
386
387/**
388 * blk_queue_alignment_offset - set physical block alignment offset
389 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700390 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400391 *
392 * Description:
393 * Some devices are naturally misaligned to compensate for things like
394 * the legacy DOS partition table 63-sector offset. Low-level drivers
395 * should call this function for devices whose first sector is not
396 * naturally aligned.
397 */
398void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
399{
400 q->limits.alignment_offset =
401 offset & (q->limits.physical_block_size - 1);
402 q->limits.misaligned = 0;
403}
404EXPORT_SYMBOL(blk_queue_alignment_offset);
405
406/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400407 * blk_limits_io_min - set minimum request size for a device
408 * @limits: the queue limits
409 * @min: smallest I/O size in bytes
410 *
411 * Description:
412 * Some devices have an internal block size bigger than the reported
413 * hardware sector size. This function can be used to signal the
414 * smallest I/O the device can perform without incurring a performance
415 * penalty.
416 */
417void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
418{
419 limits->io_min = min;
420
421 if (limits->io_min < limits->logical_block_size)
422 limits->io_min = limits->logical_block_size;
423
424 if (limits->io_min < limits->physical_block_size)
425 limits->io_min = limits->physical_block_size;
426}
427EXPORT_SYMBOL(blk_limits_io_min);
428
429/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400430 * blk_queue_io_min - set minimum request size for the queue
431 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700432 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400433 *
434 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400435 * Storage devices may report a granularity or preferred minimum I/O
436 * size which is the smallest request the device can perform without
437 * incurring a performance penalty. For disk drives this is often the
438 * physical block size. For RAID arrays it is often the stripe chunk
439 * size. A properly aligned multiple of minimum_io_size is the
440 * preferred request size for workloads where a high number of I/O
441 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400442 */
443void blk_queue_io_min(struct request_queue *q, unsigned int min)
444{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400445 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400446}
447EXPORT_SYMBOL(blk_queue_io_min);
448
449/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200450 * blk_limits_io_opt - set optimal request size for a device
451 * @limits: the queue limits
452 * @opt: smallest I/O size in bytes
453 *
454 * Description:
455 * Storage devices may report an optimal I/O size, which is the
456 * device's preferred unit for sustained I/O. This is rarely reported
457 * for disk drives. For RAID arrays it is usually the stripe width or
458 * the internal track size. A properly aligned multiple of
459 * optimal_io_size is the preferred request size for workloads where
460 * sustained throughput is desired.
461 */
462void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
463{
464 limits->io_opt = opt;
465}
466EXPORT_SYMBOL(blk_limits_io_opt);
467
468/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400469 * blk_queue_io_opt - set optimal request size for the queue
470 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700471 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400472 *
473 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400474 * Storage devices may report an optimal I/O size, which is the
475 * device's preferred unit for sustained I/O. This is rarely reported
476 * for disk drives. For RAID arrays it is usually the stripe width or
477 * the internal track size. A properly aligned multiple of
478 * optimal_io_size is the preferred request size for workloads where
479 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400480 */
481void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
482{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200483 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400484}
485EXPORT_SYMBOL(blk_queue_io_opt);
486
Jens Axboe86db1e22008-01-29 14:53:40 +0100487/**
488 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
489 * @t: the stacking driver (top)
490 * @b: the underlying device (bottom)
491 **/
492void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
493{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400494 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100495}
Jens Axboe86db1e22008-01-29 14:53:40 +0100496EXPORT_SYMBOL(blk_queue_stack_limits);
497
498/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400499 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100500 * @t: the stacking driver limits (top device)
501 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500502 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400503 *
504 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100505 * This function is used by stacking drivers like MD and DM to ensure
506 * that all component devices have compatible block sizes and
507 * alignments. The stacking driver must provide a queue_limits
508 * struct (top) and then iteratively call the stacking function for
509 * all component (bottom) devices. The stacking function will
510 * attempt to combine the values and ensure proper alignment.
511 *
512 * Returns 0 if the top and bottom queue_limits are compatible. The
513 * top device's block sizes and alignment offsets may be adjusted to
514 * ensure alignment with the bottom device. If no compatible sizes
515 * and alignments exist, -1 is returned and the resulting top
516 * queue_limits will have the misaligned flag set to indicate that
517 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400518 */
519int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500520 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400521{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500522 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100523
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400524 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
525 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200526 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400527
528 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
529 b->seg_boundary_mask);
530
Martin K. Petersen8a783622010-02-26 00:20:39 -0500531 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200532 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
533 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400534
535 t->max_segment_size = min_not_zero(t->max_segment_size,
536 b->max_segment_size);
537
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500538 t->misaligned |= b->misaligned;
539
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500540 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100541
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100542 /* Bottom device has different alignment. Check that it is
543 * compatible with the current top alignment.
544 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100545 if (t->alignment_offset != alignment) {
546
547 top = max(t->physical_block_size, t->io_min)
548 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100549 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100550
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100551 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500552 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100553 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500554 ret = -1;
555 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100556 }
557
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400558 t->logical_block_size = max(t->logical_block_size,
559 b->logical_block_size);
560
561 t->physical_block_size = max(t->physical_block_size,
562 b->physical_block_size);
563
564 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100565 t->io_opt = lcm(t->io_opt, b->io_opt);
566
Martin K. Petersene692cb62010-12-01 19:41:49 +0100567 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100568 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400569
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100570 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571 if (t->physical_block_size & (t->logical_block_size - 1)) {
572 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400573 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500574 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100575 }
576
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100577 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100578 if (t->io_min & (t->physical_block_size - 1)) {
579 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400580 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500581 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400582 }
583
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100584 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100585 if (t->io_opt & (t->physical_block_size - 1)) {
586 t->io_opt = 0;
587 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500588 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100589 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400590
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100591 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100592 t->alignment_offset = lcm(t->alignment_offset, alignment)
593 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400594
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100595 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500596 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100597 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500598 ret = -1;
599 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100600
601 /* Discard alignment and granularity */
602 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500603 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100604
605 if (t->discard_granularity != 0 &&
606 t->discard_alignment != alignment) {
607 top = t->discard_granularity + t->discard_alignment;
608 bottom = b->discard_granularity + alignment;
609
610 /* Verify that top and bottom intervals line up */
611 if (max(top, bottom) & (min(top, bottom) - 1))
612 t->discard_misaligned = 1;
613 }
614
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100615 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
616 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100617 t->discard_granularity = max(t->discard_granularity,
618 b->discard_granularity);
619 t->discard_alignment = lcm(t->discard_alignment, alignment) &
620 (t->discard_granularity - 1);
621 }
622
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500623 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400624}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200625EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400626
627/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500628 * bdev_stack_limits - adjust queue limits for stacked drivers
629 * @t: the stacking driver limits (top device)
630 * @bdev: the component block_device (bottom)
631 * @start: first data sector within component device
632 *
633 * Description:
634 * Merges queue limits for a top device and a block_device. Returns
635 * 0 if alignment didn't change. Returns -1 if adding the bottom
636 * device caused misalignment.
637 */
638int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
639 sector_t start)
640{
641 struct request_queue *bq = bdev_get_queue(bdev);
642
643 start += get_start_sect(bdev);
644
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500645 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500646}
647EXPORT_SYMBOL(bdev_stack_limits);
648
649/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400650 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200651 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400652 * @bdev: the underlying block device (bottom)
653 * @offset: offset to beginning of data within component device
654 *
655 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500656 * Merges the limits for a top level gendisk and a bottom level
657 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400658 */
659void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
660 sector_t offset)
661{
662 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400663
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500664 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400665 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
666
667 disk_name(disk, 0, top);
668 bdevname(bdev, bottom);
669
670 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
671 top, bottom);
672 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400673}
674EXPORT_SYMBOL(disk_stack_limits);
675
676/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100677 * blk_queue_dma_pad - set pad mask
678 * @q: the request queue for the device
679 * @mask: pad mask
680 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200681 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100682 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200683 * Appending pad buffer to a request modifies the last entry of a
684 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100685 **/
686void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
687{
688 q->dma_pad_mask = mask;
689}
690EXPORT_SYMBOL(blk_queue_dma_pad);
691
692/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200693 * blk_queue_update_dma_pad - update pad mask
694 * @q: the request queue for the device
695 * @mask: pad mask
696 *
697 * Update dma pad mask.
698 *
699 * Appending pad buffer to a request modifies the last entry of a
700 * scatter list such that it includes the pad buffer.
701 **/
702void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
703{
704 if (mask > q->dma_pad_mask)
705 q->dma_pad_mask = mask;
706}
707EXPORT_SYMBOL(blk_queue_update_dma_pad);
708
709/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100710 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100711 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100712 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100713 * @buf: physically contiguous buffer
714 * @size: size of the buffer in bytes
715 *
716 * Some devices have excess DMA problems and can't simply discard (or
717 * zero fill) the unwanted piece of the transfer. They have to have a
718 * real area of memory to transfer it into. The use case for this is
719 * ATAPI devices in DMA mode. If the packet command causes a transfer
720 * bigger than the transfer size some HBAs will lock up if there
721 * aren't DMA elements to contain the excess transfer. What this API
722 * does is adjust the queue so that the buf is always appended
723 * silently to the scatterlist.
724 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500725 * Note: This routine adjusts max_hw_segments to make room for appending
726 * the drain buffer. If you call blk_queue_max_segments() after calling
727 * this routine, you must set the limit to one fewer than your device
728 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100729 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100730int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100731 dma_drain_needed_fn *dma_drain_needed,
732 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100733{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500734 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100735 return -EINVAL;
736 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500737 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100738 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100739 q->dma_drain_buffer = buf;
740 q->dma_drain_size = size;
741
742 return 0;
743}
Jens Axboe86db1e22008-01-29 14:53:40 +0100744EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
745
746/**
747 * blk_queue_segment_boundary - set boundary rules for segment merging
748 * @q: the request queue for the device
749 * @mask: the memory boundary mask
750 **/
751void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
752{
753 if (mask < PAGE_CACHE_SIZE - 1) {
754 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700755 printk(KERN_INFO "%s: set to minimum %lx\n",
756 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100757 }
758
Martin K. Petersen025146e2009-05-22 17:17:51 -0400759 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100760}
Jens Axboe86db1e22008-01-29 14:53:40 +0100761EXPORT_SYMBOL(blk_queue_segment_boundary);
762
763/**
764 * blk_queue_dma_alignment - set dma length and memory alignment
765 * @q: the request queue for the device
766 * @mask: alignment mask
767 *
768 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200769 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100770 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100771 *
772 **/
773void blk_queue_dma_alignment(struct request_queue *q, int mask)
774{
775 q->dma_alignment = mask;
776}
Jens Axboe86db1e22008-01-29 14:53:40 +0100777EXPORT_SYMBOL(blk_queue_dma_alignment);
778
779/**
780 * blk_queue_update_dma_alignment - update dma length and memory alignment
781 * @q: the request queue for the device
782 * @mask: alignment mask
783 *
784 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200785 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100786 * If the requested alignment is larger than the current alignment, then
787 * the current queue alignment is updated to the new value, otherwise it
788 * is left alone. The design of this is to allow multiple objects
789 * (driver, device, transport etc) to set their respective
790 * alignments without having them interfere.
791 *
792 **/
793void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
794{
795 BUG_ON(mask > PAGE_SIZE);
796
797 if (mask > q->dma_alignment)
798 q->dma_alignment = mask;
799}
Jens Axboe86db1e22008-01-29 14:53:40 +0100800EXPORT_SYMBOL(blk_queue_update_dma_alignment);
801
Tejun Heo4913efe2010-09-03 11:56:16 +0200802/**
803 * blk_queue_flush - configure queue's cache flush capability
804 * @q: the request queue for the device
805 * @flush: 0, REQ_FLUSH or REQ_FLUSH | REQ_FUA
806 *
807 * Tell block layer cache flush capability of @q. If it supports
808 * flushing, REQ_FLUSH should be set. If it supports bypassing
809 * write cache for individual writes, REQ_FUA should be set.
810 */
811void blk_queue_flush(struct request_queue *q, unsigned int flush)
812{
813 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
814
815 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
816 flush &= ~REQ_FUA;
817
818 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
819}
820EXPORT_SYMBOL_GPL(blk_queue_flush);
821
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600822void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
823{
824 q->flush_not_queueable = !queueable;
825}
826EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
827
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200828static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100829{
830 blk_max_low_pfn = max_low_pfn - 1;
831 blk_max_pfn = max_pfn - 1;
832 return 0;
833}
834subsys_initcall(blk_settings_init);