blk-settings.c 26.5 KB
Newer Older
J
Jens Axboe 已提交
1 2 3 4 5 6 7 8 9
/*
 * Functions related to setting various queue properties from drivers
 */
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/init.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
#include <linux/bootmem.h>	/* for max_pfn/max_low_pfn */
10
#include <linux/gcd.h>
11
#include <linux/lcm.h>
R
Randy Dunlap 已提交
12
#include <linux/jiffies.h>
13
#include <linux/gfp.h>
J
Jens Axboe 已提交
14 15 16

#include "blk.h"

17
unsigned long blk_max_low_pfn;
J
Jens Axboe 已提交
18
EXPORT_SYMBOL(blk_max_low_pfn);
19 20

unsigned long blk_max_pfn;
J
Jens Axboe 已提交
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

/**
 * blk_queue_prep_rq - set a prepare_request function for queue
 * @q:		queue
 * @pfn:	prepare_request function
 *
 * It's possible for a queue to register a prepare_request callback which
 * is invoked before the request is handed to the request_fn. The goal of
 * the function is to prepare a request for I/O, it can be used to build a
 * cdb from the request data for instance.
 *
 */
void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
{
	q->prep_rq_fn = pfn;
}
EXPORT_SYMBOL(blk_queue_prep_rq);

39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
/**
 * blk_queue_unprep_rq - set an unprepare_request function for queue
 * @q:		queue
 * @ufn:	unprepare_request function
 *
 * It's possible for a queue to register an unprepare_request callback
 * which is invoked before the request is finally completed. The goal
 * of the function is to deallocate any data that was allocated in the
 * prepare_request callback.
 *
 */
void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
{
	q->unprep_rq_fn = ufn;
}
EXPORT_SYMBOL(blk_queue_unprep_rq);

J
Jens Axboe 已提交
56 57 58 59 60 61
void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
{
	q->softirq_done_fn = fn;
}
EXPORT_SYMBOL(blk_queue_softirq_done);

J
Jens Axboe 已提交
62 63 64 65 66 67 68 69 70 71 72 73
void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
{
	q->rq_timeout = timeout;
}
EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);

void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
{
	q->rq_timed_out_fn = fn;
}
EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);

74 75 76 77 78 79
void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
{
	q->lld_busy_fn = fn;
}
EXPORT_SYMBOL_GPL(blk_queue_lld_busy);

80 81
/**
 * blk_set_default_limits - reset limits to default values
82
 * @lim:  the queue_limits structure to reset
83 84
 *
 * Description:
85
 *   Returns a queue_limit struct to its default state.
86 87 88
 */
void blk_set_default_limits(struct queue_limits *lim)
{
89
	lim->max_segments = BLK_MAX_SEGMENTS;
90
	lim->max_integrity_segments = 0;
91
	lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
92
	lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
93
	lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
94
	lim->chunk_sectors = 0;
95
	lim->max_write_same_sectors = 0;
96
	lim->max_discard_sectors = 0;
97
	lim->max_hw_discard_sectors = 0;
98 99 100
	lim->discard_granularity = 0;
	lim->discard_alignment = 0;
	lim->discard_misaligned = 0;
101
	lim->discard_zeroes_data = 0;
102
	lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
103
	lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
104 105 106
	lim->alignment_offset = 0;
	lim->io_opt = 0;
	lim->misaligned = 0;
107
	lim->cluster = 1;
108 109 110
}
EXPORT_SYMBOL(blk_set_default_limits);

111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
/**
 * blk_set_stacking_limits - set default limits for stacking devices
 * @lim:  the queue_limits structure to reset
 *
 * Description:
 *   Returns a queue_limit struct to its default state. Should be used
 *   by stacking drivers like DM that have no internal limits.
 */
