xref: /linux/block/blk-settings.c (revision 70dd5bf3b99964d52862ad2810c24cc32a553535)
186db1e29SJens Axboe /*
286db1e29SJens Axboe  * Functions related to setting various queue properties from drivers
386db1e29SJens Axboe  */
486db1e29SJens Axboe #include <linux/kernel.h>
586db1e29SJens Axboe #include <linux/module.h>
686db1e29SJens Axboe #include <linux/init.h>
786db1e29SJens Axboe #include <linux/bio.h>
886db1e29SJens Axboe #include <linux/blkdev.h>
986db1e29SJens Axboe #include <linux/bootmem.h>	/* for max_pfn/max_low_pfn */
10*70dd5bf3SMartin K. Petersen #include <linux/gcd.h>
1186db1e29SJens Axboe 
1286db1e29SJens Axboe #include "blk.h"
1386db1e29SJens Axboe 
146728cb0eSJens Axboe unsigned long blk_max_low_pfn;
1586db1e29SJens Axboe EXPORT_SYMBOL(blk_max_low_pfn);
166728cb0eSJens Axboe 
176728cb0eSJens Axboe unsigned long blk_max_pfn;
1886db1e29SJens Axboe 
1986db1e29SJens Axboe /**
2086db1e29SJens Axboe  * blk_queue_prep_rq - set a prepare_request function for queue
2186db1e29SJens Axboe  * @q:		queue
2286db1e29SJens Axboe  * @pfn:	prepare_request function
2386db1e29SJens Axboe  *
2486db1e29SJens Axboe  * It's possible for a queue to register a prepare_request callback which
2586db1e29SJens Axboe  * is invoked before the request is handed to the request_fn. The goal of
2686db1e29SJens Axboe  * the function is to prepare a request for I/O, it can be used to build a
2786db1e29SJens Axboe  * cdb from the request data for instance.
2886db1e29SJens Axboe  *
2986db1e29SJens Axboe  */
3086db1e29SJens Axboe void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
3186db1e29SJens Axboe {
3286db1e29SJens Axboe 	q->prep_rq_fn = pfn;
3386db1e29SJens Axboe }
3486db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_prep_rq);
3586db1e29SJens Axboe 
3686db1e29SJens Axboe /**
37fb2dce86SDavid Woodhouse  * blk_queue_set_discard - set a discard_sectors function for queue
38fb2dce86SDavid Woodhouse  * @q:		queue
39fb2dce86SDavid Woodhouse  * @dfn:	prepare_discard function
40fb2dce86SDavid Woodhouse  *
41fb2dce86SDavid Woodhouse  * It's possible for a queue to register a discard callback which is used
42fb2dce86SDavid Woodhouse  * to transform a discard request into the appropriate type for the
43fb2dce86SDavid Woodhouse  * hardware. If none is registered, then discard requests are failed
44fb2dce86SDavid Woodhouse  * with %EOPNOTSUPP.
45fb2dce86SDavid Woodhouse  *
46fb2dce86SDavid Woodhouse  */
47fb2dce86SDavid Woodhouse void blk_queue_set_discard(struct request_queue *q, prepare_discard_fn *dfn)
48fb2dce86SDavid Woodhouse {
49fb2dce86SDavid Woodhouse 	q->prepare_discard_fn = dfn;
50fb2dce86SDavid Woodhouse }
51fb2dce86SDavid Woodhouse EXPORT_SYMBOL(blk_queue_set_discard);
52fb2dce86SDavid Woodhouse 
53fb2dce86SDavid Woodhouse /**
5486db1e29SJens Axboe  * blk_queue_merge_bvec - set a merge_bvec function for queue
5586db1e29SJens Axboe  * @q:		queue
5686db1e29SJens Axboe  * @mbfn:	merge_bvec_fn
5786db1e29SJens Axboe  *
5886db1e29SJens Axboe  * Usually queues have static limitations on the max sectors or segments that
5986db1e29SJens Axboe  * we can put in a request. Stacking drivers may have some settings that
6086db1e29SJens Axboe  * are dynamic, and thus we have to query the queue whether it is ok to
6186db1e29SJens Axboe  * add a new bio_vec to a bio at a given offset or not. If the block device
6286db1e29SJens Axboe  * has such limitations, it needs to register a merge_bvec_fn to control
6386db1e29SJens Axboe  * the size of bio's sent to it. Note that a block device *must* allow a
6486db1e29SJens Axboe  * single page to be added to an empty bio. The block device driver may want
6586db1e29SJens Axboe  * to use the bio_split() function to deal with these bio's. By default
6686db1e29SJens Axboe  * no merge_bvec_fn is defined for a queue, and only the fixed limits are
6786db1e29SJens Axboe  * honored.
6886db1e29SJens Axboe  */
6986db1e29SJens Axboe void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
7086db1e29SJens Axboe {
7186db1e29SJens Axboe 	q->merge_bvec_fn = mbfn;
7286db1e29SJens Axboe }
7386db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_merge_bvec);
7486db1e29SJens Axboe 
7586db1e29SJens Axboe void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
7686db1e29SJens Axboe {
7786db1e29SJens Axboe 	q->softirq_done_fn = fn;
7886db1e29SJens Axboe }
7986db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_softirq_done);
8086db1e29SJens Axboe 
81242f9dcbSJens Axboe void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
82242f9dcbSJens Axboe {
83242f9dcbSJens Axboe 	q->rq_timeout = timeout;
84242f9dcbSJens Axboe }
85242f9dcbSJens Axboe EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
86242f9dcbSJens Axboe 
87242f9dcbSJens Axboe void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
88242f9dcbSJens Axboe {
89242f9dcbSJens Axboe 	q->rq_timed_out_fn = fn;
90242f9dcbSJens Axboe }
91242f9dcbSJens Axboe EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
92242f9dcbSJens Axboe 
93ef9e3facSKiyoshi Ueda void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
94ef9e3facSKiyoshi Ueda {
95ef9e3facSKiyoshi Ueda 	q->lld_busy_fn = fn;
96ef9e3facSKiyoshi Ueda }
97ef9e3facSKiyoshi Ueda EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
98ef9e3facSKiyoshi Ueda 
9986db1e29SJens Axboe /**
100e475bba2SMartin K. Petersen  * blk_set_default_limits - reset limits to default values
101f740f5caSRandy Dunlap  * @lim:  the queue_limits structure to reset
102e475bba2SMartin K. Petersen  *
103e475bba2SMartin K. Petersen  * Description:
104e475bba2SMartin K. Petersen  *   Returns a queue_limit struct to its default state.  Can be used by
105e475bba2SMartin K. Petersen  *   stacking drivers like DM that stage table swaps and reuse an
106e475bba2SMartin K. Petersen  *   existing device queue.
107e475bba2SMartin K. Petersen  */
108e475bba2SMartin K. Petersen void blk_set_default_limits(struct queue_limits *lim)
109e475bba2SMartin K. Petersen {
110e475bba2SMartin K. Petersen 	lim->max_phys_segments = MAX_PHYS_SEGMENTS;
111e475bba2SMartin K. Petersen 	lim->max_hw_segments = MAX_HW_SEGMENTS;
112e475bba2SMartin K. Petersen 	lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
113e475bba2SMartin K. Petersen 	lim->max_segment_size = MAX_SEGMENT_SIZE;
114e475bba2SMartin K. Petersen 	lim->max_sectors = lim->max_hw_sectors = SAFE_MAX_SECTORS;
115e475bba2SMartin K. Petersen 	lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
1163a02c8e8SMartin K. Petersen 	lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
117e475bba2SMartin K. Petersen 	lim->alignment_offset = 0;
118e475bba2SMartin K. Petersen 	lim->io_opt = 0;
119e475bba2SMartin K. Petersen 	lim->misaligned = 0;
120e475bba2SMartin K. Petersen 	lim->no_cluster = 0;
121e475bba2SMartin K. Petersen }
122e475bba2SMartin K. Petersen EXPORT_SYMBOL(blk_set_default_limits);
123e475bba2SMartin K. Petersen 
124e475bba2SMartin K. Petersen /**
12586db1e29SJens Axboe  * blk_queue_make_request - define an alternate make_request function for a device
12686db1e29SJens Axboe  * @q:  the request queue for the device to be affected
12786db1e29SJens Axboe  * @mfn: the alternate make_request function
12886db1e29SJens Axboe  *
12986db1e29SJens Axboe  * Description:
13086db1e29SJens Axboe  *    The normal way for &struct bios to be passed to a device
13186db1e29SJens Axboe  *    driver is for them to be collected into requests on a request
13286db1e29SJens Axboe  *    queue, and then to allow the device driver to select requests
13386db1e29SJens Axboe  *    off that queue when it is ready.  This works well for many block
13486db1e29SJens Axboe  *    devices. However some block devices (typically virtual devices
13586db1e29SJens Axboe  *    such as md or lvm) do not benefit from the processing on the
13686db1e29SJens Axboe  *    request queue, and are served best by having the requests passed
13786db1e29SJens Axboe  *    directly to them.  This can be achieved by providing a function
13886db1e29SJens Axboe  *    to blk_queue_make_request().
13986db1e29SJens Axboe  *
14086db1e29SJens Axboe  * Caveat:
14186db1e29SJens Axboe  *    The driver that does this *must* be able to deal appropriately
14286db1e29SJens Axboe  *    with buffers in "highmemory". This can be accomplished by either calling
14386db1e29SJens Axboe  *    __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
14486db1e29SJens Axboe  *    blk_queue_bounce() to create a buffer in normal memory.
14586db1e29SJens Axboe  **/
14686db1e29SJens Axboe void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
14786db1e29SJens Axboe {
14886db1e29SJens Axboe 	/*
14986db1e29SJens Axboe 	 * set defaults
15086db1e29SJens Axboe 	 */
15186db1e29SJens Axboe 	q->nr_requests = BLKDEV_MAX_RQ;
1520e435ac2SMilan Broz 
15386db1e29SJens Axboe 	q->make_request_fn = mfn;
15486db1e29SJens Axboe 	blk_queue_dma_alignment(q, 511);
15586db1e29SJens Axboe 	blk_queue_congestion_threshold(q);
15686db1e29SJens Axboe 	q->nr_batching = BLK_BATCH_REQ;
15786db1e29SJens Axboe 
15886db1e29SJens Axboe 	q->unplug_thresh = 4;		/* hmm */
15986db1e29SJens Axboe 	q->unplug_delay = (3 * HZ) / 1000;	/* 3 milliseconds */
16086db1e29SJens Axboe 	if (q->unplug_delay == 0)
16186db1e29SJens Axboe 		q->unplug_delay = 1;
16286db1e29SJens Axboe 
16386db1e29SJens Axboe 	q->unplug_timer.function = blk_unplug_timeout;
16486db1e29SJens Axboe 	q->unplug_timer.data = (unsigned long)q;
16586db1e29SJens Axboe 
166e475bba2SMartin K. Petersen 	blk_set_default_limits(&q->limits);
167e475bba2SMartin K. Petersen 
16886db1e29SJens Axboe 	/*
169a4e7d464SJens Axboe 	 * If the caller didn't supply a lock, fall back to our embedded
170a4e7d464SJens Axboe 	 * per-queue locks
171a4e7d464SJens Axboe 	 */
172a4e7d464SJens Axboe 	if (!q->queue_lock)
173a4e7d464SJens Axboe 		q->queue_lock = &q->__queue_lock;
174a4e7d464SJens Axboe 
175a4e7d464SJens Axboe 	/*
17686db1e29SJens Axboe 	 * by default assume old behaviour and bounce for any highmem page
17786db1e29SJens Axboe 	 */
17886db1e29SJens Axboe 	blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
17986db1e29SJens Axboe }
18086db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_make_request);
18186db1e29SJens Axboe 
18286db1e29SJens Axboe /**
18386db1e29SJens Axboe  * blk_queue_bounce_limit - set bounce buffer limit for queue
18486db1e29SJens Axboe  * @q: the request queue for the device
185cd0aca2dSTejun Heo  * @dma_mask: the maximum address the device can handle
18686db1e29SJens Axboe  *
18786db1e29SJens Axboe  * Description:
18886db1e29SJens Axboe  *    Different hardware can have different requirements as to what pages
18986db1e29SJens Axboe  *    it can do I/O directly to. A low level driver can call
19086db1e29SJens Axboe  *    blk_queue_bounce_limit to have lower memory pages allocated as bounce
191cd0aca2dSTejun Heo  *    buffers for doing I/O to pages residing above @dma_mask.
19286db1e29SJens Axboe  **/
193cd0aca2dSTejun Heo void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
19486db1e29SJens Axboe {
195cd0aca2dSTejun Heo 	unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
19686db1e29SJens Axboe 	int dma = 0;
19786db1e29SJens Axboe 
19886db1e29SJens Axboe 	q->bounce_gfp = GFP_NOIO;
19986db1e29SJens Axboe #if BITS_PER_LONG == 64
200cd0aca2dSTejun Heo 	/*
201cd0aca2dSTejun Heo 	 * Assume anything <= 4GB can be handled by IOMMU.  Actually
202cd0aca2dSTejun Heo 	 * some IOMMUs can handle everything, but I don't know of a
203cd0aca2dSTejun Heo 	 * way to test this here.
204cd0aca2dSTejun Heo 	 */
205cd0aca2dSTejun Heo 	if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
20686db1e29SJens Axboe 		dma = 1;
207025146e1SMartin K. Petersen 	q->limits.bounce_pfn = max_low_pfn;
20886db1e29SJens Axboe #else
2096728cb0eSJens Axboe 	if (b_pfn < blk_max_low_pfn)
21086db1e29SJens Axboe 		dma = 1;
211025146e1SMartin K. Petersen 	q->limits.bounce_pfn = b_pfn;
21286db1e29SJens Axboe #endif
21386db1e29SJens Axboe 	if (dma) {
21486db1e29SJens Axboe 		init_emergency_isa_pool();
21586db1e29SJens Axboe 		q->bounce_gfp = GFP_NOIO | GFP_DMA;
216025146e1SMartin K. Petersen 		q->limits.bounce_pfn = b_pfn;
21786db1e29SJens Axboe 	}
21886db1e29SJens Axboe }
21986db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_bounce_limit);
22086db1e29SJens Axboe 
22186db1e29SJens Axboe /**
22286db1e29SJens Axboe  * blk_queue_max_sectors - set max sectors for a request for this queue
22386db1e29SJens Axboe  * @q:  the request queue for the device
22486db1e29SJens Axboe  * @max_sectors:  max sectors in the usual 512b unit
22586db1e29SJens Axboe  *
22686db1e29SJens Axboe  * Description:
22786db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the size of
22886db1e29SJens Axboe  *    received requests.
22986db1e29SJens Axboe  **/
23086db1e29SJens Axboe void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
23186db1e29SJens Axboe {
23286db1e29SJens Axboe 	if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
23386db1e29SJens Axboe 		max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
23424c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
23524c03d47SHarvey Harrison 		       __func__, max_sectors);
23686db1e29SJens Axboe 	}
23786db1e29SJens Axboe 
23886db1e29SJens Axboe 	if (BLK_DEF_MAX_SECTORS > max_sectors)
239025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = q->limits.max_sectors = max_sectors;
24086db1e29SJens Axboe 	else {
241025146e1SMartin K. Petersen 		q->limits.max_sectors = BLK_DEF_MAX_SECTORS;
242025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = max_sectors;
24386db1e29SJens Axboe 	}
24486db1e29SJens Axboe }
24586db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_sectors);
24686db1e29SJens Axboe 
247ae03bf63SMartin K. Petersen void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_sectors)
248ae03bf63SMartin K. Petersen {
249ae03bf63SMartin K. Petersen 	if (BLK_DEF_MAX_SECTORS > max_sectors)
250025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = BLK_DEF_MAX_SECTORS;
251ae03bf63SMartin K. Petersen 	else
252025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = max_sectors;
253ae03bf63SMartin K. Petersen }
254ae03bf63SMartin K. Petersen EXPORT_SYMBOL(blk_queue_max_hw_sectors);
255ae03bf63SMartin K. Petersen 
25686db1e29SJens Axboe /**
25786db1e29SJens Axboe  * blk_queue_max_phys_segments - set max phys segments for a request for this queue
25886db1e29SJens Axboe  * @q:  the request queue for the device
25986db1e29SJens Axboe  * @max_segments:  max number of segments
26086db1e29SJens Axboe  *
26186db1e29SJens Axboe  * Description:
26286db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the number of
26386db1e29SJens Axboe  *    physical data segments in a request.  This would be the largest sized
26486db1e29SJens Axboe  *    scatter list the driver could handle.
26586db1e29SJens Axboe  **/
26686db1e29SJens Axboe void blk_queue_max_phys_segments(struct request_queue *q,
26786db1e29SJens Axboe 				 unsigned short max_segments)
26886db1e29SJens Axboe {
26986db1e29SJens Axboe 	if (!max_segments) {
27086db1e29SJens Axboe 		max_segments = 1;
27124c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
27224c03d47SHarvey Harrison 		       __func__, max_segments);
27386db1e29SJens Axboe 	}
27486db1e29SJens Axboe 
275025146e1SMartin K. Petersen 	q->limits.max_phys_segments = max_segments;
27686db1e29SJens Axboe }
27786db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_phys_segments);
27886db1e29SJens Axboe 
27986db1e29SJens Axboe /**
28086db1e29SJens Axboe  * blk_queue_max_hw_segments - set max hw segments for a request for this queue
28186db1e29SJens Axboe  * @q:  the request queue for the device
28286db1e29SJens Axboe  * @max_segments:  max number of segments
28386db1e29SJens Axboe  *
28486db1e29SJens Axboe  * Description:
28586db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the number of
28686db1e29SJens Axboe  *    hw data segments in a request.  This would be the largest number of
287710027a4SRandy Dunlap  *    address/length pairs the host adapter can actually give at once
28886db1e29SJens Axboe  *    to the device.
28986db1e29SJens Axboe  **/
29086db1e29SJens Axboe void blk_queue_max_hw_segments(struct request_queue *q,
29186db1e29SJens Axboe 			       unsigned short max_segments)
29286db1e29SJens Axboe {
29386db1e29SJens Axboe 	if (!max_segments) {
29486db1e29SJens Axboe 		max_segments = 1;
29524c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
29624c03d47SHarvey Harrison 		       __func__, max_segments);
29786db1e29SJens Axboe 	}
29886db1e29SJens Axboe 
299025146e1SMartin K. Petersen 	q->limits.max_hw_segments = max_segments;
30086db1e29SJens Axboe }
30186db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_hw_segments);
30286db1e29SJens Axboe 
30386db1e29SJens Axboe /**
30486db1e29SJens Axboe  * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
30586db1e29SJens Axboe  * @q:  the request queue for the device
30686db1e29SJens Axboe  * @max_size:  max size of segment in bytes
30786db1e29SJens Axboe  *
30886db1e29SJens Axboe  * Description:
30986db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the size of a
31086db1e29SJens Axboe  *    coalesced segment
31186db1e29SJens Axboe  **/
31286db1e29SJens Axboe void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
31386db1e29SJens Axboe {
31486db1e29SJens Axboe 	if (max_size < PAGE_CACHE_SIZE) {
31586db1e29SJens Axboe 		max_size = PAGE_CACHE_SIZE;
31624c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
31724c03d47SHarvey Harrison 		       __func__, max_size);
31886db1e29SJens Axboe 	}
31986db1e29SJens Axboe 
320025146e1SMartin K. Petersen 	q->limits.max_segment_size = max_size;
32186db1e29SJens Axboe }
32286db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_segment_size);
32386db1e29SJens Axboe 
32486db1e29SJens Axboe /**
325e1defc4fSMartin K. Petersen  * blk_queue_logical_block_size - set logical block size for the queue
32686db1e29SJens Axboe  * @q:  the request queue for the device
327e1defc4fSMartin K. Petersen  * @size:  the logical block size, in bytes
32886db1e29SJens Axboe  *
32986db1e29SJens Axboe  * Description:
330e1defc4fSMartin K. Petersen  *   This should be set to the lowest possible block size that the
331e1defc4fSMartin K. Petersen  *   storage device can address.  The default of 512 covers most
332e1defc4fSMartin K. Petersen  *   hardware.
33386db1e29SJens Axboe  **/
334e1defc4fSMartin K. Petersen void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
33586db1e29SJens Axboe {
336025146e1SMartin K. Petersen 	q->limits.logical_block_size = size;
337c72758f3SMartin K. Petersen 
338c72758f3SMartin K. Petersen 	if (q->limits.physical_block_size < size)
339c72758f3SMartin K. Petersen 		q->limits.physical_block_size = size;
340c72758f3SMartin K. Petersen 
341c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.physical_block_size)
342c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.physical_block_size;
34386db1e29SJens Axboe }
344e1defc4fSMartin K. Petersen EXPORT_SYMBOL(blk_queue_logical_block_size);
34586db1e29SJens Axboe 
346c72758f3SMartin K. Petersen /**
347c72758f3SMartin K. Petersen  * blk_queue_physical_block_size - set physical block size for the queue
348c72758f3SMartin K. Petersen  * @q:  the request queue for the device
349c72758f3SMartin K. Petersen  * @size:  the physical block size, in bytes
350c72758f3SMartin K. Petersen  *
351c72758f3SMartin K. Petersen  * Description:
352c72758f3SMartin K. Petersen  *   This should be set to the lowest possible sector size that the
353c72758f3SMartin K. Petersen  *   hardware can operate on without reverting to read-modify-write
354c72758f3SMartin K. Petersen  *   operations.
355c72758f3SMartin K. Petersen  */
356c72758f3SMartin K. Petersen void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
357c72758f3SMartin K. Petersen {
358c72758f3SMartin K. Petersen 	q->limits.physical_block_size = size;
359c72758f3SMartin K. Petersen 
360c72758f3SMartin K. Petersen 	if (q->limits.physical_block_size < q->limits.logical_block_size)
361c72758f3SMartin K. Petersen 		q->limits.physical_block_size = q->limits.logical_block_size;
362c72758f3SMartin K. Petersen 
363c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.physical_block_size)
364c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.physical_block_size;
365c72758f3SMartin K. Petersen }
366c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_physical_block_size);
367c72758f3SMartin K. Petersen 
368c72758f3SMartin K. Petersen /**
369c72758f3SMartin K. Petersen  * blk_queue_alignment_offset - set physical block alignment offset
370c72758f3SMartin K. Petersen  * @q:	the request queue for the device
3718ebf9756SRandy Dunlap  * @offset: alignment offset in bytes
372c72758f3SMartin K. Petersen  *
373c72758f3SMartin K. Petersen  * Description:
374c72758f3SMartin K. Petersen  *   Some devices are naturally misaligned to compensate for things like
375c72758f3SMartin K. Petersen  *   the legacy DOS partition table 63-sector offset.  Low-level drivers
376c72758f3SMartin K. Petersen  *   should call this function for devices whose first sector is not
377c72758f3SMartin K. Petersen  *   naturally aligned.
378c72758f3SMartin K. Petersen  */
379c72758f3SMartin K. Petersen void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
380c72758f3SMartin K. Petersen {
381c72758f3SMartin K. Petersen 	q->limits.alignment_offset =
382c72758f3SMartin K. Petersen 		offset & (q->limits.physical_block_size - 1);
383c72758f3SMartin K. Petersen 	q->limits.misaligned = 0;
384c72758f3SMartin K. Petersen }
385c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_alignment_offset);
386c72758f3SMartin K. Petersen 
387c72758f3SMartin K. Petersen /**
3887c958e32SMartin K. Petersen  * blk_limits_io_min - set minimum request size for a device
3897c958e32SMartin K. Petersen  * @limits: the queue limits
3907c958e32SMartin K. Petersen  * @min:  smallest I/O size in bytes
3917c958e32SMartin K. Petersen  *
3927c958e32SMartin K. Petersen  * Description:
3937c958e32SMartin K. Petersen  *   Some devices have an internal block size bigger than the reported
3947c958e32SMartin K. Petersen  *   hardware sector size.  This function can be used to signal the
3957c958e32SMartin K. Petersen  *   smallest I/O the device can perform without incurring a performance
3967c958e32SMartin K. Petersen  *   penalty.
3977c958e32SMartin K. Petersen  */
3987c958e32SMartin K. Petersen void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
3997c958e32SMartin K. Petersen {
4007c958e32SMartin K. Petersen 	limits->io_min = min;
4017c958e32SMartin K. Petersen 
4027c958e32SMartin K. Petersen 	if (limits->io_min < limits->logical_block_size)
4037c958e32SMartin K. Petersen 		limits->io_min = limits->logical_block_size;
4047c958e32SMartin K. Petersen 
4057c958e32SMartin K. Petersen 	if (limits->io_min < limits->physical_block_size)
4067c958e32SMartin K. Petersen 		limits->io_min = limits->physical_block_size;
4077c958e32SMartin K. Petersen }
4087c958e32SMartin K. Petersen EXPORT_SYMBOL(blk_limits_io_min);
4097c958e32SMartin K. Petersen 
4107c958e32SMartin K. Petersen /**
411c72758f3SMartin K. Petersen  * blk_queue_io_min - set minimum request size for the queue
412c72758f3SMartin K. Petersen  * @q:	the request queue for the device
4138ebf9756SRandy Dunlap  * @min:  smallest I/O size in bytes
414c72758f3SMartin K. Petersen  *
415c72758f3SMartin K. Petersen  * Description:
416c72758f3SMartin K. Petersen  *   Some devices have an internal block size bigger than the reported
417c72758f3SMartin K. Petersen  *   hardware sector size.  This function can be used to signal the
418c72758f3SMartin K. Petersen  *   smallest I/O the device can perform without incurring a performance
419c72758f3SMartin K. Petersen  *   penalty.
420c72758f3SMartin K. Petersen  */
421c72758f3SMartin K. Petersen void blk_queue_io_min(struct request_queue *q, unsigned int min)
422c72758f3SMartin K. Petersen {
4237c958e32SMartin K. Petersen 	blk_limits_io_min(&q->limits, min);
424c72758f3SMartin K. Petersen }
425c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_io_min);
426c72758f3SMartin K. Petersen 
427c72758f3SMartin K. Petersen /**
428c72758f3SMartin K. Petersen  * blk_queue_io_opt - set optimal request size for the queue
429c72758f3SMartin K. Petersen  * @q:	the request queue for the device
4308ebf9756SRandy Dunlap  * @opt:  optimal request size in bytes
431c72758f3SMartin K. Petersen  *
432c72758f3SMartin K. Petersen  * Description:
433c72758f3SMartin K. Petersen  *   Drivers can call this function to set the preferred I/O request
434c72758f3SMartin K. Petersen  *   size for devices that report such a value.
435c72758f3SMartin K. Petersen  */
436c72758f3SMartin K. Petersen void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
437c72758f3SMartin K. Petersen {
438c72758f3SMartin K. Petersen 	q->limits.io_opt = opt;
439c72758f3SMartin K. Petersen }
440c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_io_opt);
441c72758f3SMartin K. Petersen 
44286db1e29SJens Axboe /*
44386db1e29SJens Axboe  * Returns the minimum that is _not_ zero, unless both are zero.
44486db1e29SJens Axboe  */
44586db1e29SJens Axboe #define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
44686db1e29SJens Axboe 
44786db1e29SJens Axboe /**
44886db1e29SJens Axboe  * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
44986db1e29SJens Axboe  * @t:	the stacking driver (top)
45086db1e29SJens Axboe  * @b:  the underlying device (bottom)
45186db1e29SJens Axboe  **/
45286db1e29SJens Axboe void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
45386db1e29SJens Axboe {
454fef24667SMartin K. Petersen 	blk_stack_limits(&t->limits, &b->limits, 0);
455025146e1SMartin K. Petersen 
456e7e72bf6SNeil Brown 	if (!t->queue_lock)
457e7e72bf6SNeil Brown 		WARN_ON_ONCE(1);
458e7e72bf6SNeil Brown 	else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
459e7e72bf6SNeil Brown 		unsigned long flags;
460e7e72bf6SNeil Brown 		spin_lock_irqsave(t->queue_lock, flags);
46175ad23bcSNick Piggin 		queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
462e7e72bf6SNeil Brown 		spin_unlock_irqrestore(t->queue_lock, flags);
463e7e72bf6SNeil Brown 	}
46486db1e29SJens Axboe }
46586db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_stack_limits);
46686db1e29SJens Axboe 
46786db1e29SJens Axboe /**
468c72758f3SMartin K. Petersen  * blk_stack_limits - adjust queue_limits for stacked devices
469c72758f3SMartin K. Petersen  * @t:	the stacking driver limits (top)
47077634f33SMartin K. Petersen  * @b:  the underlying queue limits (bottom)
471c72758f3SMartin K. Petersen  * @offset:  offset to beginning of data within component device
472c72758f3SMartin K. Petersen  *
473c72758f3SMartin K. Petersen  * Description:
474c72758f3SMartin K. Petersen  *    Merges two queue_limit structs.  Returns 0 if alignment didn't
475c72758f3SMartin K. Petersen  *    change.  Returns -1 if adding the bottom device caused
476c72758f3SMartin K. Petersen  *    misalignment.
477c72758f3SMartin K. Petersen  */
478c72758f3SMartin K. Petersen int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
479c72758f3SMartin K. Petersen 		     sector_t offset)
480c72758f3SMartin K. Petersen {
481c72758f3SMartin K. Petersen 	t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
482c72758f3SMartin K. Petersen 	t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
48377634f33SMartin K. Petersen 	t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
484c72758f3SMartin K. Petersen 
485c72758f3SMartin K. Petersen 	t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
486c72758f3SMartin K. Petersen 					    b->seg_boundary_mask);
487c72758f3SMartin K. Petersen 
488c72758f3SMartin K. Petersen 	t->max_phys_segments = min_not_zero(t->max_phys_segments,
489c72758f3SMartin K. Petersen 					    b->max_phys_segments);
490c72758f3SMartin K. Petersen 
491c72758f3SMartin K. Petersen 	t->max_hw_segments = min_not_zero(t->max_hw_segments,
492c72758f3SMartin K. Petersen 					  b->max_hw_segments);
493c72758f3SMartin K. Petersen 
494c72758f3SMartin K. Petersen 	t->max_segment_size = min_not_zero(t->max_segment_size,
495c72758f3SMartin K. Petersen 					   b->max_segment_size);
496c72758f3SMartin K. Petersen 
497c72758f3SMartin K. Petersen 	t->logical_block_size = max(t->logical_block_size,
498c72758f3SMartin K. Petersen 				    b->logical_block_size);
499c72758f3SMartin K. Petersen 
500c72758f3SMartin K. Petersen 	t->physical_block_size = max(t->physical_block_size,
501c72758f3SMartin K. Petersen 				     b->physical_block_size);
502c72758f3SMartin K. Petersen 
503c72758f3SMartin K. Petersen 	t->io_min = max(t->io_min, b->io_min);
504c72758f3SMartin K. Petersen 	t->no_cluster |= b->no_cluster;
505c72758f3SMartin K. Petersen 
506c72758f3SMartin K. Petersen 	/* Bottom device offset aligned? */
507c72758f3SMartin K. Petersen 	if (offset &&
508c72758f3SMartin K. Petersen 	    (offset & (b->physical_block_size - 1)) != b->alignment_offset) {
509c72758f3SMartin K. Petersen 		t->misaligned = 1;
510c72758f3SMartin K. Petersen 		return -1;
511c72758f3SMartin K. Petersen 	}
512c72758f3SMartin K. Petersen 
513c72758f3SMartin K. Petersen 	/* If top has no alignment offset, inherit from bottom */
514c72758f3SMartin K. Petersen 	if (!t->alignment_offset)
515c72758f3SMartin K. Petersen 		t->alignment_offset =
516c72758f3SMartin K. Petersen 			b->alignment_offset & (b->physical_block_size - 1);
517c72758f3SMartin K. Petersen 
518c72758f3SMartin K. Petersen 	/* Top device aligned on logical block boundary? */
519c72758f3SMartin K. Petersen 	if (t->alignment_offset & (t->logical_block_size - 1)) {
520c72758f3SMartin K. Petersen 		t->misaligned = 1;
521c72758f3SMartin K. Petersen 		return -1;
522c72758f3SMartin K. Petersen 	}
523c72758f3SMartin K. Petersen 
524*70dd5bf3SMartin K. Petersen 	/* Find lcm() of optimal I/O size */
525*70dd5bf3SMartin K. Petersen 	if (t->io_opt && b->io_opt)
526*70dd5bf3SMartin K. Petersen 		t->io_opt = (t->io_opt * b->io_opt) / gcd(t->io_opt, b->io_opt);
527*70dd5bf3SMartin K. Petersen 	else if (b->io_opt)
528*70dd5bf3SMartin K. Petersen 		t->io_opt = b->io_opt;
529*70dd5bf3SMartin K. Petersen 
530*70dd5bf3SMartin K. Petersen 	/* Verify that optimal I/O size is a multiple of io_min */
531*70dd5bf3SMartin K. Petersen 	if (t->io_min && t->io_opt % t->io_min)
532*70dd5bf3SMartin K. Petersen 		return -1;
533*70dd5bf3SMartin K. Petersen 
534c72758f3SMartin K. Petersen 	return 0;
535c72758f3SMartin K. Petersen }
5365d85d324SMike Snitzer EXPORT_SYMBOL(blk_stack_limits);
537c72758f3SMartin K. Petersen 
538c72758f3SMartin K. Petersen /**
539c72758f3SMartin K. Petersen  * disk_stack_limits - adjust queue limits for stacked drivers
54077634f33SMartin K. Petersen  * @disk:  MD/DM gendisk (top)
541c72758f3SMartin K. Petersen  * @bdev:  the underlying block device (bottom)
542c72758f3SMartin K. Petersen  * @offset:  offset to beginning of data within component device
543c72758f3SMartin K. Petersen  *
544c72758f3SMartin K. Petersen  * Description:
545c72758f3SMartin K. Petersen  *    Merges the limits for two queues.  Returns 0 if alignment
546c72758f3SMartin K. Petersen  *    didn't change.  Returns -1 if adding the bottom device caused
547c72758f3SMartin K. Petersen  *    misalignment.
548c72758f3SMartin K. Petersen  */
549c72758f3SMartin K. Petersen void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
550c72758f3SMartin K. Petersen 		       sector_t offset)
551c72758f3SMartin K. Petersen {
552c72758f3SMartin K. Petersen 	struct request_queue *t = disk->queue;
553c72758f3SMartin K. Petersen 	struct request_queue *b = bdev_get_queue(bdev);
554c72758f3SMartin K. Petersen 
555c72758f3SMartin K. Petersen 	offset += get_start_sect(bdev) << 9;
556c72758f3SMartin K. Petersen 
557c72758f3SMartin K. Petersen 	if (blk_stack_limits(&t->limits, &b->limits, offset) < 0) {
558c72758f3SMartin K. Petersen 		char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
559c72758f3SMartin K. Petersen 
560c72758f3SMartin K. Petersen 		disk_name(disk, 0, top);
561c72758f3SMartin K. Petersen 		bdevname(bdev, bottom);
562c72758f3SMartin K. Petersen 
563c72758f3SMartin K. Petersen 		printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
564c72758f3SMartin K. Petersen 		       top, bottom);
565c72758f3SMartin K. Petersen 	}
566c72758f3SMartin K. Petersen 
567c72758f3SMartin K. Petersen 	if (!t->queue_lock)
568c72758f3SMartin K. Petersen 		WARN_ON_ONCE(1);
569c72758f3SMartin K. Petersen 	else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
570c72758f3SMartin K. Petersen 		unsigned long flags;
571c72758f3SMartin K. Petersen 
572c72758f3SMartin K. Petersen 		spin_lock_irqsave(t->queue_lock, flags);
573c72758f3SMartin K. Petersen 		if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
574c72758f3SMartin K. Petersen 			queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
575c72758f3SMartin K. Petersen 		spin_unlock_irqrestore(t->queue_lock, flags);
576c72758f3SMartin K. Petersen 	}
577c72758f3SMartin K. Petersen }
578c72758f3SMartin K. Petersen EXPORT_SYMBOL(disk_stack_limits);
579c72758f3SMartin K. Petersen 
580c72758f3SMartin K. Petersen /**
581e3790c7dSTejun Heo  * blk_queue_dma_pad - set pad mask
582e3790c7dSTejun Heo  * @q:     the request queue for the device
583e3790c7dSTejun Heo  * @mask:  pad mask
584e3790c7dSTejun Heo  *
58527f8221aSFUJITA Tomonori  * Set dma pad mask.
586e3790c7dSTejun Heo  *
58727f8221aSFUJITA Tomonori  * Appending pad buffer to a request modifies the last entry of a
58827f8221aSFUJITA Tomonori  * scatter list such that it includes the pad buffer.
589e3790c7dSTejun Heo  **/
590e3790c7dSTejun Heo void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
591e3790c7dSTejun Heo {
592e3790c7dSTejun Heo 	q->dma_pad_mask = mask;
593e3790c7dSTejun Heo }
594e3790c7dSTejun Heo EXPORT_SYMBOL(blk_queue_dma_pad);
595e3790c7dSTejun Heo 
596e3790c7dSTejun Heo /**
59727f8221aSFUJITA Tomonori  * blk_queue_update_dma_pad - update pad mask
59827f8221aSFUJITA Tomonori  * @q:     the request queue for the device
59927f8221aSFUJITA Tomonori  * @mask:  pad mask
60027f8221aSFUJITA Tomonori  *
60127f8221aSFUJITA Tomonori  * Update dma pad mask.
60227f8221aSFUJITA Tomonori  *
60327f8221aSFUJITA Tomonori  * Appending pad buffer to a request modifies the last entry of a
60427f8221aSFUJITA Tomonori  * scatter list such that it includes the pad buffer.
60527f8221aSFUJITA Tomonori  **/
60627f8221aSFUJITA Tomonori void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
60727f8221aSFUJITA Tomonori {
60827f8221aSFUJITA Tomonori 	if (mask > q->dma_pad_mask)
60927f8221aSFUJITA Tomonori 		q->dma_pad_mask = mask;
61027f8221aSFUJITA Tomonori }
61127f8221aSFUJITA Tomonori EXPORT_SYMBOL(blk_queue_update_dma_pad);
61227f8221aSFUJITA Tomonori 
61327f8221aSFUJITA Tomonori /**
61486db1e29SJens Axboe  * blk_queue_dma_drain - Set up a drain buffer for excess dma.
61586db1e29SJens Axboe  * @q:  the request queue for the device
6162fb98e84STejun Heo  * @dma_drain_needed: fn which returns non-zero if drain is necessary
61786db1e29SJens Axboe  * @buf:	physically contiguous buffer
61886db1e29SJens Axboe  * @size:	size of the buffer in bytes
61986db1e29SJens Axboe  *
62086db1e29SJens Axboe  * Some devices have excess DMA problems and can't simply discard (or
62186db1e29SJens Axboe  * zero fill) the unwanted piece of the transfer.  They have to have a
62286db1e29SJens Axboe  * real area of memory to transfer it into.  The use case for this is
62386db1e29SJens Axboe  * ATAPI devices in DMA mode.  If the packet command causes a transfer
62486db1e29SJens Axboe  * bigger than the transfer size some HBAs will lock up if there
62586db1e29SJens Axboe  * aren't DMA elements to contain the excess transfer.  What this API
62686db1e29SJens Axboe  * does is adjust the queue so that the buf is always appended
62786db1e29SJens Axboe  * silently to the scatterlist.
62886db1e29SJens Axboe  *
62986db1e29SJens Axboe  * Note: This routine adjusts max_hw_segments to make room for
63086db1e29SJens Axboe  * appending the drain buffer.  If you call
63186db1e29SJens Axboe  * blk_queue_max_hw_segments() or blk_queue_max_phys_segments() after
63286db1e29SJens Axboe  * calling this routine, you must set the limit to one fewer than your
63386db1e29SJens Axboe  * device can support otherwise there won't be room for the drain
63486db1e29SJens Axboe  * buffer.
63586db1e29SJens Axboe  */
636448da4d2SHarvey Harrison int blk_queue_dma_drain(struct request_queue *q,
6372fb98e84STejun Heo 			       dma_drain_needed_fn *dma_drain_needed,
6382fb98e84STejun Heo 			       void *buf, unsigned int size)
63986db1e29SJens Axboe {
640ae03bf63SMartin K. Petersen 	if (queue_max_hw_segments(q) < 2 || queue_max_phys_segments(q) < 2)
64186db1e29SJens Axboe 		return -EINVAL;
64286db1e29SJens Axboe 	/* make room for appending the drain */
643ae03bf63SMartin K. Petersen 	blk_queue_max_hw_segments(q, queue_max_hw_segments(q) - 1);
644ae03bf63SMartin K. Petersen 	blk_queue_max_phys_segments(q, queue_max_phys_segments(q) - 1);
6452fb98e84STejun Heo 	q->dma_drain_needed = dma_drain_needed;
64686db1e29SJens Axboe 	q->dma_drain_buffer = buf;
64786db1e29SJens Axboe 	q->dma_drain_size = size;
64886db1e29SJens Axboe 
64986db1e29SJens Axboe 	return 0;
65086db1e29SJens Axboe }
65186db1e29SJens Axboe EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
65286db1e29SJens Axboe 
65386db1e29SJens Axboe /**
65486db1e29SJens Axboe  * blk_queue_segment_boundary - set boundary rules for segment merging
65586db1e29SJens Axboe  * @q:  the request queue for the device
65686db1e29SJens Axboe  * @mask:  the memory boundary mask
65786db1e29SJens Axboe  **/
65886db1e29SJens Axboe void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
65986db1e29SJens Axboe {
66086db1e29SJens Axboe 	if (mask < PAGE_CACHE_SIZE - 1) {
66186db1e29SJens Axboe 		mask = PAGE_CACHE_SIZE - 1;
66224c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %lx\n",
66324c03d47SHarvey Harrison 		       __func__, mask);
66486db1e29SJens Axboe 	}
66586db1e29SJens Axboe 
666025146e1SMartin K. Petersen 	q->limits.seg_boundary_mask = mask;
66786db1e29SJens Axboe }
66886db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_segment_boundary);
66986db1e29SJens Axboe 
67086db1e29SJens Axboe /**
67186db1e29SJens Axboe  * blk_queue_dma_alignment - set dma length and memory alignment
67286db1e29SJens Axboe  * @q:     the request queue for the device
67386db1e29SJens Axboe  * @mask:  alignment mask
67486db1e29SJens Axboe  *
67586db1e29SJens Axboe  * description:
676710027a4SRandy Dunlap  *    set required memory and length alignment for direct dma transactions.
6778feb4d20SAlan Cox  *    this is used when building direct io requests for the queue.
67886db1e29SJens Axboe  *
67986db1e29SJens Axboe  **/
68086db1e29SJens Axboe void blk_queue_dma_alignment(struct request_queue *q, int mask)
68186db1e29SJens Axboe {
68286db1e29SJens Axboe 	q->dma_alignment = mask;
68386db1e29SJens Axboe }
68486db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_dma_alignment);
68586db1e29SJens Axboe 
68686db1e29SJens Axboe /**
68786db1e29SJens Axboe  * blk_queue_update_dma_alignment - update dma length and memory alignment
68886db1e29SJens Axboe  * @q:     the request queue for the device
68986db1e29SJens Axboe  * @mask:  alignment mask
69086db1e29SJens Axboe  *
69186db1e29SJens Axboe  * description:
692710027a4SRandy Dunlap  *    update required memory and length alignment for direct dma transactions.
69386db1e29SJens Axboe  *    If the requested alignment is larger than the current alignment, then
69486db1e29SJens Axboe  *    the current queue alignment is updated to the new value, otherwise it
69586db1e29SJens Axboe  *    is left alone.  The design of this is to allow multiple objects
69686db1e29SJens Axboe  *    (driver, device, transport etc) to set their respective
69786db1e29SJens Axboe  *    alignments without having them interfere.
69886db1e29SJens Axboe  *
69986db1e29SJens Axboe  **/
70086db1e29SJens Axboe void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
70186db1e29SJens Axboe {
70286db1e29SJens Axboe 	BUG_ON(mask > PAGE_SIZE);
70386db1e29SJens Axboe 
70486db1e29SJens Axboe 	if (mask > q->dma_alignment)
70586db1e29SJens Axboe 		q->dma_alignment = mask;
70686db1e29SJens Axboe }
70786db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_update_dma_alignment);
70886db1e29SJens Axboe 
709aeb3d3a8SHarvey Harrison static int __init blk_settings_init(void)
71086db1e29SJens Axboe {
71186db1e29SJens Axboe 	blk_max_low_pfn = max_low_pfn - 1;
71286db1e29SJens Axboe 	blk_max_pfn = max_pfn - 1;
71386db1e29SJens Axboe 	return 0;
71486db1e29SJens Axboe }
71586db1e29SJens Axboe subsys_initcall(blk_settings_init);
716