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/blk-cgroup.h>
14
15#include "blk.h"
16#include "blk-mq.h"
17#include "blk-mq-debugfs.h"
18#include "blk-wbt.h"
19
20struct queue_sysfs_entry {
21 struct attribute attr;
22 ssize_t (*show)(struct request_queue *, char *);
23 ssize_t (*store)(struct request_queue *, const char *, size_t);
24};
25
26static ssize_t
27queue_var_show(unsigned long var, char *page)
28{
29 return sprintf(page, "%lu\n", var);
30}
31
32static ssize_t
33queue_var_store(unsigned long *var, const char *page, size_t count)
34{
35 int err;
36 unsigned long v;
37
38 err = kstrtoul(page, 10, &v);
39 if (err || v > UINT_MAX)
40 return -EINVAL;
41
42 *var = v;
43
44 return count;
45}
46
47static ssize_t queue_var_store64(s64 *var, const char *page)
48{
49 int err;
50 s64 v;
51
52 err = kstrtos64(page, 10, &v);
53 if (err < 0)
54 return err;
55
56 *var = v;
57 return 0;
58}
59
60static ssize_t queue_requests_show(struct request_queue *q, char *page)
61{
62 return queue_var_show(q->nr_requests, (page));
63}
64
65static ssize_t
66queue_requests_store(struct request_queue *q, const char *page, size_t count)
67{
68 unsigned long nr;
69 int ret, err;
70
71 if (!q->request_fn && !q->mq_ops)
72 return -EINVAL;
73
74 ret = queue_var_store(&nr, page, count);
75 if (ret < 0)
76 return ret;
77
78 if (nr < BLKDEV_MIN_RQ)
79 nr = BLKDEV_MIN_RQ;
80
81 if (q->request_fn)
82 err = blk_update_nr_requests(q, nr);
83 else
84 err = blk_mq_update_nr_requests(q, nr);
85
86 if (err)
87 return err;
88
89 return ret;
90}
91
92static ssize_t queue_ra_show(struct request_queue *q, char *page)
93{
94 unsigned long ra_kb = q->backing_dev_info->ra_pages <<
95 (PAGE_SHIFT - 10);
96
97 return queue_var_show(ra_kb, (page));
98}
99
100static ssize_t
101queue_ra_store(struct request_queue *q, const char *page, size_t count)
102{
103 unsigned long ra_kb;
104 ssize_t ret = queue_var_store(&ra_kb, page, count);
105
106 if (ret < 0)
107 return ret;
108
109 q->backing_dev_info->ra_pages = ra_kb >> (PAGE_SHIFT - 10);
110
111 return ret;
112}
113
114static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
115{
116 int max_sectors_kb = queue_max_sectors(q) >> 1;
117
118 return queue_var_show(max_sectors_kb, (page));
119}
120
121static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
122{
123 return queue_var_show(queue_max_segments(q), (page));
124}
125
126static ssize_t queue_max_discard_segments_show(struct request_queue *q,
127 char *page)
128{
129 return queue_var_show(queue_max_discard_segments(q), (page));
130}
131
132static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
133{
134 return queue_var_show(q->limits.max_integrity_segments, (page));
135}
136
137static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
138{
139 if (blk_queue_cluster(q))
140 return queue_var_show(queue_max_segment_size(q), (page));
141
142 return queue_var_show(PAGE_SIZE, (page));
143}
144
145static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
146{
147 return queue_var_show(queue_logical_block_size(q), page);
148}
149
150static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
151{
152 return queue_var_show(queue_physical_block_size(q), page);
153}
154
155static ssize_t queue_chunk_sectors_show(struct request_queue *q, char *page)
156{
157 return queue_var_show(q->limits.chunk_sectors, page);
158}
159
160static ssize_t queue_io_min_show(struct request_queue *q, char *page)
161{
162 return queue_var_show(queue_io_min(q), page);
163}
164
165static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
166{
167 return queue_var_show(queue_io_opt(q), page);
168}
169
170static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
171{
172 return queue_var_show(q->limits.discard_granularity, page);
173}
174
175static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
176{
177
178 return sprintf(page, "%llu\n",
179 (unsigned long long)q->limits.max_hw_discard_sectors << 9);
180}
181
182static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
183{
184 return sprintf(page, "%llu\n",
185 (unsigned long long)q->limits.max_discard_sectors << 9);
186}
187
188static ssize_t queue_discard_max_store(struct request_queue *q,
189 const char *page, size_t count)
190{
191 unsigned long max_discard;
192 ssize_t ret = queue_var_store(&max_discard, page, count);
193
194 if (ret < 0)
195 return ret;
196
197 if (max_discard & (q->limits.discard_granularity - 1))
198 return -EINVAL;
199
200 max_discard >>= 9;
201 if (max_discard > UINT_MAX)
202 return -EINVAL;
203
204 if (max_discard > q->limits.max_hw_discard_sectors)
205 max_discard = q->limits.max_hw_discard_sectors;
206
207 q->limits.max_discard_sectors = max_discard;
208 return ret;
209}
210
211static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
212{
213 return queue_var_show(0, page);
214}
215
216static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
217{
218 return sprintf(page, "%llu\n",
219 (unsigned long long)q->limits.max_write_same_sectors << 9);
220}
221
222static ssize_t queue_write_zeroes_max_show(struct request_queue *q, char *page)
223{
224 return sprintf(page, "%llu\n",
225 (unsigned long long)q->limits.max_write_zeroes_sectors << 9);
226}
227
228static ssize_t
229queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
230{
231 unsigned long max_sectors_kb,
232 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
233 page_kb = 1 << (PAGE_SHIFT - 10);
234 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
235
236 if (ret < 0)
237 return ret;
238
239 max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb, (unsigned long)
240 q->limits.max_dev_sectors >> 1);
241
242 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
243 return -EINVAL;
244
245 spin_lock_irq(q->queue_lock);
246 q->limits.max_sectors = max_sectors_kb << 1;
247 q->backing_dev_info->io_pages = max_sectors_kb >> (PAGE_SHIFT - 10);
248 spin_unlock_irq(q->queue_lock);
249
250 return ret;
251}
252
253static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
254{
255 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
256
257 return queue_var_show(max_hw_sectors_kb, (page));
258}
259
260#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
261static ssize_t \
262queue_show_##name(struct request_queue *q, char *page) \
263{ \
264 int bit; \
265 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
266 return queue_var_show(neg ? !bit : bit, page); \
267} \
268static ssize_t \
269queue_store_##name(struct request_queue *q, const char *page, size_t count) \
270{ \
271 unsigned long val; \
272 ssize_t ret; \
273 ret = queue_var_store(&val, page, count); \
274 if (ret < 0) \
275 return ret; \
276 if (neg) \
277 val = !val; \
278 \
279 if (val) \
280 blk_queue_flag_set(QUEUE_FLAG_##flag, q); \
281 else \
282 blk_queue_flag_clear(QUEUE_FLAG_##flag, q); \
283 return ret; \
284}
285
286QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
287QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
288QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
289#undef QUEUE_SYSFS_BIT_FNS
290
291static ssize_t queue_zoned_show(struct request_queue *q, char *page)
292{
293 switch (blk_queue_zoned_model(q)) {
294 case BLK_ZONED_HA:
295 return sprintf(page, "host-aware\n");
296 case BLK_ZONED_HM:
297 return sprintf(page, "host-managed\n");
298 default:
299 return sprintf(page, "none\n");
300 }
301}
302
303static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
304{
305 return queue_var_show((blk_queue_nomerges(q) << 1) |
306 blk_queue_noxmerges(q), page);
307}
308
309static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
310 size_t count)
311{
312 unsigned long nm;
313 ssize_t ret = queue_var_store(&nm, page, count);
314
315 if (ret < 0)
316 return ret;
317
318 spin_lock_irq(q->queue_lock);
319 queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
320 queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
321 if (nm == 2)
322 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
323 else if (nm)
324 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
325 spin_unlock_irq(q->queue_lock);
326
327 return ret;
328}
329
330static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
331{
332 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
333 bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
334
335 return queue_var_show(set << force, page);
336}
337
338static ssize_t
339queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
340{
341 ssize_t ret = -EINVAL;
342#ifdef CONFIG_SMP
343 unsigned long val;
344
345 ret = queue_var_store(&val, page, count);
346 if (ret < 0)
347 return ret;
348
349 spin_lock_irq(q->queue_lock);
350 if (val == 2) {
351 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
352 queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
353 } else if (val == 1) {
354 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
355 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
356 } else if (val == 0) {
357 queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
358 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
359 }
360 spin_unlock_irq(q->queue_lock);
361#endif
362 return ret;
363}
364
365static ssize_t queue_poll_delay_show(struct request_queue *q, char *page)
366{
367 int val;
368
369 if (q->poll_nsec == -1)
370 val = -1;
371 else
372 val = q->poll_nsec / 1000;
373
374 return sprintf(page, "%d\n", val);
375}
376
377static ssize_t queue_poll_delay_store(struct request_queue *q, const char *page,
378 size_t count)
379{
380 int err, val;
381
382 if (!q->mq_ops || !q->mq_ops->poll)
383 return -EINVAL;
384
385 err = kstrtoint(page, 10, &val);
386 if (err < 0)
387 return err;
388
389 if (val == -1)
390 q->poll_nsec = -1;
391 else
392 q->poll_nsec = val * 1000;
393
394 return count;
395}
396
397static ssize_t queue_poll_show(struct request_queue *q, char *page)
398{
399 return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
400}
401
402static ssize_t queue_poll_store(struct request_queue *q, const char *page,
403 size_t count)
404{
405 unsigned long poll_on;
406 ssize_t ret;
407
408 if (!q->mq_ops || !q->mq_ops->poll)
409 return -EINVAL;
410
411 ret = queue_var_store(&poll_on, page, count);
412 if (ret < 0)
413 return ret;
414
415 if (poll_on)
416 blk_queue_flag_set(QUEUE_FLAG_POLL, q);
417 else
418 blk_queue_flag_clear(QUEUE_FLAG_POLL, q);
419
420 return ret;
421}
422
423static ssize_t queue_wb_lat_show(struct request_queue *q, char *page)
424{
425 if (!q->rq_wb)
426 return -EINVAL;
427
428 return sprintf(page, "%llu\n", div_u64(q->rq_wb->min_lat_nsec, 1000));
429}
430
431static ssize_t queue_wb_lat_store(struct request_queue *q, const char *page,
432 size_t count)
433{
434 struct rq_wb *rwb;
435 ssize_t ret;
436 s64 val;
437
438 ret = queue_var_store64(&val, page);
439 if (ret < 0)
440 return ret;
441 if (val < -1)
442 return -EINVAL;
443
444 rwb = q->rq_wb;
445 if (!rwb) {
446 ret = wbt_init(q);
447 if (ret)
448 return ret;
449 }
450
451 rwb = q->rq_wb;
452 if (val == -1)
453 rwb->min_lat_nsec = wbt_default_latency_nsec(q);
454 else if (val >= 0)
455 rwb->min_lat_nsec = val * 1000ULL;
456
457 if (rwb->enable_state == WBT_STATE_ON_DEFAULT)
458 rwb->enable_state = WBT_STATE_ON_MANUAL;
459
460 wbt_update_limits(rwb);
461 return count;
462}
463
464static ssize_t queue_wc_show(struct request_queue *q, char *page)
465{
466 if (test_bit(QUEUE_FLAG_WC, &q->queue_flags))
467 return sprintf(page, "write back\n");
468
469 return sprintf(page, "write through\n");
470}
471
472static ssize_t queue_wc_store(struct request_queue *q, const char *page,
473 size_t count)
474{
475 int set = -1;
476
477 if (!strncmp(page, "write back", 10))
478 set = 1;
479 else if (!strncmp(page, "write through", 13) ||
480 !strncmp(page, "none", 4))
481 set = 0;
482
483 if (set == -1)
484 return -EINVAL;
485
486 if (set)
487 blk_queue_flag_set(QUEUE_FLAG_WC, q);
488 else
489 blk_queue_flag_clear(QUEUE_FLAG_WC, q);
490
491 return count;
492}
493
494static ssize_t queue_dax_show(struct request_queue *q, char *page)
495{
496 return queue_var_show(blk_queue_dax(q), page);
497}
498
499static struct queue_sysfs_entry queue_requests_entry = {
500 .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
501 .show = queue_requests_show,
502 .store = queue_requests_store,
503};
504
505static struct queue_sysfs_entry queue_ra_entry = {
506 .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
507 .show = queue_ra_show,
508 .store = queue_ra_store,
509};
510
511static struct queue_sysfs_entry queue_max_sectors_entry = {
512 .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
513 .show = queue_max_sectors_show,
514 .store = queue_max_sectors_store,
515};
516
517static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
518 .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
519 .show = queue_max_hw_sectors_show,
520};
521
522static struct queue_sysfs_entry queue_max_segments_entry = {
523 .attr = {.name = "max_segments", .mode = S_IRUGO },
524 .show = queue_max_segments_show,
525};
526
527static struct queue_sysfs_entry queue_max_discard_segments_entry = {
528 .attr = {.name = "max_discard_segments", .mode = S_IRUGO },
529 .show = queue_max_discard_segments_show,
530};
531
532static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
533 .attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
534 .show = queue_max_integrity_segments_show,
535};
536
537static struct queue_sysfs_entry queue_max_segment_size_entry = {
538 .attr = {.name = "max_segment_size", .mode = S_IRUGO },
539 .show = queue_max_segment_size_show,
540};
541
542static struct queue_sysfs_entry queue_iosched_entry = {
543 .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
544 .show = elv_iosched_show,
545 .store = elv_iosched_store,
546};
547
548static struct queue_sysfs_entry queue_hw_sector_size_entry = {
549 .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
550 .show = queue_logical_block_size_show,
551};
552
553static struct queue_sysfs_entry queue_logical_block_size_entry = {
554 .attr = {.name = "logical_block_size", .mode = S_IRUGO },
555 .show = queue_logical_block_size_show,
556};
557
558static struct queue_sysfs_entry queue_physical_block_size_entry = {
559 .attr = {.name = "physical_block_size", .mode = S_IRUGO },
560 .show = queue_physical_block_size_show,
561};
562
563static struct queue_sysfs_entry queue_chunk_sectors_entry = {
564 .attr = {.name = "chunk_sectors", .mode = S_IRUGO },
565 .show = queue_chunk_sectors_show,
566};
567
568static struct queue_sysfs_entry queue_io_min_entry = {
569 .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
570 .show = queue_io_min_show,
571};
572
573static struct queue_sysfs_entry queue_io_opt_entry = {
574 .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
575 .show = queue_io_opt_show,
576};
577
578static struct queue_sysfs_entry queue_discard_granularity_entry = {
579 .attr = {.name = "discard_granularity", .mode = S_IRUGO },
580 .show = queue_discard_granularity_show,
581};
582
583static struct queue_sysfs_entry queue_discard_max_hw_entry = {
584 .attr = {.name = "discard_max_hw_bytes", .mode = S_IRUGO },
585 .show = queue_discard_max_hw_show,
586};
587
588static struct queue_sysfs_entry queue_discard_max_entry = {
589 .attr = {.name = "discard_max_bytes", .mode = S_IRUGO | S_IWUSR },
590 .show = queue_discard_max_show,
591 .store = queue_discard_max_store,
592};
593
594static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
595 .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
596 .show = queue_discard_zeroes_data_show,
597};
598
599static struct queue_sysfs_entry queue_write_same_max_entry = {
600 .attr = {.name = "write_same_max_bytes", .mode = S_IRUGO },
601 .show = queue_write_same_max_show,
602};
603
604static struct queue_sysfs_entry queue_write_zeroes_max_entry = {
605 .attr = {.name = "write_zeroes_max_bytes", .mode = S_IRUGO },
606 .show = queue_write_zeroes_max_show,
607};
608
609static struct queue_sysfs_entry queue_nonrot_entry = {
610 .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
611 .show = queue_show_nonrot,
612 .store = queue_store_nonrot,
613};
614
615static struct queue_sysfs_entry queue_zoned_entry = {
616 .attr = {.name = "zoned", .mode = S_IRUGO },
617 .show = queue_zoned_show,
618};
619
620static struct queue_sysfs_entry queue_nomerges_entry = {
621 .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
622 .show = queue_nomerges_show,
623 .store = queue_nomerges_store,
624};
625
626static struct queue_sysfs_entry queue_rq_affinity_entry = {
627 .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
628 .show = queue_rq_affinity_show,
629 .store = queue_rq_affinity_store,
630};
631
632static struct queue_sysfs_entry queue_iostats_entry = {
633 .attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
634 .show = queue_show_iostats,
635 .store = queue_store_iostats,
636};
637
638static struct queue_sysfs_entry queue_random_entry = {
639 .attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
640 .show = queue_show_random,
641 .store = queue_store_random,
642};
643
644static struct queue_sysfs_entry queue_poll_entry = {
645 .attr = {.name = "io_poll", .mode = S_IRUGO | S_IWUSR },
646 .show = queue_poll_show,
647 .store = queue_poll_store,
648};
649
650static struct queue_sysfs_entry queue_poll_delay_entry = {
651 .attr = {.name = "io_poll_delay", .mode = S_IRUGO | S_IWUSR },
652 .show = queue_poll_delay_show,
653 .store = queue_poll_delay_store,
654};
655
656static struct queue_sysfs_entry queue_wc_entry = {
657 .attr = {.name = "write_cache", .mode = S_IRUGO | S_IWUSR },
658 .show = queue_wc_show,
659 .store = queue_wc_store,
660};
661
662static struct queue_sysfs_entry queue_dax_entry = {
663 .attr = {.name = "dax", .mode = S_IRUGO },
664 .show = queue_dax_show,
665};
666
667static struct queue_sysfs_entry queue_wb_lat_entry = {
668 .attr = {.name = "wbt_lat_usec", .mode = S_IRUGO | S_IWUSR },
669 .show = queue_wb_lat_show,
670 .store = queue_wb_lat_store,
671};
672
673#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
674static struct queue_sysfs_entry throtl_sample_time_entry = {
675 .attr = {.name = "throttle_sample_time", .mode = S_IRUGO | S_IWUSR },
676 .show = blk_throtl_sample_time_show,
677 .store = blk_throtl_sample_time_store,
678};
679#endif
680
681static struct attribute *default_attrs[] = {
682 &queue_requests_entry.attr,
683 &queue_ra_entry.attr,
684 &queue_max_hw_sectors_entry.attr,
685 &queue_max_sectors_entry.attr,
686 &queue_max_segments_entry.attr,
687 &queue_max_discard_segments_entry.attr,
688 &queue_max_integrity_segments_entry.attr,
689 &queue_max_segment_size_entry.attr,
690 &queue_iosched_entry.attr,
691 &queue_hw_sector_size_entry.attr,
692 &queue_logical_block_size_entry.attr,
693 &queue_physical_block_size_entry.attr,
694 &queue_chunk_sectors_entry.attr,
695 &queue_io_min_entry.attr,
696 &queue_io_opt_entry.attr,
697 &queue_discard_granularity_entry.attr,
698 &queue_discard_max_entry.attr,
699 &queue_discard_max_hw_entry.attr,
700 &queue_discard_zeroes_data_entry.attr,
701 &queue_write_same_max_entry.attr,
702 &queue_write_zeroes_max_entry.attr,
703 &queue_nonrot_entry.attr,
704 &queue_zoned_entry.attr,
705 &queue_nomerges_entry.attr,
706 &queue_rq_affinity_entry.attr,
707 &queue_iostats_entry.attr,
708 &queue_random_entry.attr,
709 &queue_poll_entry.attr,
710 &queue_wc_entry.attr,
711 &queue_dax_entry.attr,
712 &queue_wb_lat_entry.attr,
713 &queue_poll_delay_entry.attr,
714#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
715 &throtl_sample_time_entry.attr,
716#endif
717 NULL,
718};
719
720#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
721
722static ssize_t
723queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
724{
725 struct queue_sysfs_entry *entry = to_queue(attr);
726 struct request_queue *q =
727 container_of(kobj, struct request_queue, kobj);
728 ssize_t res;
729
730 if (!entry->show)
731 return -EIO;
732 mutex_lock(&q->sysfs_lock);
733 if (blk_queue_dying(q)) {
734 mutex_unlock(&q->sysfs_lock);
735 return -ENOENT;
736 }
737 res = entry->show(q, page);
738 mutex_unlock(&q->sysfs_lock);
739 return res;
740}
741
742static ssize_t
743queue_attr_store(struct kobject *kobj, struct attribute *attr,
744 const char *page, size_t length)
745{
746 struct queue_sysfs_entry *entry = to_queue(attr);
747 struct request_queue *q;
748 ssize_t res;
749
750 if (!entry->store)
751 return -EIO;
752
753 q = container_of(kobj, struct request_queue, kobj);
754 mutex_lock(&q->sysfs_lock);
755 if (blk_queue_dying(q)) {
756 mutex_unlock(&q->sysfs_lock);
757 return -ENOENT;
758 }
759 res = entry->store(q, page, length);
760 mutex_unlock(&q->sysfs_lock);
761 return res;
762}
763
764static void blk_free_queue_rcu(struct rcu_head *rcu_head)
765{
766 struct request_queue *q = container_of(rcu_head, struct request_queue,
767 rcu_head);
768 kmem_cache_free(blk_requestq_cachep, q);
769}
770
771/**
772 * __blk_release_queue - release a request queue when it is no longer needed
773 * @work: pointer to the release_work member of the request queue to be released
774 *
775 * Description:
776 * blk_release_queue is the counterpart of blk_init_queue(). It should be
777 * called when a request queue is being released; typically when a block
778 * device is being de-registered. Its primary task it to free the queue
779 * itself.
780 *
781 * Notes:
782 * The low level driver must have finished any outstanding requests first
783 * via blk_cleanup_queue().
784 *
785 * Although blk_release_queue() may be called with preemption disabled,
786 * __blk_release_queue() may sleep.
787 */
788static void __blk_release_queue(struct work_struct *work)
789{
790 struct request_queue *q = container_of(work, typeof(*q), release_work);
791
792 if (test_bit(QUEUE_FLAG_POLL_STATS, &q->queue_flags))
793 blk_stat_remove_callback(q, q->poll_cb);
794 blk_stat_free_callback(q->poll_cb);
795
796 blk_free_queue_stats(q->stats);
797
798 blk_exit_rl(q, &q->root_rl);
799
800 if (q->queue_tags)
801 __blk_queue_free_tags(q);
802
803 if (!q->mq_ops) {
804 if (q->exit_rq_fn)
805 q->exit_rq_fn(q, q->fq->flush_rq);
806 blk_free_flush_queue(q->fq);
807 } else {
808 blk_mq_release(q);
809 }
810
811 blk_trace_shutdown(q);
812
813 if (q->mq_ops)
814 blk_mq_debugfs_unregister(q);
815
816 if (q->bio_split)
817 bioset_free(q->bio_split);
818
819 ida_simple_remove(&blk_queue_ida, q->id);
820 call_rcu(&q->rcu_head, blk_free_queue_rcu);
821}
822
823static void blk_release_queue(struct kobject *kobj)
824{
825 struct request_queue *q =
826 container_of(kobj, struct request_queue, kobj);
827
828 INIT_WORK(&q->release_work, __blk_release_queue);
829 schedule_work(&q->release_work);
830}
831
832static const struct sysfs_ops queue_sysfs_ops = {
833 .show = queue_attr_show,
834 .store = queue_attr_store,
835};
836
837struct kobj_type blk_queue_ktype = {
838 .sysfs_ops = &queue_sysfs_ops,
839 .default_attrs = default_attrs,
840 .release = blk_release_queue,
841};
842
843/**
844 * blk_register_queue - register a block layer queue with sysfs
845 * @disk: Disk of which the request queue should be registered with sysfs.
846 */
847int blk_register_queue(struct gendisk *disk)
848{
849 int ret;
850 struct device *dev = disk_to_dev(disk);
851 struct request_queue *q = disk->queue;
852
853 if (WARN_ON(!q))
854 return -ENXIO;
855
856 WARN_ONCE(test_bit(QUEUE_FLAG_REGISTERED, &q->queue_flags),
857 "%s is registering an already registered queue\n",
858 kobject_name(&dev->kobj));
859 queue_flag_set_unlocked(QUEUE_FLAG_REGISTERED, q);
860
861 /*
862 * SCSI probing may synchronously create and destroy a lot of
863 * request_queues for non-existent devices. Shutting down a fully
864 * functional queue takes measureable wallclock time as RCU grace
865 * periods are involved. To avoid excessive latency in these
866 * cases, a request_queue starts out in a degraded mode which is
867 * faster to shut down and is made fully functional here as
868 * request_queues for non-existent devices never get registered.
869 */
870 if (!blk_queue_init_done(q)) {
871 queue_flag_set_unlocked(QUEUE_FLAG_INIT_DONE, q);
872 percpu_ref_switch_to_percpu(&q->q_usage_counter);
873 blk_queue_bypass_end(q);
874 }
875
876 ret = blk_trace_init_sysfs(dev);
877 if (ret)
878 return ret;
879
880 /* Prevent changes through sysfs until registration is completed. */
881 mutex_lock(&q->sysfs_lock);
882
883 ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
884 if (ret < 0) {
885 blk_trace_remove_sysfs(dev);
886 goto unlock;
887 }
888
889 if (q->mq_ops) {
890 __blk_mq_register_dev(dev, q);
891 blk_mq_debugfs_register(q);
892 }
893
894 kobject_uevent(&q->kobj, KOBJ_ADD);
895
896 wbt_enable_default(q);
897
898 blk_throtl_register_queue(q);
899
900 if (q->request_fn || (q->mq_ops && q->elevator)) {
901 ret = elv_register_queue(q);
902 if (ret) {
903 mutex_unlock(&q->sysfs_lock);
904 kobject_uevent(&q->kobj, KOBJ_REMOVE);
905 kobject_del(&q->kobj);
906 blk_trace_remove_sysfs(dev);
907 kobject_put(&dev->kobj);
908 return ret;
909 }
910 }
911 ret = 0;
912unlock:
913 mutex_unlock(&q->sysfs_lock);
914 return ret;
915}
916EXPORT_SYMBOL_GPL(blk_register_queue);
917
918/**
919 * blk_unregister_queue - counterpart of blk_register_queue()
920 * @disk: Disk of which the request queue should be unregistered from sysfs.
921 *
922 * Note: the caller is responsible for guaranteeing that this function is called
923 * after blk_register_queue() has finished.
924 */
925void blk_unregister_queue(struct gendisk *disk)
926{
927 struct request_queue *q = disk->queue;
928
929 if (WARN_ON(!q))
930 return;
931
932 /* Return early if disk->queue was never registered. */
933 if (!test_bit(QUEUE_FLAG_REGISTERED, &q->queue_flags))
934 return;
935
936 /*
937 * Since sysfs_remove_dir() prevents adding new directory entries
938 * before removal of existing entries starts, protect against
939 * concurrent elv_iosched_store() calls.
940 */
941 mutex_lock(&q->sysfs_lock);
942
943 blk_queue_flag_clear(QUEUE_FLAG_REGISTERED, q);
944
945 /*
946 * Remove the sysfs attributes before unregistering the queue data
947 * structures that can be modified through sysfs.
948 */
949 if (q->mq_ops)
950 blk_mq_unregister_dev(disk_to_dev(disk), q);
951 mutex_unlock(&q->sysfs_lock);
952
953 kobject_uevent(&q->kobj, KOBJ_REMOVE);
954 kobject_del(&q->kobj);
955 blk_trace_remove_sysfs(disk_to_dev(disk));
956
957 wbt_exit(q);
958
959 mutex_lock(&q->sysfs_lock);
960 if (q->request_fn || (q->mq_ops && q->elevator))
961 elv_unregister_queue(q);
962 mutex_unlock(&q->sysfs_lock);
963
964 kobject_put(&disk_to_dev(disk)->kobj);
965}
1/*
2 * Functions related to sysfs handling
3 */
4#include <linux/kernel.h>
5#include <linux/slab.h>
6#include <linux/module.h>
7#include <linux/bio.h>
8#include <linux/blkdev.h>
9#include <linux/backing-dev.h>
10#include <linux/blktrace_api.h>
11#include <linux/blk-mq.h>
12#include <linux/blk-cgroup.h>
13
14#include "blk.h"
15#include "blk-mq.h"
16
17struct queue_sysfs_entry {
18 struct attribute attr;
19 ssize_t (*show)(struct request_queue *, char *);
20 ssize_t (*store)(struct request_queue *, const char *, size_t);
21};
22
23static ssize_t
24queue_var_show(unsigned long var, char *page)
25{
26 return sprintf(page, "%lu\n", var);
27}
28
29static ssize_t
30queue_var_store(unsigned long *var, const char *page, size_t count)
31{
32 int err;
33 unsigned long v;
34
35 err = kstrtoul(page, 10, &v);
36 if (err || v > UINT_MAX)
37 return -EINVAL;
38
39 *var = v;
40
41 return count;
42}
43
44static ssize_t queue_requests_show(struct request_queue *q, char *page)
45{
46 return queue_var_show(q->nr_requests, (page));
47}
48
49static ssize_t
50queue_requests_store(struct request_queue *q, const char *page, size_t count)
51{
52 unsigned long nr;
53 int ret, err;
54
55 if (!q->request_fn && !q->mq_ops)
56 return -EINVAL;
57
58 ret = queue_var_store(&nr, page, count);
59 if (ret < 0)
60 return ret;
61
62 if (nr < BLKDEV_MIN_RQ)
63 nr = BLKDEV_MIN_RQ;
64
65 if (q->request_fn)
66 err = blk_update_nr_requests(q, nr);
67 else
68 err = blk_mq_update_nr_requests(q, nr);
69
70 if (err)
71 return err;
72
73 return ret;
74}
75
76static ssize_t queue_ra_show(struct request_queue *q, char *page)
77{
78 unsigned long ra_kb = q->backing_dev_info.ra_pages <<
79 (PAGE_SHIFT - 10);
80
81 return queue_var_show(ra_kb, (page));
82}
83
84static ssize_t
85queue_ra_store(struct request_queue *q, const char *page, size_t count)
86{
87 unsigned long ra_kb;
88 ssize_t ret = queue_var_store(&ra_kb, page, count);
89
90 if (ret < 0)
91 return ret;
92
93 q->backing_dev_info.ra_pages = ra_kb >> (PAGE_SHIFT - 10);
94
95 return ret;
96}
97
98static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
99{
100 int max_sectors_kb = queue_max_sectors(q) >> 1;
101
102 return queue_var_show(max_sectors_kb, (page));
103}
104
105static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
106{
107 return queue_var_show(queue_max_segments(q), (page));
108}
109
110static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
111{
112 return queue_var_show(q->limits.max_integrity_segments, (page));
113}
114
115static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
116{
117 if (blk_queue_cluster(q))
118 return queue_var_show(queue_max_segment_size(q), (page));
119
120 return queue_var_show(PAGE_SIZE, (page));
121}
122
123static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
124{
125 return queue_var_show(queue_logical_block_size(q), page);
126}
127
128static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
129{
130 return queue_var_show(queue_physical_block_size(q), page);
131}
132
133static ssize_t queue_io_min_show(struct request_queue *q, char *page)
134{
135 return queue_var_show(queue_io_min(q), page);
136}
137
138static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
139{
140 return queue_var_show(queue_io_opt(q), page);
141}
142
143static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
144{
145 return queue_var_show(q->limits.discard_granularity, page);
146}
147
148static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
149{
150
151 return sprintf(page, "%llu\n",
152 (unsigned long long)q->limits.max_hw_discard_sectors << 9);
153}
154
155static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
156{
157 return sprintf(page, "%llu\n",
158 (unsigned long long)q->limits.max_discard_sectors << 9);
159}
160
161static ssize_t queue_discard_max_store(struct request_queue *q,
162 const char *page, size_t count)
163{
164 unsigned long max_discard;
165 ssize_t ret = queue_var_store(&max_discard, page, count);
166
167 if (ret < 0)
168 return ret;
169
170 if (max_discard & (q->limits.discard_granularity - 1))
171 return -EINVAL;
172
173 max_discard >>= 9;
174 if (max_discard > UINT_MAX)
175 return -EINVAL;
176
177 if (max_discard > q->limits.max_hw_discard_sectors)
178 max_discard = q->limits.max_hw_discard_sectors;
179
180 q->limits.max_discard_sectors = max_discard;
181 return ret;
182}
183
184static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
185{
186 return queue_var_show(queue_discard_zeroes_data(q), page);
187}
188
189static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
190{
191 return sprintf(page, "%llu\n",
192 (unsigned long long)q->limits.max_write_same_sectors << 9);
193}
194
195
196static ssize_t
197queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
198{
199 unsigned long max_sectors_kb,
200 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
201 page_kb = 1 << (PAGE_SHIFT - 10);
202 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
203
204 if (ret < 0)
205 return ret;
206
207 max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb, (unsigned long)
208 q->limits.max_dev_sectors >> 1);
209
210 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
211 return -EINVAL;
212
213 spin_lock_irq(q->queue_lock);
214 q->limits.max_sectors = max_sectors_kb << 1;
215 spin_unlock_irq(q->queue_lock);
216
217 return ret;
218}
219
220static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
221{
222 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
223
224 return queue_var_show(max_hw_sectors_kb, (page));
225}
226
227#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
228static ssize_t \
229queue_show_##name(struct request_queue *q, char *page) \
230{ \
231 int bit; \
232 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
233 return queue_var_show(neg ? !bit : bit, page); \
234} \
235static ssize_t \
236queue_store_##name(struct request_queue *q, const char *page, size_t count) \
237{ \
238 unsigned long val; \
239 ssize_t ret; \
240 ret = queue_var_store(&val, page, count); \
241 if (ret < 0) \
242 return ret; \
243 if (neg) \
244 val = !val; \
245 \
246 spin_lock_irq(q->queue_lock); \
247 if (val) \
248 queue_flag_set(QUEUE_FLAG_##flag, q); \
249 else \
250 queue_flag_clear(QUEUE_FLAG_##flag, q); \
251 spin_unlock_irq(q->queue_lock); \
252 return ret; \
253}
254
255QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
256QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
257QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
258#undef QUEUE_SYSFS_BIT_FNS
259
260static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
261{
262 return queue_var_show((blk_queue_nomerges(q) << 1) |
263 blk_queue_noxmerges(q), page);
264}
265
266static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
267 size_t count)
268{
269 unsigned long nm;
270 ssize_t ret = queue_var_store(&nm, page, count);
271
272 if (ret < 0)
273 return ret;
274
275 spin_lock_irq(q->queue_lock);
276 queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
277 queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
278 if (nm == 2)
279 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
280 else if (nm)
281 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
282 spin_unlock_irq(q->queue_lock);
283
284 return ret;
285}
286
287static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
288{
289 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
290 bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
291
292 return queue_var_show(set << force, page);
293}
294
295static ssize_t
296queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
297{
298 ssize_t ret = -EINVAL;
299#ifdef CONFIG_SMP
300 unsigned long val;
301
302 ret = queue_var_store(&val, page, count);
303 if (ret < 0)
304 return ret;
305
306 spin_lock_irq(q->queue_lock);
307 if (val == 2) {
308 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
309 queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
310 } else if (val == 1) {
311 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
312 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
313 } else if (val == 0) {
314 queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
315 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
316 }
317 spin_unlock_irq(q->queue_lock);
318#endif
319 return ret;
320}
321
322static ssize_t queue_poll_show(struct request_queue *q, char *page)
323{
324 return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
325}
326
327static ssize_t queue_poll_store(struct request_queue *q, const char *page,
328 size_t count)
329{
330 unsigned long poll_on;
331 ssize_t ret;
332
333 if (!q->mq_ops || !q->mq_ops->poll)
334 return -EINVAL;
335
336 ret = queue_var_store(&poll_on, page, count);
337 if (ret < 0)
338 return ret;
339
340 spin_lock_irq(q->queue_lock);
341 if (poll_on)
342 queue_flag_set(QUEUE_FLAG_POLL, q);
343 else
344 queue_flag_clear(QUEUE_FLAG_POLL, q);
345 spin_unlock_irq(q->queue_lock);
346
347 return ret;
348}
349
350static struct queue_sysfs_entry queue_requests_entry = {
351 .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
352 .show = queue_requests_show,
353 .store = queue_requests_store,
354};
355
356static struct queue_sysfs_entry queue_ra_entry = {
357 .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
358 .show = queue_ra_show,
359 .store = queue_ra_store,
360};
361
362static struct queue_sysfs_entry queue_max_sectors_entry = {
363 .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
364 .show = queue_max_sectors_show,
365 .store = queue_max_sectors_store,
366};
367
368static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
369 .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
370 .show = queue_max_hw_sectors_show,
371};
372
373static struct queue_sysfs_entry queue_max_segments_entry = {
374 .attr = {.name = "max_segments", .mode = S_IRUGO },
375 .show = queue_max_segments_show,
376};
377
378static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
379 .attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
380 .show = queue_max_integrity_segments_show,
381};
382
383static struct queue_sysfs_entry queue_max_segment_size_entry = {
384 .attr = {.name = "max_segment_size", .mode = S_IRUGO },
385 .show = queue_max_segment_size_show,
386};
387
388static struct queue_sysfs_entry queue_iosched_entry = {
389 .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
390 .show = elv_iosched_show,
391 .store = elv_iosched_store,
392};
393
394static struct queue_sysfs_entry queue_hw_sector_size_entry = {
395 .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
396 .show = queue_logical_block_size_show,
397};
398
399static struct queue_sysfs_entry queue_logical_block_size_entry = {
400 .attr = {.name = "logical_block_size", .mode = S_IRUGO },
401 .show = queue_logical_block_size_show,
402};
403
404static struct queue_sysfs_entry queue_physical_block_size_entry = {
405 .attr = {.name = "physical_block_size", .mode = S_IRUGO },
406 .show = queue_physical_block_size_show,
407};
408
409static struct queue_sysfs_entry queue_io_min_entry = {
410 .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
411 .show = queue_io_min_show,
412};
413
414static struct queue_sysfs_entry queue_io_opt_entry = {
415 .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
416 .show = queue_io_opt_show,
417};
418
419static struct queue_sysfs_entry queue_discard_granularity_entry = {
420 .attr = {.name = "discard_granularity", .mode = S_IRUGO },
421 .show = queue_discard_granularity_show,
422};
423
424static struct queue_sysfs_entry queue_discard_max_hw_entry = {
425 .attr = {.name = "discard_max_hw_bytes", .mode = S_IRUGO },
426 .show = queue_discard_max_hw_show,
427};
428
429static struct queue_sysfs_entry queue_discard_max_entry = {
430 .attr = {.name = "discard_max_bytes", .mode = S_IRUGO | S_IWUSR },
431 .show = queue_discard_max_show,
432 .store = queue_discard_max_store,
433};
434
435static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
436 .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
437 .show = queue_discard_zeroes_data_show,
438};
439
440static struct queue_sysfs_entry queue_write_same_max_entry = {
441 .attr = {.name = "write_same_max_bytes", .mode = S_IRUGO },
442 .show = queue_write_same_max_show,
443};
444
445static struct queue_sysfs_entry queue_nonrot_entry = {
446 .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
447 .show = queue_show_nonrot,
448 .store = queue_store_nonrot,
449};
450
451static struct queue_sysfs_entry queue_nomerges_entry = {
452 .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
453 .show = queue_nomerges_show,
454 .store = queue_nomerges_store,
455};
456
457static struct queue_sysfs_entry queue_rq_affinity_entry = {
458 .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
459 .show = queue_rq_affinity_show,
460 .store = queue_rq_affinity_store,
461};
462
463static struct queue_sysfs_entry queue_iostats_entry = {
464 .attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
465 .show = queue_show_iostats,
466 .store = queue_store_iostats,
467};
468
469static struct queue_sysfs_entry queue_random_entry = {
470 .attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
471 .show = queue_show_random,
472 .store = queue_store_random,
473};
474
475static struct queue_sysfs_entry queue_poll_entry = {
476 .attr = {.name = "io_poll", .mode = S_IRUGO | S_IWUSR },
477 .show = queue_poll_show,
478 .store = queue_poll_store,
479};
480
481static struct attribute *default_attrs[] = {
482 &queue_requests_entry.attr,
483 &queue_ra_entry.attr,
484 &queue_max_hw_sectors_entry.attr,
485 &queue_max_sectors_entry.attr,
486 &queue_max_segments_entry.attr,
487 &queue_max_integrity_segments_entry.attr,
488 &queue_max_segment_size_entry.attr,
489 &queue_iosched_entry.attr,
490 &queue_hw_sector_size_entry.attr,
491 &queue_logical_block_size_entry.attr,
492 &queue_physical_block_size_entry.attr,
493 &queue_io_min_entry.attr,
494 &queue_io_opt_entry.attr,
495 &queue_discard_granularity_entry.attr,
496 &queue_discard_max_entry.attr,
497 &queue_discard_max_hw_entry.attr,
498 &queue_discard_zeroes_data_entry.attr,
499 &queue_write_same_max_entry.attr,
500 &queue_nonrot_entry.attr,
501 &queue_nomerges_entry.attr,
502 &queue_rq_affinity_entry.attr,
503 &queue_iostats_entry.attr,
504 &queue_random_entry.attr,
505 &queue_poll_entry.attr,
506 NULL,
507};
508
509#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
510
511static ssize_t
512queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
513{
514 struct queue_sysfs_entry *entry = to_queue(attr);
515 struct request_queue *q =
516 container_of(kobj, struct request_queue, kobj);
517 ssize_t res;
518
519 if (!entry->show)
520 return -EIO;
521 mutex_lock(&q->sysfs_lock);
522 if (blk_queue_dying(q)) {
523 mutex_unlock(&q->sysfs_lock);
524 return -ENOENT;
525 }
526 res = entry->show(q, page);
527 mutex_unlock(&q->sysfs_lock);
528 return res;
529}
530
531static ssize_t
532queue_attr_store(struct kobject *kobj, struct attribute *attr,
533 const char *page, size_t length)
534{
535 struct queue_sysfs_entry *entry = to_queue(attr);
536 struct request_queue *q;
537 ssize_t res;
538
539 if (!entry->store)
540 return -EIO;
541
542 q = container_of(kobj, struct request_queue, kobj);
543 mutex_lock(&q->sysfs_lock);
544 if (blk_queue_dying(q)) {
545 mutex_unlock(&q->sysfs_lock);
546 return -ENOENT;
547 }
548 res = entry->store(q, page, length);
549 mutex_unlock(&q->sysfs_lock);
550 return res;
551}
552
553static void blk_free_queue_rcu(struct rcu_head *rcu_head)
554{
555 struct request_queue *q = container_of(rcu_head, struct request_queue,
556 rcu_head);
557 kmem_cache_free(blk_requestq_cachep, q);
558}
559
560/**
561 * blk_release_queue: - release a &struct request_queue when it is no longer needed
562 * @kobj: the kobj belonging to the request queue to be released
563 *
564 * Description:
565 * blk_release_queue is the pair to blk_init_queue() or
566 * blk_queue_make_request(). It should be called when a request queue is
567 * being released; typically when a block device is being de-registered.
568 * Currently, its primary task it to free all the &struct request
569 * structures that were allocated to the queue and the queue itself.
570 *
571 * Note:
572 * The low level driver must have finished any outstanding requests first
573 * via blk_cleanup_queue().
574 **/
575static void blk_release_queue(struct kobject *kobj)
576{
577 struct request_queue *q =
578 container_of(kobj, struct request_queue, kobj);
579
580 bdi_exit(&q->backing_dev_info);
581 blkcg_exit_queue(q);
582
583 if (q->elevator) {
584 spin_lock_irq(q->queue_lock);
585 ioc_clear_queue(q);
586 spin_unlock_irq(q->queue_lock);
587 elevator_exit(q->elevator);
588 }
589
590 blk_exit_rl(&q->root_rl);
591
592 if (q->queue_tags)
593 __blk_queue_free_tags(q);
594
595 if (!q->mq_ops)
596 blk_free_flush_queue(q->fq);
597 else
598 blk_mq_release(q);
599
600 blk_trace_shutdown(q);
601
602 if (q->bio_split)
603 bioset_free(q->bio_split);
604
605 ida_simple_remove(&blk_queue_ida, q->id);
606 call_rcu(&q->rcu_head, blk_free_queue_rcu);
607}
608
609static const struct sysfs_ops queue_sysfs_ops = {
610 .show = queue_attr_show,
611 .store = queue_attr_store,
612};
613
614struct kobj_type blk_queue_ktype = {
615 .sysfs_ops = &queue_sysfs_ops,
616 .default_attrs = default_attrs,
617 .release = blk_release_queue,
618};
619
620int blk_register_queue(struct gendisk *disk)
621{
622 int ret;
623 struct device *dev = disk_to_dev(disk);
624 struct request_queue *q = disk->queue;
625
626 if (WARN_ON(!q))
627 return -ENXIO;
628
629 /*
630 * SCSI probing may synchronously create and destroy a lot of
631 * request_queues for non-existent devices. Shutting down a fully
632 * functional queue takes measureable wallclock time as RCU grace
633 * periods are involved. To avoid excessive latency in these
634 * cases, a request_queue starts out in a degraded mode which is
635 * faster to shut down and is made fully functional here as
636 * request_queues for non-existent devices never get registered.
637 */
638 if (!blk_queue_init_done(q)) {
639 queue_flag_set_unlocked(QUEUE_FLAG_INIT_DONE, q);
640 percpu_ref_switch_to_percpu(&q->q_usage_counter);
641 blk_queue_bypass_end(q);
642 }
643
644 ret = blk_trace_init_sysfs(dev);
645 if (ret)
646 return ret;
647
648 ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
649 if (ret < 0) {
650 blk_trace_remove_sysfs(dev);
651 return ret;
652 }
653
654 kobject_uevent(&q->kobj, KOBJ_ADD);
655
656 if (q->mq_ops)
657 blk_mq_register_disk(disk);
658
659 if (!q->request_fn)
660 return 0;
661
662 ret = elv_register_queue(q);
663 if (ret) {
664 kobject_uevent(&q->kobj, KOBJ_REMOVE);
665 kobject_del(&q->kobj);
666 blk_trace_remove_sysfs(dev);
667 kobject_put(&dev->kobj);
668 return ret;
669 }
670
671 return 0;
672}
673
674void blk_unregister_queue(struct gendisk *disk)
675{
676 struct request_queue *q = disk->queue;
677
678 if (WARN_ON(!q))
679 return;
680
681 if (q->mq_ops)
682 blk_mq_unregister_disk(disk);
683
684 if (q->request_fn)
685 elv_unregister_queue(q);
686
687 kobject_uevent(&q->kobj, KOBJ_REMOVE);
688 kobject_del(&q->kobj);
689 blk_trace_remove_sysfs(disk_to_dev(disk));
690 kobject_put(&disk_to_dev(disk)->kobj);
691}