void blk_set_stacking_limits(struct queue_limits *lim)
{
	blk_set_default_limits(lim);

	/* Inherit limits from component devices */
	lim->discard_zeroes_data = 1;
	lim->max_segments = USHRT_MAX;
	lim->max_hw_sectors = UINT_MAX;
127
	lim->max_segment_size = UINT_MAX;
128
	lim->max_sectors = UINT_MAX;
129
	lim->max_write_same_sectors = UINT_MAX;
130 131 132
}
EXPORT_SYMBOL(blk_set_stacking_limits);

J
Jens Axboe 已提交
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154
/**
 * blk_queue_make_request - define an alternate make_request function for a device
 * @q:  the request queue for the device to be affected
 * @mfn: the alternate make_request function
 *
 * Description:
 *    The normal way for &struct bios to be passed to a device
 *    driver is for them to be collected into requests on a request
 *    queue, and then to allow the device driver to select requests
 *    off that queue when it is ready.  This works well for many block
 *    devices. However some block devices (typically virtual devices
 *    such as md or lvm) do not benefit from the processing on the
 *    request queue, and are served best by having the requests passed
 *    directly to them.  This can be achieved by providing a function
 *    to blk_queue_make_request().
 *
 * Caveat:
 *    The driver that does this *must* be able to deal appropriately
 *    with buffers in "highmemory". This can be accomplished by either calling
 *    __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
 *    blk_queue_bounce() to create a buffer in normal memory.
 **/
155
void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
J
Jens Axboe 已提交
156 157 158 159 160
{
	/*
	 * set defaults
	 */
	q->nr_requests = BLKDEV_MAX_RQ;
161

J
Jens Axboe 已提交
162 163 164 165 166
	q->make_request_fn = mfn;
	blk_queue_dma_alignment(q, 511);
	blk_queue_congestion_threshold(q);
	q->nr_batching = BLK_BATCH_REQ;

167 168
	blk_set_default_limits(&q->limits);

J
Jens Axboe 已提交
169 170 171 172 173 174 175 176 177
	/*
	 * by default assume old behaviour and bounce for any highmem page
	 */
	blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
}
EXPORT_SYMBOL(blk_queue_make_request);

/**
 * blk_queue_bounce_limit - set bounce buffer limit for queue
178
 * @q: the request queue for the device
179
 * @max_addr: the maximum address the device can handle
J
Jens Axboe 已提交
180 181 182 183 184
 *
 * Description:
 *    Different hardware can have different requirements as to what pages
 *    it can do I/O directly to. A low level driver can call
 *    blk_queue_bounce_limit to have lower memory pages allocated as bounce
185
 *    buffers for doing I/O to pages residing above @max_addr.
J
Jens Axboe 已提交
186
 **/
187
void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr)
J
Jens Axboe 已提交
188
{
189
	unsigned long b_pfn = max_addr >> PAGE_SHIFT;
J
Jens Axboe 已提交
190 191 192 193
	int dma = 0;

	q->bounce_gfp = GFP_NOIO;
#if BITS_PER_LONG == 64
194 195 196 197 198 199
	/*
	 * Assume anything <= 4GB can be handled by IOMMU.  Actually
	 * some IOMMUs can handle everything, but I don't know of a
	 * way to test this here.
	 */
	if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
J
Jens Axboe 已提交
200
		dma = 1;
201
	q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
J
Jens Axboe 已提交
202
#else
203
	if (b_pfn < blk_max_low_pfn)
J
Jens Axboe 已提交
204
		dma = 1;
205
	q->limits.bounce_pfn = b_pfn;
206
#endif
J
Jens Axboe 已提交
207 208 209
	if (dma) {
		init_emergency_isa_pool();
		q->bounce_gfp = GFP_NOIO | GFP_DMA;
210
		q->limits.bounce_pfn = b_pfn;
J
Jens Axboe 已提交
211 212 213 214 215
	}
}
EXPORT_SYMBOL(blk_queue_bounce_limit);

