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