Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Functions related to sysfs handling
4 */
5#include <linux/kernel.h>
6#include <linux/slab.h>
7#include <linux/module.h>
8#include <linux/bio.h>
9#include <linux/blkdev.h>
10#include <linux/backing-dev.h>
11#include <linux/blktrace_api.h>
12#include <linux/blk-mq.h>
13#include <linux/debugfs.h>
14
15#include "blk.h"
16#include "blk-mq.h"
17#include "blk-mq-debugfs.h"
18#include "blk-mq-sched.h"
19#include "blk-wbt.h"
20#include "blk-cgroup.h"
21#include "blk-throttle.h"
22
23struct queue_sysfs_entry {
24 struct attribute attr;
25 ssize_t (*show)(struct request_queue *, char *);
26 ssize_t (*store)(struct request_queue *, const char *, size_t);
27};
28
29static ssize_t
30queue_var_show(unsigned long var, char *page)
31{
32 return sprintf(page, "%lu\n", var);
33}
34
35static ssize_t
36queue_var_store(unsigned long *var, const char *page, size_t count)
37{
38 int err;
39 unsigned long v;
40
41 err = kstrtoul(page, 10, &v);
42 if (err || v > UINT_MAX)
43 return -EINVAL;
44
45 *var = v;
46
47 return count;
48}
49
50static ssize_t queue_var_store64(s64 *var, const char *page)
51{
52 int err;
53 s64 v;
54
55 err = kstrtos64(page, 10, &v);
56 if (err < 0)
57 return err;
58
59 *var = v;
60 return 0;
61}
62
63static ssize_t queue_requests_show(struct request_queue *q, char *page)
64{
65 return queue_var_show(q->nr_requests, page);
66}
67
68static ssize_t
69queue_requests_store(struct request_queue *q, const char *page, size_t count)
70{
71 unsigned long nr;
72 int ret, err;
73
74 if (!queue_is_mq(q))
75 return -EINVAL;
76
77 ret = queue_var_store(&nr, page, count);
78 if (ret < 0)
79 return ret;
80
81 if (nr < BLKDEV_MIN_RQ)
82 nr = BLKDEV_MIN_RQ;
83
84 err = blk_mq_update_nr_requests(q, nr);
85 if (err)
86 return err;
87
88 return ret;
89}
90
91static ssize_t queue_ra_show(struct request_queue *q, char *page)
92{
93 unsigned long ra_kb;
94
95 if (!q->disk)
96 return -EINVAL;
97 ra_kb = q->disk->bdi->ra_pages << (PAGE_SHIFT - 10);
98 return queue_var_show(ra_kb, page);
99}
100
101static ssize_t
102queue_ra_store(struct request_queue *q, const char *page, size_t count)
103{
104 unsigned long ra_kb;
105 ssize_t ret;
106
107 if (!q->disk)
108 return -EINVAL;
109 ret = queue_var_store(&ra_kb, page, count);
110 if (ret < 0)
111 return ret;
112 q->disk->bdi->ra_pages = ra_kb >> (PAGE_SHIFT - 10);
113 return ret;
114}
115
116static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
117{
118 int max_sectors_kb = queue_max_sectors(q) >> 1;
119
120 return queue_var_show(max_sectors_kb, page);
121}
122
123static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
124{
125 return queue_var_show(queue_max_segments(q), page);
126}
127
128static ssize_t queue_max_discard_segments_show(struct request_queue *q,
129 char *page)
130{
131 return queue_var_show(queue_max_discard_segments(q), page);
132}
133
134static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
135{
136 return queue_var_show(q->limits.max_integrity_segments, page);
137}
138
139static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
140{
141 return queue_var_show(queue_max_segment_size(q), page);
142}
143
144static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
145{
146 return queue_var_show(queue_logical_block_size(q), page);
147}
148
149static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
150{
151 return queue_var_show(queue_physical_block_size(q), page);
152}
153
154static ssize_t queue_chunk_sectors_show(struct request_queue *q, char *page)
155{
156 return queue_var_show(q->limits.chunk_sectors, page);
157}
158
159static ssize_t queue_io_min_show(struct request_queue *q, char *page)
160{
161 return queue_var_show(queue_io_min(q), page);
162}
163
164static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
165{
166 return queue_var_show(queue_io_opt(q), page);
167}
168
169static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
170{
171 return queue_var_show(q->limits.discard_granularity, page);
172}
173
174static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
175{
176
177 return sprintf(page, "%llu\n",
178 (unsigned long long)q->limits.max_hw_discard_sectors << 9);
179}
180
181static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
182{
183 return sprintf(page, "%llu\n",
184 (unsigned long long)q->limits.max_discard_sectors << 9);
185}
186
187static ssize_t queue_discard_max_store(struct request_queue *q,
188 const char *page, size_t count)
189{
190 unsigned long max_discard;
191 ssize_t ret = queue_var_store(&max_discard, page, count);
192
193 if (ret < 0)
194 return ret;
195
196 if (max_discard & (q->limits.discard_granularity - 1))
197 return -EINVAL;
198
199 max_discard >>= 9;
200 if (max_discard > UINT_MAX)
201 return -EINVAL;
202
203 if (max_discard > q->limits.max_hw_discard_sectors)
204 max_discard = q->limits.max_hw_discard_sectors;
205
206 q->limits.max_discard_sectors = max_discard;
207 return ret;
208}
209
210static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
211{
212 return queue_var_show(0, page);
213}
214
215static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
216{
217 return queue_var_show(0, page);
218}
219
220static ssize_t queue_write_zeroes_max_show(struct request_queue *q, char *page)
221{
222 return sprintf(page, "%llu\n",
223 (unsigned long long)q->limits.max_write_zeroes_sectors << 9);
224}
225
226static ssize_t queue_zone_write_granularity_show(struct request_queue *q,
227 char *page)
228{
229 return queue_var_show(queue_zone_write_granularity(q), page);
230}
231
232static ssize_t queue_zone_append_max_show(struct request_queue *q, char *page)
233{
234 unsigned long long max_sectors = q->limits.max_zone_append_sectors;
235
236 return sprintf(page, "%llu\n", max_sectors << SECTOR_SHIFT);
237}
238
239static ssize_t
240queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
241{
242 unsigned long max_sectors_kb,
243 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
244 page_kb = 1 << (PAGE_SHIFT - 10);
245 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
246
247 if (ret < 0)
248 return ret;
249
250 max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb, (unsigned long)
251 q->limits.max_dev_sectors >> 1);
252
253 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
254 return -EINVAL;
255
256 spin_lock_irq(&q->queue_lock);
257 q->limits.max_sectors = max_sectors_kb << 1;
258 if (q->disk)
259 q->disk->bdi->io_pages = max_sectors_kb >> (PAGE_SHIFT - 10);
260 spin_unlock_irq(&q->queue_lock);
261
262 return ret;
263}
264
265static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
266{
267 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
268
269 return queue_var_show(max_hw_sectors_kb, page);
270}
271
272static ssize_t queue_virt_boundary_mask_show(struct request_queue *q, char *page)
273{
274 return queue_var_show(q->limits.virt_boundary_mask, page);
275}
276
277static ssize_t queue_dma_alignment_show(struct request_queue *q, char *page)
278{
279 return queue_var_show(queue_dma_alignment(q), page);
280}
281
282#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
283static ssize_t \
284queue_##name##_show(struct request_queue *q, char *page) \
285{ \
286 int bit; \
287 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
288 return queue_var_show(neg ? !bit : bit, page); \
289} \
290static ssize_t \
291queue_##name##_store(struct request_queue *q, const char *page, size_t count) \
292{ \
293 unsigned long val; \
294 ssize_t ret; \
295 ret = queue_var_store(&val, page, count); \
296 if (ret < 0) \
297 return ret; \
298 if (neg) \
299 val = !val; \
300 \
301 if (val) \
302 blk_queue_flag_set(QUEUE_FLAG_##flag, q); \
303 else \
304 blk_queue_flag_clear(QUEUE_FLAG_##flag, q); \
305 return ret; \
306}
307
308QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
309QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
310QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
311QUEUE_SYSFS_BIT_FNS(stable_writes, STABLE_WRITES, 0);
312#undef QUEUE_SYSFS_BIT_FNS
313
314static ssize_t queue_zoned_show(struct request_queue *q, char *page)
315{
316 switch (blk_queue_zoned_model(q)) {
317 case BLK_ZONED_HA:
318 return sprintf(page, "host-aware\n");
319 case BLK_ZONED_HM:
320 return sprintf(page, "host-managed\n");
321 default:
322 return sprintf(page, "none\n");
323 }
324}
325
326static ssize_t queue_nr_zones_show(struct request_queue *q, char *page)
327{
328 return queue_var_show(disk_nr_zones(q->disk), page);
329}
330
331static ssize_t queue_max_open_zones_show(struct request_queue *q, char *page)
332{
333 return queue_var_show(bdev_max_open_zones(q->disk->part0), page);
334}
335
336static ssize_t queue_max_active_zones_show(struct request_queue *q, char *page)
337{
338 return queue_var_show(bdev_max_active_zones(q->disk->part0), page);
339}
340
341static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
342{
343 return queue_var_show((blk_queue_nomerges(q) << 1) |
344 blk_queue_noxmerges(q), page);
345}
346
347static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
348 size_t count)
349{
350 unsigned long nm;
351 ssize_t ret = queue_var_store(&nm, page, count);
352
353 if (ret < 0)
354 return ret;
355
356 blk_queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
357 blk_queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
358 if (nm == 2)
359 blk_queue_flag_set(QUEUE_FLAG_NOMERGES, q);
360 else if (nm)
361 blk_queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
362
363 return ret;
364}
365
366static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
367{
368 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
369 bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
370
371 return queue_var_show(set << force, page);
372}
373
374static ssize_t
375queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
376{
377 ssize_t ret = -EINVAL;
378#ifdef CONFIG_SMP
379 unsigned long val;
380
381 ret = queue_var_store(&val, page, count);
382 if (ret < 0)
383 return ret;
384
385 if (val == 2) {
386 blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
387 blk_queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
388 } else if (val == 1) {
389 blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
390 blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
391 } else if (val == 0) {
392 blk_queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
393 blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
394 }
395#endif
396 return ret;
397}
398
399static ssize_t queue_poll_delay_show(struct request_queue *q, char *page)
400{
401 int val;
402
403 if (q->poll_nsec == BLK_MQ_POLL_CLASSIC)
404 val = BLK_MQ_POLL_CLASSIC;
405 else
406 val = q->poll_nsec / 1000;
407
408 return sprintf(page, "%d\n", val);
409}
410
411static ssize_t queue_poll_delay_store(struct request_queue *q, const char *page,
412 size_t count)
413{
414 int err, val;
415
416 if (!q->mq_ops || !q->mq_ops->poll)
417 return -EINVAL;
418
419 err = kstrtoint(page, 10, &val);
420 if (err < 0)
421 return err;
422
423 if (val == BLK_MQ_POLL_CLASSIC)
424 q->poll_nsec = BLK_MQ_POLL_CLASSIC;
425 else if (val >= 0)
426 q->poll_nsec = val * 1000;
427 else
428 return -EINVAL;
429
430 return count;
431}
432
433static ssize_t queue_poll_show(struct request_queue *q, char *page)
434{
435 return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
436}
437
438static ssize_t queue_poll_store(struct request_queue *q, const char *page,
439 size_t count)
440{
441 if (!test_bit(QUEUE_FLAG_POLL, &q->queue_flags))
442 return -EINVAL;
443 pr_info_ratelimited("writes to the poll attribute are ignored.\n");
444 pr_info_ratelimited("please use driver specific parameters instead.\n");
445 return count;
446}
447
448static ssize_t queue_io_timeout_show(struct request_queue *q, char *page)
449{
450 return sprintf(page, "%u\n", jiffies_to_msecs(q->rq_timeout));
451}
452
453static ssize_t queue_io_timeout_store(struct request_queue *q, const char *page,
454 size_t count)
455{
456 unsigned int val;
457 int err;
458
459 err = kstrtou32(page, 10, &val);
460 if (err || val == 0)
461 return -EINVAL;
462
463 blk_queue_rq_timeout(q, msecs_to_jiffies(val));
464
465 return count;
466}
467
468static ssize_t queue_wb_lat_show(struct request_queue *q, char *page)
469{
470 if (!wbt_rq_qos(q))
471 return -EINVAL;
472
473 if (wbt_disabled(q))
474 return sprintf(page, "0\n");
475
476 return sprintf(page, "%llu\n", div_u64(wbt_get_min_lat(q), 1000));
477}
478
479static ssize_t queue_wb_lat_store(struct request_queue *q, const char *page,
480 size_t count)
481{
482 struct rq_qos *rqos;
483 ssize_t ret;
484 s64 val;
485
486 ret = queue_var_store64(&val, page);
487 if (ret < 0)
488 return ret;
489 if (val < -1)
490 return -EINVAL;
491
492 rqos = wbt_rq_qos(q);
493 if (!rqos) {
494 ret = wbt_init(q);
495 if (ret)
496 return ret;
497 }
498
499 if (val == -1)
500 val = wbt_default_latency_nsec(q);
501 else if (val >= 0)
502 val *= 1000ULL;
503
504 if (wbt_get_min_lat(q) == val)
505 return count;
506
507 /*
508 * Ensure that the queue is idled, in case the latency update
509 * ends up either enabling or disabling wbt completely. We can't
510 * have IO inflight if that happens.
511 */
512 blk_mq_freeze_queue(q);
513 blk_mq_quiesce_queue(q);
514
515 wbt_set_min_lat(q, val);
516
517 blk_mq_unquiesce_queue(q);
518 blk_mq_unfreeze_queue(q);
519
520 return count;
521}
522
523static ssize_t queue_wc_show(struct request_queue *q, char *page)
524{
525 if (test_bit(QUEUE_FLAG_WC, &q->queue_flags))
526 return sprintf(page, "write back\n");
527
528 return sprintf(page, "write through\n");
529}
530
531static ssize_t queue_wc_store(struct request_queue *q, const char *page,
532 size_t count)
533{
534 int set = -1;
535
536 if (!strncmp(page, "write back", 10))
537 set = 1;
538 else if (!strncmp(page, "write through", 13) ||
539 !strncmp(page, "none", 4))
540 set = 0;
541
542 if (set == -1)
543 return -EINVAL;
544
545 if (set)
546 blk_queue_flag_set(QUEUE_FLAG_WC, q);
547 else
548 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
549
550 return count;
551}
552
553static ssize_t queue_fua_show(struct request_queue *q, char *page)
554{
555 return sprintf(page, "%u\n", test_bit(QUEUE_FLAG_FUA, &q->queue_flags));
556}
557
558static ssize_t queue_dax_show(struct request_queue *q, char *page)
559{
560 return queue_var_show(blk_queue_dax(q), page);
561}
562
563#define QUEUE_RO_ENTRY(_prefix, _name) \
564static struct queue_sysfs_entry _prefix##_entry = { \
565 .attr = { .name = _name, .mode = 0444 }, \
566 .show = _prefix##_show, \
567};
568
569#define QUEUE_RW_ENTRY(_prefix, _name) \
570static struct queue_sysfs_entry _prefix##_entry = { \
571 .attr = { .name = _name, .mode = 0644 }, \
572 .show = _prefix##_show, \
573 .store = _prefix##_store, \
574};
575
576QUEUE_RW_ENTRY(queue_requests, "nr_requests");
577QUEUE_RW_ENTRY(queue_ra, "read_ahead_kb");
578QUEUE_RW_ENTRY(queue_max_sectors, "max_sectors_kb");
579QUEUE_RO_ENTRY(queue_max_hw_sectors, "max_hw_sectors_kb");
580QUEUE_RO_ENTRY(queue_max_segments, "max_segments");
581QUEUE_RO_ENTRY(queue_max_integrity_segments, "max_integrity_segments");
582QUEUE_RO_ENTRY(queue_max_segment_size, "max_segment_size");
583QUEUE_RW_ENTRY(elv_iosched, "scheduler");
584
585QUEUE_RO_ENTRY(queue_logical_block_size, "logical_block_size");
586QUEUE_RO_ENTRY(queue_physical_block_size, "physical_block_size");
587QUEUE_RO_ENTRY(queue_chunk_sectors, "chunk_sectors");
588QUEUE_RO_ENTRY(queue_io_min, "minimum_io_size");
589QUEUE_RO_ENTRY(queue_io_opt, "optimal_io_size");
590
591QUEUE_RO_ENTRY(queue_max_discard_segments, "max_discard_segments");
592QUEUE_RO_ENTRY(queue_discard_granularity, "discard_granularity");
593QUEUE_RO_ENTRY(queue_discard_max_hw, "discard_max_hw_bytes");
594QUEUE_RW_ENTRY(queue_discard_max, "discard_max_bytes");
595QUEUE_RO_ENTRY(queue_discard_zeroes_data, "discard_zeroes_data");
596
597QUEUE_RO_ENTRY(queue_write_same_max, "write_same_max_bytes");
598QUEUE_RO_ENTRY(queue_write_zeroes_max, "write_zeroes_max_bytes");
599QUEUE_RO_ENTRY(queue_zone_append_max, "zone_append_max_bytes");
600QUEUE_RO_ENTRY(queue_zone_write_granularity, "zone_write_granularity");
601
602QUEUE_RO_ENTRY(queue_zoned, "zoned");
603QUEUE_RO_ENTRY(queue_nr_zones, "nr_zones");
604QUEUE_RO_ENTRY(queue_max_open_zones, "max_open_zones");
605QUEUE_RO_ENTRY(queue_max_active_zones, "max_active_zones");
606
607QUEUE_RW_ENTRY(queue_nomerges, "nomerges");
608QUEUE_RW_ENTRY(queue_rq_affinity, "rq_affinity");
609QUEUE_RW_ENTRY(queue_poll, "io_poll");
610QUEUE_RW_ENTRY(queue_poll_delay, "io_poll_delay");
611QUEUE_RW_ENTRY(queue_wc, "write_cache");
612QUEUE_RO_ENTRY(queue_fua, "fua");
613QUEUE_RO_ENTRY(queue_dax, "dax");
614QUEUE_RW_ENTRY(queue_io_timeout, "io_timeout");
615QUEUE_RW_ENTRY(queue_wb_lat, "wbt_lat_usec");
616QUEUE_RO_ENTRY(queue_virt_boundary_mask, "virt_boundary_mask");
617QUEUE_RO_ENTRY(queue_dma_alignment, "dma_alignment");
618
619#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
620QUEUE_RW_ENTRY(blk_throtl_sample_time, "throttle_sample_time");
621#endif
622
623/* legacy alias for logical_block_size: */
624static struct queue_sysfs_entry queue_hw_sector_size_entry = {
625 .attr = {.name = "hw_sector_size", .mode = 0444 },
626 .show = queue_logical_block_size_show,
627};
628
629QUEUE_RW_ENTRY(queue_nonrot, "rotational");
630QUEUE_RW_ENTRY(queue_iostats, "iostats");
631QUEUE_RW_ENTRY(queue_random, "add_random");
632QUEUE_RW_ENTRY(queue_stable_writes, "stable_writes");
633
634static struct attribute *queue_attrs[] = {
635 &queue_requests_entry.attr,
636 &queue_ra_entry.attr,
637 &queue_max_hw_sectors_entry.attr,
638 &queue_max_sectors_entry.attr,
639 &queue_max_segments_entry.attr,
640 &queue_max_discard_segments_entry.attr,
641 &queue_max_integrity_segments_entry.attr,
642 &queue_max_segment_size_entry.attr,
643 &elv_iosched_entry.attr,
644 &queue_hw_sector_size_entry.attr,
645 &queue_logical_block_size_entry.attr,
646 &queue_physical_block_size_entry.attr,
647 &queue_chunk_sectors_entry.attr,
648 &queue_io_min_entry.attr,
649 &queue_io_opt_entry.attr,
650 &queue_discard_granularity_entry.attr,
651 &queue_discard_max_entry.attr,
652 &queue_discard_max_hw_entry.attr,
653 &queue_discard_zeroes_data_entry.attr,
654 &queue_write_same_max_entry.attr,
655 &queue_write_zeroes_max_entry.attr,
656 &queue_zone_append_max_entry.attr,
657 &queue_zone_write_granularity_entry.attr,
658 &queue_nonrot_entry.attr,
659 &queue_zoned_entry.attr,
660 &queue_nr_zones_entry.attr,
661 &queue_max_open_zones_entry.attr,
662 &queue_max_active_zones_entry.attr,
663 &queue_nomerges_entry.attr,
664 &queue_rq_affinity_entry.attr,
665 &queue_iostats_entry.attr,
666 &queue_stable_writes_entry.attr,
667 &queue_random_entry.attr,
668 &queue_poll_entry.attr,
669 &queue_wc_entry.attr,
670 &queue_fua_entry.attr,
671 &queue_dax_entry.attr,
672 &queue_wb_lat_entry.attr,
673 &queue_poll_delay_entry.attr,
674 &queue_io_timeout_entry.attr,
675#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
676 &blk_throtl_sample_time_entry.attr,
677#endif
678 &queue_virt_boundary_mask_entry.attr,
679 &queue_dma_alignment_entry.attr,
680 NULL,
681};
682
683static umode_t queue_attr_visible(struct kobject *kobj, struct attribute *attr,
684 int n)
685{
686 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
687 struct request_queue *q = disk->queue;
688
689 if (attr == &queue_io_timeout_entry.attr &&
690 (!q->mq_ops || !q->mq_ops->timeout))
691 return 0;
692
693 if ((attr == &queue_max_open_zones_entry.attr ||
694 attr == &queue_max_active_zones_entry.attr) &&
695 !blk_queue_is_zoned(q))
696 return 0;
697
698 return attr->mode;
699}
700
701static struct attribute_group queue_attr_group = {
702 .attrs = queue_attrs,
703 .is_visible = queue_attr_visible,
704};
705
706
707#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
708
709static ssize_t
710queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
711{
712 struct queue_sysfs_entry *entry = to_queue(attr);
713 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
714 struct request_queue *q = disk->queue;
715 ssize_t res;
716
717 if (!entry->show)
718 return -EIO;
719 mutex_lock(&q->sysfs_lock);
720 res = entry->show(q, page);
721 mutex_unlock(&q->sysfs_lock);
722 return res;
723}
724
725static ssize_t
726queue_attr_store(struct kobject *kobj, struct attribute *attr,
727 const char *page, size_t length)
728{
729 struct queue_sysfs_entry *entry = to_queue(attr);
730 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
731 struct request_queue *q = disk->queue;
732 ssize_t res;
733
734 if (!entry->store)
735 return -EIO;
736
737 mutex_lock(&q->sysfs_lock);
738 res = entry->store(q, page, length);
739 mutex_unlock(&q->sysfs_lock);
740 return res;
741}
742
743static const struct sysfs_ops queue_sysfs_ops = {
744 .show = queue_attr_show,
745 .store = queue_attr_store,
746};
747
748static const struct attribute_group *blk_queue_attr_groups[] = {
749 &queue_attr_group,
750 NULL
751};
752
753static void blk_queue_release(struct kobject *kobj)
754{
755 /* nothing to do here, all data is associated with the parent gendisk */
756}
757
758static struct kobj_type blk_queue_ktype = {
759 .default_groups = blk_queue_attr_groups,
760 .sysfs_ops = &queue_sysfs_ops,
761 .release = blk_queue_release,
762};
763
764static void blk_debugfs_remove(struct gendisk *disk)
765{
766 struct request_queue *q = disk->queue;
767
768 mutex_lock(&q->debugfs_mutex);
769 blk_trace_shutdown(q);
770 debugfs_remove_recursive(q->debugfs_dir);
771 q->debugfs_dir = NULL;
772 q->sched_debugfs_dir = NULL;
773 q->rqos_debugfs_dir = NULL;
774 mutex_unlock(&q->debugfs_mutex);
775}
776
777/**
778 * blk_register_queue - register a block layer queue with sysfs
779 * @disk: Disk of which the request queue should be registered with sysfs.
780 */
781int blk_register_queue(struct gendisk *disk)
782{
783 struct request_queue *q = disk->queue;
784 int ret;
785
786 mutex_lock(&q->sysfs_dir_lock);
787 kobject_init(&disk->queue_kobj, &blk_queue_ktype);
788 ret = kobject_add(&disk->queue_kobj, &disk_to_dev(disk)->kobj, "queue");
789 if (ret < 0)
790 goto out_put_queue_kobj;
791
792 if (queue_is_mq(q)) {
793 ret = blk_mq_sysfs_register(disk);
794 if (ret)
795 goto out_put_queue_kobj;
796 }
797 mutex_lock(&q->sysfs_lock);
798
799 mutex_lock(&q->debugfs_mutex);
800 q->debugfs_dir = debugfs_create_dir(disk->disk_name, blk_debugfs_root);
801 if (queue_is_mq(q))
802 blk_mq_debugfs_register(q);
803 mutex_unlock(&q->debugfs_mutex);
804
805 ret = disk_register_independent_access_ranges(disk);
806 if (ret)
807 goto out_debugfs_remove;
808
809 if (q->elevator) {
810 ret = elv_register_queue(q, false);
811 if (ret)
812 goto out_unregister_ia_ranges;
813 }
814
815 ret = blk_crypto_sysfs_register(disk);
816 if (ret)
817 goto out_elv_unregister;
818
819 blk_queue_flag_set(QUEUE_FLAG_REGISTERED, q);
820 wbt_enable_default(q);
821 blk_throtl_register(disk);
822
823 /* Now everything is ready and send out KOBJ_ADD uevent */
824 kobject_uevent(&disk->queue_kobj, KOBJ_ADD);
825 if (q->elevator)
826 kobject_uevent(&q->elevator->kobj, KOBJ_ADD);
827 mutex_unlock(&q->sysfs_lock);
828 mutex_unlock(&q->sysfs_dir_lock);
829
830 /*
831 * SCSI probing may synchronously create and destroy a lot of
832 * request_queues for non-existent devices. Shutting down a fully
833 * functional queue takes measureable wallclock time as RCU grace
834 * periods are involved. To avoid excessive latency in these
835 * cases, a request_queue starts out in a degraded mode which is
836 * faster to shut down and is made fully functional here as
837 * request_queues for non-existent devices never get registered.
838 */
839 if (!blk_queue_init_done(q)) {
840 blk_queue_flag_set(QUEUE_FLAG_INIT_DONE, q);
841 percpu_ref_switch_to_percpu(&q->q_usage_counter);
842 }
843
844 return ret;
845
846out_elv_unregister:
847 elv_unregister_queue(q);
848out_unregister_ia_ranges:
849 disk_unregister_independent_access_ranges(disk);
850out_debugfs_remove:
851 blk_debugfs_remove(disk);
852 mutex_unlock(&q->sysfs_lock);
853out_put_queue_kobj:
854 kobject_put(&disk->queue_kobj);
855 mutex_unlock(&q->sysfs_dir_lock);
856 return ret;
857}
858
859/**
860 * blk_unregister_queue - counterpart of blk_register_queue()
861 * @disk: Disk of which the request queue should be unregistered from sysfs.
862 *
863 * Note: the caller is responsible for guaranteeing that this function is called
864 * after blk_register_queue() has finished.
865 */
866void blk_unregister_queue(struct gendisk *disk)
867{
868 struct request_queue *q = disk->queue;
869
870 if (WARN_ON(!q))
871 return;
872
873 /* Return early if disk->queue was never registered. */
874 if (!blk_queue_registered(q))
875 return;
876
877 /*
878 * Since sysfs_remove_dir() prevents adding new directory entries
879 * before removal of existing entries starts, protect against
880 * concurrent elv_iosched_store() calls.
881 */
882 mutex_lock(&q->sysfs_lock);
883 blk_queue_flag_clear(QUEUE_FLAG_REGISTERED, q);
884 mutex_unlock(&q->sysfs_lock);
885
886 mutex_lock(&q->sysfs_dir_lock);
887 /*
888 * Remove the sysfs attributes before unregistering the queue data
889 * structures that can be modified through sysfs.
890 */
891 if (queue_is_mq(q))
892 blk_mq_sysfs_unregister(disk);
893 blk_crypto_sysfs_unregister(disk);
894
895 mutex_lock(&q->sysfs_lock);
896 elv_unregister_queue(q);
897 disk_unregister_independent_access_ranges(disk);
898 mutex_unlock(&q->sysfs_lock);
899
900 /* Now that we've deleted all child objects, we can delete the queue. */
901 kobject_uevent(&disk->queue_kobj, KOBJ_REMOVE);
902 kobject_del(&disk->queue_kobj);
903 mutex_unlock(&q->sysfs_dir_lock);
904
905 blk_debugfs_remove(disk);
906}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Functions related to sysfs handling
4 */
5#include <linux/kernel.h>
6#include <linux/slab.h>
7#include <linux/module.h>
8#include <linux/bio.h>
9#include <linux/blkdev.h>
10#include <linux/backing-dev.h>
11#include <linux/blktrace_api.h>
12#include <linux/debugfs.h>
13
14#include "blk.h"
15#include "blk-mq.h"
16#include "blk-mq-debugfs.h"
17#include "blk-mq-sched.h"
18#include "blk-rq-qos.h"
19#include "blk-wbt.h"
20#include "blk-cgroup.h"
21#include "blk-throttle.h"
22
23struct queue_sysfs_entry {
24 struct attribute attr;
25 ssize_t (*show)(struct request_queue *, char *);
26 ssize_t (*store)(struct request_queue *, const char *, size_t);
27};
28
29static ssize_t
30queue_var_show(unsigned long var, char *page)
31{
32 return sprintf(page, "%lu\n", var);
33}
34
35static ssize_t
36queue_var_store(unsigned long *var, const char *page, size_t count)
37{
38 int err;
39 unsigned long v;
40
41 err = kstrtoul(page, 10, &v);
42 if (err || v > UINT_MAX)
43 return -EINVAL;
44
45 *var = v;
46
47 return count;
48}
49
50static ssize_t queue_requests_show(struct request_queue *q, char *page)
51{
52 return queue_var_show(q->nr_requests, page);
53}
54
55static ssize_t
56queue_requests_store(struct request_queue *q, const char *page, size_t count)
57{
58 unsigned long nr;
59 int ret, err;
60
61 if (!queue_is_mq(q))
62 return -EINVAL;
63
64 ret = queue_var_store(&nr, page, count);
65 if (ret < 0)
66 return ret;
67
68 if (nr < BLKDEV_MIN_RQ)
69 nr = BLKDEV_MIN_RQ;
70
71 err = blk_mq_update_nr_requests(q, nr);
72 if (err)
73 return err;
74
75 return ret;
76}
77
78static ssize_t queue_ra_show(struct request_queue *q, char *page)
79{
80 unsigned long ra_kb;
81
82 if (!q->disk)
83 return -EINVAL;
84 ra_kb = q->disk->bdi->ra_pages << (PAGE_SHIFT - 10);
85 return queue_var_show(ra_kb, page);
86}
87
88static ssize_t
89queue_ra_store(struct request_queue *q, const char *page, size_t count)
90{
91 unsigned long ra_kb;
92 ssize_t ret;
93
94 if (!q->disk)
95 return -EINVAL;
96 ret = queue_var_store(&ra_kb, page, count);
97 if (ret < 0)
98 return ret;
99 q->disk->bdi->ra_pages = ra_kb >> (PAGE_SHIFT - 10);
100 return ret;
101}
102
103static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
104{
105 int max_sectors_kb = queue_max_sectors(q) >> 1;
106
107 return queue_var_show(max_sectors_kb, page);
108}
109
110static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
111{
112 return queue_var_show(queue_max_segments(q), page);
113}
114
115static ssize_t queue_max_discard_segments_show(struct request_queue *q,
116 char *page)
117{
118 return queue_var_show(queue_max_discard_segments(q), page);
119}
120
121static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
122{
123 return queue_var_show(q->limits.max_integrity_segments, page);
124}
125
126static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
127{
128 return queue_var_show(queue_max_segment_size(q), page);
129}
130
131static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
132{
133 return queue_var_show(queue_logical_block_size(q), page);
134}
135
136static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
137{
138 return queue_var_show(queue_physical_block_size(q), page);
139}
140
141static ssize_t queue_chunk_sectors_show(struct request_queue *q, char *page)
142{
143 return queue_var_show(q->limits.chunk_sectors, page);
144}
145
146static ssize_t queue_io_min_show(struct request_queue *q, char *page)
147{
148 return queue_var_show(queue_io_min(q), page);
149}
150
151static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
152{
153 return queue_var_show(queue_io_opt(q), page);
154}
155
156static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
157{
158 return queue_var_show(q->limits.discard_granularity, page);
159}
160
161static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
162{
163
164 return sprintf(page, "%llu\n",
165 (unsigned long long)q->limits.max_hw_discard_sectors << 9);
166}
167
168static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
169{
170 return sprintf(page, "%llu\n",
171 (unsigned long long)q->limits.max_discard_sectors << 9);
172}
173
174static ssize_t queue_discard_max_store(struct request_queue *q,
175 const char *page, size_t count)
176{
177 unsigned long max_discard;
178 ssize_t ret = queue_var_store(&max_discard, page, count);
179
180 if (ret < 0)
181 return ret;
182
183 if (max_discard & (q->limits.discard_granularity - 1))
184 return -EINVAL;
185
186 max_discard >>= 9;
187 if (max_discard > UINT_MAX)
188 return -EINVAL;
189
190 if (max_discard > q->limits.max_hw_discard_sectors)
191 max_discard = q->limits.max_hw_discard_sectors;
192
193 q->limits.max_discard_sectors = max_discard;
194 return ret;
195}
196
197static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
198{
199 return queue_var_show(0, page);
200}
201
202static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
203{
204 return queue_var_show(0, page);
205}
206
207static ssize_t queue_write_zeroes_max_show(struct request_queue *q, char *page)
208{
209 return sprintf(page, "%llu\n",
210 (unsigned long long)q->limits.max_write_zeroes_sectors << 9);
211}
212
213static ssize_t queue_zone_write_granularity_show(struct request_queue *q,
214 char *page)
215{
216 return queue_var_show(queue_zone_write_granularity(q), page);
217}
218
219static ssize_t queue_zone_append_max_show(struct request_queue *q, char *page)
220{
221 unsigned long long max_sectors = q->limits.max_zone_append_sectors;
222
223 return sprintf(page, "%llu\n", max_sectors << SECTOR_SHIFT);
224}
225
226static ssize_t
227queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
228{
229 unsigned long var;
230 unsigned int max_sectors_kb,
231 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
232 page_kb = 1 << (PAGE_SHIFT - 10);
233 ssize_t ret = queue_var_store(&var, page, count);
234
235 if (ret < 0)
236 return ret;
237
238 max_sectors_kb = (unsigned int)var;
239 max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb,
240 q->limits.max_dev_sectors >> 1);
241 if (max_sectors_kb == 0) {
242 q->limits.max_user_sectors = 0;
243 max_sectors_kb = min(max_hw_sectors_kb,
244 BLK_DEF_MAX_SECTORS_CAP >> 1);
245 } else {
246 if (max_sectors_kb > max_hw_sectors_kb ||
247 max_sectors_kb < page_kb)
248 return -EINVAL;
249 q->limits.max_user_sectors = max_sectors_kb << 1;
250 }
251
252 spin_lock_irq(&q->queue_lock);
253 q->limits.max_sectors = max_sectors_kb << 1;
254 if (q->disk)
255 q->disk->bdi->io_pages = max_sectors_kb >> (PAGE_SHIFT - 10);
256 spin_unlock_irq(&q->queue_lock);
257
258 return ret;
259}
260
261static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
262{
263 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
264
265 return queue_var_show(max_hw_sectors_kb, page);
266}
267
268static ssize_t queue_virt_boundary_mask_show(struct request_queue *q, char *page)
269{
270 return queue_var_show(q->limits.virt_boundary_mask, page);
271}
272
273static ssize_t queue_dma_alignment_show(struct request_queue *q, char *page)
274{
275 return queue_var_show(queue_dma_alignment(q), page);
276}
277
278#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
279static ssize_t \
280queue_##name##_show(struct request_queue *q, char *page) \
281{ \
282 int bit; \
283 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
284 return queue_var_show(neg ? !bit : bit, page); \
285} \
286static ssize_t \
287queue_##name##_store(struct request_queue *q, const char *page, size_t count) \
288{ \
289 unsigned long val; \
290 ssize_t ret; \
291 ret = queue_var_store(&val, page, count); \
292 if (ret < 0) \
293 return ret; \
294 if (neg) \
295 val = !val; \
296 \
297 if (val) \
298 blk_queue_flag_set(QUEUE_FLAG_##flag, q); \
299 else \
300 blk_queue_flag_clear(QUEUE_FLAG_##flag, q); \
301 return ret; \
302}
303
304QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
305QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
306QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
307QUEUE_SYSFS_BIT_FNS(stable_writes, STABLE_WRITES, 0);
308#undef QUEUE_SYSFS_BIT_FNS
309
310static ssize_t queue_zoned_show(struct request_queue *q, char *page)
311{
312 if (blk_queue_is_zoned(q))
313 return sprintf(page, "host-managed\n");
314 return sprintf(page, "none\n");
315}
316
317static ssize_t queue_nr_zones_show(struct request_queue *q, char *page)
318{
319 return queue_var_show(disk_nr_zones(q->disk), page);
320}
321
322static ssize_t queue_max_open_zones_show(struct request_queue *q, char *page)
323{
324 return queue_var_show(bdev_max_open_zones(q->disk->part0), page);
325}
326
327static ssize_t queue_max_active_zones_show(struct request_queue *q, char *page)
328{
329 return queue_var_show(bdev_max_active_zones(q->disk->part0), page);
330}
331
332static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
333{
334 return queue_var_show((blk_queue_nomerges(q) << 1) |
335 blk_queue_noxmerges(q), page);
336}
337
338static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
339 size_t count)
340{
341 unsigned long nm;
342 ssize_t ret = queue_var_store(&nm, page, count);
343
344 if (ret < 0)
345 return ret;
346
347 blk_queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
348 blk_queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
349 if (nm == 2)
350 blk_queue_flag_set(QUEUE_FLAG_NOMERGES, q);
351 else if (nm)
352 blk_queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
353
354 return ret;
355}
356
357static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
358{
359 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
360 bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
361
362 return queue_var_show(set << force, page);
363}
364
365static ssize_t
366queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
367{
368 ssize_t ret = -EINVAL;
369#ifdef CONFIG_SMP
370 unsigned long val;
371
372 ret = queue_var_store(&val, page, count);
373 if (ret < 0)
374 return ret;
375
376 if (val == 2) {
377 blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
378 blk_queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
379 } else if (val == 1) {
380 blk_queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
381 blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
382 } else if (val == 0) {
383 blk_queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
384 blk_queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
385 }
386#endif
387 return ret;
388}
389
390static ssize_t queue_poll_delay_show(struct request_queue *q, char *page)
391{
392 return sprintf(page, "%d\n", -1);
393}
394
395static ssize_t queue_poll_delay_store(struct request_queue *q, const char *page,
396 size_t count)
397{
398 return count;
399}
400
401static ssize_t queue_poll_show(struct request_queue *q, char *page)
402{
403 return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
404}
405
406static ssize_t queue_poll_store(struct request_queue *q, const char *page,
407 size_t count)
408{
409 if (!test_bit(QUEUE_FLAG_POLL, &q->queue_flags))
410 return -EINVAL;
411 pr_info_ratelimited("writes to the poll attribute are ignored.\n");
412 pr_info_ratelimited("please use driver specific parameters instead.\n");
413 return count;
414}
415
416static ssize_t queue_io_timeout_show(struct request_queue *q, char *page)
417{
418 return sprintf(page, "%u\n", jiffies_to_msecs(q->rq_timeout));
419}
420
421static ssize_t queue_io_timeout_store(struct request_queue *q, const char *page,
422 size_t count)
423{
424 unsigned int val;
425 int err;
426
427 err = kstrtou32(page, 10, &val);
428 if (err || val == 0)
429 return -EINVAL;
430
431 blk_queue_rq_timeout(q, msecs_to_jiffies(val));
432
433 return count;
434}
435
436static ssize_t queue_wc_show(struct request_queue *q, char *page)
437{
438 if (test_bit(QUEUE_FLAG_WC, &q->queue_flags))
439 return sprintf(page, "write back\n");
440
441 return sprintf(page, "write through\n");
442}
443
444static ssize_t queue_wc_store(struct request_queue *q, const char *page,
445 size_t count)
446{
447 if (!strncmp(page, "write back", 10)) {
448 if (!test_bit(QUEUE_FLAG_HW_WC, &q->queue_flags))
449 return -EINVAL;
450 blk_queue_flag_set(QUEUE_FLAG_WC, q);
451 } else if (!strncmp(page, "write through", 13) ||
452 !strncmp(page, "none", 4)) {
453 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
454 } else {
455 return -EINVAL;
456 }
457
458 return count;
459}
460
461static ssize_t queue_fua_show(struct request_queue *q, char *page)
462{
463 return sprintf(page, "%u\n", test_bit(QUEUE_FLAG_FUA, &q->queue_flags));
464}
465
466static ssize_t queue_dax_show(struct request_queue *q, char *page)
467{
468 return queue_var_show(blk_queue_dax(q), page);
469}
470
471#define QUEUE_RO_ENTRY(_prefix, _name) \
472static struct queue_sysfs_entry _prefix##_entry = { \
473 .attr = { .name = _name, .mode = 0444 }, \
474 .show = _prefix##_show, \
475};
476
477#define QUEUE_RW_ENTRY(_prefix, _name) \
478static struct queue_sysfs_entry _prefix##_entry = { \
479 .attr = { .name = _name, .mode = 0644 }, \
480 .show = _prefix##_show, \
481 .store = _prefix##_store, \
482};
483
484QUEUE_RW_ENTRY(queue_requests, "nr_requests");
485QUEUE_RW_ENTRY(queue_ra, "read_ahead_kb");
486QUEUE_RW_ENTRY(queue_max_sectors, "max_sectors_kb");
487QUEUE_RO_ENTRY(queue_max_hw_sectors, "max_hw_sectors_kb");
488QUEUE_RO_ENTRY(queue_max_segments, "max_segments");
489QUEUE_RO_ENTRY(queue_max_integrity_segments, "max_integrity_segments");
490QUEUE_RO_ENTRY(queue_max_segment_size, "max_segment_size");
491QUEUE_RW_ENTRY(elv_iosched, "scheduler");
492
493QUEUE_RO_ENTRY(queue_logical_block_size, "logical_block_size");
494QUEUE_RO_ENTRY(queue_physical_block_size, "physical_block_size");
495QUEUE_RO_ENTRY(queue_chunk_sectors, "chunk_sectors");
496QUEUE_RO_ENTRY(queue_io_min, "minimum_io_size");
497QUEUE_RO_ENTRY(queue_io_opt, "optimal_io_size");
498
499QUEUE_RO_ENTRY(queue_max_discard_segments, "max_discard_segments");
500QUEUE_RO_ENTRY(queue_discard_granularity, "discard_granularity");
501QUEUE_RO_ENTRY(queue_discard_max_hw, "discard_max_hw_bytes");
502QUEUE_RW_ENTRY(queue_discard_max, "discard_max_bytes");
503QUEUE_RO_ENTRY(queue_discard_zeroes_data, "discard_zeroes_data");
504
505QUEUE_RO_ENTRY(queue_write_same_max, "write_same_max_bytes");
506QUEUE_RO_ENTRY(queue_write_zeroes_max, "write_zeroes_max_bytes");
507QUEUE_RO_ENTRY(queue_zone_append_max, "zone_append_max_bytes");
508QUEUE_RO_ENTRY(queue_zone_write_granularity, "zone_write_granularity");
509
510QUEUE_RO_ENTRY(queue_zoned, "zoned");
511QUEUE_RO_ENTRY(queue_nr_zones, "nr_zones");
512QUEUE_RO_ENTRY(queue_max_open_zones, "max_open_zones");
513QUEUE_RO_ENTRY(queue_max_active_zones, "max_active_zones");
514
515QUEUE_RW_ENTRY(queue_nomerges, "nomerges");
516QUEUE_RW_ENTRY(queue_rq_affinity, "rq_affinity");
517QUEUE_RW_ENTRY(queue_poll, "io_poll");
518QUEUE_RW_ENTRY(queue_poll_delay, "io_poll_delay");
519QUEUE_RW_ENTRY(queue_wc, "write_cache");
520QUEUE_RO_ENTRY(queue_fua, "fua");
521QUEUE_RO_ENTRY(queue_dax, "dax");
522QUEUE_RW_ENTRY(queue_io_timeout, "io_timeout");
523QUEUE_RO_ENTRY(queue_virt_boundary_mask, "virt_boundary_mask");
524QUEUE_RO_ENTRY(queue_dma_alignment, "dma_alignment");
525
526#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
527QUEUE_RW_ENTRY(blk_throtl_sample_time, "throttle_sample_time");
528#endif
529
530/* legacy alias for logical_block_size: */
531static struct queue_sysfs_entry queue_hw_sector_size_entry = {
532 .attr = {.name = "hw_sector_size", .mode = 0444 },
533 .show = queue_logical_block_size_show,
534};
535
536QUEUE_RW_ENTRY(queue_nonrot, "rotational");
537QUEUE_RW_ENTRY(queue_iostats, "iostats");
538QUEUE_RW_ENTRY(queue_random, "add_random");
539QUEUE_RW_ENTRY(queue_stable_writes, "stable_writes");
540
541#ifdef CONFIG_BLK_WBT
542static ssize_t queue_var_store64(s64 *var, const char *page)
543{
544 int err;
545 s64 v;
546
547 err = kstrtos64(page, 10, &v);
548 if (err < 0)
549 return err;
550
551 *var = v;
552 return 0;
553}
554
555static ssize_t queue_wb_lat_show(struct request_queue *q, char *page)
556{
557 if (!wbt_rq_qos(q))
558 return -EINVAL;
559
560 if (wbt_disabled(q))
561 return sprintf(page, "0\n");
562
563 return sprintf(page, "%llu\n", div_u64(wbt_get_min_lat(q), 1000));
564}
565
566static ssize_t queue_wb_lat_store(struct request_queue *q, const char *page,
567 size_t count)
568{
569 struct rq_qos *rqos;
570 ssize_t ret;
571 s64 val;
572
573 ret = queue_var_store64(&val, page);
574 if (ret < 0)
575 return ret;
576 if (val < -1)
577 return -EINVAL;
578
579 rqos = wbt_rq_qos(q);
580 if (!rqos) {
581 ret = wbt_init(q->disk);
582 if (ret)
583 return ret;
584 }
585
586 if (val == -1)
587 val = wbt_default_latency_nsec(q);
588 else if (val >= 0)
589 val *= 1000ULL;
590
591 if (wbt_get_min_lat(q) == val)
592 return count;
593
594 /*
595 * Ensure that the queue is idled, in case the latency update
596 * ends up either enabling or disabling wbt completely. We can't
597 * have IO inflight if that happens.
598 */
599 blk_mq_freeze_queue(q);
600 blk_mq_quiesce_queue(q);
601
602 wbt_set_min_lat(q, val);
603
604 blk_mq_unquiesce_queue(q);
605 blk_mq_unfreeze_queue(q);
606
607 return count;
608}
609
610QUEUE_RW_ENTRY(queue_wb_lat, "wbt_lat_usec");
611#endif
612
613/* Common attributes for bio-based and request-based queues. */
614static struct attribute *queue_attrs[] = {
615 &queue_ra_entry.attr,
616 &queue_max_hw_sectors_entry.attr,
617 &queue_max_sectors_entry.attr,
618 &queue_max_segments_entry.attr,
619 &queue_max_discard_segments_entry.attr,
620 &queue_max_integrity_segments_entry.attr,
621 &queue_max_segment_size_entry.attr,
622 &queue_hw_sector_size_entry.attr,
623 &queue_logical_block_size_entry.attr,
624 &queue_physical_block_size_entry.attr,
625 &queue_chunk_sectors_entry.attr,
626 &queue_io_min_entry.attr,
627 &queue_io_opt_entry.attr,
628 &queue_discard_granularity_entry.attr,
629 &queue_discard_max_entry.attr,
630 &queue_discard_max_hw_entry.attr,
631 &queue_discard_zeroes_data_entry.attr,
632 &queue_write_same_max_entry.attr,
633 &queue_write_zeroes_max_entry.attr,
634 &queue_zone_append_max_entry.attr,
635 &queue_zone_write_granularity_entry.attr,
636 &queue_nonrot_entry.attr,
637 &queue_zoned_entry.attr,
638 &queue_nr_zones_entry.attr,
639 &queue_max_open_zones_entry.attr,
640 &queue_max_active_zones_entry.attr,
641 &queue_nomerges_entry.attr,
642 &queue_iostats_entry.attr,
643 &queue_stable_writes_entry.attr,
644 &queue_random_entry.attr,
645 &queue_poll_entry.attr,
646 &queue_wc_entry.attr,
647 &queue_fua_entry.attr,
648 &queue_dax_entry.attr,
649 &queue_poll_delay_entry.attr,
650#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
651 &blk_throtl_sample_time_entry.attr,
652#endif
653 &queue_virt_boundary_mask_entry.attr,
654 &queue_dma_alignment_entry.attr,
655 NULL,
656};
657
658/* Request-based queue attributes that are not relevant for bio-based queues. */
659static struct attribute *blk_mq_queue_attrs[] = {
660 &queue_requests_entry.attr,
661 &elv_iosched_entry.attr,
662 &queue_rq_affinity_entry.attr,
663 &queue_io_timeout_entry.attr,
664#ifdef CONFIG_BLK_WBT
665 &queue_wb_lat_entry.attr,
666#endif
667 NULL,
668};
669
670static umode_t queue_attr_visible(struct kobject *kobj, struct attribute *attr,
671 int n)
672{
673 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
674 struct request_queue *q = disk->queue;
675
676 if ((attr == &queue_max_open_zones_entry.attr ||
677 attr == &queue_max_active_zones_entry.attr) &&
678 !blk_queue_is_zoned(q))
679 return 0;
680
681 return attr->mode;
682}
683
684static umode_t blk_mq_queue_attr_visible(struct kobject *kobj,
685 struct attribute *attr, int n)
686{
687 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
688 struct request_queue *q = disk->queue;
689
690 if (!queue_is_mq(q))
691 return 0;
692
693 if (attr == &queue_io_timeout_entry.attr && !q->mq_ops->timeout)
694 return 0;
695
696 return attr->mode;
697}
698
699static struct attribute_group queue_attr_group = {
700 .attrs = queue_attrs,
701 .is_visible = queue_attr_visible,
702};
703
704static struct attribute_group blk_mq_queue_attr_group = {
705 .attrs = blk_mq_queue_attrs,
706 .is_visible = blk_mq_queue_attr_visible,
707};
708
709#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
710
711static ssize_t
712queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
713{
714 struct queue_sysfs_entry *entry = to_queue(attr);
715 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
716 struct request_queue *q = disk->queue;
717 ssize_t res;
718
719 if (!entry->show)
720 return -EIO;
721 mutex_lock(&q->sysfs_lock);
722 res = entry->show(q, page);
723 mutex_unlock(&q->sysfs_lock);
724 return res;
725}
726
727static ssize_t
728queue_attr_store(struct kobject *kobj, struct attribute *attr,
729 const char *page, size_t length)
730{
731 struct queue_sysfs_entry *entry = to_queue(attr);
732 struct gendisk *disk = container_of(kobj, struct gendisk, queue_kobj);
733 struct request_queue *q = disk->queue;
734 ssize_t res;
735
736 if (!entry->store)
737 return -EIO;
738
739 mutex_lock(&q->sysfs_lock);
740 res = entry->store(q, page, length);
741 mutex_unlock(&q->sysfs_lock);
742 return res;
743}
744
745static const struct sysfs_ops queue_sysfs_ops = {
746 .show = queue_attr_show,
747 .store = queue_attr_store,
748};
749
750static const struct attribute_group *blk_queue_attr_groups[] = {
751 &queue_attr_group,
752 &blk_mq_queue_attr_group,
753 NULL
754};
755
756static void blk_queue_release(struct kobject *kobj)
757{
758 /* nothing to do here, all data is associated with the parent gendisk */
759}
760
761static const struct kobj_type blk_queue_ktype = {
762 .default_groups = blk_queue_attr_groups,
763 .sysfs_ops = &queue_sysfs_ops,
764 .release = blk_queue_release,
765};
766
767static void blk_debugfs_remove(struct gendisk *disk)
768{
769 struct request_queue *q = disk->queue;
770
771 mutex_lock(&q->debugfs_mutex);
772 blk_trace_shutdown(q);
773 debugfs_remove_recursive(q->debugfs_dir);
774 q->debugfs_dir = NULL;
775 q->sched_debugfs_dir = NULL;
776 q->rqos_debugfs_dir = NULL;
777 mutex_unlock(&q->debugfs_mutex);
778}
779
780/**
781 * blk_register_queue - register a block layer queue with sysfs
782 * @disk: Disk of which the request queue should be registered with sysfs.
783 */
784int blk_register_queue(struct gendisk *disk)
785{
786 struct request_queue *q = disk->queue;
787 int ret;
788
789 mutex_lock(&q->sysfs_dir_lock);
790 kobject_init(&disk->queue_kobj, &blk_queue_ktype);
791 ret = kobject_add(&disk->queue_kobj, &disk_to_dev(disk)->kobj, "queue");
792 if (ret < 0)
793 goto out_put_queue_kobj;
794
795 if (queue_is_mq(q)) {
796 ret = blk_mq_sysfs_register(disk);
797 if (ret)
798 goto out_put_queue_kobj;
799 }
800 mutex_lock(&q->sysfs_lock);
801
802 mutex_lock(&q->debugfs_mutex);
803 q->debugfs_dir = debugfs_create_dir(disk->disk_name, blk_debugfs_root);
804 if (queue_is_mq(q))
805 blk_mq_debugfs_register(q);
806 mutex_unlock(&q->debugfs_mutex);
807
808 ret = disk_register_independent_access_ranges(disk);
809 if (ret)
810 goto out_debugfs_remove;
811
812 if (q->elevator) {
813 ret = elv_register_queue(q, false);
814 if (ret)
815 goto out_unregister_ia_ranges;
816 }
817
818 ret = blk_crypto_sysfs_register(disk);
819 if (ret)
820 goto out_elv_unregister;
821
822 blk_queue_flag_set(QUEUE_FLAG_REGISTERED, q);
823 wbt_enable_default(disk);
824 blk_throtl_register(disk);
825
826 /* Now everything is ready and send out KOBJ_ADD uevent */
827 kobject_uevent(&disk->queue_kobj, KOBJ_ADD);
828 if (q->elevator)
829 kobject_uevent(&q->elevator->kobj, KOBJ_ADD);
830 mutex_unlock(&q->sysfs_lock);
831 mutex_unlock(&q->sysfs_dir_lock);
832
833 /*
834 * SCSI probing may synchronously create and destroy a lot of
835 * request_queues for non-existent devices. Shutting down a fully
836 * functional queue takes measureable wallclock time as RCU grace
837 * periods are involved. To avoid excessive latency in these
838 * cases, a request_queue starts out in a degraded mode which is
839 * faster to shut down and is made fully functional here as
840 * request_queues for non-existent devices never get registered.
841 */
842 if (!blk_queue_init_done(q)) {
843 blk_queue_flag_set(QUEUE_FLAG_INIT_DONE, q);
844 percpu_ref_switch_to_percpu(&q->q_usage_counter);
845 }
846
847 return ret;
848
849out_elv_unregister:
850 elv_unregister_queue(q);
851out_unregister_ia_ranges:
852 disk_unregister_independent_access_ranges(disk);
853out_debugfs_remove:
854 blk_debugfs_remove(disk);
855 mutex_unlock(&q->sysfs_lock);
856out_put_queue_kobj:
857 kobject_put(&disk->queue_kobj);
858 mutex_unlock(&q->sysfs_dir_lock);
859 return ret;
860}
861
862/**
863 * blk_unregister_queue - counterpart of blk_register_queue()
864 * @disk: Disk of which the request queue should be unregistered from sysfs.
865 *
866 * Note: the caller is responsible for guaranteeing that this function is called
867 * after blk_register_queue() has finished.
868 */
869void blk_unregister_queue(struct gendisk *disk)
870{
871 struct request_queue *q = disk->queue;
872
873 if (WARN_ON(!q))
874 return;
875
876 /* Return early if disk->queue was never registered. */
877 if (!blk_queue_registered(q))
878 return;
879
880 /*
881 * Since sysfs_remove_dir() prevents adding new directory entries
882 * before removal of existing entries starts, protect against
883 * concurrent elv_iosched_store() calls.
884 */
885 mutex_lock(&q->sysfs_lock);
886 blk_queue_flag_clear(QUEUE_FLAG_REGISTERED, q);
887 mutex_unlock(&q->sysfs_lock);
888
889 mutex_lock(&q->sysfs_dir_lock);
890 /*
891 * Remove the sysfs attributes before unregistering the queue data
892 * structures that can be modified through sysfs.
893 */
894 if (queue_is_mq(q))
895 blk_mq_sysfs_unregister(disk);
896 blk_crypto_sysfs_unregister(disk);
897
898 mutex_lock(&q->sysfs_lock);
899 elv_unregister_queue(q);
900 disk_unregister_independent_access_ranges(disk);
901 mutex_unlock(&q->sysfs_lock);
902
903 /* Now that we've deleted all child objects, we can delete the queue. */
904 kobject_uevent(&disk->queue_kobj, KOBJ_REMOVE);
905 kobject_del(&disk->queue_kobj);
906 mutex_unlock(&q->sysfs_dir_lock);
907
908 blk_debugfs_remove(disk);
909}