xref: /linux/block/blk-settings.c (revision 8ebf975608aaebd7feb33d77f07ba21a6380e086)
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 */
1086db1e29SJens Axboe 
1186db1e29SJens Axboe #include "blk.h"
1286db1e29SJens Axboe 
136728cb0eSJens Axboe unsigned long blk_max_low_pfn;
1486db1e29SJens Axboe EXPORT_SYMBOL(blk_max_low_pfn);
156728cb0eSJens Axboe 
166728cb0eSJens Axboe unsigned long blk_max_pfn;
1786db1e29SJens Axboe 
1886db1e29SJens Axboe /**
1986db1e29SJens Axboe  * blk_queue_prep_rq - set a prepare_request function for queue
2086db1e29SJens Axboe  * @q:		queue
2186db1e29SJens Axboe  * @pfn:	prepare_request function
2286db1e29SJens Axboe  *
2386db1e29SJens Axboe  * It's possible for a queue to register a prepare_request callback which
2486db1e29SJens Axboe  * is invoked before the request is handed to the request_fn. The goal of
2586db1e29SJens Axboe  * the function is to prepare a request for I/O, it can be used to build a
2686db1e29SJens Axboe  * cdb from the request data for instance.
2786db1e29SJens Axboe  *
2886db1e29SJens Axboe  */
2986db1e29SJens Axboe void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
3086db1e29SJens Axboe {
3186db1e29SJens Axboe 	q->prep_rq_fn = pfn;
3286db1e29SJens Axboe }
3386db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_prep_rq);
3486db1e29SJens Axboe 
3586db1e29SJens Axboe /**
36fb2dce86SDavid Woodhouse  * blk_queue_set_discard - set a discard_sectors function for queue
37fb2dce86SDavid Woodhouse  * @q:		queue
38fb2dce86SDavid Woodhouse  * @dfn:	prepare_discard function
39fb2dce86SDavid Woodhouse  *
40fb2dce86SDavid Woodhouse  * It's possible for a queue to register a discard callback which is used
41fb2dce86SDavid Woodhouse  * to transform a discard request into the appropriate type for the
42fb2dce86SDavid Woodhouse  * hardware. If none is registered, then discard requests are failed
43fb2dce86SDavid Woodhouse  * with %EOPNOTSUPP.
44fb2dce86SDavid Woodhouse  *
45fb2dce86SDavid Woodhouse  */
46fb2dce86SDavid Woodhouse void blk_queue_set_discard(struct request_queue *q, prepare_discard_fn *dfn)
47fb2dce86SDavid Woodhouse {
48fb2dce86SDavid Woodhouse 	q->prepare_discard_fn = dfn;
49fb2dce86SDavid Woodhouse }
50fb2dce86SDavid Woodhouse EXPORT_SYMBOL(blk_queue_set_discard);
51fb2dce86SDavid Woodhouse 
52fb2dce86SDavid Woodhouse /**
5386db1e29SJens Axboe  * blk_queue_merge_bvec - set a merge_bvec function for queue
5486db1e29SJens Axboe  * @q:		queue
5586db1e29SJens Axboe  * @mbfn:	merge_bvec_fn
5686db1e29SJens Axboe  *
5786db1e29SJens Axboe  * Usually queues have static limitations on the max sectors or segments that
5886db1e29SJens Axboe  * we can put in a request. Stacking drivers may have some settings that
5986db1e29SJens Axboe  * are dynamic, and thus we have to query the queue whether it is ok to
6086db1e29SJens Axboe  * add a new bio_vec to a bio at a given offset or not. If the block device
6186db1e29SJens Axboe  * has such limitations, it needs to register a merge_bvec_fn to control
6286db1e29SJens Axboe  * the size of bio's sent to it. Note that a block device *must* allow a
6386db1e29SJens Axboe  * single page to be added to an empty bio. The block device driver may want
6486db1e29SJens Axboe  * to use the bio_split() function to deal with these bio's. By default
6586db1e29SJens Axboe  * no merge_bvec_fn is defined for a queue, and only the fixed limits are
6686db1e29SJens Axboe  * honored.
6786db1e29SJens Axboe  */
6886db1e29SJens Axboe void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
6986db1e29SJens Axboe {
7086db1e29SJens Axboe 	q->merge_bvec_fn = mbfn;
7186db1e29SJens Axboe }
7286db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_merge_bvec);
7386db1e29SJens Axboe 
7486db1e29SJens Axboe void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
7586db1e29SJens Axboe {
7686db1e29SJens Axboe 	q->softirq_done_fn = fn;
7786db1e29SJens Axboe }
7886db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_softirq_done);
7986db1e29SJens Axboe 
80242f9dcbSJens Axboe void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
81242f9dcbSJens Axboe {
82242f9dcbSJens Axboe 	q->rq_timeout = timeout;
83242f9dcbSJens Axboe }
84242f9dcbSJens Axboe EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
85242f9dcbSJens Axboe 
86242f9dcbSJens Axboe void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
87242f9dcbSJens Axboe {
88242f9dcbSJens Axboe 	q->rq_timed_out_fn = fn;
89242f9dcbSJens Axboe }
90242f9dcbSJens Axboe EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
91242f9dcbSJens Axboe 
92ef9e3facSKiyoshi Ueda void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
93ef9e3facSKiyoshi Ueda {
94ef9e3facSKiyoshi Ueda 	q->lld_busy_fn = fn;
95ef9e3facSKiyoshi Ueda }
96ef9e3facSKiyoshi Ueda EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
97ef9e3facSKiyoshi Ueda 
9886db1e29SJens Axboe /**
9986db1e29SJens Axboe  * blk_queue_make_request - define an alternate make_request function for a device
10086db1e29SJens Axboe  * @q:  the request queue for the device to be affected
10186db1e29SJens Axboe  * @mfn: the alternate make_request function
10286db1e29SJens Axboe  *
10386db1e29SJens Axboe  * Description:
10486db1e29SJens Axboe  *    The normal way for &struct bios to be passed to a device
10586db1e29SJens Axboe  *    driver is for them to be collected into requests on a request
10686db1e29SJens Axboe  *    queue, and then to allow the device driver to select requests
10786db1e29SJens Axboe  *    off that queue when it is ready.  This works well for many block
10886db1e29SJens Axboe  *    devices. However some block devices (typically virtual devices
10986db1e29SJens Axboe  *    such as md or lvm) do not benefit from the processing on the
11086db1e29SJens Axboe  *    request queue, and are served best by having the requests passed
11186db1e29SJens Axboe  *    directly to them.  This can be achieved by providing a function
11286db1e29SJens Axboe  *    to blk_queue_make_request().
11386db1e29SJens Axboe  *
11486db1e29SJens Axboe  * Caveat:
11586db1e29SJens Axboe  *    The driver that does this *must* be able to deal appropriately
11686db1e29SJens Axboe  *    with buffers in "highmemory". This can be accomplished by either calling
11786db1e29SJens Axboe  *    __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
11886db1e29SJens Axboe  *    blk_queue_bounce() to create a buffer in normal memory.
11986db1e29SJens Axboe  **/
12086db1e29SJens Axboe void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
12186db1e29SJens Axboe {
12286db1e29SJens Axboe 	/*
12386db1e29SJens Axboe 	 * set defaults
12486db1e29SJens Axboe 	 */
12586db1e29SJens Axboe 	q->nr_requests = BLKDEV_MAX_RQ;
12686db1e29SJens Axboe 	blk_queue_max_phys_segments(q, MAX_PHYS_SEGMENTS);
12786db1e29SJens Axboe 	blk_queue_max_hw_segments(q, MAX_HW_SEGMENTS);
1280e435ac2SMilan Broz 	blk_queue_segment_boundary(q, BLK_SEG_BOUNDARY_MASK);
1290e435ac2SMilan Broz 	blk_queue_max_segment_size(q, MAX_SEGMENT_SIZE);
1300e435ac2SMilan Broz 
13186db1e29SJens Axboe 	q->make_request_fn = mfn;
1326728cb0eSJens Axboe 	q->backing_dev_info.ra_pages =
1336728cb0eSJens Axboe 			(VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
13486db1e29SJens Axboe 	q->backing_dev_info.state = 0;
13586db1e29SJens Axboe 	q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
13686db1e29SJens Axboe 	blk_queue_max_sectors(q, SAFE_MAX_SECTORS);
137e1defc4fSMartin K. Petersen 	blk_queue_logical_block_size(q, 512);
13886db1e29SJens Axboe 	blk_queue_dma_alignment(q, 511);
13986db1e29SJens Axboe 	blk_queue_congestion_threshold(q);
14086db1e29SJens Axboe 	q->nr_batching = BLK_BATCH_REQ;
14186db1e29SJens Axboe 
14286db1e29SJens Axboe 	q->unplug_thresh = 4;		/* hmm */
14386db1e29SJens Axboe 	q->unplug_delay = (3 * HZ) / 1000;	/* 3 milliseconds */
14486db1e29SJens Axboe 	if (q->unplug_delay == 0)
14586db1e29SJens Axboe 		q->unplug_delay = 1;
14686db1e29SJens Axboe 
14786db1e29SJens Axboe 	q->unplug_timer.function = blk_unplug_timeout;
14886db1e29SJens Axboe 	q->unplug_timer.data = (unsigned long)q;
14986db1e29SJens Axboe 
15086db1e29SJens Axboe 	/*
15186db1e29SJens Axboe 	 * by default assume old behaviour and bounce for any highmem page
15286db1e29SJens Axboe 	 */
15386db1e29SJens Axboe 	blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
15486db1e29SJens Axboe }
15586db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_make_request);
15686db1e29SJens Axboe 
15786db1e29SJens Axboe /**
15886db1e29SJens Axboe  * blk_queue_bounce_limit - set bounce buffer limit for queue
15986db1e29SJens Axboe  * @q: the request queue for the device
160cd0aca2dSTejun Heo  * @dma_mask: the maximum address the device can handle
16186db1e29SJens Axboe  *
16286db1e29SJens Axboe  * Description:
16386db1e29SJens Axboe  *    Different hardware can have different requirements as to what pages
16486db1e29SJens Axboe  *    it can do I/O directly to. A low level driver can call
16586db1e29SJens Axboe  *    blk_queue_bounce_limit to have lower memory pages allocated as bounce
166cd0aca2dSTejun Heo  *    buffers for doing I/O to pages residing above @dma_mask.
16786db1e29SJens Axboe  **/
168cd0aca2dSTejun Heo void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
16986db1e29SJens Axboe {
170cd0aca2dSTejun Heo 	unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
17186db1e29SJens Axboe 	int dma = 0;
17286db1e29SJens Axboe 
17386db1e29SJens Axboe 	q->bounce_gfp = GFP_NOIO;
17486db1e29SJens Axboe #if BITS_PER_LONG == 64
175cd0aca2dSTejun Heo 	/*
176cd0aca2dSTejun Heo 	 * Assume anything <= 4GB can be handled by IOMMU.  Actually
177cd0aca2dSTejun Heo 	 * some IOMMUs can handle everything, but I don't know of a
178cd0aca2dSTejun Heo 	 * way to test this here.
179cd0aca2dSTejun Heo 	 */
180cd0aca2dSTejun Heo 	if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
18186db1e29SJens Axboe 		dma = 1;
182025146e1SMartin K. Petersen 	q->limits.bounce_pfn = max_low_pfn;
18386db1e29SJens Axboe #else
1846728cb0eSJens Axboe 	if (b_pfn < blk_max_low_pfn)
18586db1e29SJens Axboe 		dma = 1;
186025146e1SMartin K. Petersen 	q->limits.bounce_pfn = b_pfn;
18786db1e29SJens Axboe #endif
18886db1e29SJens Axboe 	if (dma) {
18986db1e29SJens Axboe 		init_emergency_isa_pool();
19086db1e29SJens Axboe 		q->bounce_gfp = GFP_NOIO | GFP_DMA;
191025146e1SMartin K. Petersen 		q->limits.bounce_pfn = b_pfn;
19286db1e29SJens Axboe 	}
19386db1e29SJens Axboe }
19486db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_bounce_limit);
19586db1e29SJens Axboe 
19686db1e29SJens Axboe /**
19786db1e29SJens Axboe  * blk_queue_max_sectors - set max sectors for a request for this queue
19886db1e29SJens Axboe  * @q:  the request queue for the device
19986db1e29SJens Axboe  * @max_sectors:  max sectors in the usual 512b unit
20086db1e29SJens Axboe  *
20186db1e29SJens Axboe  * Description:
20286db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the size of
20386db1e29SJens Axboe  *    received requests.
20486db1e29SJens Axboe  **/
20586db1e29SJens Axboe void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
20686db1e29SJens Axboe {
20786db1e29SJens Axboe 	if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
20886db1e29SJens Axboe 		max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
20924c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
21024c03d47SHarvey Harrison 		       __func__, max_sectors);
21186db1e29SJens Axboe 	}
21286db1e29SJens Axboe 
21386db1e29SJens Axboe 	if (BLK_DEF_MAX_SECTORS > max_sectors)
214025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = q->limits.max_sectors = max_sectors;
21586db1e29SJens Axboe 	else {
216025146e1SMartin K. Petersen 		q->limits.max_sectors = BLK_DEF_MAX_SECTORS;
217025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = max_sectors;
21886db1e29SJens Axboe 	}
21986db1e29SJens Axboe }
22086db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_sectors);
22186db1e29SJens Axboe 
222ae03bf63SMartin K. Petersen void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_sectors)
223ae03bf63SMartin K. Petersen {
224ae03bf63SMartin K. Petersen 	if (BLK_DEF_MAX_SECTORS > max_sectors)
225025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = BLK_DEF_MAX_SECTORS;
226ae03bf63SMartin K. Petersen 	else
227025146e1SMartin K. Petersen 		q->limits.max_hw_sectors = max_sectors;
228ae03bf63SMartin K. Petersen }
229ae03bf63SMartin K. Petersen EXPORT_SYMBOL(blk_queue_max_hw_sectors);
230ae03bf63SMartin K. Petersen 
23186db1e29SJens Axboe /**
23286db1e29SJens Axboe  * blk_queue_max_phys_segments - set max phys segments for a request for this queue
23386db1e29SJens Axboe  * @q:  the request queue for the device
23486db1e29SJens Axboe  * @max_segments:  max number of segments
23586db1e29SJens Axboe  *
23686db1e29SJens Axboe  * Description:
23786db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the number of
23886db1e29SJens Axboe  *    physical data segments in a request.  This would be the largest sized
23986db1e29SJens Axboe  *    scatter list the driver could handle.
24086db1e29SJens Axboe  **/
24186db1e29SJens Axboe void blk_queue_max_phys_segments(struct request_queue *q,
24286db1e29SJens Axboe 				 unsigned short max_segments)
24386db1e29SJens Axboe {
24486db1e29SJens Axboe 	if (!max_segments) {
24586db1e29SJens Axboe 		max_segments = 1;
24624c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
24724c03d47SHarvey Harrison 		       __func__, max_segments);
24886db1e29SJens Axboe 	}
24986db1e29SJens Axboe 
250025146e1SMartin K. Petersen 	q->limits.max_phys_segments = max_segments;
25186db1e29SJens Axboe }
25286db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_phys_segments);
25386db1e29SJens Axboe 
25486db1e29SJens Axboe /**
25586db1e29SJens Axboe  * blk_queue_max_hw_segments - set max hw segments for a request for this queue
25686db1e29SJens Axboe  * @q:  the request queue for the device
25786db1e29SJens Axboe  * @max_segments:  max number of segments
25886db1e29SJens Axboe  *
25986db1e29SJens Axboe  * Description:
26086db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the number of
26186db1e29SJens Axboe  *    hw data segments in a request.  This would be the largest number of
262710027a4SRandy Dunlap  *    address/length pairs the host adapter can actually give at once
26386db1e29SJens Axboe  *    to the device.
26486db1e29SJens Axboe  **/
26586db1e29SJens Axboe void blk_queue_max_hw_segments(struct request_queue *q,
26686db1e29SJens Axboe 			       unsigned short max_segments)
26786db1e29SJens Axboe {
26886db1e29SJens Axboe 	if (!max_segments) {
26986db1e29SJens Axboe 		max_segments = 1;
27024c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
27124c03d47SHarvey Harrison 		       __func__, max_segments);
27286db1e29SJens Axboe 	}
27386db1e29SJens Axboe 
274025146e1SMartin K. Petersen 	q->limits.max_hw_segments = max_segments;
27586db1e29SJens Axboe }
27686db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_hw_segments);
27786db1e29SJens Axboe 
27886db1e29SJens Axboe /**
27986db1e29SJens Axboe  * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
28086db1e29SJens Axboe  * @q:  the request queue for the device
28186db1e29SJens Axboe  * @max_size:  max size of segment in bytes
28286db1e29SJens Axboe  *
28386db1e29SJens Axboe  * Description:
28486db1e29SJens Axboe  *    Enables a low level driver to set an upper limit on the size of a
28586db1e29SJens Axboe  *    coalesced segment
28686db1e29SJens Axboe  **/
28786db1e29SJens Axboe void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
28886db1e29SJens Axboe {
28986db1e29SJens Axboe 	if (max_size < PAGE_CACHE_SIZE) {
29086db1e29SJens Axboe 		max_size = PAGE_CACHE_SIZE;
29124c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %d\n",
29224c03d47SHarvey Harrison 		       __func__, max_size);
29386db1e29SJens Axboe 	}
29486db1e29SJens Axboe 
295025146e1SMartin K. Petersen 	q->limits.max_segment_size = max_size;
29686db1e29SJens Axboe }
29786db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_max_segment_size);
29886db1e29SJens Axboe 
29986db1e29SJens Axboe /**
300e1defc4fSMartin K. Petersen  * blk_queue_logical_block_size - set logical block size for the queue
30186db1e29SJens Axboe  * @q:  the request queue for the device
302e1defc4fSMartin K. Petersen  * @size:  the logical block size, in bytes
30386db1e29SJens Axboe  *
30486db1e29SJens Axboe  * Description:
305e1defc4fSMartin K. Petersen  *   This should be set to the lowest possible block size that the
306e1defc4fSMartin K. Petersen  *   storage device can address.  The default of 512 covers most
307e1defc4fSMartin K. Petersen  *   hardware.
30886db1e29SJens Axboe  **/
309e1defc4fSMartin K. Petersen void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
31086db1e29SJens Axboe {
311025146e1SMartin K. Petersen 	q->limits.logical_block_size = size;
312c72758f3SMartin K. Petersen 
313c72758f3SMartin K. Petersen 	if (q->limits.physical_block_size < size)
314c72758f3SMartin K. Petersen 		q->limits.physical_block_size = size;
315c72758f3SMartin K. Petersen 
316c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.physical_block_size)
317c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.physical_block_size;
31886db1e29SJens Axboe }
319e1defc4fSMartin K. Petersen EXPORT_SYMBOL(blk_queue_logical_block_size);
32086db1e29SJens Axboe 
321c72758f3SMartin K. Petersen /**
322c72758f3SMartin K. Petersen  * blk_queue_physical_block_size - set physical block size for the queue
323c72758f3SMartin K. Petersen  * @q:  the request queue for the device
324c72758f3SMartin K. Petersen  * @size:  the physical block size, in bytes
325c72758f3SMartin K. Petersen  *
326c72758f3SMartin K. Petersen  * Description:
327c72758f3SMartin K. Petersen  *   This should be set to the lowest possible sector size that the
328c72758f3SMartin K. Petersen  *   hardware can operate on without reverting to read-modify-write
329c72758f3SMartin K. Petersen  *   operations.
330c72758f3SMartin K. Petersen  */
331c72758f3SMartin K. Petersen void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
332c72758f3SMartin K. Petersen {
333c72758f3SMartin K. Petersen 	q->limits.physical_block_size = size;
334c72758f3SMartin K. Petersen 
335c72758f3SMartin K. Petersen 	if (q->limits.physical_block_size < q->limits.logical_block_size)
336c72758f3SMartin K. Petersen 		q->limits.physical_block_size = q->limits.logical_block_size;
337c72758f3SMartin K. Petersen 
338c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.physical_block_size)
339c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.physical_block_size;
340c72758f3SMartin K. Petersen }
341c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_physical_block_size);
342c72758f3SMartin K. Petersen 
343c72758f3SMartin K. Petersen /**
344c72758f3SMartin K. Petersen  * blk_queue_alignment_offset - set physical block alignment offset
345c72758f3SMartin K. Petersen  * @q:	the request queue for the device
346*8ebf9756SRandy Dunlap  * @offset: alignment offset in bytes
347c72758f3SMartin K. Petersen  *
348c72758f3SMartin K. Petersen  * Description:
349c72758f3SMartin K. Petersen  *   Some devices are naturally misaligned to compensate for things like
350c72758f3SMartin K. Petersen  *   the legacy DOS partition table 63-sector offset.  Low-level drivers
351c72758f3SMartin K. Petersen  *   should call this function for devices whose first sector is not
352c72758f3SMartin K. Petersen  *   naturally aligned.
353c72758f3SMartin K. Petersen  */
354c72758f3SMartin K. Petersen void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
355c72758f3SMartin K. Petersen {
356c72758f3SMartin K. Petersen 	q->limits.alignment_offset =
357c72758f3SMartin K. Petersen 		offset & (q->limits.physical_block_size - 1);
358c72758f3SMartin K. Petersen 	q->limits.misaligned = 0;
359c72758f3SMartin K. Petersen }
360c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_alignment_offset);
361c72758f3SMartin K. Petersen 
362c72758f3SMartin K. Petersen /**
363c72758f3SMartin K. Petersen  * blk_queue_io_min - set minimum request size for the queue
364c72758f3SMartin K. Petersen  * @q:	the request queue for the device
365*8ebf9756SRandy Dunlap  * @min:  smallest I/O size in bytes
366c72758f3SMartin K. Petersen  *
367c72758f3SMartin K. Petersen  * Description:
368c72758f3SMartin K. Petersen  *   Some devices have an internal block size bigger than the reported
369c72758f3SMartin K. Petersen  *   hardware sector size.  This function can be used to signal the
370c72758f3SMartin K. Petersen  *   smallest I/O the device can perform without incurring a performance
371c72758f3SMartin K. Petersen  *   penalty.
372c72758f3SMartin K. Petersen  */
373c72758f3SMartin K. Petersen void blk_queue_io_min(struct request_queue *q, unsigned int min)
374c72758f3SMartin K. Petersen {
375c72758f3SMartin K. Petersen 	q->limits.io_min = min;
376c72758f3SMartin K. Petersen 
377c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.logical_block_size)
378c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.logical_block_size;
379c72758f3SMartin K. Petersen 
380c72758f3SMartin K. Petersen 	if (q->limits.io_min < q->limits.physical_block_size)
381c72758f3SMartin K. Petersen 		q->limits.io_min = q->limits.physical_block_size;
382c72758f3SMartin K. Petersen }
383c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_io_min);
384c72758f3SMartin K. Petersen 
385c72758f3SMartin K. Petersen /**
386c72758f3SMartin K. Petersen  * blk_queue_io_opt - set optimal request size for the queue
387c72758f3SMartin K. Petersen  * @q:	the request queue for the device
388*8ebf9756SRandy Dunlap  * @opt:  optimal request size in bytes
389c72758f3SMartin K. Petersen  *
390c72758f3SMartin K. Petersen  * Description:
391c72758f3SMartin K. Petersen  *   Drivers can call this function to set the preferred I/O request
392c72758f3SMartin K. Petersen  *   size for devices that report such a value.
393c72758f3SMartin K. Petersen  */
394c72758f3SMartin K. Petersen void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
395c72758f3SMartin K. Petersen {
396c72758f3SMartin K. Petersen 	q->limits.io_opt = opt;
397c72758f3SMartin K. Petersen }
398c72758f3SMartin K. Petersen EXPORT_SYMBOL(blk_queue_io_opt);
399c72758f3SMartin K. Petersen 
40086db1e29SJens Axboe /*
40186db1e29SJens Axboe  * Returns the minimum that is _not_ zero, unless both are zero.
40286db1e29SJens Axboe  */
40386db1e29SJens Axboe #define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
40486db1e29SJens Axboe 
40586db1e29SJens Axboe /**
40686db1e29SJens Axboe  * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
40786db1e29SJens Axboe  * @t:	the stacking driver (top)
40886db1e29SJens Axboe  * @b:  the underlying device (bottom)
40986db1e29SJens Axboe  **/
41086db1e29SJens Axboe void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
41186db1e29SJens Axboe {
41286db1e29SJens Axboe 	/* zero is "infinity" */
413025146e1SMartin K. Petersen 	t->limits.max_sectors = min_not_zero(queue_max_sectors(t),
414025146e1SMartin K. Petersen 					     queue_max_sectors(b));
41586db1e29SJens Axboe 
416025146e1SMartin K. Petersen 	t->limits.max_hw_sectors = min_not_zero(queue_max_hw_sectors(t),
417025146e1SMartin K. Petersen 						queue_max_hw_sectors(b));
418025146e1SMartin K. Petersen 
419025146e1SMartin K. Petersen 	t->limits.seg_boundary_mask = min_not_zero(queue_segment_boundary(t),
420025146e1SMartin K. Petersen 						   queue_segment_boundary(b));
421025146e1SMartin K. Petersen 
422025146e1SMartin K. Petersen 	t->limits.max_phys_segments = min_not_zero(queue_max_phys_segments(t),
423025146e1SMartin K. Petersen 						   queue_max_phys_segments(b));
424025146e1SMartin K. Petersen 
425025146e1SMartin K. Petersen 	t->limits.max_hw_segments = min_not_zero(queue_max_hw_segments(t),
426025146e1SMartin K. Petersen 						 queue_max_hw_segments(b));
427025146e1SMartin K. Petersen 
428025146e1SMartin K. Petersen 	t->limits.max_segment_size = min_not_zero(queue_max_segment_size(t),
429025146e1SMartin K. Petersen 						  queue_max_segment_size(b));
430025146e1SMartin K. Petersen 
431025146e1SMartin K. Petersen 	t->limits.logical_block_size = max(queue_logical_block_size(t),
432025146e1SMartin K. Petersen 					   queue_logical_block_size(b));
433025146e1SMartin K. Petersen 
434e7e72bf6SNeil Brown 	if (!t->queue_lock)
435e7e72bf6SNeil Brown 		WARN_ON_ONCE(1);
436e7e72bf6SNeil Brown 	else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
437e7e72bf6SNeil Brown 		unsigned long flags;
438e7e72bf6SNeil Brown 		spin_lock_irqsave(t->queue_lock, flags);
43975ad23bcSNick Piggin 		queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
440e7e72bf6SNeil Brown 		spin_unlock_irqrestore(t->queue_lock, flags);
441e7e72bf6SNeil Brown 	}
44286db1e29SJens Axboe }
44386db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_stack_limits);
44486db1e29SJens Axboe 
44586db1e29SJens Axboe /**
446c72758f3SMartin K. Petersen  * blk_stack_limits - adjust queue_limits for stacked devices
447c72758f3SMartin K. Petersen  * @t:	the stacking driver limits (top)
44877634f33SMartin K. Petersen  * @b:  the underlying queue limits (bottom)
449c72758f3SMartin K. Petersen  * @offset:  offset to beginning of data within component device
450c72758f3SMartin K. Petersen  *
451c72758f3SMartin K. Petersen  * Description:
452c72758f3SMartin K. Petersen  *    Merges two queue_limit structs.  Returns 0 if alignment didn't
453c72758f3SMartin K. Petersen  *    change.  Returns -1 if adding the bottom device caused
454c72758f3SMartin K. Petersen  *    misalignment.
455c72758f3SMartin K. Petersen  */
456c72758f3SMartin K. Petersen int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
457c72758f3SMartin K. Petersen 		     sector_t offset)
458c72758f3SMartin K. Petersen {
459c72758f3SMartin K. Petersen 	t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
460c72758f3SMartin K. Petersen 	t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
46177634f33SMartin K. Petersen 	t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
462c72758f3SMartin K. Petersen 
463c72758f3SMartin K. Petersen 	t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
464c72758f3SMartin K. Petersen 					    b->seg_boundary_mask);
465c72758f3SMartin K. Petersen 
466c72758f3SMartin K. Petersen 	t->max_phys_segments = min_not_zero(t->max_phys_segments,
467c72758f3SMartin K. Petersen 					    b->max_phys_segments);
468c72758f3SMartin K. Petersen 
469c72758f3SMartin K. Petersen 	t->max_hw_segments = min_not_zero(t->max_hw_segments,
470c72758f3SMartin K. Petersen 					  b->max_hw_segments);
471c72758f3SMartin K. Petersen 
472c72758f3SMartin K. Petersen 	t->max_segment_size = min_not_zero(t->max_segment_size,
473c72758f3SMartin K. Petersen 					   b->max_segment_size);
474c72758f3SMartin K. Petersen 
475c72758f3SMartin K. Petersen 	t->logical_block_size = max(t->logical_block_size,
476c72758f3SMartin K. Petersen 				    b->logical_block_size);
477c72758f3SMartin K. Petersen 
478c72758f3SMartin K. Petersen 	t->physical_block_size = max(t->physical_block_size,
479c72758f3SMartin K. Petersen 				     b->physical_block_size);
480c72758f3SMartin K. Petersen 
481c72758f3SMartin K. Petersen 	t->io_min = max(t->io_min, b->io_min);
482c72758f3SMartin K. Petersen 	t->no_cluster |= b->no_cluster;
483c72758f3SMartin K. Petersen 
484c72758f3SMartin K. Petersen 	/* Bottom device offset aligned? */
485c72758f3SMartin K. Petersen 	if (offset &&
486c72758f3SMartin K. Petersen 	    (offset & (b->physical_block_size - 1)) != b->alignment_offset) {
487c72758f3SMartin K. Petersen 		t->misaligned = 1;
488c72758f3SMartin K. Petersen 		return -1;
489c72758f3SMartin K. Petersen 	}
490c72758f3SMartin K. Petersen 
491c72758f3SMartin K. Petersen 	/* If top has no alignment offset, inherit from bottom */
492c72758f3SMartin K. Petersen 	if (!t->alignment_offset)
493c72758f3SMartin K. Petersen 		t->alignment_offset =
494c72758f3SMartin K. Petersen 			b->alignment_offset & (b->physical_block_size - 1);
495c72758f3SMartin K. Petersen 
496c72758f3SMartin K. Petersen 	/* Top device aligned on logical block boundary? */
497c72758f3SMartin K. Petersen 	if (t->alignment_offset & (t->logical_block_size - 1)) {
498c72758f3SMartin K. Petersen 		t->misaligned = 1;
499c72758f3SMartin K. Petersen 		return -1;
500c72758f3SMartin K. Petersen 	}
501c72758f3SMartin K. Petersen 
502c72758f3SMartin K. Petersen 	return 0;
503c72758f3SMartin K. Petersen }
5045d85d324SMike Snitzer EXPORT_SYMBOL(blk_stack_limits);
505c72758f3SMartin K. Petersen 
506c72758f3SMartin K. Petersen /**
507c72758f3SMartin K. Petersen  * disk_stack_limits - adjust queue limits for stacked drivers
50877634f33SMartin K. Petersen  * @disk:  MD/DM gendisk (top)
509c72758f3SMartin K. Petersen  * @bdev:  the underlying block device (bottom)
510c72758f3SMartin K. Petersen  * @offset:  offset to beginning of data within component device
511c72758f3SMartin K. Petersen  *
512c72758f3SMartin K. Petersen  * Description:
513c72758f3SMartin K. Petersen  *    Merges the limits for two queues.  Returns 0 if alignment
514c72758f3SMartin K. Petersen  *    didn't change.  Returns -1 if adding the bottom device caused
515c72758f3SMartin K. Petersen  *    misalignment.
516c72758f3SMartin K. Petersen  */
517c72758f3SMartin K. Petersen void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
518c72758f3SMartin K. Petersen 		       sector_t offset)
519c72758f3SMartin K. Petersen {
520c72758f3SMartin K. Petersen 	struct request_queue *t = disk->queue;
521c72758f3SMartin K. Petersen 	struct request_queue *b = bdev_get_queue(bdev);
522c72758f3SMartin K. Petersen 
523c72758f3SMartin K. Petersen 	offset += get_start_sect(bdev) << 9;
524c72758f3SMartin K. Petersen 
525c72758f3SMartin K. Petersen 	if (blk_stack_limits(&t->limits, &b->limits, offset) < 0) {
526c72758f3SMartin K. Petersen 		char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
527c72758f3SMartin K. Petersen 
528c72758f3SMartin K. Petersen 		disk_name(disk, 0, top);
529c72758f3SMartin K. Petersen 		bdevname(bdev, bottom);
530c72758f3SMartin K. Petersen 
531c72758f3SMartin K. Petersen 		printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
532c72758f3SMartin K. Petersen 		       top, bottom);
533c72758f3SMartin K. Petersen 	}
534c72758f3SMartin K. Petersen 
535c72758f3SMartin K. Petersen 	if (!t->queue_lock)
536c72758f3SMartin K. Petersen 		WARN_ON_ONCE(1);
537c72758f3SMartin K. Petersen 	else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
538c72758f3SMartin K. Petersen 		unsigned long flags;
539c72758f3SMartin K. Petersen 
540c72758f3SMartin K. Petersen 		spin_lock_irqsave(t->queue_lock, flags);
541c72758f3SMartin K. Petersen 		if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
542c72758f3SMartin K. Petersen 			queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
543c72758f3SMartin K. Petersen 		spin_unlock_irqrestore(t->queue_lock, flags);
544c72758f3SMartin K. Petersen 	}
545c72758f3SMartin K. Petersen }
546c72758f3SMartin K. Petersen EXPORT_SYMBOL(disk_stack_limits);
547c72758f3SMartin K. Petersen 
548c72758f3SMartin K. Petersen /**
549e3790c7dSTejun Heo  * blk_queue_dma_pad - set pad mask
550e3790c7dSTejun Heo  * @q:     the request queue for the device
551e3790c7dSTejun Heo  * @mask:  pad mask
552e3790c7dSTejun Heo  *
55327f8221aSFUJITA Tomonori  * Set dma pad mask.
554e3790c7dSTejun Heo  *
55527f8221aSFUJITA Tomonori  * Appending pad buffer to a request modifies the last entry of a
55627f8221aSFUJITA Tomonori  * scatter list such that it includes the pad buffer.
557e3790c7dSTejun Heo  **/
558e3790c7dSTejun Heo void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
559e3790c7dSTejun Heo {
560e3790c7dSTejun Heo 	q->dma_pad_mask = mask;
561e3790c7dSTejun Heo }
562e3790c7dSTejun Heo EXPORT_SYMBOL(blk_queue_dma_pad);
563e3790c7dSTejun Heo 
564e3790c7dSTejun Heo /**
56527f8221aSFUJITA Tomonori  * blk_queue_update_dma_pad - update pad mask
56627f8221aSFUJITA Tomonori  * @q:     the request queue for the device
56727f8221aSFUJITA Tomonori  * @mask:  pad mask
56827f8221aSFUJITA Tomonori  *
56927f8221aSFUJITA Tomonori  * Update dma pad mask.
57027f8221aSFUJITA Tomonori  *
57127f8221aSFUJITA Tomonori  * Appending pad buffer to a request modifies the last entry of a
57227f8221aSFUJITA Tomonori  * scatter list such that it includes the pad buffer.
57327f8221aSFUJITA Tomonori  **/
57427f8221aSFUJITA Tomonori void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
57527f8221aSFUJITA Tomonori {
57627f8221aSFUJITA Tomonori 	if (mask > q->dma_pad_mask)
57727f8221aSFUJITA Tomonori 		q->dma_pad_mask = mask;
57827f8221aSFUJITA Tomonori }
57927f8221aSFUJITA Tomonori EXPORT_SYMBOL(blk_queue_update_dma_pad);
58027f8221aSFUJITA Tomonori 
58127f8221aSFUJITA Tomonori /**
58286db1e29SJens Axboe  * blk_queue_dma_drain - Set up a drain buffer for excess dma.
58386db1e29SJens Axboe  * @q:  the request queue for the device
5842fb98e84STejun Heo  * @dma_drain_needed: fn which returns non-zero if drain is necessary
58586db1e29SJens Axboe  * @buf:	physically contiguous buffer
58686db1e29SJens Axboe  * @size:	size of the buffer in bytes
58786db1e29SJens Axboe  *
58886db1e29SJens Axboe  * Some devices have excess DMA problems and can't simply discard (or
58986db1e29SJens Axboe  * zero fill) the unwanted piece of the transfer.  They have to have a
59086db1e29SJens Axboe  * real area of memory to transfer it into.  The use case for this is
59186db1e29SJens Axboe  * ATAPI devices in DMA mode.  If the packet command causes a transfer
59286db1e29SJens Axboe  * bigger than the transfer size some HBAs will lock up if there
59386db1e29SJens Axboe  * aren't DMA elements to contain the excess transfer.  What this API
59486db1e29SJens Axboe  * does is adjust the queue so that the buf is always appended
59586db1e29SJens Axboe  * silently to the scatterlist.
59686db1e29SJens Axboe  *
59786db1e29SJens Axboe  * Note: This routine adjusts max_hw_segments to make room for
59886db1e29SJens Axboe  * appending the drain buffer.  If you call
59986db1e29SJens Axboe  * blk_queue_max_hw_segments() or blk_queue_max_phys_segments() after
60086db1e29SJens Axboe  * calling this routine, you must set the limit to one fewer than your
60186db1e29SJens Axboe  * device can support otherwise there won't be room for the drain
60286db1e29SJens Axboe  * buffer.
60386db1e29SJens Axboe  */
604448da4d2SHarvey Harrison int blk_queue_dma_drain(struct request_queue *q,
6052fb98e84STejun Heo 			       dma_drain_needed_fn *dma_drain_needed,
6062fb98e84STejun Heo 			       void *buf, unsigned int size)
60786db1e29SJens Axboe {
608ae03bf63SMartin K. Petersen 	if (queue_max_hw_segments(q) < 2 || queue_max_phys_segments(q) < 2)
60986db1e29SJens Axboe 		return -EINVAL;
61086db1e29SJens Axboe 	/* make room for appending the drain */
611ae03bf63SMartin K. Petersen 	blk_queue_max_hw_segments(q, queue_max_hw_segments(q) - 1);
612ae03bf63SMartin K. Petersen 	blk_queue_max_phys_segments(q, queue_max_phys_segments(q) - 1);
6132fb98e84STejun Heo 	q->dma_drain_needed = dma_drain_needed;
61486db1e29SJens Axboe 	q->dma_drain_buffer = buf;
61586db1e29SJens Axboe 	q->dma_drain_size = size;
61686db1e29SJens Axboe 
61786db1e29SJens Axboe 	return 0;
61886db1e29SJens Axboe }
61986db1e29SJens Axboe EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
62086db1e29SJens Axboe 
62186db1e29SJens Axboe /**
62286db1e29SJens Axboe  * blk_queue_segment_boundary - set boundary rules for segment merging
62386db1e29SJens Axboe  * @q:  the request queue for the device
62486db1e29SJens Axboe  * @mask:  the memory boundary mask
62586db1e29SJens Axboe  **/
62686db1e29SJens Axboe void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
62786db1e29SJens Axboe {
62886db1e29SJens Axboe 	if (mask < PAGE_CACHE_SIZE - 1) {
62986db1e29SJens Axboe 		mask = PAGE_CACHE_SIZE - 1;
63024c03d47SHarvey Harrison 		printk(KERN_INFO "%s: set to minimum %lx\n",
63124c03d47SHarvey Harrison 		       __func__, mask);
63286db1e29SJens Axboe 	}
63386db1e29SJens Axboe 
634025146e1SMartin K. Petersen 	q->limits.seg_boundary_mask = mask;
63586db1e29SJens Axboe }
63686db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_segment_boundary);
63786db1e29SJens Axboe 
63886db1e29SJens Axboe /**
63986db1e29SJens Axboe  * blk_queue_dma_alignment - set dma length and memory alignment
64086db1e29SJens Axboe  * @q:     the request queue for the device
64186db1e29SJens Axboe  * @mask:  alignment mask
64286db1e29SJens Axboe  *
64386db1e29SJens Axboe  * description:
644710027a4SRandy Dunlap  *    set required memory and length alignment for direct dma transactions.
6458feb4d20SAlan Cox  *    this is used when building direct io requests for the queue.
64686db1e29SJens Axboe  *
64786db1e29SJens Axboe  **/
64886db1e29SJens Axboe void blk_queue_dma_alignment(struct request_queue *q, int mask)
64986db1e29SJens Axboe {
65086db1e29SJens Axboe 	q->dma_alignment = mask;
65186db1e29SJens Axboe }
65286db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_dma_alignment);
65386db1e29SJens Axboe 
65486db1e29SJens Axboe /**
65586db1e29SJens Axboe  * blk_queue_update_dma_alignment - update dma length and memory alignment
65686db1e29SJens Axboe  * @q:     the request queue for the device
65786db1e29SJens Axboe  * @mask:  alignment mask
65886db1e29SJens Axboe  *
65986db1e29SJens Axboe  * description:
660710027a4SRandy Dunlap  *    update required memory and length alignment for direct dma transactions.
66186db1e29SJens Axboe  *    If the requested alignment is larger than the current alignment, then
66286db1e29SJens Axboe  *    the current queue alignment is updated to the new value, otherwise it
66386db1e29SJens Axboe  *    is left alone.  The design of this is to allow multiple objects
66486db1e29SJens Axboe  *    (driver, device, transport etc) to set their respective
66586db1e29SJens Axboe  *    alignments without having them interfere.
66686db1e29SJens Axboe  *
66786db1e29SJens Axboe  **/
66886db1e29SJens Axboe void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
66986db1e29SJens Axboe {
67086db1e29SJens Axboe 	BUG_ON(mask > PAGE_SIZE);
67186db1e29SJens Axboe 
67286db1e29SJens Axboe 	if (mask > q->dma_alignment)
67386db1e29SJens Axboe 		q->dma_alignment = mask;
67486db1e29SJens Axboe }
67586db1e29SJens Axboe EXPORT_SYMBOL(blk_queue_update_dma_alignment);
67686db1e29SJens Axboe 
677aeb3d3a8SHarvey Harrison static int __init blk_settings_init(void)
67886db1e29SJens Axboe {
67986db1e29SJens Axboe 	blk_max_low_pfn = max_low_pfn - 1;
68086db1e29SJens Axboe 	blk_max_pfn = max_pfn - 1;
68186db1e29SJens Axboe 	return 0;
68286db1e29SJens Axboe }
68386db1e29SJens Axboe subsys_initcall(blk_settings_init);
684