/**
216 217
 * blk_limits_max_hw_sectors - set hard and soft limit of max sectors for request
 * @limits: the queue limits
218
 * @max_hw_sectors:  max hardware sectors in the usual 512b unit
J
Jens Axboe 已提交
219 220
 *
 * Description:
221 222 223 224 225 226 227 228 229
 *    Enables a low level driver to set a hard upper limit,
 *    max_hw_sectors, on the size of requests.  max_hw_sectors is set by
 *    the device driver based upon the combined capabilities of I/O
 *    controller and storage device.
 *
 *    max_sectors is a soft limit imposed by the block layer for
 *    filesystem type requests.  This value can be overridden on a
 *    per-device basis in /sys/block/<device>/queue/max_sectors_kb.
 *    The soft limit can not exceed max_hw_sectors.
J
Jens Axboe 已提交
230
 **/
231
void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
J
Jens Axboe 已提交
232
{
233 234
	if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
		max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
235
		printk(KERN_INFO "%s: set to minimum %d\n",
236
		       __func__, max_hw_sectors);
J
Jens Axboe 已提交
237 238
	}

239
	limits->max_sectors = limits->max_hw_sectors = max_hw_sectors;
240 241 242 243 244 245 246 247 248 249 250 251 252 253
}
EXPORT_SYMBOL(blk_limits_max_hw_sectors);

/**
 * blk_queue_max_hw_sectors - set max sectors for a request for this queue
 * @q:  the request queue for the device
 * @max_hw_sectors:  max hardware sectors in the usual 512b unit
 *
 * Description:
 *    See description for blk_limits_max_hw_sectors().
 **/
void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
{
	blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
J
Jens Axboe 已提交
254
}
255
EXPORT_SYMBOL(blk_queue_max_hw_sectors);
J
Jens Axboe 已提交
256

257 258 259 260 261 262 263 264
/**
 * blk_queue_chunk_sectors - set size of the chunk for this queue
 * @q:  the request queue for the device
 * @chunk_sectors:  chunk sectors in the usual 512b unit
 *
 * Description:
 *    If a driver doesn't want IOs to cross a given chunk size, it can set
 *    this limit and prevent merging across chunks. Note that the chunk size
265 266 267 268
 *    must currently be a power-of-2 in sectors. Also note that the block
 *    layer must accept a page worth of data at any offset. So if the
 *    crossing of chunks is a hard limitation in the driver, it must still be
 *    prepared to split single page bios.
269 270 271 272 273 274 275 276
 **/
void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
{
	BUG_ON(!is_power_of_2(chunk_sectors));
	q->limits.chunk_sectors = chunk_sectors;
}
EXPORT_SYMBOL(blk_queue_chunk_sectors);

277 278 279
/**
 * blk_queue_max_discard_sectors - set max sectors for a single discard
 * @q:  the request queue for the device
280
 * @max_discard_sectors: maximum number of sectors to discard
281 282 283 284
 **/
void blk_queue_max_discard_sectors(struct request_queue *q,
		unsigned int max_discard_sectors)
{
285
	q->limits.max_hw_discard_sectors = max_discard_sectors;
286 287 288 289
	q->limits.max_discard_sectors = max_discard_sectors;
}
EXPORT_SYMBOL(blk_queue_max_discard_sectors);

290 291 292 293 294 295 296 297 298 299 300 301
/**
 * blk_queue_max_write_same_sectors - set max sectors for a single write same
 * @q:  the request queue for the device
 * @max_write_same_sectors: maximum number of sectors to write per command
 **/
void blk_queue_max_write_same_sectors(struct request_queue *q,
				      unsigned int max_write_same_sectors)
{
	q->limits.max_write_same_sectors = max_write_same_sectors;
}
EXPORT_SYMBOL(blk_queue_max_write_same_sectors);

