blob: b0f547cecfb8775a484a73f41fbb51801abd6902 [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 */
10
11#include "blk.h"
12
Jens Axboe6728cb02008-01-31 13:03:55 +010013unsigned long blk_max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010014EXPORT_SYMBOL(blk_max_low_pfn);
Jens Axboe6728cb02008-01-31 13:03:55 +010015
16unsigned long blk_max_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +010017
18/**
19 * blk_queue_prep_rq - set a prepare_request function for queue
20 * @q: queue
21 * @pfn: prepare_request function
22 *
23 * It's possible for a queue to register a prepare_request callback which
24 * is invoked before the request is handed to the request_fn. The goal of
25 * the function is to prepare a request for I/O, it can be used to build a
26 * cdb from the request data for instance.
27 *
28 */
29void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
30{
31 q->prep_rq_fn = pfn;
32}
Jens Axboe86db1e22008-01-29 14:53:40 +010033EXPORT_SYMBOL(blk_queue_prep_rq);
34
35/**
David Woodhousefb2dce82008-08-05 18:01:53 +010036 * blk_queue_set_discard - set a discard_sectors function for queue
37 * @q: queue
38 * @dfn: prepare_discard function
39 *
40 * It's possible for a queue to register a discard callback which is used
41 * to transform a discard request into the appropriate type for the
42 * hardware. If none is registered, then discard requests are failed
43 * with %EOPNOTSUPP.
44 *
45 */
46void blk_queue_set_discard(struct request_queue *q, prepare_discard_fn *dfn)
47{
48 q->prepare_discard_fn = dfn;
49}
50EXPORT_SYMBOL(blk_queue_set_discard);
51
52/**
Jens Axboe86db1e22008-01-29 14:53:40 +010053 * blk_queue_merge_bvec - set a merge_bvec function for queue
54 * @q: queue
55 * @mbfn: merge_bvec_fn
56 *
57 * Usually queues have static limitations on the max sectors or segments that
58 * we can put in a request. Stacking drivers may have some settings that
59 * are dynamic, and thus we have to query the queue whether it is ok to
60 * add a new bio_vec to a bio at a given offset or not. If the block device
61 * has such limitations, it needs to register a merge_bvec_fn to control
62 * the size of bio's sent to it. Note that a block device *must* allow a
63 * single page to be added to an empty bio. The block device driver may want
64 * to use the bio_split() function to deal with these bio's. By default
65 * no merge_bvec_fn is defined for a queue, and only the fixed limits are
66 * honored.
67 */
68void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
69{
70 q->merge_bvec_fn = mbfn;
71}
Jens Axboe86db1e22008-01-29 14:53:40 +010072EXPORT_SYMBOL(blk_queue_merge_bvec);
73
74void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
75{
76 q->softirq_done_fn = fn;
77}
Jens Axboe86db1e22008-01-29 14:53:40 +010078EXPORT_SYMBOL(blk_queue_softirq_done);
79
Jens Axboe242f9dc2008-09-14 05:55:09 -070080void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
81{
82 q->rq_timeout = timeout;
83}
84EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
85
86void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
87{
88 q->rq_timed_out_fn = fn;
89}
90EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
91
Kiyoshi Uedaef9e3fa2008-10-01 16:12:15 +020092void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
93{
94 q->lld_busy_fn = fn;
95}
96EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
97
Jens Axboe86db1e22008-01-29 14:53:40 +010098/**
99 * blk_queue_make_request - define an alternate make_request function for a device
100 * @q: the request queue for the device to be affected
101 * @mfn: the alternate make_request function
102 *
103 * Description:
104 * The normal way for &struct bios to be passed to a device
105 * driver is for them to be collected into requests on a request
106 * queue, and then to allow the device driver to select requests
107 * off that queue when it is ready. This works well for many block
108 * devices. However some block devices (typically virtual devices
109 * such as md or lvm) do not benefit from the processing on the
110 * request queue, and are served best by having the requests passed
111 * directly to them. This can be achieved by providing a function
112 * to blk_queue_make_request().
113 *
114 * Caveat:
115 * The driver that does this *must* be able to deal appropriately
116 * with buffers in "highmemory". This can be accomplished by either calling
117 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
118 * blk_queue_bounce() to create a buffer in normal memory.
119 **/
Jens Axboe6728cb02008-01-31 13:03:55 +0100120void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100121{
122 /*
123 * set defaults
124 */
125 q->nr_requests = BLKDEV_MAX_RQ;
126 blk_queue_max_phys_segments(q, MAX_PHYS_SEGMENTS);
127 blk_queue_max_hw_segments(q, MAX_HW_SEGMENTS);
Milan Broz0e435ac2008-12-03 12:55:08 +0100128 blk_queue_segment_boundary(q, BLK_SEG_BOUNDARY_MASK);
129 blk_queue_max_segment_size(q, MAX_SEGMENT_SIZE);
130
Jens Axboe86db1e22008-01-29 14:53:40 +0100131 q->make_request_fn = mfn;
Jens Axboe6728cb02008-01-31 13:03:55 +0100132 q->backing_dev_info.ra_pages =
133 (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
Jens Axboe86db1e22008-01-29 14:53:40 +0100134 q->backing_dev_info.state = 0;
135 q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
136 blk_queue_max_sectors(q, SAFE_MAX_SECTORS);
Martin K. Petersene1defc42009-05-22 17:17:49 -0400137 blk_queue_logical_block_size(q, 512);
Jens Axboe86db1e22008-01-29 14:53:40 +0100138 blk_queue_dma_alignment(q, 511);
139 blk_queue_congestion_threshold(q);
140 q->nr_batching = BLK_BATCH_REQ;
141
142 q->unplug_thresh = 4; /* hmm */
143 q->unplug_delay = (3 * HZ) / 1000; /* 3 milliseconds */
144 if (q->unplug_delay == 0)
145 q->unplug_delay = 1;
146
Jens Axboe86db1e22008-01-29 14:53:40 +0100147 q->unplug_timer.function = blk_unplug_timeout;
148 q->unplug_timer.data = (unsigned long)q;
149
150 /*
151 * by default assume old behaviour and bounce for any highmem page
152 */
153 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
154}
Jens Axboe86db1e22008-01-29 14:53:40 +0100155EXPORT_SYMBOL(blk_queue_make_request);
156
157/**
158 * blk_queue_bounce_limit - set bounce buffer limit for queue
Tejun Heocd0aca22009-04-15 22:10:25 +0900159 * @q: the request queue for the device
160 * @dma_mask: the maximum address the device can handle
Jens Axboe86db1e22008-01-29 14:53:40 +0100161 *
162 * Description:
163 * Different hardware can have different requirements as to what pages
164 * it can do I/O directly to. A low level driver can call
165 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
Tejun Heocd0aca22009-04-15 22:10:25 +0900166 * buffers for doing I/O to pages residing above @dma_mask.
Jens Axboe86db1e22008-01-29 14:53:40 +0100167 **/
Tejun Heocd0aca22009-04-15 22:10:25 +0900168void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
Jens Axboe86db1e22008-01-29 14:53:40 +0100169{
Tejun Heocd0aca22009-04-15 22:10:25 +0900170 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
Jens Axboe86db1e22008-01-29 14:53:40 +0100171 int dma = 0;
172
173 q->bounce_gfp = GFP_NOIO;
174#if BITS_PER_LONG == 64
Tejun Heocd0aca22009-04-15 22:10:25 +0900175 /*
176 * Assume anything <= 4GB can be handled by IOMMU. Actually
177 * some IOMMUs can handle everything, but I don't know of a
178 * way to test this here.
179 */
180 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
Jens Axboe86db1e22008-01-29 14:53:40 +0100181 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400182 q->limits.bounce_pfn = max_low_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100183#else
Jens Axboe6728cb02008-01-31 13:03:55 +0100184 if (b_pfn < blk_max_low_pfn)
Jens Axboe86db1e22008-01-29 14:53:40 +0100185 dma = 1;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400186 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100187#endif
188 if (dma) {
189 init_emergency_isa_pool();
190 q->bounce_gfp = GFP_NOIO | GFP_DMA;
Martin K. Petersen025146e2009-05-22 17:17:51 -0400191 q->limits.bounce_pfn = b_pfn;
Jens Axboe86db1e22008-01-29 14:53:40 +0100192 }
193}
Jens Axboe86db1e22008-01-29 14:53:40 +0100194EXPORT_SYMBOL(blk_queue_bounce_limit);
195
196/**
197 * blk_queue_max_sectors - set max sectors for a request for this queue
198 * @q: the request queue for the device
199 * @max_sectors: max sectors in the usual 512b unit
200 *
201 * Description:
202 * Enables a low level driver to set an upper limit on the size of
203 * received requests.
204 **/
205void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
206{
207 if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
208 max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
Harvey Harrison24c03d42008-05-01 04:35:17 -0700209 printk(KERN_INFO "%s: set to minimum %d\n",
210 __func__, max_sectors);
Jens Axboe86db1e22008-01-29 14:53:40 +0100211 }
212
213 if (BLK_DEF_MAX_SECTORS > max_sectors)
Martin K. Petersen025146e2009-05-22 17:17:51 -0400214 q->limits.max_hw_sectors = q->limits.max_sectors = max_sectors;
Jens Axboe86db1e22008-01-29 14:53:40 +0100215 else {
Martin K. Petersen025146e2009-05-22 17:17:51 -0400216 q->limits.max_sectors = BLK_DEF_MAX_SECTORS;
217 q->limits.max_hw_sectors = max_sectors;
Jens Axboe86db1e22008-01-29 14:53:40 +0100218 }
219}
Jens Axboe86db1e22008-01-29 14:53:40 +0100220EXPORT_SYMBOL(blk_queue_max_sectors);
221
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400222void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_sectors)
223{
224 if (BLK_DEF_MAX_SECTORS > max_sectors)
Martin K. Petersen025146e2009-05-22 17:17:51 -0400225 q->limits.max_hw_sectors = BLK_DEF_MAX_SECTORS;
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400226 else
Martin K. Petersen025146e2009-05-22 17:17:51 -0400227 q->limits.max_hw_sectors = max_sectors;
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400228}
229EXPORT_SYMBOL(blk_queue_max_hw_sectors);
230
Jens Axboe86db1e22008-01-29 14:53:40 +0100231/**
232 * blk_queue_max_phys_segments - set max phys segments for a request for this queue
233 * @q: the request queue for the device
234 * @max_segments: max number of segments
235 *
236 * Description:
237 * Enables a low level driver to set an upper limit on the number of
238 * physical data segments in a request. This would be the largest sized
239 * scatter list the driver could handle.
240 **/
241void blk_queue_max_phys_segments(struct request_queue *q,
242 unsigned short max_segments)
243{
244 if (!max_segments) {
245 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700246 printk(KERN_INFO "%s: set to minimum %d\n",
247 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100248 }
249
Martin K. Petersen025146e2009-05-22 17:17:51 -0400250 q->limits.max_phys_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100251}
Jens Axboe86db1e22008-01-29 14:53:40 +0100252EXPORT_SYMBOL(blk_queue_max_phys_segments);
253
254/**
255 * blk_queue_max_hw_segments - set max hw segments for a request for this queue
256 * @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
261 * hw data segments in a request. This would be the largest number of
Randy Dunlap710027a2008-08-19 20:13:11 +0200262 * address/length pairs the host adapter can actually give at once
Jens Axboe86db1e22008-01-29 14:53:40 +0100263 * to the device.
264 **/
265void blk_queue_max_hw_segments(struct request_queue *q,
266 unsigned short max_segments)
267{
268 if (!max_segments) {
269 max_segments = 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700270 printk(KERN_INFO "%s: set to minimum %d\n",
271 __func__, max_segments);
Jens Axboe86db1e22008-01-29 14:53:40 +0100272 }
273
Martin K. Petersen025146e2009-05-22 17:17:51 -0400274 q->limits.max_hw_segments = max_segments;
Jens Axboe86db1e22008-01-29 14:53:40 +0100275}
Jens Axboe86db1e22008-01-29 14:53:40 +0100276EXPORT_SYMBOL(blk_queue_max_hw_segments);
277
278/**
279 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
280 * @q: the request queue for the device
281 * @max_size: max size of segment in bytes
282 *
283 * Description:
284 * Enables a low level driver to set an upper limit on the size of a
285 * coalesced segment
286 **/
287void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
288{
289 if (max_size < PAGE_CACHE_SIZE) {
290 max_size = PAGE_CACHE_SIZE;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700291 printk(KERN_INFO "%s: set to minimum %d\n",
292 __func__, max_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100293 }
294
Martin K. Petersen025146e2009-05-22 17:17:51 -0400295 q->limits.max_segment_size = max_size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100296}
Jens Axboe86db1e22008-01-29 14:53:40 +0100297EXPORT_SYMBOL(blk_queue_max_segment_size);
298
299/**
Martin K. Petersene1defc42009-05-22 17:17:49 -0400300 * blk_queue_logical_block_size - set logical block size for the queue
Jens Axboe86db1e22008-01-29 14:53:40 +0100301 * @q: the request queue for the device
Martin K. Petersene1defc42009-05-22 17:17:49 -0400302 * @size: the logical block size, in bytes
Jens Axboe86db1e22008-01-29 14:53:40 +0100303 *
304 * Description:
Martin K. Petersene1defc42009-05-22 17:17:49 -0400305 * This should be set to the lowest possible block size that the
306 * storage device can address. The default of 512 covers most
307 * hardware.
Jens Axboe86db1e22008-01-29 14:53:40 +0100308 **/
Martin K. Petersene1defc42009-05-22 17:17:49 -0400309void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100310{
Martin K. Petersen025146e2009-05-22 17:17:51 -0400311 q->limits.logical_block_size = size;
Jens Axboe86db1e22008-01-29 14:53:40 +0100312}
Martin K. Petersene1defc42009-05-22 17:17:49 -0400313EXPORT_SYMBOL(blk_queue_logical_block_size);
Jens Axboe86db1e22008-01-29 14:53:40 +0100314
315/*
316 * Returns the minimum that is _not_ zero, unless both are zero.
317 */
318#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
319
320/**
321 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
322 * @t: the stacking driver (top)
323 * @b: the underlying device (bottom)
324 **/
325void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
326{
327 /* zero is "infinity" */
Martin K. Petersen025146e2009-05-22 17:17:51 -0400328 t->limits.max_sectors = min_not_zero(queue_max_sectors(t),
329 queue_max_sectors(b));
Jens Axboe86db1e22008-01-29 14:53:40 +0100330
Martin K. Petersen025146e2009-05-22 17:17:51 -0400331 t->limits.max_hw_sectors = min_not_zero(queue_max_hw_sectors(t),
332 queue_max_hw_sectors(b));
333
334 t->limits.seg_boundary_mask = min_not_zero(queue_segment_boundary(t),
335 queue_segment_boundary(b));
336
337 t->limits.max_phys_segments = min_not_zero(queue_max_phys_segments(t),
338 queue_max_phys_segments(b));
339
340 t->limits.max_hw_segments = min_not_zero(queue_max_hw_segments(t),
341 queue_max_hw_segments(b));
342
343 t->limits.max_segment_size = min_not_zero(queue_max_segment_size(t),
344 queue_max_segment_size(b));
345
346 t->limits.logical_block_size = max(queue_logical_block_size(t),
347 queue_logical_block_size(b));
348
Neil Browne7e72bf2008-05-14 16:05:54 -0700349 if (!t->queue_lock)
350 WARN_ON_ONCE(1);
351 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
352 unsigned long flags;
353 spin_lock_irqsave(t->queue_lock, flags);
Nick Piggin75ad23b2008-04-29 14:48:33 +0200354 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
Neil Browne7e72bf2008-05-14 16:05:54 -0700355 spin_unlock_irqrestore(t->queue_lock, flags);
356 }
Jens Axboe86db1e22008-01-29 14:53:40 +0100357}
Jens Axboe86db1e22008-01-29 14:53:40 +0100358EXPORT_SYMBOL(blk_queue_stack_limits);
359
360/**
Tejun Heoe3790c72008-03-04 11:18:17 +0100361 * blk_queue_dma_pad - set pad mask
362 * @q: the request queue for the device
363 * @mask: pad mask
364 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200365 * Set dma pad mask.
Tejun Heoe3790c72008-03-04 11:18:17 +0100366 *
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200367 * Appending pad buffer to a request modifies the last entry of a
368 * scatter list such that it includes the pad buffer.
Tejun Heoe3790c72008-03-04 11:18:17 +0100369 **/
370void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
371{
372 q->dma_pad_mask = mask;
373}
374EXPORT_SYMBOL(blk_queue_dma_pad);
375
376/**
FUJITA Tomonori27f82212008-07-04 09:30:03 +0200377 * blk_queue_update_dma_pad - update pad mask
378 * @q: the request queue for the device
379 * @mask: pad mask
380 *
381 * Update dma pad mask.
382 *
383 * Appending pad buffer to a request modifies the last entry of a
384 * scatter list such that it includes the pad buffer.
385 **/
386void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
387{
388 if (mask > q->dma_pad_mask)
389 q->dma_pad_mask = mask;
390}
391EXPORT_SYMBOL(blk_queue_update_dma_pad);
392
393/**
Jens Axboe86db1e22008-01-29 14:53:40 +0100394 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
Jens Axboe86db1e22008-01-29 14:53:40 +0100395 * @q: the request queue for the device
Tejun Heo2fb98e82008-02-19 11:36:53 +0100396 * @dma_drain_needed: fn which returns non-zero if drain is necessary
Jens Axboe86db1e22008-01-29 14:53:40 +0100397 * @buf: physically contiguous buffer
398 * @size: size of the buffer in bytes
399 *
400 * Some devices have excess DMA problems and can't simply discard (or
401 * zero fill) the unwanted piece of the transfer. They have to have a
402 * real area of memory to transfer it into. The use case for this is
403 * ATAPI devices in DMA mode. If the packet command causes a transfer
404 * bigger than the transfer size some HBAs will lock up if there
405 * aren't DMA elements to contain the excess transfer. What this API
406 * does is adjust the queue so that the buf is always appended
407 * silently to the scatterlist.
408 *
409 * Note: This routine adjusts max_hw_segments to make room for
410 * appending the drain buffer. If you call
411 * blk_queue_max_hw_segments() or blk_queue_max_phys_segments() after
412 * calling this routine, you must set the limit to one fewer than your
413 * device can support otherwise there won't be room for the drain
414 * buffer.
415 */
Harvey Harrison448da4d2008-03-04 11:30:18 +0100416int blk_queue_dma_drain(struct request_queue *q,
Tejun Heo2fb98e82008-02-19 11:36:53 +0100417 dma_drain_needed_fn *dma_drain_needed,
418 void *buf, unsigned int size)
Jens Axboe86db1e22008-01-29 14:53:40 +0100419{
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400420 if (queue_max_hw_segments(q) < 2 || queue_max_phys_segments(q) < 2)
Jens Axboe86db1e22008-01-29 14:53:40 +0100421 return -EINVAL;
422 /* make room for appending the drain */
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400423 blk_queue_max_hw_segments(q, queue_max_hw_segments(q) - 1);
424 blk_queue_max_phys_segments(q, queue_max_phys_segments(q) - 1);
Tejun Heo2fb98e82008-02-19 11:36:53 +0100425 q->dma_drain_needed = dma_drain_needed;
Jens Axboe86db1e22008-01-29 14:53:40 +0100426 q->dma_drain_buffer = buf;
427 q->dma_drain_size = size;
428
429 return 0;
430}
Jens Axboe86db1e22008-01-29 14:53:40 +0100431EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
432
433/**
434 * blk_queue_segment_boundary - set boundary rules for segment merging
435 * @q: the request queue for the device
436 * @mask: the memory boundary mask
437 **/
438void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
439{
440 if (mask < PAGE_CACHE_SIZE - 1) {
441 mask = PAGE_CACHE_SIZE - 1;
Harvey Harrison24c03d42008-05-01 04:35:17 -0700442 printk(KERN_INFO "%s: set to minimum %lx\n",
443 __func__, mask);
Jens Axboe86db1e22008-01-29 14:53:40 +0100444 }
445
Martin K. Petersen025146e2009-05-22 17:17:51 -0400446 q->limits.seg_boundary_mask = mask;
Jens Axboe86db1e22008-01-29 14:53:40 +0100447}
Jens Axboe86db1e22008-01-29 14:53:40 +0100448EXPORT_SYMBOL(blk_queue_segment_boundary);
449
450/**
451 * blk_queue_dma_alignment - set dma length and memory alignment
452 * @q: the request queue for the device
453 * @mask: alignment mask
454 *
455 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200456 * set required memory and length alignment for direct dma transactions.
Alan Cox8feb4d22009-04-01 15:01:39 +0100457 * this is used when building direct io requests for the queue.
Jens Axboe86db1e22008-01-29 14:53:40 +0100458 *
459 **/
460void blk_queue_dma_alignment(struct request_queue *q, int mask)
461{
462 q->dma_alignment = mask;
463}
Jens Axboe86db1e22008-01-29 14:53:40 +0100464EXPORT_SYMBOL(blk_queue_dma_alignment);
465
466/**
467 * blk_queue_update_dma_alignment - update dma length and memory alignment
468 * @q: the request queue for the device
469 * @mask: alignment mask
470 *
471 * description:
Randy Dunlap710027a2008-08-19 20:13:11 +0200472 * update required memory and length alignment for direct dma transactions.
Jens Axboe86db1e22008-01-29 14:53:40 +0100473 * If the requested alignment is larger than the current alignment, then
474 * the current queue alignment is updated to the new value, otherwise it
475 * is left alone. The design of this is to allow multiple objects
476 * (driver, device, transport etc) to set their respective
477 * alignments without having them interfere.
478 *
479 **/
480void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
481{
482 BUG_ON(mask > PAGE_SIZE);
483
484 if (mask > q->dma_alignment)
485 q->dma_alignment = mask;
486}
Jens Axboe86db1e22008-01-29 14:53:40 +0100487EXPORT_SYMBOL(blk_queue_update_dma_alignment);
488
Harvey Harrisonaeb3d3a2008-08-28 09:27:42 +0200489static int __init blk_settings_init(void)
Jens Axboe86db1e22008-01-29 14:53:40 +0100490{
491 blk_max_low_pfn = max_low_pfn - 1;
492 blk_max_pfn = max_pfn - 1;
493 return 0;
494}
495subsys_initcall(blk_settings_init);