1
2
3
4#include <linux/kernel.h>
5#include <linux/module.h>
6#include <linux/init.h>
7#include <linux/bio.h>
8#include <linux/blkdev.h>
9#include <linux/bootmem.h>
10#include <linux/gcd.h>
11#include <linux/lcm.h>
12#include <linux/jiffies.h>
13#include <linux/gfp.h>
14
15#include "blk.h"
16
17unsigned long blk_max_low_pfn;
18EXPORT_SYMBOL(blk_max_low_pfn);
19
20unsigned long blk_max_pfn;
21
22
23
24
25
26
27
28
29
30
31
32
33void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
34{
35 q->prep_rq_fn = pfn;
36}
37EXPORT_SYMBOL(blk_queue_prep_rq);
38
39
40
41
42
43
44
45
46
47
48
49
50void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
51{
52 q->unprep_rq_fn = ufn;
53}
54EXPORT_SYMBOL(blk_queue_unprep_rq);
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
73{
74 q->merge_bvec_fn = mbfn;
75}
76EXPORT_SYMBOL(blk_queue_merge_bvec);
77
78void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
79{
80 q->softirq_done_fn = fn;
81}
82EXPORT_SYMBOL(blk_queue_softirq_done);
83
84void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
85{
86 q->rq_timeout = timeout;
87}
88EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
89
90void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
91{
92 q->rq_timed_out_fn = fn;
93}
94EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
95
96void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
97{
98 q->lld_busy_fn = fn;
99}
100EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
101
102
103
104
105
106
107
108
109
110
111void blk_set_default_limits(struct queue_limits *lim)
112{
113 lim->max_segments = BLK_MAX_SEGMENTS;
114 lim->max_integrity_segments = 0;
115 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
116 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
117 lim->max_sectors = BLK_DEF_MAX_SECTORS;
118 lim->max_hw_sectors = INT_MAX;
119 lim->max_discard_sectors = 0;
120 lim->discard_granularity = 0;
121 lim->discard_alignment = 0;
122 lim->discard_misaligned = 0;
123 lim->discard_zeroes_data = 1;
124 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
125 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
126 lim->alignment_offset = 0;
127 lim->io_opt = 0;
128 lim->misaligned = 0;
129 lim->cluster = 1;
130}
131EXPORT_SYMBOL(blk_set_default_limits);
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
156{
157
158
159
160 q->nr_requests = BLKDEV_MAX_RQ;
161
162 q->make_request_fn = mfn;
163 blk_queue_dma_alignment(q, 511);
164 blk_queue_congestion_threshold(q);
165 q->nr_batching = BLK_BATCH_REQ;
166
167 blk_set_default_limits(&q->limits);
168 blk_queue_max_hw_sectors(q, BLK_SAFE_MAX_SECTORS);
169 q->limits.discard_zeroes_data = 0;
170
171
172
173
174 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
175}
176EXPORT_SYMBOL(blk_queue_make_request);
177
178
179
180
181
182
183
184
185
186
187
188
189void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
190{
191 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
192 int dma = 0;
193
194 q->bounce_gfp = GFP_NOIO;
195#if BITS_PER_LONG == 64
196
197
198
199
200
201 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
202 dma = 1;
203 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
204#else
205 if (b_pfn < blk_max_low_pfn)
206 dma = 1;
207 q->limits.bounce_pfn = b_pfn;
208#endif
209 if (dma) {
210 init_emergency_isa_pool();
211 q->bounce_gfp = GFP_NOIO | GFP_DMA;
212 q->limits.bounce_pfn = b_pfn;
213 }
214}
215EXPORT_SYMBOL(blk_queue_bounce_limit);
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
234{
235 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
236 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
237 printk(KERN_INFO "%s: set to minimum %d\n",
238 __func__, max_hw_sectors);
239 }
240
241 limits->max_hw_sectors = max_hw_sectors;
242 limits->max_sectors = min_t(unsigned int, max_hw_sectors,
243 BLK_DEF_MAX_SECTORS);
244}
245EXPORT_SYMBOL(blk_limits_max_hw_sectors);
246
247
248
249
250
251
252
253
254
255void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
256{
257 blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
258}
259EXPORT_SYMBOL(blk_queue_max_hw_sectors);
260
261
262
263
264
265
266void blk_queue_max_discard_sectors(struct request_queue *q,
267 unsigned int max_discard_sectors)
268{
269 q->limits.max_discard_sectors = max_discard_sectors;
270}
271EXPORT_SYMBOL(blk_queue_max_discard_sectors);
272
273
274
275
276
277
278
279
280
281
282void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
283{
284 if (!max_segments) {
285 max_segments = 1;
286 printk(KERN_INFO "%s: set to minimum %d\n",
287 __func__, max_segments);
288 }
289
290 q->limits.max_segments = max_segments;
291}
292EXPORT_SYMBOL(blk_queue_max_segments);
293
294
295
296
297
298
299
300
301
302
303void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
304{
305 if (max_size < PAGE_CACHE_SIZE) {
306 max_size = PAGE_CACHE_SIZE;
307 printk(KERN_INFO "%s: set to minimum %d\n",
308 __func__, max_size);
309 }
310
311 q->limits.max_segment_size = max_size;
312}
313EXPORT_SYMBOL(blk_queue_max_segment_size);
314
315
316
317
318
319
320
321
322
323
324
325void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
326{
327 q->limits.logical_block_size = size;
328
329 if (q->limits.physical_block_size < size)
330 q->limits.physical_block_size = size;
331
332 if (q->limits.io_min < q->limits.physical_block_size)
333 q->limits.io_min = q->limits.physical_block_size;
334}
335EXPORT_SYMBOL(blk_queue_logical_block_size);
336
337
338
339
340
341
342
343
344
345
346
347void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
348{
349 q->limits.physical_block_size = size;
350
351 if (q->limits.physical_block_size < q->limits.logical_block_size)
352 q->limits.physical_block_size = q->limits.logical_block_size;
353
354 if (q->limits.io_min < q->limits.physical_block_size)
355 q->limits.io_min = q->limits.physical_block_size;
356}
357EXPORT_SYMBOL(blk_queue_physical_block_size);
358
359
360
361
362
363
364
365
366
367
368
369
370void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
371{
372 q->limits.alignment_offset =
373 offset & (q->limits.physical_block_size - 1);
374 q->limits.misaligned = 0;
375}
376EXPORT_SYMBOL(blk_queue_alignment_offset);
377
378
379
380
381
382
383
384
385
386
387
388
389void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
390{
391 limits->io_min = min;
392
393 if (limits->io_min < limits->logical_block_size)
394 limits->io_min = limits->logical_block_size;
395
396 if (limits->io_min < limits->physical_block_size)
397 limits->io_min = limits->physical_block_size;
398}
399EXPORT_SYMBOL(blk_limits_io_min);
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415void blk_queue_io_min(struct request_queue *q, unsigned int min)
416{
417 blk_limits_io_min(&q->limits, min);
418}
419EXPORT_SYMBOL(blk_queue_io_min);
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
435{
436 limits->io_opt = opt;
437}
438EXPORT_SYMBOL(blk_limits_io_opt);
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
454{
455 blk_limits_io_opt(&q->limits, opt);
456}
457EXPORT_SYMBOL(blk_queue_io_opt);
458
459
460
461
462
463
464void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
465{
466 blk_stack_limits(&t->limits, &b->limits, 0);
467}
468EXPORT_SYMBOL(blk_queue_stack_limits);
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
492 sector_t start)
493{
494 unsigned int top, bottom, alignment, ret = 0;
495
496 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
497 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
498 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
499
500 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
501 b->seg_boundary_mask);
502
503 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
504 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
505 b->max_integrity_segments);
506
507 t->max_segment_size = min_not_zero(t->max_segment_size,
508 b->max_segment_size);
509
510 t->misaligned |= b->misaligned;
511
512 alignment = queue_limit_alignment_offset(b, start);
513
514
515
516
517 if (t->alignment_offset != alignment) {
518
519 top = max(t->physical_block_size, t->io_min)
520 + t->alignment_offset;
521 bottom = max(b->physical_block_size, b->io_min) + alignment;
522
523
524 if (max(top, bottom) & (min(top, bottom) - 1)) {
525 t->misaligned = 1;
526 ret = -1;
527 }
528 }
529
530 t->logical_block_size = max(t->logical_block_size,
531 b->logical_block_size);
532
533 t->physical_block_size = max(t->physical_block_size,
534 b->physical_block_size);
535
536 t->io_min = max(t->io_min, b->io_min);
537 t->io_opt = lcm(t->io_opt, b->io_opt);
538
539 t->cluster &= b->cluster;
540 t->discard_zeroes_data &= b->discard_zeroes_data;
541
542
543 if (t->physical_block_size & (t->logical_block_size - 1)) {
544 t->physical_block_size = t->logical_block_size;
545 t->misaligned = 1;
546 ret = -1;
547 }
548
549
550 if (t->io_min & (t->physical_block_size - 1)) {
551 t->io_min = t->physical_block_size;
552 t->misaligned = 1;
553 ret = -1;
554 }
555
556
557 if (t->io_opt & (t->physical_block_size - 1)) {
558 t->io_opt = 0;
559 t->misaligned = 1;
560 ret = -1;
561 }
562
563
564 t->alignment_offset = lcm(t->alignment_offset, alignment)
565 & (max(t->physical_block_size, t->io_min) - 1);
566
567
568 if (t->alignment_offset & (t->logical_block_size - 1)) {
569 t->misaligned = 1;
570 ret = -1;
571 }
572
573
574 if (b->discard_granularity) {
575 alignment = queue_limit_discard_alignment(b, start);
576
577 if (t->discard_granularity != 0 &&
578 t->discard_alignment != alignment) {
579 top = t->discard_granularity + t->discard_alignment;
580 bottom = b->discard_granularity + alignment;
581
582
583 if (max(top, bottom) & (min(top, bottom) - 1))
584 t->discard_misaligned = 1;
585 }
586
587 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
588 b->max_discard_sectors);
589 t->discard_granularity = max(t->discard_granularity,
590 b->discard_granularity);
591 t->discard_alignment = lcm(t->discard_alignment, alignment) &
592 (t->discard_granularity - 1);
593 }
594
595 return ret;
596}
597EXPORT_SYMBOL(blk_stack_limits);
598
599
600
601
602
603
604
605
606
607
608
609
610int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
611 sector_t start)
612{
613 struct request_queue *bq = bdev_get_queue(bdev);
614
615 start += get_start_sect(bdev);
616
617 return blk_stack_limits(t, &bq->limits, start);
618}
619EXPORT_SYMBOL(bdev_stack_limits);
620
621
622
623
624
625
626
627
628
629
630
631void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
632 sector_t offset)
633{
634 struct request_queue *t = disk->queue;
635
636 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
637 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
638
639 disk_name(disk, 0, top);
640 bdevname(bdev, bottom);
641
642 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
643 top, bottom);
644 }
645}
646EXPORT_SYMBOL(disk_stack_limits);
647
648
649
650
651
652
653
654
655
656
657
658void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
659{
660 q->dma_pad_mask = mask;
661}
662EXPORT_SYMBOL(blk_queue_dma_pad);
663
664
665
666
667
668
669
670
671
672
673
674void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
675{
676 if (mask > q->dma_pad_mask)
677 q->dma_pad_mask = mask;
678}
679EXPORT_SYMBOL(blk_queue_update_dma_pad);
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702int blk_queue_dma_drain(struct request_queue *q,
703 dma_drain_needed_fn *dma_drain_needed,
704 void *buf, unsigned int size)
705{
706 if (queue_max_segments(q) < 2)
707 return -EINVAL;
708
709 blk_queue_max_segments(q, queue_max_segments(q) - 1);
710 q->dma_drain_needed = dma_drain_needed;
711 q->dma_drain_buffer = buf;
712 q->dma_drain_size = size;
713
714 return 0;
715}
716EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
717
718
719
720
721
722
723void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
724{
725 if (mask < PAGE_CACHE_SIZE - 1) {
726 mask = PAGE_CACHE_SIZE - 1;
727 printk(KERN_INFO "%s: set to minimum %lx\n",
728 __func__, mask);
729 }
730
731 q->limits.seg_boundary_mask = mask;
732}
733EXPORT_SYMBOL(blk_queue_segment_boundary);
734
735
736
737
738
739
740
741
742
743
744
745void blk_queue_dma_alignment(struct request_queue *q, int mask)
746{
747 q->dma_alignment = mask;
748}
749EXPORT_SYMBOL(blk_queue_dma_alignment);
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
766{
767 BUG_ON(mask > PAGE_SIZE);
768
769 if (mask > q->dma_alignment)
770 q->dma_alignment = mask;
771}
772EXPORT_SYMBOL(blk_queue_update_dma_alignment);
773
774
775
776
777
778
779
780
781
782
783void blk_queue_flush(struct request_queue *q, unsigned int flush)
784{
785 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
786
787 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
788 flush &= ~REQ_FUA;
789
790 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
791}
792EXPORT_SYMBOL_GPL(blk_queue_flush);
793
794void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
795{
796 q->flush_not_queueable = !queueable;
797}
798EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
799
800static int __init blk_settings_init(void)
801{
802 blk_max_low_pfn = max_low_pfn - 1;
803 blk_max_pfn = max_pfn - 1;
804 return 0;
805}
806subsys_initcall(blk_settings_init);
807