J
Jens Axboe 已提交
302
/**
303
 * blk_queue_max_segments - set max hw segments for a request for this queue
J
Jens Axboe 已提交
304 305 306 307 308
 * @q:  the request queue for the device
 * @max_segments:  max number of segments
 *
 * Description:
 *    Enables a low level driver to set an upper limit on the number of
309
 *    hw data segments in a request.
J
Jens Axboe 已提交
310
 **/
311
void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
J
Jens Axboe 已提交
312 313 314
{
	if (!max_segments) {
		max_segments = 1;
315 316
		printk(KERN_INFO "%s: set to minimum %d\n",
		       __func__, max_segments);
J
Jens Axboe 已提交
317 318
	}

319
	q->limits.max_segments = max_segments;
J
Jens Axboe 已提交
320
}
321
EXPORT_SYMBOL(blk_queue_max_segments);
J
Jens Axboe 已提交
322 323 324 325 326 327 328 329 330 331 332 333 334 335

/**
 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
 * @q:  the request queue for the device
 * @max_size:  max size of segment in bytes
 *
 * Description:
 *    Enables a low level driver to set an upper limit on the size of a
 *    coalesced segment
 **/
void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
{
	if (max_size < PAGE_CACHE_SIZE) {
		max_size = PAGE_CACHE_SIZE;
336 337
		printk(KERN_INFO "%s: set to minimum %d\n",
		       __func__, max_size);
J
Jens Axboe 已提交
338 339
	}

340
	q->limits.max_segment_size = max_size;
J
Jens Axboe 已提交
341 342 343 344
}
EXPORT_SYMBOL(blk_queue_max_segment_size);

/**
345
 * blk_queue_logical_block_size - set logical block size for the queue
J
Jens Axboe 已提交
346
 * @q:  the request queue for the device
347
 * @size:  the logical block size, in bytes
J
Jens Axboe 已提交
348 349
 *
 * Description:
350 351 352
 *   This should be set to the lowest possible block size that the
 *   storage device can address.  The default of 512 covers most
 *   hardware.
J
Jens Axboe 已提交
353
 **/
354
void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
J
Jens Axboe 已提交
355
{
356
	q->limits.logical_block_size = size;
357 358 359 360 361 362

	if (q->limits.physical_block_size < size)
		q->limits.physical_block_size = size;

	if (q->limits.io_min < q->limits.physical_block_size)
		q->limits.io_min = q->limits.physical_block_size;
J
Jens Axboe 已提交
363
}
364
EXPORT_SYMBOL(blk_queue_logical_block_size);
J
Jens Axboe 已提交
365

366 367 368 369 370 371 372 373 374 375
/**
 * blk_queue_physical_block_size - set physical block size for the queue
 * @q:  the request queue for the device
 * @size:  the physical block size, in bytes
 *
 * Description:
 *   This should be set to the lowest possible sector size that the
 *   hardware can operate on without reverting to read-modify-write
 *   operations.
 */
376
void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
377 378 379 380 381 382 383 384 385 386 387 388 389 390
{
	q->limits.physical_block_size = size;

	if (q->limits.physical_block_size < q->limits.logical_block_size)
		q->limits.physical_block_size = q->limits.logical_block_size;

	if (q->limits.io_min < q->limits.physical_block_size)
		q->limits.io_min = q->limits.physical_block_size;
}
EXPORT_SYMBOL(blk_queue_physical_block_size);

/**
 * blk_queue_alignment_offset - set physical block alignment offset
 * @q:	the request queue for the device
391
 * @offset: alignment offset in bytes
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
 *
 * Description:
 *   Some devices are naturally misaligned to compensate for things like
 *   the legacy DOS partition table 63-sector offset.  Low-level drivers
 *   should call this function for devices whose first sector is not
 *   naturally aligned.
 */
void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
{
	q->limits.alignment_offset =
		offset & (q->limits.physical_block_size - 1);
	q->limits.misaligned = 0;
}
EXPORT_SYMBOL(blk_queue_alignment_offset);

