blob: d9a9db5f0a2bddfbdd6e5dbfe8a8c0c7a73b24b0 [file] [log] [blame]
Jens Axboe86db1e22008-01-29 14:53:40 +01001/*
2 * Functions related to setting various queue properties from drivers
3 */
4#include <linux/kernel.h>
5#include <linux/module.h>
6#include <linux/init.h>
7#include <linux/bio.h>
8#include <linux/blkdev.h>
9#include <linux/bootmem.h> /* for max_pfn/max_low_pfn */
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -040010#include <linux/gcd.h>
Randy Dunlapad5ebd22009-11-11 13:47:45 +010011#include <linux/jiffies.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090012#include <linux/gfp.h>
Jens Axboe86db1e22008-01-29 14:53:40 +010013
14#include "blk.h"
15
Jens Axboe6728cb02008-01-31 13:03:55 +010016unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010017EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010018
19unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010020
21/**
22 * blk_queue_prep_rq - set a prepare_request function for queue
23 * @q: queue
24 * @pfn: prepare_request function
25 *
26 * It's possible for a queue to register a prepare_request callback which
27 * is invoked before the request is handed to the request_fn. The goal of
28 * the function is to prepare a request for I/O, it can be used to build a
29 * cdb from the request data for instance.
30 *
31 */
32void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
33{
34 q->prep_rq_fn = pfn;
35}
Jens Axboe86db1e22008-01-29 14:53:40 +010036EXPORT_SYMBOL(blk_queue_prep_rq);
37
38/**
39 * blk_queue_merge_bvec - set a merge_bvec function for queue
40 * @q: queue
41 * @mbfn: merge_bvec_fn
42 *
43 * Usually queues have static limitations on the max sectors or segments that
44 * we can put in a request. Stacking drivers may have some settings that
45 * are dynamic, and thus we have to query the queue whether it is ok to
46 * add a new bio_vec to a bio at a given offset or not. If the block device
47 * has such limitations, it needs to register a merge_bvec_fn to control
48 * the size of bio's sent to it. Note that a block device *must* allow a
49 * single page to be added to an empty bio. The block device driver may want
50 * to use the bio_split() function to deal with these bio's. By default
51 * no merge_bvec_fn is defined for a queue, and only the fixed limits are
52 * honored.
53 */
54void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
55{
56 q->merge_bvec_fn = mbfn;
57}
Jens Axboe86db1e22008-01-29 14:53:40 +010058EXPORT_SYMBOL(blk_queue_merge_bvec);
59
60void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
61{
62 q->softirq_done_fn = fn;
63}
Jens Axboe86db1e22008-01-29 14:53:40 +010064EXPORT_SYMBOL(blk_queue_softirq_done);
65
Jens Axboe242f9dc2008-09-14 05:55:09 -070066void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
67{
68 q->rq_timeout = timeout;
69}
70EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
71
72void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
73{
74 q->rq_timed_out_fn = fn;
75}
76EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
77
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020078void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
79{
80 q->lld_busy_fn = fn;
81}
82EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
83
Jens Axboe86db1e22008-01-29 14:53:40 +010084/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020085 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020086 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020087 *
88 * Description:
89 * Returns a queue_limit struct to its default state. Can be used by
90 * stacking drivers like DM that stage table swaps and reuse an
91 * existing device queue.
92 */
93void blk_set_default_limits(struct queue_limits *lim)
94{
Martin K. Petersen8a783622010-02-26 00:20:39 -050095 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersene475bba2009-06-16 08:23:52 +020096 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050097 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersen5dee2472009-09-21 21:46:05 +020098 lim->max_sectors = BLK_DEF_MAX_SECTORS;
99 lim->max_hw_sectors = INT_MAX;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100100 lim->max_discard_sectors = 0;
101 lim->discard_granularity = 0;
102 lim->discard_alignment = 0;
103 lim->discard_misaligned = 0;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100104 lim->discard_zeroes_data = -1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200105 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200106 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200107 lim->alignment_offset = 0;
108 lim->io_opt = 0;
109 lim->misaligned = 0;
110 lim->no_cluster = 0;
111}
112EXPORT_SYMBOL(blk_set_default_limits);
113
114/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100115 * blk_queue_make_request - define an alternate make_request function for a device
116 * @q: the request queue for the device to be affected
117 * @mfn: the alternate make_request function
118 *
119 * Description:
120 * The normal way for &struct bios to be passed to a device
121 * driver is for them to be collected into requests on a request
122 * queue, and then to allow the device driver to select requests
123 * off that queue when it is ready. This works well for many block
124 * devices. However some block devices (typically virtual devices
125 * such as md or lvm) do not benefit from the processing on the
126 * request queue, and are served best by having the requests passed
127 * directly to them. This can be achieved by providing a function
128 * to blk_queue_make_request().
129 *
130 * Caveat:
131 * The driver that does this *must* be able to deal appropriately
132 * with buffers in "highmemory". This can be accomplished by either calling
133 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
134 * blk_queue_bounce() to create a buffer in normal memory.
135 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100136void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100137{
138 /*
139 * set defaults
140 */
141 q->nr_requests = BLKDEV_MAX_RQ;
Milan Broz0e435ac2008-12-03 12:55:08 +0100142
Jens Axboe86db1e22008-01-29 14:53:40 +0100143 q->make_request_fn = mfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100144 blk_queue_dma_alignment(q, 511);
145 blk_queue_congestion_threshold(q);
146 q->nr_batching = BLK_BATCH_REQ;
147
148 q->unplug_thresh = 4; /* hmm */
Randy Dunlapad5ebd22009-11-11 13:47:45 +0100149 q->unplug_delay = msecs_to_jiffies(3); /* 3 milliseconds */
Jens Axboe86db1e22008-01-29 14:53:40 +0100150 if (q->unplug_delay == 0)
151 q->unplug_delay = 1;
152
Jens Axboe86db1e22008-01-29 14:53:40 +0100153 q->unplug_timer.function = blk_unplug_timeout;
154 q->unplug_timer.data = (unsigned long)q;
155
Martin K. Petersene475bba2009-06-16 08:23:52 +0200156 blk_set_default_limits(&q->limits);
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500157 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200158
Jens Axboe86db1e22008-01-29 14:53:40 +0100159 /*
Jens Axboea4e7d462009-07-28 09:07:29 +0200160 * If the caller didn't supply a lock, fall back to our embedded
161 * per-queue locks
162 */
163 if (!q->queue_lock)
164 q->queue_lock = &q->__queue_lock;
165
166 /*
Jens Axboe86db1e22008-01-29 14:53:40 +0100167 * by default assume old behaviour and bounce for any highmem page
168 */
169 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
170}
Jens Axboe86db1e22008-01-29 14:53:40 +0100171EXPORT_SYMBOL(blk_queue_make_request);
172
173/**
174 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900175 * @q: the request queue for the device
176 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100177 *
178 * Description:
179 * Different hardware can have different requirements as to what pages
180 * it can do I/O directly to. A low level driver can call
181 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900182 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100183 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900184void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100185{
Tejun Heocd0aca22009-04-15 22:10:25 +0900186 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100187 int dma = 0;
188
189 q->bounce_gfp = GFP_NOIO;
190#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900191 /*
192 * Assume anything <= 4GB can be handled by IOMMU. Actually
193 * some IOMMUs can handle everything, but I don't know of a
194 * way to test this here.
195 */
196 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100197 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400198 q->limits.bounce_pfn = max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100199#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100200 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100201 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400202 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100203#endif
204 if (dma) {
205 init_emergency_isa_pool();
206 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400207 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100208 }
209}
Jens Axboe86db1e22008-01-29 14:53:40 +0100210EXPORT_SYMBOL(blk_queue_bounce_limit);
211
212/**
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500213 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100214 * @q: the request queue for the device
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500215 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100216 *
217 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500218 * Enables a low level driver to set a hard upper limit,
219 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
220 * the device driver based upon the combined capabilities of I/O
221 * controller and storage device.
222 *
223 * max_sectors is a soft limit imposed by the block layer for
224 * filesystem type requests. This value can be overridden on a
225 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
226 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100227 **/
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500228void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100229{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500230 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
231 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700232 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500233 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100234 }
235
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 q->limits.max_hw_sectors = max_hw_sectors;
237 q->limits.max_sectors = min_t(unsigned int, max_hw_sectors,
238 BLK_DEF_MAX_SECTORS);
Jens Axboe86db1e22008-01-29 14:53:40 +0100239}
Martin K. Petersen086fa5f2010-02-26 00:20:38 -0500240EXPORT_SYMBOL(blk_queue_max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100241
242/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200243 * blk_queue_max_discard_sectors - set max sectors for a single discard
244 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200245 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200246 **/
247void blk_queue_max_discard_sectors(struct request_queue *q,
248 unsigned int max_discard_sectors)
249{
250 q->limits.max_discard_sectors = max_discard_sectors;
251}
252EXPORT_SYMBOL(blk_queue_max_discard_sectors);
253
254/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500255 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100256 * @q: the request queue for the device
257 * @max_segments: max number of segments
258 *
259 * Description:
260 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500261 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100262 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500263void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100264{
265 if (!max_segments) {
266 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700267 printk(KERN_INFO "%s: set to minimum %d\n",
268 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100269 }
270
Martin K. Petersen8a783622010-02-26 00:20:39 -0500271 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100272}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500273EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100274
275/**
276 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
277 * @q: the request queue for the device
278 * @max_size: max size of segment in bytes
279 *
280 * Description:
281 * Enables a low level driver to set an upper limit on the size of a
282 * coalesced segment
283 **/
284void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
285{
286 if (max_size < PAGE_CACHE_SIZE) {
287 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700288 printk(KERN_INFO "%s: set to minimum %d\n",
289 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100290 }
291
Martin K. Petersen025146e2009-05-22 17:17:51 -0400292 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100293}
Jens Axboe86db1e22008-01-29 14:53:40 +0100294EXPORT_SYMBOL(blk_queue_max_segment_size);
295
296/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400297 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100298 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400299 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100300 *
301 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400302 * This should be set to the lowest possible block size that the
303 * storage device can address. The default of 512 covers most
304 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100305 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400306void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100307{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400308 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400309
310 if (q->limits.physical_block_size < size)
311 q->limits.physical_block_size = size;
312
313 if (q->limits.io_min < q->limits.physical_block_size)
314 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100315}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400316EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100317
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400318/**
319 * blk_queue_physical_block_size - set physical block size for the queue
320 * @q: the request queue for the device
321 * @size: the physical block size, in bytes
322 *
323 * Description:
324 * This should be set to the lowest possible sector size that the
325 * hardware can operate on without reverting to read-modify-write
326 * operations.
327 */
328void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
329{
330 q->limits.physical_block_size = size;
331
332 if (q->limits.physical_block_size < q->limits.logical_block_size)
333 q->limits.physical_block_size = q->limits.logical_block_size;
334
335 if (q->limits.io_min < q->limits.physical_block_size)
336 q->limits.io_min = q->limits.physical_block_size;
337}
338EXPORT_SYMBOL(blk_queue_physical_block_size);
339
340/**
341 * blk_queue_alignment_offset - set physical block alignment offset
342 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700343 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400344 *
345 * Description:
346 * Some devices are naturally misaligned to compensate for things like
347 * the legacy DOS partition table 63-sector offset. Low-level drivers
348 * should call this function for devices whose first sector is not
349 * naturally aligned.
350 */
351void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
352{
353 q->limits.alignment_offset =
354 offset & (q->limits.physical_block_size - 1);
355 q->limits.misaligned = 0;
356}
357EXPORT_SYMBOL(blk_queue_alignment_offset);
358
359/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400360 * blk_limits_io_min - set minimum request size for a device
361 * @limits: the queue limits
362 * @min: smallest I/O size in bytes
363 *
364 * Description:
365 * Some devices have an internal block size bigger than the reported
366 * hardware sector size. This function can be used to signal the
367 * smallest I/O the device can perform without incurring a performance
368 * penalty.
369 */
370void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
371{
372 limits->io_min = min;
373
374 if (limits->io_min < limits->logical_block_size)
375 limits->io_min = limits->logical_block_size;
376
377 if (limits->io_min < limits->physical_block_size)
378 limits->io_min = limits->physical_block_size;
379}
380EXPORT_SYMBOL(blk_limits_io_min);
381
382/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400383 * blk_queue_io_min - set minimum request size for the queue
384 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700385 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400386 *
387 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400388 * Storage devices may report a granularity or preferred minimum I/O
389 * size which is the smallest request the device can perform without
390 * incurring a performance penalty. For disk drives this is often the
391 * physical block size. For RAID arrays it is often the stripe chunk
392 * size. A properly aligned multiple of minimum_io_size is the
393 * preferred request size for workloads where a high number of I/O
394 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400395 */
396void blk_queue_io_min(struct request_queue *q, unsigned int min)
397{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400398 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400399}
400EXPORT_SYMBOL(blk_queue_io_min);
401
402/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200403 * blk_limits_io_opt - set optimal request size for a device
404 * @limits: the queue limits
405 * @opt: smallest I/O size in bytes
406 *
407 * Description:
408 * Storage devices may report an optimal I/O size, which is the
409 * device's preferred unit for sustained I/O. This is rarely reported
410 * for disk drives. For RAID arrays it is usually the stripe width or
411 * the internal track size. A properly aligned multiple of
412 * optimal_io_size is the preferred request size for workloads where
413 * sustained throughput is desired.
414 */
415void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
416{
417 limits->io_opt = opt;
418}
419EXPORT_SYMBOL(blk_limits_io_opt);
420
421/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400422 * blk_queue_io_opt - set optimal request size for the queue
423 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700424 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400425 *
426 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400427 * Storage devices may report an optimal I/O size, which is the
428 * device's preferred unit for sustained I/O. This is rarely reported
429 * for disk drives. For RAID arrays it is usually the stripe width or
430 * the internal track size. A properly aligned multiple of
431 * optimal_io_size is the preferred request size for workloads where
432 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400433 */
434void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
435{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200436 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400437}
438EXPORT_SYMBOL(blk_queue_io_opt);
439
Jens Axboe86db1e22008-01-29 14:53:40 +0100440/*
441 * Returns the minimum that is _not_ zero, unless both are zero.
442 */
443#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
444
445/**
446 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
447 * @t: the stacking driver (top)
448 * @b: the underlying device (bottom)
449 **/
450void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
451{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400452 blk_stack_limits(&t->limits, &b->limits, 0);
Martin K. Petersen025146e2009-05-22 17:17:51 -0400453
Neil Browne7e72bf2008-05-14 16:05:54 -0700454 if (!t->queue_lock)
455 WARN_ON_ONCE(1);
456 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
457 unsigned long flags;
458 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200459 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700460 spin_unlock_irqrestore(t->queue_lock, flags);
461 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100462}
Jens Axboe86db1e22008-01-29 14:53:40 +0100463EXPORT_SYMBOL(blk_queue_stack_limits);
464
Martin K. Petersen86b37282009-11-10 11:50:21 +0100465static unsigned int lcm(unsigned int a, unsigned int b)
466{
467 if (a && b)
468 return (a * b) / gcd(a, b);
469 else if (b)
470 return b;
471
472 return a;
473}
474
Jens Axboe86db1e22008-01-29 14:53:40 +0100475/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400476 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100477 * @t: the stacking driver limits (top device)
478 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500479 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400480 *
481 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100482 * This function is used by stacking drivers like MD and DM to ensure
483 * that all component devices have compatible block sizes and
484 * alignments. The stacking driver must provide a queue_limits
485 * struct (top) and then iteratively call the stacking function for
486 * all component (bottom) devices. The stacking function will
487 * attempt to combine the values and ensure proper alignment.
488 *
489 * Returns 0 if the top and bottom queue_limits are compatible. The
490 * top device's block sizes and alignment offsets may be adjusted to
491 * ensure alignment with the bottom device. If no compatible sizes
492 * and alignments exist, -1 is returned and the resulting top
493 * queue_limits will have the misaligned flag set to indicate that
494 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400495 */
496int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500497 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400498{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500499 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100500
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400501 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
502 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200503 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400504
505 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
506 b->seg_boundary_mask);
507
Martin K. Petersen8a783622010-02-26 00:20:39 -0500508 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400509
510 t->max_segment_size = min_not_zero(t->max_segment_size,
511 b->max_segment_size);
512
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500513 t->misaligned |= b->misaligned;
514
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500515 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100516
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100517 /* Bottom device has different alignment. Check that it is
518 * compatible with the current top alignment.
519 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100520 if (t->alignment_offset != alignment) {
521
522 top = max(t->physical_block_size, t->io_min)
523 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100524 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100525
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100526 /* Verify that top and bottom intervals line up */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500527 if (max(top, bottom) & (min(top, bottom) - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100528 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500529 ret = -1;
530 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100531 }
532
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400533 t->logical_block_size = max(t->logical_block_size,
534 b->logical_block_size);
535
536 t->physical_block_size = max(t->physical_block_size,
537 b->physical_block_size);
538
539 t->io_min = max(t->io_min, b->io_min);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100540 t->io_opt = lcm(t->io_opt, b->io_opt);
541
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400542 t->no_cluster |= b->no_cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100543 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400544
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100545 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100546 if (t->physical_block_size & (t->logical_block_size - 1)) {
547 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400548 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500549 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100550 }
551
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100552 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100553 if (t->io_min & (t->physical_block_size - 1)) {
554 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400555 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500556 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400557 }
558
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100559 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100560 if (t->io_opt & (t->physical_block_size - 1)) {
561 t->io_opt = 0;
562 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500563 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100564 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400565
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100566 /* Find lowest common alignment_offset */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100567 t->alignment_offset = lcm(t->alignment_offset, alignment)
568 & (max(t->physical_block_size, t->io_min) - 1);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400569
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100570 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500571 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100572 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500573 ret = -1;
574 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100575
576 /* Discard alignment and granularity */
577 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500578 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100579
580 if (t->discard_granularity != 0 &&
581 t->discard_alignment != alignment) {
582 top = t->discard_granularity + t->discard_alignment;
583 bottom = b->discard_granularity + alignment;
584
585 /* Verify that top and bottom intervals line up */
586 if (max(top, bottom) & (min(top, bottom) - 1))
587 t->discard_misaligned = 1;
588 }
589
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100590 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
591 b->max_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100592 t->discard_granularity = max(t->discard_granularity,
593 b->discard_granularity);
594 t->discard_alignment = lcm(t->discard_alignment, alignment) &
595 (t->discard_granularity - 1);
596 }
597
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500598 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400599}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200600EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400601
602/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500603 * bdev_stack_limits - adjust queue limits for stacked drivers
604 * @t: the stacking driver limits (top device)
605 * @bdev: the component block_device (bottom)
606 * @start: first data sector within component device
607 *
608 * Description:
609 * Merges queue limits for a top device and a block_device. Returns
610 * 0 if alignment didn't change. Returns -1 if adding the bottom
611 * device caused misalignment.
612 */
613int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
614 sector_t start)
615{
616 struct request_queue *bq = bdev_get_queue(bdev);
617
618 start += get_start_sect(bdev);
619
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500620 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500621}
622EXPORT_SYMBOL(bdev_stack_limits);
623
624/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400625 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200626 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400627 * @bdev: the underlying block device (bottom)
628 * @offset: offset to beginning of data within component device
629 *
630 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500631 * Merges the limits for a top level gendisk and a bottom level
632 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400633 */
634void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
635 sector_t offset)
636{
637 struct request_queue *t = disk->queue;
638 struct request_queue *b = bdev_get_queue(bdev);
639
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500640 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400641 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
642
643 disk_name(disk, 0, top);
644 bdevname(bdev, bottom);
645
646 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
647 top, bottom);
648 }
649
650 if (!t->queue_lock)
651 WARN_ON_ONCE(1);
652 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
653 unsigned long flags;
654
655 spin_lock_irqsave(t->queue_lock, flags);
656 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
657 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
658 spin_unlock_irqrestore(t->queue_lock, flags);
659 }
660}
661EXPORT_SYMBOL(disk_stack_limits);
662
663/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100664 * blk_queue_dma_pad - set pad mask
665 * @q: the request queue for the device
666 * @mask: pad mask
667 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200668 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100669 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200670 * Appending pad buffer to a request modifies the last entry of a
671 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100672 **/
673void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
674{
675 q->dma_pad_mask = mask;
676}
677EXPORT_SYMBOL(blk_queue_dma_pad);
678
679/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200680 * blk_queue_update_dma_pad - update pad mask
681 * @q: the request queue for the device
682 * @mask: pad mask
683 *
684 * Update dma pad mask.
685 *
686 * Appending pad buffer to a request modifies the last entry of a
687 * scatter list such that it includes the pad buffer.
688 **/
689void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
690{
691 if (mask > q->dma_pad_mask)
692 q->dma_pad_mask = mask;
693}
694EXPORT_SYMBOL(blk_queue_update_dma_pad);
695
696/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100697 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100698 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100699 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100700 * @buf: physically contiguous buffer
701 * @size: size of the buffer in bytes
702 *
703 * Some devices have excess DMA problems and can't simply discard (or
704 * zero fill) the unwanted piece of the transfer. They have to have a
705 * real area of memory to transfer it into. The use case for this is
706 * ATAPI devices in DMA mode. If the packet command causes a transfer
707 * bigger than the transfer size some HBAs will lock up if there
708 * aren't DMA elements to contain the excess transfer. What this API
709 * does is adjust the queue so that the buf is always appended
710 * silently to the scatterlist.
711 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500712 * Note: This routine adjusts max_hw_segments to make room for appending
713 * the drain buffer. If you call blk_queue_max_segments() after calling
714 * this routine, you must set the limit to one fewer than your device
715 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100716 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100717int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100718 dma_drain_needed_fn *dma_drain_needed,
719 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100720{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500721 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100722 return -EINVAL;
723 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500724 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100725 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100726 q->dma_drain_buffer = buf;
727 q->dma_drain_size = size;
728
729 return 0;
730}
Jens Axboe86db1e22008-01-29 14:53:40 +0100731EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
732
733/**
734 * blk_queue_segment_boundary - set boundary rules for segment merging
735 * @q: the request queue for the device
736 * @mask: the memory boundary mask
737 **/
738void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
739{
740 if (mask < PAGE_CACHE_SIZE - 1) {
741 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700742 printk(KERN_INFO "%s: set to minimum %lx\n",
743 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100744 }
745
Martin K. Petersen025146e2009-05-22 17:17:51 -0400746 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100747}
Jens Axboe86db1e22008-01-29 14:53:40 +0100748EXPORT_SYMBOL(blk_queue_segment_boundary);
749
750/**
751 * blk_queue_dma_alignment - set dma length and memory alignment
752 * @q: the request queue for the device
753 * @mask: alignment mask
754 *
755 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200756 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100757 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100758 *
759 **/
760void blk_queue_dma_alignment(struct request_queue *q, int mask)
761{
762 q->dma_alignment = mask;
763}
Jens Axboe86db1e22008-01-29 14:53:40 +0100764EXPORT_SYMBOL(blk_queue_dma_alignment);
765
766/**
767 * blk_queue_update_dma_alignment - update dma length and memory alignment
768 * @q: the request queue for the device
769 * @mask: alignment mask
770 *
771 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200772 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100773 * If the requested alignment is larger than the current alignment, then
774 * the current queue alignment is updated to the new value, otherwise it
775 * is left alone. The design of this is to allow multiple objects
776 * (driver, device, transport etc) to set their respective
777 * alignments without having them interfere.
778 *
779 **/
780void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
781{
782 BUG_ON(mask > PAGE_SIZE);
783
784 if (mask > q->dma_alignment)
785 q->dma_alignment = mask;
786}
Jens Axboe86db1e22008-01-29 14:53:40 +0100787EXPORT_SYMBOL(blk_queue_update_dma_alignment);
788
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200789static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100790{
791 blk_max_low_pfn = max_low_pfn - 1;
792 blk_max_pfn = max_pfn - 1;
793 return 0;
794}
795subsys_initcall(blk_settings_init);