1
2
3
4
5#include <linux/kernel.h>
6#include <linux/module.h>
7#include <linux/init.h>
8#include <linux/bio.h>
9#include <linux/blkdev.h>
10#include <linux/pagemap.h>
11#include <linux/gcd.h>
12#include <linux/lcm.h>
13#include <linux/jiffies.h>
14#include <linux/gfp.h>
15#include <linux/dma-mapping.h>
16
17#include "blk.h"
18#include "blk-wbt.h"
19
20void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
21{
22 q->rq_timeout = timeout;
23}
24EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
25
26
27
28
29
30
31
32
33void blk_set_default_limits(struct queue_limits *lim)
34{
35 lim->max_segments = BLK_MAX_SEGMENTS;
36 lim->max_discard_segments = 1;
37 lim->max_integrity_segments = 0;
38 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
39 lim->virt_boundary_mask = 0;
40 lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
41 lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
42 lim->max_dev_sectors = 0;
43 lim->chunk_sectors = 0;
44 lim->max_write_same_sectors = 0;
45 lim->max_write_zeroes_sectors = 0;
46 lim->max_zone_append_sectors = 0;
47 lim->max_discard_sectors = 0;
48 lim->max_hw_discard_sectors = 0;
49 lim->discard_granularity = 0;
50 lim->discard_alignment = 0;
51 lim->discard_misaligned = 0;
52 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
53 lim->bounce = BLK_BOUNCE_NONE;
54 lim->alignment_offset = 0;
55 lim->io_opt = 0;
56 lim->misaligned = 0;
57 lim->zoned = BLK_ZONED_NONE;
58 lim->zone_write_granularity = 0;
59}
60EXPORT_SYMBOL(blk_set_default_limits);
61
62
63
64
65
66
67
68
69
70void blk_set_stacking_limits(struct queue_limits *lim)
71{
72 blk_set_default_limits(lim);
73
74
75 lim->max_segments = USHRT_MAX;
76 lim->max_discard_segments = USHRT_MAX;
77 lim->max_hw_sectors = UINT_MAX;
78 lim->max_segment_size = UINT_MAX;
79 lim->max_sectors = UINT_MAX;
80 lim->max_dev_sectors = UINT_MAX;
81 lim->max_write_same_sectors = UINT_MAX;
82 lim->max_write_zeroes_sectors = UINT_MAX;
83 lim->max_zone_append_sectors = UINT_MAX;
84}
85EXPORT_SYMBOL(blk_set_stacking_limits);
86
87
88
89
90
91
92
93
94
95
96
97void blk_queue_bounce_limit(struct request_queue *q, enum blk_bounce bounce)
98{
99 q->limits.bounce = bounce;
100}
101EXPORT_SYMBOL(blk_queue_bounce_limit);
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
123{
124 struct queue_limits *limits = &q->limits;
125 unsigned int max_sectors;
126
127 if ((max_hw_sectors << 9) < PAGE_SIZE) {
128 max_hw_sectors = 1 << (PAGE_SHIFT - 9);
129 printk(KERN_INFO "%s: set to minimum %d\n",
130 __func__, max_hw_sectors);
131 }
132
133 max_hw_sectors = round_down(max_hw_sectors,
134 limits->logical_block_size >> SECTOR_SHIFT);
135 limits->max_hw_sectors = max_hw_sectors;
136
137 max_sectors = min_not_zero(max_hw_sectors, limits->max_dev_sectors);
138 max_sectors = min_t(unsigned int, max_sectors, BLK_DEF_MAX_SECTORS);
139 max_sectors = round_down(max_sectors,
140 limits->logical_block_size >> SECTOR_SHIFT);
141 limits->max_sectors = max_sectors;
142
143 q->backing_dev_info->io_pages = max_sectors >> (PAGE_SHIFT - 9);
144}
145EXPORT_SYMBOL(blk_queue_max_hw_sectors);
146
147
148
149
150
151
152
153
154
155
156
157
158
159void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors)
160{
161 q->limits.chunk_sectors = chunk_sectors;
162}
163EXPORT_SYMBOL(blk_queue_chunk_sectors);
164
165
166
167
168
169
170void blk_queue_max_discard_sectors(struct request_queue *q,
171 unsigned int max_discard_sectors)
172{
173 q->limits.max_hw_discard_sectors = max_discard_sectors;
174 q->limits.max_discard_sectors = max_discard_sectors;
175}
176EXPORT_SYMBOL(blk_queue_max_discard_sectors);
177
178
179
180
181
182
183void blk_queue_max_write_same_sectors(struct request_queue *q,
184 unsigned int max_write_same_sectors)
185{
186 q->limits.max_write_same_sectors = max_write_same_sectors;
187}
188EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
189
190
191
192
193
194
195
196void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
197 unsigned int max_write_zeroes_sectors)
198{
199 q->limits.max_write_zeroes_sectors = max_write_zeroes_sectors;
200}
201EXPORT_SYMBOL(blk_queue_max_write_zeroes_sectors);
202
203
204
205
206
207
208void blk_queue_max_zone_append_sectors(struct request_queue *q,
209 unsigned int max_zone_append_sectors)
210{
211 unsigned int max_sectors;
212
213 if (WARN_ON(!blk_queue_is_zoned(q)))
214 return;
215
216 max_sectors = min(q->limits.max_hw_sectors, max_zone_append_sectors);
217 max_sectors = min(q->limits.chunk_sectors, max_sectors);
218
219
220
221
222
223
224 WARN_ON(!max_sectors);
225
226 q->limits.max_zone_append_sectors = max_sectors;
227}
228EXPORT_SYMBOL_GPL(blk_queue_max_zone_append_sectors);
229
230
231
232
233
234
235
236
237
238
239void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
240{
241 if (!max_segments) {
242 max_segments = 1;
243 printk(KERN_INFO "%s: set to minimum %d\n",
244 __func__, max_segments);
245 }
246
247 q->limits.max_segments = max_segments;
248}
249EXPORT_SYMBOL(blk_queue_max_segments);
250
251
252
253
254
255
256
257
258
259
260void blk_queue_max_discard_segments(struct request_queue *q,
261 unsigned short max_segments)
262{
263 q->limits.max_discard_segments = max_segments;
264}
265EXPORT_SYMBOL_GPL(blk_queue_max_discard_segments);
266
267
268
269
270
271
272
273
274
275
276void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
277{
278 if (max_size < PAGE_SIZE) {
279 max_size = PAGE_SIZE;
280 printk(KERN_INFO "%s: set to minimum %d\n",
281 __func__, max_size);
282 }
283
284
285 WARN_ON_ONCE(q->limits.virt_boundary_mask);
286
287 q->limits.max_segment_size = max_size;
288}
289EXPORT_SYMBOL(blk_queue_max_segment_size);
290
291
292
293
294
295
296
297
298
299
300
301void blk_queue_logical_block_size(struct request_queue *q, unsigned int size)
302{
303 struct queue_limits *limits = &q->limits;
304
305 limits->logical_block_size = size;
306
307 if (limits->physical_block_size < size)
308 limits->physical_block_size = size;
309
310 if (limits->io_min < limits->physical_block_size)
311 limits->io_min = limits->physical_block_size;
312
313 limits->max_hw_sectors =
314 round_down(limits->max_hw_sectors, size >> SECTOR_SHIFT);
315 limits->max_sectors =
316 round_down(limits->max_sectors, size >> SECTOR_SHIFT);
317}
318EXPORT_SYMBOL(blk_queue_logical_block_size);
319
320
321
322
323
324
325
326
327
328
329
330void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
331{
332 q->limits.physical_block_size = size;
333
334 if (q->limits.physical_block_size < q->limits.logical_block_size)
335 q->limits.physical_block_size = q->limits.logical_block_size;
336
337 if (q->limits.io_min < q->limits.physical_block_size)
338 q->limits.io_min = q->limits.physical_block_size;
339}
340EXPORT_SYMBOL(blk_queue_physical_block_size);
341
342
343
344
345
346
347
348
349
350
351void blk_queue_zone_write_granularity(struct request_queue *q,
352 unsigned int size)
353{
354 if (WARN_ON_ONCE(!blk_queue_is_zoned(q)))
355 return;
356
357 q->limits.zone_write_granularity = size;
358
359 if (q->limits.zone_write_granularity < q->limits.logical_block_size)
360 q->limits.zone_write_granularity = q->limits.logical_block_size;
361}
362EXPORT_SYMBOL_GPL(blk_queue_zone_write_granularity);
363
364
365
366
367
368
369
370
371
372
373
374
375void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
376{
377 q->limits.alignment_offset =
378 offset & (q->limits.physical_block_size - 1);
379 q->limits.misaligned = 0;
380}
381EXPORT_SYMBOL(blk_queue_alignment_offset);
382
383void blk_queue_update_readahead(struct request_queue *q)
384{
385
386
387
388
389 q->backing_dev_info->ra_pages =
390 max(queue_io_opt(q) * 2 / PAGE_SIZE, VM_READAHEAD_PAGES);
391 q->backing_dev_info->io_pages =
392 queue_max_sectors(q) >> (PAGE_SHIFT - 9);
393}
394EXPORT_SYMBOL_GPL(blk_queue_update_readahead);
395
396
397
398
399
400
401
402
403
404
405
406
407void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
408{
409 limits->io_min = min;
410
411 if (limits->io_min < limits->logical_block_size)
412 limits->io_min = limits->logical_block_size;
413
414 if (limits->io_min < limits->physical_block_size)
415 limits->io_min = limits->physical_block_size;
416}
417EXPORT_SYMBOL(blk_limits_io_min);
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433void blk_queue_io_min(struct request_queue *q, unsigned int min)
434{
435 blk_limits_io_min(&q->limits, min);
436}
437EXPORT_SYMBOL(blk_queue_io_min);
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
453{
454 limits->io_opt = opt;
455}
456EXPORT_SYMBOL(blk_limits_io_opt);
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
472{
473 blk_limits_io_opt(&q->limits, opt);
474 q->backing_dev_info->ra_pages =
475 max(queue_io_opt(q) * 2 / PAGE_SIZE, VM_READAHEAD_PAGES);
476}
477EXPORT_SYMBOL(blk_queue_io_opt);
478
479static unsigned int blk_round_down_sectors(unsigned int sectors, unsigned int lbs)
480{
481 sectors = round_down(sectors, lbs >> SECTOR_SHIFT);
482 if (sectors < PAGE_SIZE >> SECTOR_SHIFT)
483 sectors = PAGE_SIZE >> SECTOR_SHIFT;
484 return sectors;
485}
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
509 sector_t start)
510{
511 unsigned int top, bottom, alignment, ret = 0;
512
513 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
514 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
515 t->max_dev_sectors = min_not_zero(t->max_dev_sectors, b->max_dev_sectors);
516 t->max_write_same_sectors = min(t->max_write_same_sectors,
517 b->max_write_same_sectors);
518 t->max_write_zeroes_sectors = min(t->max_write_zeroes_sectors,
519 b->max_write_zeroes_sectors);
520 t->max_zone_append_sectors = min(t->max_zone_append_sectors,
521 b->max_zone_append_sectors);
522 t->bounce = max(t->bounce, b->bounce);
523
524 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
525 b->seg_boundary_mask);
526 t->virt_boundary_mask = min_not_zero(t->virt_boundary_mask,
527 b->virt_boundary_mask);
528
529 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
530 t->max_discard_segments = min_not_zero(t->max_discard_segments,
531 b->max_discard_segments);
532 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
533 b->max_integrity_segments);
534
535 t->max_segment_size = min_not_zero(t->max_segment_size,
536 b->max_segment_size);
537
538 t->misaligned |= b->misaligned;
539
540 alignment = queue_limit_alignment_offset(b, start);
541
542
543
544
545 if (t->alignment_offset != alignment) {
546
547 top = max(t->physical_block_size, t->io_min)
548 + t->alignment_offset;
549 bottom = max(b->physical_block_size, b->io_min) + alignment;
550
551
552 if (max(top, bottom) % min(top, bottom)) {
553 t->misaligned = 1;
554 ret = -1;
555 }
556 }
557
558 t->logical_block_size = max(t->logical_block_size,
559 b->logical_block_size);
560
561 t->physical_block_size = max(t->physical_block_size,
562 b->physical_block_size);
563
564 t->io_min = max(t->io_min, b->io_min);
565 t->io_opt = lcm_not_zero(t->io_opt, b->io_opt);
566
567
568 if (b->chunk_sectors)
569 t->chunk_sectors = gcd(t->chunk_sectors, b->chunk_sectors);
570
571
572 if (t->physical_block_size & (t->logical_block_size - 1)) {
573 t->physical_block_size = t->logical_block_size;
574 t->misaligned = 1;
575 ret = -1;
576 }
577
578
579 if (t->io_min & (t->physical_block_size - 1)) {
580 t->io_min = t->physical_block_size;
581 t->misaligned = 1;
582 ret = -1;
583 }
584
585
586 if (t->io_opt & (t->physical_block_size - 1)) {
587 t->io_opt = 0;
588 t->misaligned = 1;
589 ret = -1;
590 }
591
592
593 if ((t->chunk_sectors << 9) & (t->physical_block_size - 1)) {
594 t->chunk_sectors = 0;
595 t->misaligned = 1;
596 ret = -1;
597 }
598
599 t->raid_partial_stripes_expensive =
600 max(t->raid_partial_stripes_expensive,
601 b->raid_partial_stripes_expensive);
602
603
604 t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment)
605 % max(t->physical_block_size, t->io_min);
606
607
608 if (t->alignment_offset & (t->logical_block_size - 1)) {
609 t->misaligned = 1;
610 ret = -1;
611 }
612
613 t->max_sectors = blk_round_down_sectors(t->max_sectors, t->logical_block_size);
614 t->max_hw_sectors = blk_round_down_sectors(t->max_hw_sectors, t->logical_block_size);
615 t->max_dev_sectors = blk_round_down_sectors(t->max_dev_sectors, t->logical_block_size);
616
617
618 if (b->discard_granularity) {
619 alignment = queue_limit_discard_alignment(b, start);
620
621 if (t->discard_granularity != 0 &&
622 t->discard_alignment != alignment) {
623 top = t->discard_granularity + t->discard_alignment;
624 bottom = b->discard_granularity + alignment;
625
626
627 if ((max(top, bottom) % min(top, bottom)) != 0)
628 t->discard_misaligned = 1;
629 }
630
631 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
632 b->max_discard_sectors);
633 t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors,
634 b->max_hw_discard_sectors);
635 t->discard_granularity = max(t->discard_granularity,
636 b->discard_granularity);
637 t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) %
638 t->discard_granularity;
639 }
640
641 t->zone_write_granularity = max(t->zone_write_granularity,
642 b->zone_write_granularity);
643 t->zoned = max(t->zoned, b->zoned);
644 return ret;
645}
646EXPORT_SYMBOL(blk_stack_limits);
647
648
649
650
651
652
653
654
655
656
657
658void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
659 sector_t offset)
660{
661 struct request_queue *t = disk->queue;
662
663 if (blk_stack_limits(&t->limits, &bdev_get_queue(bdev)->limits,
664 get_start_sect(bdev) + (offset >> 9)) < 0) {
665 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
666
667 disk_name(disk, 0, top);
668 bdevname(bdev, bottom);
669
670 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
671 top, bottom);
672 }
673
674 blk_queue_update_readahead(disk->queue);
675}
676EXPORT_SYMBOL(disk_stack_limits);
677
678
679
680
681
682
683
684
685
686
687
688void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
689{
690 if (mask > q->dma_pad_mask)
691 q->dma_pad_mask = mask;
692}
693EXPORT_SYMBOL(blk_queue_update_dma_pad);
694
695
696
697
698
699
700void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
701{
702 if (mask < PAGE_SIZE - 1) {
703 mask = PAGE_SIZE - 1;
704 printk(KERN_INFO "%s: set to minimum %lx\n",
705 __func__, mask);
706 }
707
708 q->limits.seg_boundary_mask = mask;
709}
710EXPORT_SYMBOL(blk_queue_segment_boundary);
711
712
713
714
715
716
717void blk_queue_virt_boundary(struct request_queue *q, unsigned long mask)
718{
719 q->limits.virt_boundary_mask = mask;
720
721
722
723
724
725
726
727 if (mask)
728 q->limits.max_segment_size = UINT_MAX;
729}
730EXPORT_SYMBOL(blk_queue_virt_boundary);
731
732
733
734
735
736
737
738
739
740
741
742void blk_queue_dma_alignment(struct request_queue *q, int mask)
743{
744 q->dma_alignment = mask;
745}
746EXPORT_SYMBOL(blk_queue_dma_alignment);
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
763{
764 BUG_ON(mask > PAGE_SIZE);
765
766 if (mask > q->dma_alignment)
767 q->dma_alignment = mask;
768}
769EXPORT_SYMBOL(blk_queue_update_dma_alignment);
770
771
772
773
774
775
776
777void blk_set_queue_depth(struct request_queue *q, unsigned int depth)
778{
779 q->queue_depth = depth;
780 rq_qos_queue_depth_changed(q);
781}
782EXPORT_SYMBOL(blk_set_queue_depth);
783
784
785
786
787
788
789
790
791
792void blk_queue_write_cache(struct request_queue *q, bool wc, bool fua)
793{
794 if (wc)
795 blk_queue_flag_set(QUEUE_FLAG_WC, q);
796 else
797 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
798 if (fua)
799 blk_queue_flag_set(QUEUE_FLAG_FUA, q);
800 else
801 blk_queue_flag_clear(QUEUE_FLAG_FUA, q);
802
803 wbt_set_write_cache(q, test_bit(QUEUE_FLAG_WC, &q->queue_flags));
804}
805EXPORT_SYMBOL_GPL(blk_queue_write_cache);
806
807
808
809
810
811
812
813
814
815
816void blk_queue_required_elevator_features(struct request_queue *q,
817 unsigned int features)
818{
819 q->required_elevator_features = features;
820}
821EXPORT_SYMBOL_GPL(blk_queue_required_elevator_features);
822
823
824
825
826
827
828
829
830bool blk_queue_can_use_dma_map_merging(struct request_queue *q,
831 struct device *dev)
832{
833 unsigned long boundary = dma_get_merge_boundary(dev);
834
835 if (!boundary)
836 return false;
837
838
839 blk_queue_virt_boundary(q, boundary);
840
841 return true;
842}
843EXPORT_SYMBOL_GPL(blk_queue_can_use_dma_map_merging);
844
845
846
847
848
849
850
851
852
853
854
855
856
857void blk_queue_set_zoned(struct gendisk *disk, enum blk_zoned_model model)
858{
859 struct request_queue *q = disk->queue;
860
861 switch (model) {
862 case BLK_ZONED_HM:
863
864
865
866
867 WARN_ON_ONCE(!IS_ENABLED(CONFIG_BLK_DEV_ZONED));
868 break;
869 case BLK_ZONED_HA:
870
871
872
873
874
875
876
877
878 if (!IS_ENABLED(CONFIG_BLK_DEV_ZONED) ||
879 !xa_empty(&disk->part_tbl))
880 model = BLK_ZONED_NONE;
881 break;
882 case BLK_ZONED_NONE:
883 default:
884 if (WARN_ON_ONCE(model != BLK_ZONED_NONE))
885 model = BLK_ZONED_NONE;
886 break;
887 }
888
889 q->limits.zoned = model;
890 if (model != BLK_ZONED_NONE) {
891
892
893
894
895 blk_queue_zone_write_granularity(q,
896 queue_logical_block_size(q));
897 } else {
898 blk_queue_clear_zone_settings(q);
899 }
900}
901EXPORT_SYMBOL_GPL(blk_queue_set_zoned);
902