407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
/**
 * blk_limits_io_min - set minimum request size for a device
 * @limits: the queue limits
 * @min:  smallest I/O size in bytes
 *
 * Description:
 *   Some devices have an internal block size bigger than the reported
 *   hardware sector size.  This function can be used to signal the
 *   smallest I/O the device can perform without incurring a performance
 *   penalty.
 */
void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
{
	limits->io_min = min;

	if (limits->io_min < limits->logical_block_size)
		limits->io_min = limits->logical_block_size;

	if (limits->io_min < limits->physical_block_size)
		limits->io_min = limits->physical_block_size;
}
EXPORT_SYMBOL(blk_limits_io_min);

430 431 432
/**
 * blk_queue_io_min - set minimum request size for the queue
 * @q:	the request queue for the device
433
 * @min:  smallest I/O size in bytes
434 435
 *
 * Description:
436 437 438 439 440 441 442
 *   Storage devices may report a granularity or preferred minimum I/O
 *   size which is the smallest request the device can perform without
 *   incurring a performance penalty.  For disk drives this is often the
 *   physical block size.  For RAID arrays it is often the stripe chunk
 *   size.  A properly aligned multiple of minimum_io_size is the
 *   preferred request size for workloads where a high number of I/O
 *   operations is desired.
443 444 445
 */
void blk_queue_io_min(struct request_queue *q, unsigned int min)
{
446
	blk_limits_io_min(&q->limits, min);
447 448 449
}
EXPORT_SYMBOL(blk_queue_io_min);

450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468
/**
 * blk_limits_io_opt - set optimal request size for a device
 * @limits: the queue limits
 * @opt:  smallest I/O size in bytes
 *
 * Description:
 *   Storage devices may report an optimal I/O size, which is the
 *   device's preferred unit for sustained I/O.  This is rarely reported
 *   for disk drives.  For RAID arrays it is usually the stripe width or
 *   the internal track size.  A properly aligned multiple of
 *   optimal_io_size is the preferred request size for workloads where
 *   sustained throughput is desired.
 */
void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
{
	limits->io_opt = opt;
}
EXPORT_SYMBOL(blk_limits_io_opt);

469 470 471
/**
 * blk_queue_io_opt - set optimal request size for the queue
 * @q:	the request queue for the device
472
 * @opt:  optimal request size in bytes
473 474
 *
 * Description:
475 476 477 478 479 480
 *   Storage devices may report an optimal I/O size, which is the
 *   device's preferred unit for sustained I/O.  This is rarely reported
 *   for disk drives.  For RAID arrays it is usually the stripe width or
 *   the internal track size.  A properly aligned multiple of
 *   optimal_io_size is the preferred request size for workloads where
 *   sustained throughput is desired.
481 482 483
 */
void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
{
484
	blk_limits_io_opt(&q->limits, opt);
485 486 487
}
EXPORT_SYMBOL(blk_queue_io_opt);

J
Jens Axboe 已提交
488 489 490 491 492 493 494
/**
 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
 * @t:	the stacking driver (top)
 * @b:  the underlying device (bottom)
 **/
void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
{
495
	blk_stack_limits(&t->limits, &b->limits, 0);
J
Jens Axboe 已提交
496 497 498
}
EXPORT_SYMBOL(blk_queue_stack_limits);

499 500
/**
 * blk_stack_limits - adjust queue_limits for stacked devices
501 502
 * @t:	the stacking driver limits (top device)
 * @b:  the underlying queue limits (bottom, component device)
503
 * @start:  first data sector within component device
504 505
 *
 * Description:
506 507 508 509 510 511 512 513 514 515 516 517 518
 *    This function is used by stacking drivers like MD and DM to ensure
 *    that all component devices have compatible block sizes and
 *    alignments.  The stacking driver must provide a queue_limits
 *    struct (top) and then iteratively call the stacking function for
 *    all component (bottom) devices.  The stacking function will
 *    attempt to combine the values and ensure proper alignment.
 *
 *    Returns 0 if the top and bottom queue_limits are compatible.  The
 *    top device's block sizes and alignment offsets may be adjusted to
 *    ensure alignment with the bottom device. If no compatible sizes
 *    and alignments exist, -1 is returned and the resulting top
 *    queue_limits will have the misaligned flag set to indicate that
 *    the alignment_offset is undefined.
519 520
 */
