blob: d27b4e272356212530d6d5917fbb59ea2c914a25 [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
Jens Axboe86db1e22008-01-29 14:53:40 +010056void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
57{
58 q->softirq_done_fn = fn;
59}
Jens Axboe86db1e22008-01-29 14:53:40 +010060EXPORT_SYMBOL(blk_queue_softirq_done);
61
Jens Axboe242f9dc2008-09-14 05:55:09 -070062void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
63{
64 q->rq_timeout = timeout;
65}
66EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
67
68void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
69{
70 q->rq_timed_out_fn = fn;
71}
72EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
73
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020074void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
75{
76 q->lld_busy_fn = fn;
77}
78EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
79
Jens Axboe86db1e22008-01-29 14:53:40 +010080/**
Martin K. Petersene475bba2009-06-16 08:23:52 +020081 * blk_set_default_limits - reset limits to default values
Randy Dunlapf740f5ca2009-06-19 09:18:32 +020082 * @lim: the queue_limits structure to reset
Martin K. Petersene475bba2009-06-16 08:23:52 +020083 *
84 * Description:
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010085 * Returns a queue_limit struct to its default state.
Martin K. Petersene475bba2009-06-16 08:23:52 +020086 */
87void blk_set_default_limits(struct queue_limits *lim)
88{
Martin K. Petersen8a783622010-02-26 00:20:39 -050089 lim->max_segments = BLK_MAX_SEGMENTS;
Martin K. Petersen13f05c82010-09-10 20:50:10 +020090 lim->max_integrity_segments = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +020091 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
Martin K. Peterseneb28d312010-02-26 00:20:37 -050092 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +010093 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
Jens Axboe762380a2014-06-05 13:38:39 -060094 lim->chunk_sectors = 0;
Martin K. Petersen4363ac72012-09-18 12:19:27 -040095 lim->max_write_same_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010096 lim->max_discard_sectors = 0;
Jens Axboe0034af02015-07-16 09:14:26 -060097 lim->max_hw_discard_sectors = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +010098 lim->discard_granularity = 0;
99 lim->discard_alignment = 0;
100 lim->discard_misaligned = 0;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100101 lim->discard_zeroes_data = 0;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200102 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
Martin K. Petersen3a02c8e2009-06-18 09:56:03 +0200103 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
Martin K. Petersene475bba2009-06-16 08:23:52 +0200104 lim->alignment_offset = 0;
105 lim->io_opt = 0;
106 lim->misaligned = 0;
Martin K. Petersene692cb62010-12-01 19:41:49 +0100107 lim->cluster = 1;
Martin K. Petersene475bba2009-06-16 08:23:52 +0200108}
109EXPORT_SYMBOL(blk_set_default_limits);
110
111/**
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100112 * blk_set_stacking_limits - set default limits for stacking devices
113 * @lim: the queue_limits structure to reset
114 *
115 * Description:
116 * Returns a queue_limit struct to its default state. Should be used
117 * by stacking drivers like DM that have no internal limits.
118 */
119void blk_set_stacking_limits(struct queue_limits *lim)
120{
121 blk_set_default_limits(lim);
122
123 /* Inherit limits from component devices */
124 lim->discard_zeroes_data = 1;
125 lim->max_segments = USHRT_MAX;
126 lim->max_hw_sectors = UINT_MAX;
Mike Snitzerd82ae522013-10-18 09:44:49 -0600127 lim->max_segment_size = UINT_MAX;
Mike Snitzerfe86cdc2012-08-01 10:44:28 +0200128 lim->max_sectors = UINT_MAX;
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400129 lim->max_write_same_sectors = UINT_MAX;
Martin K. Petersenb1bd0552012-01-11 16:27:11 +0100130}
131EXPORT_SYMBOL(blk_set_stacking_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
Martin K. Petersene475bba2009-06-16 08:23:52 +0200167 blk_set_default_limits(&q->limits);
168
Jens Axboe86db1e22008-01-29 14:53:40 +0100169 /*
170 * by default assume old behaviour and bounce for any highmem page
171 */
172 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
173}
Jens Axboe86db1e22008-01-29 14:53:40 +0100174EXPORT_SYMBOL(blk_queue_make_request);
175
176/**
177 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900178 * @q: the request queue for the device
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100179 * @max_addr: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100180 *
181 * Description:
182 * Different hardware can have different requirements as to what pages
183 * it can do I/O directly to. A low level driver can call
184 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100185 * buffers for doing I/O to pages residing above @max_addr.
Jens Axboe86db1e22008-01-29 14:53:40 +0100186 **/
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100187void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
Jens Axboe86db1e22008-01-29 14:53:40 +0100188{
Santosh Shilimkar9f7e45d2013-07-29 14:17:54 +0100189 unsigned long b_pfn = max_addr >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100190 int dma = 0;
191
192 q->bounce_gfp = GFP_NOIO;
193#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900194 /*
195 * Assume anything <= 4GB can be handled by IOMMU. Actually
196 * some IOMMUs can handle everything, but I don't know of a
197 * way to test this here.
198 */
199 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100200 dma = 1;
Malahal Naineniefb012b32010-10-01 14:45:27 +0200201 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
Jens Axboe86db1e22008-01-29 14:53:40 +0100202#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100203 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100204 dma = 1;
Malahal Nainenic49825f2010-09-24 20:25:49 +0200205 q->limits.bounce_pfn = b_pfn;
Jens Axboe260a67a2010-10-01 14:42:43 +0200206#endif
Jens Axboe86db1e22008-01-29 14:53:40 +0100207 if (dma) {
208 init_emergency_isa_pool();
209 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Jens Axboe260a67a2010-10-01 14:42:43 +0200210 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100211 }
212}
Jens Axboe86db1e22008-01-29 14:53:40 +0100213EXPORT_SYMBOL(blk_queue_bounce_limit);
214
215/**
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100216 * blk_limits_max_hw_sectors - set hard and soft limit of max sectors for request
217 * @limits: the queue limits
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500218 * @max_hw_sectors: max hardware sectors in the usual 512b unit
Jens Axboe86db1e22008-01-29 14:53:40 +0100219 *
220 * Description:
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500221 * Enables a low level driver to set a hard upper limit,
222 * max_hw_sectors, on the size of requests. max_hw_sectors is set by
223 * the device driver based upon the combined capabilities of I/O
224 * controller and storage device.
225 *
226 * max_sectors is a soft limit imposed by the block layer for
227 * filesystem type requests. This value can be overridden on a
228 * per-device basis in /sys/block/<device>/queue/max_sectors_kb.
229 * The soft limit can not exceed max_hw_sectors.
Jens Axboe86db1e22008-01-29 14:53:40 +0100230 **/
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100231void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
Jens Axboe86db1e22008-01-29 14:53:40 +0100232{
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500233 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
234 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700235 printk(KERN_INFO "%s: set to minimum %d\n",
Martin K. Petersen2800aac2010-02-26 00:20:35 -0500236 __func__, max_hw_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100237 }
238
Jeff Moyer30e2bc02015-08-13 14:57:56 -0400239 limits->max_hw_sectors = max_hw_sectors;
240 limits->max_sectors = min_t(unsigned int, max_hw_sectors,
241 BLK_DEF_MAX_SECTORS);
Mike Snitzer72d4cd92010-12-17 08:34:20 +0100242}
243EXPORT_SYMBOL(blk_limits_max_hw_sectors);
244
245/**
246 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
247 * @q: the request queue for the device
248 * @max_hw_sectors: max hardware sectors in the usual 512b unit
249 *
250 * Description:
251 * See description for blk_limits_max_hw_sectors().
252 **/
253void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
254{
255 blk_limits_max_hw_sectors(&q->limits, max_hw_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/**
Jens Axboe762380a2014-06-05 13:38:39 -0600260 * blk_queue_chunk_sectors - set size of the chunk for this queue
261 * @q: the request queue for the device
262 * @chunk_sectors: chunk sectors in the usual 512b unit
263 *
264 * Description:
265 * If a driver doesn't want IOs to cross a given chunk size, it can set
266 * this limit and prevent merging across chunks. Note that the chunk size
Jens Axboe58a49152014-06-10 12:53:56 -0600267 * must currently be a power-of-2 in sectors. Also note that the block
268 * layer must accept a page worth of data at any offset. So if the
269 * crossing of chunks is a hard limitation in the driver, it must still be
270 * prepared to split single page bios.
Jens Axboe762380a2014-06-05 13:38:39 -0600271 **/
272void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
273{
274 BUG_ON(!is_power_of_2(chunk_sectors));
275 q->limits.chunk_sectors = chunk_sectors;
276}
277EXPORT_SYMBOL(blk_queue_chunk_sectors);
278
279/**
Christoph Hellwig67efc922009-09-30 13:54:20 +0200280 * blk_queue_max_discard_sectors - set max sectors for a single discard
281 * @q: the request queue for the device
Randy Dunlapc7ebf062009-10-12 08:20:47 +0200282 * @max_discard_sectors: maximum number of sectors to discard
Christoph Hellwig67efc922009-09-30 13:54:20 +0200283 **/
284void blk_queue_max_discard_sectors(struct request_queue *q,
285 unsigned int max_discard_sectors)
286{
Jens Axboe0034af02015-07-16 09:14:26 -0600287 q->limits.max_hw_discard_sectors = max_discard_sectors;
Christoph Hellwig67efc922009-09-30 13:54:20 +0200288 q->limits.max_discard_sectors = max_discard_sectors;
289}
290EXPORT_SYMBOL(blk_queue_max_discard_sectors);
291
292/**
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400293 * blk_queue_max_write_same_sectors - set max sectors for a single write same
294 * @q: the request queue for the device
295 * @max_write_same_sectors: maximum number of sectors to write per command
296 **/
297void blk_queue_max_write_same_sectors(struct request_queue *q,
298 unsigned int max_write_same_sectors)
299{
300 q->limits.max_write_same_sectors = max_write_same_sectors;
301}
302EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
303
304/**
Martin K. Petersen8a783622010-02-26 00:20:39 -0500305 * blk_queue_max_segments - set max hw segments for a request for this queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100306 * @q: the request queue for the device
307 * @max_segments: max number of segments
308 *
309 * Description:
310 * Enables a low level driver to set an upper limit on the number of
Martin K. Petersen8a783622010-02-26 00:20:39 -0500311 * hw data segments in a request.
Jens Axboe86db1e22008-01-29 14:53:40 +0100312 **/
Martin K. Petersen8a783622010-02-26 00:20:39 -0500313void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
Jens Axboe86db1e22008-01-29 14:53:40 +0100314{
315 if (!max_segments) {
316 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700317 printk(KERN_INFO "%s: set to minimum %d\n",
318 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100319 }
320
Martin K. Petersen8a783622010-02-26 00:20:39 -0500321 q->limits.max_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100322}
Martin K. Petersen8a783622010-02-26 00:20:39 -0500323EXPORT_SYMBOL(blk_queue_max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100324
325/**
326 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
327 * @q: the request queue for the device
328 * @max_size: max size of segment in bytes
329 *
330 * Description:
331 * Enables a low level driver to set an upper limit on the size of a
332 * coalesced segment
333 **/
334void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
335{
336 if (max_size < PAGE_CACHE_SIZE) {
337 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700338 printk(KERN_INFO "%s: set to minimum %d\n",
339 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100340 }
341
Martin K. Petersen025146e2009-05-22 17:17:51 -0400342 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100343}
Jens Axboe86db1e22008-01-29 14:53:40 +0100344EXPORT_SYMBOL(blk_queue_max_segment_size);
345
346/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400347 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100348 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400349 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100350 *
351 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400352 * This should be set to the lowest possible block size that the
353 * storage device can address. The default of 512 covers most
354 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100355 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400356void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100357{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400358 q->limits.logical_block_size = size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400359
360 if (q->limits.physical_block_size < size)
361 q->limits.physical_block_size = size;
362
363 if (q->limits.io_min < q->limits.physical_block_size)
364 q->limits.io_min = q->limits.physical_block_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100365}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400366EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100367
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400368/**
369 * blk_queue_physical_block_size - set physical block size for the queue
370 * @q: the request queue for the device
371 * @size: the physical block size, in bytes
372 *
373 * Description:
374 * This should be set to the lowest possible sector size that the
375 * hardware can operate on without reverting to read-modify-write
376 * operations.
377 */
Martin K. Petersen892b6f92010-10-13 21:18:03 +0200378void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400379{
380 q->limits.physical_block_size = size;
381
382 if (q->limits.physical_block_size < q->limits.logical_block_size)
383 q->limits.physical_block_size = q->limits.logical_block_size;
384
385 if (q->limits.io_min < q->limits.physical_block_size)
386 q->limits.io_min = q->limits.physical_block_size;
387}
388EXPORT_SYMBOL(blk_queue_physical_block_size);
389
390/**
391 * blk_queue_alignment_offset - set physical block alignment offset
392 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700393 * @offset: alignment offset in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400394 *
395 * Description:
396 * Some devices are naturally misaligned to compensate for things like
397 * the legacy DOS partition table 63-sector offset. Low-level drivers
398 * should call this function for devices whose first sector is not
399 * naturally aligned.
400 */
401void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
402{
403 q->limits.alignment_offset =
404 offset & (q->limits.physical_block_size - 1);
405 q->limits.misaligned = 0;
406}
407EXPORT_SYMBOL(blk_queue_alignment_offset);
408
409/**
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400410 * blk_limits_io_min - set minimum request size for a device
411 * @limits: the queue limits
412 * @min: smallest I/O size in bytes
413 *
414 * Description:
415 * Some devices have an internal block size bigger than the reported
416 * hardware sector size. This function can be used to signal the
417 * smallest I/O the device can perform without incurring a performance
418 * penalty.
419 */
420void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
421{
422 limits->io_min = min;
423
424 if (limits->io_min < limits->logical_block_size)
425 limits->io_min = limits->logical_block_size;
426
427 if (limits->io_min < limits->physical_block_size)
428 limits->io_min = limits->physical_block_size;
429}
430EXPORT_SYMBOL(blk_limits_io_min);
431
432/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400433 * blk_queue_io_min - set minimum request size for the queue
434 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700435 * @min: smallest I/O size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400436 *
437 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400438 * Storage devices may report a granularity or preferred minimum I/O
439 * size which is the smallest request the device can perform without
440 * incurring a performance penalty. For disk drives this is often the
441 * physical block size. For RAID arrays it is often the stripe chunk
442 * size. A properly aligned multiple of minimum_io_size is the
443 * preferred request size for workloads where a high number of I/O
444 * operations is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400445 */
446void blk_queue_io_min(struct request_queue *q, unsigned int min)
447{
Martin K. Petersen7c958e32009-07-31 11:49:11 -0400448 blk_limits_io_min(&q->limits, min);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400449}
450EXPORT_SYMBOL(blk_queue_io_min);
451
452/**
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200453 * blk_limits_io_opt - set optimal request size for a device
454 * @limits: the queue limits
455 * @opt: smallest I/O size in bytes
456 *
457 * Description:
458 * Storage devices may report an optimal I/O size, which is the
459 * device's preferred unit for sustained I/O. This is rarely reported
460 * for disk drives. For RAID arrays it is usually the stripe width or
461 * the internal track size. A properly aligned multiple of
462 * optimal_io_size is the preferred request size for workloads where
463 * sustained throughput is desired.
464 */
465void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
466{
467 limits->io_opt = opt;
468}
469EXPORT_SYMBOL(blk_limits_io_opt);
470
471/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400472 * blk_queue_io_opt - set optimal request size for the queue
473 * @q: the request queue for the device
Randy Dunlap8ebf9752009-06-11 20:00:41 -0700474 * @opt: optimal request size in bytes
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400475 *
476 * Description:
Martin K. Petersen7e5f5fb2009-07-31 11:49:13 -0400477 * Storage devices may report an optimal I/O size, which is the
478 * device's preferred unit for sustained I/O. This is rarely reported
479 * for disk drives. For RAID arrays it is usually the stripe width or
480 * the internal track size. A properly aligned multiple of
481 * optimal_io_size is the preferred request size for workloads where
482 * sustained throughput is desired.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400483 */
484void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
485{
Martin K. Petersen3c5820c2009-09-11 21:54:52 +0200486 blk_limits_io_opt(&q->limits, opt);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400487}
488EXPORT_SYMBOL(blk_queue_io_opt);
489
Jens Axboe86db1e22008-01-29 14:53:40 +0100490/**
491 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
492 * @t: the stacking driver (top)
493 * @b: the underlying device (bottom)
494 **/
495void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
496{
Martin K. Petersenfef24662009-07-31 11:49:10 -0400497 blk_stack_limits(&t->limits, &b->limits, 0);
Jens Axboe86db1e22008-01-29 14:53:40 +0100498}
Jens Axboe86db1e22008-01-29 14:53:40 +0100499EXPORT_SYMBOL(blk_queue_stack_limits);
500
501/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400502 * blk_stack_limits - adjust queue_limits for stacked devices
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100503 * @t: the stacking driver limits (top device)
504 * @b: the underlying queue limits (bottom, component device)
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500505 * @start: first data sector within component device
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400506 *
507 * Description:
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100508 * This function is used by stacking drivers like MD and DM to ensure
509 * that all component devices have compatible block sizes and
510 * alignments. The stacking driver must provide a queue_limits
511 * struct (top) and then iteratively call the stacking function for
512 * all component (bottom) devices. The stacking function will
513 * attempt to combine the values and ensure proper alignment.
514 *
515 * Returns 0 if the top and bottom queue_limits are compatible. The
516 * top device's block sizes and alignment offsets may be adjusted to
517 * ensure alignment with the bottom device. If no compatible sizes
518 * and alignments exist, -1 is returned and the resulting top
519 * queue_limits will have the misaligned flag set to indicate that
520 * the alignment_offset is undefined.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400521 */
522int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500523 sector_t start)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400524{
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500525 unsigned int top, bottom, alignment, ret = 0;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100526
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400527 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
528 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
Martin K. Petersen4363ac72012-09-18 12:19:27 -0400529 t->max_write_same_sectors = min(t->max_write_same_sectors,
530 b->max_write_same_sectors);
Martin K. Petersen77634f32009-06-09 06:23:22 +0200531 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400532
533 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
534 b->seg_boundary_mask);
535
Martin K. Petersen8a783622010-02-26 00:20:39 -0500536 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200537 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
538 b->max_integrity_segments);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400539
540 t->max_segment_size = min_not_zero(t->max_segment_size,
541 b->max_segment_size);
542
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500543 t->misaligned |= b->misaligned;
544
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500545 alignment = queue_limit_alignment_offset(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100546
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100547 /* Bottom device has different alignment. Check that it is
548 * compatible with the current top alignment.
549 */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100550 if (t->alignment_offset != alignment) {
551
552 top = max(t->physical_block_size, t->io_min)
553 + t->alignment_offset;
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100554 bottom = max(b->physical_block_size, b->io_min) + alignment;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100555
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100556 /* Verify that top and bottom intervals line up */
Mike Snitzerb8839b82014-10-08 18:26:13 -0400557 if (max(top, bottom) % min(top, bottom)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100558 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500559 ret = -1;
560 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100561 }
562
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400563 t->logical_block_size = max(t->logical_block_size,
564 b->logical_block_size);
565
566 t->physical_block_size = max(t->physical_block_size,
567 b->physical_block_size);
568
569 t->io_min = max(t->io_min, b->io_min);
Mike Snitzere9637412015-03-30 13:39:09 -0400570 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100571
Martin K. Petersene692cb62010-12-01 19:41:49 +0100572 t->cluster &= b->cluster;
Martin K. Petersen98262f22009-12-03 09:24:48 +0100573 t->discard_zeroes_data &= b->discard_zeroes_data;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400574
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100575 /* Physical block size a multiple of the logical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100576 if (t->physical_block_size & (t->logical_block_size - 1)) {
577 t->physical_block_size = t->logical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400578 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500579 ret = -1;
Martin K. Petersen86b37282009-11-10 11:50:21 +0100580 }
581
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100582 /* Minimum I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100583 if (t->io_min & (t->physical_block_size - 1)) {
584 t->io_min = t->physical_block_size;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400585 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500586 ret = -1;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400587 }
588
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100589 /* Optimal I/O a multiple of the physical block size? */
Martin K. Petersen9504e082009-12-21 15:55:51 +0100590 if (t->io_opt & (t->physical_block_size - 1)) {
591 t->io_opt = 0;
592 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500593 ret = -1;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100594 }
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400595
Kent Overstreetc78afc62013-07-11 22:39:53 -0700596 t->raid_partial_stripes_expensive =
597 max(t->raid_partial_stripes_expensive,
598 b->raid_partial_stripes_expensive);
599
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100600 /* Find lowest common alignment_offset */
Mike Snitzere9637412015-03-30 13:39:09 -0400601 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
Mike Snitzerb8839b82014-10-08 18:26:13 -0400602 % max(t->physical_block_size, t->io_min);
Martin K. Petersen70dd5bf2009-07-31 11:49:12 -0400603
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100604 /* Verify that new alignment_offset is on a logical block boundary */
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500605 if (t->alignment_offset & (t->logical_block_size - 1)) {
Martin K. Petersen9504e082009-12-21 15:55:51 +0100606 t->misaligned = 1;
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500607 ret = -1;
608 }
Martin K. Petersen9504e082009-12-21 15:55:51 +0100609
610 /* Discard alignment and granularity */
611 if (b->discard_granularity) {
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500612 alignment = queue_limit_discard_alignment(b, start);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100613
614 if (t->discard_granularity != 0 &&
615 t->discard_alignment != alignment) {
616 top = t->discard_granularity + t->discard_alignment;
617 bottom = b->discard_granularity + alignment;
618
619 /* Verify that top and bottom intervals line up */
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800620 if ((max(top, bottom) % min(top, bottom)) != 0)
Martin K. Petersen9504e082009-12-21 15:55:51 +0100621 t->discard_misaligned = 1;
622 }
623
Martin K. Petersen81744ee2009-12-29 08:35:35 +0100624 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
625 b->max_discard_sectors);
Jens Axboe0034af02015-07-16 09:14:26 -0600626 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
627 b->max_hw_discard_sectors);
Martin K. Petersen9504e082009-12-21 15:55:51 +0100628 t->discard_granularity = max(t->discard_granularity,
629 b->discard_granularity);
Mike Snitzere9637412015-03-30 13:39:09 -0400630 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
Shaohua Li8dd2cb72012-12-14 11:15:36 +0800631 t->discard_granularity;
Martin K. Petersen9504e082009-12-21 15:55:51 +0100632 }
633
Martin K. Petersenfe0b3932010-01-11 03:21:47 -0500634 return ret;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400635}
Mike Snitzer5d85d322009-05-28 11:04:53 +0200636EXPORT_SYMBOL(blk_stack_limits);
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400637
638/**
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500639 * bdev_stack_limits - adjust queue limits for stacked drivers
640 * @t: the stacking driver limits (top device)
641 * @bdev: the component block_device (bottom)
642 * @start: first data sector within component device
643 *
644 * Description:
645 * Merges queue limits for a top device and a block_device. Returns
646 * 0 if alignment didn't change. Returns -1 if adding the bottom
647 * device caused misalignment.
648 */
649int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
650 sector_t start)
651{
652 struct request_queue *bq = bdev_get_queue(bdev);
653
654 start += get_start_sect(bdev);
655
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500656 return blk_stack_limits(t, &bq->limits, start);
Martin K. Petersen17be8c22010-01-11 03:21:49 -0500657}
658EXPORT_SYMBOL(bdev_stack_limits);
659
660/**
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400661 * disk_stack_limits - adjust queue limits for stacked drivers
Martin K. Petersen77634f32009-06-09 06:23:22 +0200662 * @disk: MD/DM gendisk (top)
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400663 * @bdev: the underlying block device (bottom)
664 * @offset: offset to beginning of data within component device
665 *
666 * Description:
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500667 * Merges the limits for a top level gendisk and a bottom level
668 * block_device.
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400669 */
670void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
671 sector_t offset)
672{
673 struct request_queue *t = disk->queue;
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400674
Martin K. Petersene03a72e2010-01-11 03:21:51 -0500675 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400676 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
677
678 disk_name(disk, 0, top);
679 bdevname(bdev, bottom);
680
681 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
682 top, bottom);
683 }
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400684}
685EXPORT_SYMBOL(disk_stack_limits);
686
687/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100688 * blk_queue_dma_pad - set pad mask
689 * @q: the request queue for the device
690 * @mask: pad mask
691 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200692 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100693 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200694 * Appending pad buffer to a request modifies the last entry of a
695 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100696 **/
697void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
698{
699 q->dma_pad_mask = mask;
700}
701EXPORT_SYMBOL(blk_queue_dma_pad);
702
703/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200704 * blk_queue_update_dma_pad - update pad mask
705 * @q: the request queue for the device
706 * @mask: pad mask
707 *
708 * Update dma pad mask.
709 *
710 * Appending pad buffer to a request modifies the last entry of a
711 * scatter list such that it includes the pad buffer.
712 **/
713void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
714{
715 if (mask > q->dma_pad_mask)
716 q->dma_pad_mask = mask;
717}
718EXPORT_SYMBOL(blk_queue_update_dma_pad);
719
720/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100721 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100722 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100723 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100724 * @buf: physically contiguous buffer
725 * @size: size of the buffer in bytes
726 *
727 * Some devices have excess DMA problems and can't simply discard (or
728 * zero fill) the unwanted piece of the transfer. They have to have a
729 * real area of memory to transfer it into. The use case for this is
730 * ATAPI devices in DMA mode. If the packet command causes a transfer
731 * bigger than the transfer size some HBAs will lock up if there
732 * aren't DMA elements to contain the excess transfer. What this API
733 * does is adjust the queue so that the buf is always appended
734 * silently to the scatterlist.
735 *
Martin K. Petersen8a783622010-02-26 00:20:39 -0500736 * Note: This routine adjusts max_hw_segments to make room for appending
737 * the drain buffer. If you call blk_queue_max_segments() after calling
738 * this routine, you must set the limit to one fewer than your device
739 * can support otherwise there won't be room for the drain buffer.
Jens Axboe86db1e22008-01-29 14:53:40 +0100740 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100741int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100742 dma_drain_needed_fn *dma_drain_needed,
743 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100744{
Martin K. Petersen8a783622010-02-26 00:20:39 -0500745 if (queue_max_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100746 return -EINVAL;
747 /* make room for appending the drain */
Martin K. Petersen8a783622010-02-26 00:20:39 -0500748 blk_queue_max_segments(q, queue_max_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100749 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100750 q->dma_drain_buffer = buf;
751 q->dma_drain_size = size;
752
753 return 0;
754}
Jens Axboe86db1e22008-01-29 14:53:40 +0100755EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
756
757/**
758 * blk_queue_segment_boundary - set boundary rules for segment merging
759 * @q: the request queue for the device
760 * @mask: the memory boundary mask
761 **/
762void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
763{
764 if (mask < PAGE_CACHE_SIZE - 1) {
765 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700766 printk(KERN_INFO "%s: set to minimum %lx\n",
767 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100768 }
769
Martin K. Petersen025146e2009-05-22 17:17:51 -0400770 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100771}
Jens Axboe86db1e22008-01-29 14:53:40 +0100772EXPORT_SYMBOL(blk_queue_segment_boundary);
773
774/**
775 * blk_queue_dma_alignment - set dma length and memory alignment
776 * @q: the request queue for the device
777 * @mask: alignment mask
778 *
779 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200780 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100781 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100782 *
783 **/
784void blk_queue_dma_alignment(struct request_queue *q, int mask)
785{
786 q->dma_alignment = mask;
787}
Jens Axboe86db1e22008-01-29 14:53:40 +0100788EXPORT_SYMBOL(blk_queue_dma_alignment);
789
790/**
791 * blk_queue_update_dma_alignment - update dma length and memory alignment
792 * @q: the request queue for the device
793 * @mask: alignment mask
794 *
795 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200796 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100797 * If the requested alignment is larger than the current alignment, then
798 * the current queue alignment is updated to the new value, otherwise it
799 * is left alone. The design of this is to allow multiple objects
800 * (driver, device, transport etc) to set their respective
801 * alignments without having them interfere.
802 *
803 **/
804void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
805{
806 BUG_ON(mask > PAGE_SIZE);
807
808 if (mask > q->dma_alignment)
809 q->dma_alignment = mask;
810}
Jens Axboe86db1e22008-01-29 14:53:40 +0100811EXPORT_SYMBOL(blk_queue_update_dma_alignment);
812
Tejun Heo4913efe2010-09-03 11:56:16 +0200813/**
814 * blk_queue_flush - configure queue's cache flush capability
815 * @q: the request queue for the device
816 * @flush: 0, REQ_FLUSH or REQ_FLUSH | REQ_FUA
817 *
818 * Tell block layer cache flush capability of @q. If it supports
819 * flushing, REQ_FLUSH should be set. If it supports bypassing
820 * write cache for individual writes, REQ_FUA should be set.
821 */
822void blk_queue_flush(struct request_queue *q, unsigned int flush)
823{
824 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
825
826 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
827 flush &= ~REQ_FUA;
828
829 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
830}
831EXPORT_SYMBOL_GPL(blk_queue_flush);
832
shaohua.li@intel.comf3876932011-05-06 11:34:32 -0600833void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
834{
835 q->flush_not_queueable = !queueable;
836}
837EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
838
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200839static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100840{
841 blk_max_low_pfn = max_low_pfn - 1;
842 blk_max_pfn = max_pfn - 1;
843 return 0;
844}
845subsys_initcall(blk_settings_init);