int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
521
		     sector_t start)
522
{
523
	unsigned int top, bottom, alignment, ret = 0;
524

525 526
	t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
	t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
527 528
	t->max_write_same_sectors = min(t->max_write_same_sectors,
					b->max_write_same_sectors);
529
	t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
530 531 532 533

	t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
					    b->seg_boundary_mask);

534
	t->max_segments = min_not_zero(t->max_segments, b->max_segments);
535 536
	t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
						 b->max_integrity_segments);
537 538 539 540

	t->max_segment_size = min_not_zero(t->max_segment_size,
					   b->max_segment_size);

541 542
	t->misaligned |= b->misaligned;

543
	alignment = queue_limit_alignment_offset(b, start);
544

545 546 547
	/* Bottom device has different alignment.  Check that it is
	 * compatible with the current top alignment.
	 */
548 549 550 551
	if (t->alignment_offset != alignment) {

		top = max(t->physical_block_size, t->io_min)
			+ t->alignment_offset;
552
		bottom = max(b->physical_block_size, b->io_min) + alignment;
553

554
		/* Verify that top and bottom intervals line up */
555
		if (max(top, bottom) % min(top, bottom)) {
556
			t->misaligned = 1;
557 558
			ret = -1;
		}
559 560
	}

561 562 563 564 565 566 567
	t->logical_block_size = max(t->logical_block_size,
				    b->logical_block_size);

	t->physical_block_size = max(t->physical_block_size,
				     b->physical_block_size);

	t->io_min = max(t->io_min, b->io_min);
568
	t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
569

570
	t->cluster &= b->cluster;
571
	t->discard_zeroes_data &= b->discard_zeroes_data;
572

573
	/* Physical block size a multiple of the logical block size? */
574 575
	if (t->physical_block_size & (t->logical_block_size - 1)) {
		t->physical_block_size = t->logical_block_size;
576
		t->misaligned = 1;
577
		ret = -1;
578 579
	}

580
	/* Minimum I/O a multiple of the physical block size? */
581 582 583
	if (t->io_min & (t->physical_block_size - 1)) {
		t->io_min = t->physical_block_size;
		t->misaligned = 1;
584
		ret = -1;
585 586
	}

587
	/* Optimal I/O a multiple of the physical block size? */
588 589 590
	if (t->io_opt & (t->physical_block_size - 1)) {
		t->io_opt = 0;
		t->misaligned = 1;
591
		ret = -1;
592
	}
593

594 595 596 597
	t->raid_partial_stripes_expensive =
		max(t->raid_partial_stripes_expensive,
		    b->raid_partial_stripes_expensive);

598
	/* Find lowest common alignment_offset */
599
	t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
600
		% max(t->physical_block_size, t->io_min);
601

602
	/* Verify that new alignment_offset is on a logical block boundary */
603
	if (t->alignment_offset & (t->logical_block_size - 1)) {
604
		t->misaligned = 1;
605 606
		ret = -1;
	}
607

608 609
	/* Discard alignment and granularity */
	if (b->discard_granularity) {
610
		alignment = queue_limit_discard_alignment(b, start);
611 612 613 614 615

		if (t->discard_granularity != 0 &&
		    t->discard_alignment != alignment) {
			top = t->discard_granularity + t->discard_alignment;
			bottom = b->discard_granularity + alignment;
616

617
			/* Verify that top and bottom intervals line up */
618
			if ((max(top, bottom) % min(top, bottom)) != 0)
619 620 621
				t->discard_misaligned = 1;
		}

622 623
		t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
						      b->max_discard_sectors);
624 625
		t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
							 b->max_hw_discard_sectors);
626 627
		t->discard_granularity = max(t->discard_granularity,
					     b->discard_granularity);
628
		t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
629
			t->discard_granularity;
630
	}
631

632
	return ret;
633
}
M
Mike Snitzer 已提交
634
EXPORT_SYMBOL(blk_stack_limits);
635

636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653
/**
 * bdev_stack_limits - adjust queue limits for stacked drivers
 * @t:	the stacking driver limits (top device)
 * @bdev:  the component block_device (bottom)
 * @start:  first data sector within component device
 *
 * Description:
 *    Merges queue limits for a top device and a block_device.  Returns
 *    0 if alignment didn't change.  Returns -1 if adding the bottom
 *    device caused misalignment.
 */
int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
		      sector_t start)
{
	struct request_queue *bq = bdev_get_queue(bdev);

	start += get_start_sect(bdev);

654
	return blk_stack_limits(t, &bq->limits, start);
655 656 657
}
EXPORT_SYMBOL(bdev_stack_limits);

658 659
/**
 * disk_stack_limits - adjust queue limits for stacked drivers
660
 * @disk:  MD/DM gendisk (top)
661 662 663 664
 * @bdev:  the underlying block device (bottom)
 * @offset:  offset to beginning of data within component device
 *
 * Description:
665 666
 *    Merges the limits for a top level gendisk and a bottom level
 *    block_device.
667 668 669 670 671 672
 */
void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
		       sector_t offset)
{
	struct request_queue *t = disk->queue;

673
	if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
674 675 676 677 678 679 680 681 682 683 684
		char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];

		disk_name(disk, 0, top);
		bdevname(bdev, bottom);

		printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
		       top, bottom);
	}
}
EXPORT_SYMBOL(disk_stack_limits);

685 686 687 688 689
/**
 * blk_queue_dma_pad - set pad mask
 * @q:     the request queue for the device
 * @mask:  pad mask
 *
690
 * Set dma pad mask.
691
 *
692 693
 * Appending pad buffer to a request modifies the last entry of a
 * scatter list such that it includes the pad buffer.
694 695 696 697 698 699 700
 **/
void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
{
	q->dma_pad_mask = mask;
}
EXPORT_SYMBOL(blk_queue_dma_pad);

701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717
/**
 * blk_queue_update_dma_pad - update pad mask
 * @q:     the request queue for the device
 * @mask:  pad mask
 *
 * Update dma pad mask.
 *
 * Appending pad buffer to a request modifies the last entry of a
 * scatter list such that it includes the pad buffer.
 **/
void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
{
	if (mask > q->dma_pad_mask)
		q->dma_pad_mask = mask;
}
EXPORT_SYMBOL(blk_queue_update_dma_pad);

J
Jens Axboe 已提交
718 719 720
/**
 * blk_queue_dma_drain - Set up a drain buffer for excess dma.
 * @q:  the request queue for the device
721
 * @dma_drain_needed: fn which returns non-zero if drain is necessary
J
Jens Axboe 已提交
722 723 724 725 726 727 728 729 730 731 732 733
 * @buf:	physically contiguous buffer
 * @size:	size of the buffer in bytes
 *
 * Some devices have excess DMA problems and can't simply discard (or
 * zero fill) the unwanted piece of the transfer.  They have to have a
 * real area of memory to transfer it into.  The use case for this is
 * ATAPI devices in DMA mode.  If the packet command causes a transfer
 * bigger than the transfer size some HBAs will lock up if there
 * aren't DMA elements to contain the excess transfer.  What this API
 * does is adjust the queue so that the buf is always appended
 * silently to the scatterlist.
 *
734 735 736 737
 * Note: This routine adjusts max_hw_segments to make room for appending
 * the drain buffer.  If you call blk_queue_max_segments() after calling
 * this routine, you must set the limit to one fewer than your device
 * can support otherwise there won't be room for the drain buffer.
J
Jens Axboe 已提交
738
 */
739
int blk_queue_dma_drain(struct request_queue *q,
740 741
			       dma_drain_needed_fn *dma_drain_needed,
			       void *buf, unsigned int size)
J
Jens Axboe 已提交
742
{
743
	if (queue_max_segments(q) < 2)
J
Jens Axboe 已提交
744 745
		return -EINVAL;
	/* make room for appending the drain */
746
	blk_queue_max_segments(q, queue_max_segments(q) - 1);
747
	q->dma_drain_needed = dma_drain_needed;
J
Jens Axboe 已提交
748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763
	q->dma_drain_buffer = buf;
	q->dma_drain_size = size;

	return 0;
}
EXPORT_SYMBOL_GPL(blk_queue_dma_drain);

/**
 * blk_queue_segment_boundary - set boundary rules for segment merging
 * @q:  the request queue for the device
 * @mask:  the memory boundary mask
 **/
void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
{
	if (mask < PAGE_CACHE_SIZE - 1) {
		mask = PAGE_CACHE_SIZE - 1;
764 765
		printk(KERN_INFO "%s: set to minimum %lx\n",
		       __func__, mask);
J
Jens Axboe 已提交
766 767
	}

768
	q->limits.seg_boundary_mask = mask;
J
Jens Axboe 已提交
769 770 771 772 773 774 775 776 777
}
EXPORT_SYMBOL(blk_queue_segment_boundary);

/**
 * blk_queue_dma_alignment - set dma length and memory alignment
 * @q:     the request queue for the device
 * @mask:  alignment mask
 *
 * description:
778
 *    set required memory and length alignment for direct dma transactions.
A
Alan Cox 已提交
779
 *    this is used when building direct io requests for the queue.
J
Jens Axboe 已提交
780 781 782 783 784 785 786 787 788 789 790 791 792 793
 *
 **/
void blk_queue_dma_alignment(struct request_queue *q, int mask)
{
	q->dma_alignment = mask;
}
EXPORT_SYMBOL(blk_queue_dma_alignment);

/**
 * blk_queue_update_dma_alignment - update dma length and memory alignment
 * @q:     the request queue for the device
 * @mask:  alignment mask
 *
 * description:
794
 *    update required memory and length alignment for direct dma transactions.
J
Jens Axboe 已提交
795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810
 *    If the requested alignment is larger than the current alignment, then
 *    the current queue alignment is updated to the new value, otherwise it
 *    is left alone.  The design of this is to allow multiple objects
 *    (driver, device, transport etc) to set their respective
 *    alignments without having them interfere.
 *
 **/
void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
{
	BUG_ON(mask > PAGE_SIZE);

	if (mask > q->dma_alignment)
		q->dma_alignment = mask;
}
EXPORT_SYMBOL(blk_queue_update_dma_alignment);

811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830
/**
 * blk_queue_flush - configure queue's cache flush capability
 * @q:		the request queue for the device
 * @flush:	0, REQ_FLUSH or REQ_FLUSH | REQ_FUA
 *
 * Tell block layer cache flush capability of @q.  If it supports
 * flushing, REQ_FLUSH should be set.  If it supports bypassing
 * write cache for individual writes, REQ_FUA should be set.
 */
void blk_queue_flush(struct request_queue *q, unsigned int flush)
{
	WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));

	if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
		flush &= ~REQ_FUA;

	q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
}
EXPORT_SYMBOL_GPL(blk_queue_flush);

831 832 833 834 835 836
void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
{
	q->flush_not_queueable = !queueable;
}
EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);

837
static int __init blk_settings_init(void)
J
Jens Axboe 已提交
838 839 840 841 842 843
{
	blk_max_low_pfn = max_low_pfn - 1;
	blk_max_pfn = max_pfn - 1;
	return 0;
}
subsys_initcall(blk_settings_init);