Loading...
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}
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/blktrace_api.h>
10
11#include "blk.h"
12
13struct queue_sysfs_entry {
14 struct attribute attr;
15 ssize_t (*show)(struct request_queue *, char *);
16 ssize_t (*store)(struct request_queue *, const char *, size_t);
17};
18
19static ssize_t
20queue_var_show(unsigned long var, char *page)
21{
22 return sprintf(page, "%lu\n", var);
23}
24
25static ssize_t
26queue_var_store(unsigned long *var, const char *page, size_t count)
27{
28 char *p = (char *) page;
29
30 *var = simple_strtoul(p, &p, 10);
31 return count;
32}
33
34static ssize_t queue_requests_show(struct request_queue *q, char *page)
35{
36 return queue_var_show(q->nr_requests, (page));
37}
38
39static ssize_t
40queue_requests_store(struct request_queue *q, const char *page, size_t count)
41{
42 struct request_list *rl = &q->rq;
43 unsigned long nr;
44 int ret;
45
46 if (!q->request_fn)
47 return -EINVAL;
48
49 ret = queue_var_store(&nr, page, count);
50 if (nr < BLKDEV_MIN_RQ)
51 nr = BLKDEV_MIN_RQ;
52
53 spin_lock_irq(q->queue_lock);
54 q->nr_requests = nr;
55 blk_queue_congestion_threshold(q);
56
57 if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
58 blk_set_queue_congested(q, BLK_RW_SYNC);
59 else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q))
60 blk_clear_queue_congested(q, BLK_RW_SYNC);
61
62 if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
63 blk_set_queue_congested(q, BLK_RW_ASYNC);
64 else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
65 blk_clear_queue_congested(q, BLK_RW_ASYNC);
66
67 if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
68 blk_set_queue_full(q, BLK_RW_SYNC);
69 } else {
70 blk_clear_queue_full(q, BLK_RW_SYNC);
71 wake_up(&rl->wait[BLK_RW_SYNC]);
72 }
73
74 if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
75 blk_set_queue_full(q, BLK_RW_ASYNC);
76 } else {
77 blk_clear_queue_full(q, BLK_RW_ASYNC);
78 wake_up(&rl->wait[BLK_RW_ASYNC]);
79 }
80 spin_unlock_irq(q->queue_lock);
81 return ret;
82}
83
84static ssize_t queue_ra_show(struct request_queue *q, char *page)
85{
86 unsigned long ra_kb = q->backing_dev_info.ra_pages <<
87 (PAGE_CACHE_SHIFT - 10);
88
89 return queue_var_show(ra_kb, (page));
90}
91
92static ssize_t
93queue_ra_store(struct request_queue *q, const char *page, size_t count)
94{
95 unsigned long ra_kb;
96 ssize_t ret = queue_var_store(&ra_kb, page, count);
97
98 q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
99
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_integrity_segments_show(struct request_queue *q, char *page)
116{
117 return queue_var_show(q->limits.max_integrity_segments, (page));
118}
119
120static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
121{
122 if (blk_queue_cluster(q))
123 return queue_var_show(queue_max_segment_size(q), (page));
124
125 return queue_var_show(PAGE_CACHE_SIZE, (page));
126}
127
128static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
129{
130 return queue_var_show(queue_logical_block_size(q), page);
131}
132
133static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
134{
135 return queue_var_show(queue_physical_block_size(q), page);
136}
137
138static ssize_t queue_io_min_show(struct request_queue *q, char *page)
139{
140 return queue_var_show(queue_io_min(q), page);
141}
142
143static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
144{
145 return queue_var_show(queue_io_opt(q), page);
146}
147
148static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
149{
150 return queue_var_show(q->limits.discard_granularity, page);
151}
152
153static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
154{
155 return sprintf(page, "%llu\n",
156 (unsigned long long)q->limits.max_discard_sectors << 9);
157}
158
159static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
160{
161 return queue_var_show(queue_discard_zeroes_data(q), page);
162}
163
164static ssize_t
165queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
166{
167 unsigned long max_sectors_kb,
168 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
169 page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
170 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
171
172 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
173 return -EINVAL;
174
175 spin_lock_irq(q->queue_lock);
176 q->limits.max_sectors = max_sectors_kb << 1;
177 spin_unlock_irq(q->queue_lock);
178
179 return ret;
180}
181
182static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
183{
184 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
185
186 return queue_var_show(max_hw_sectors_kb, (page));
187}
188
189#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
190static ssize_t \
191queue_show_##name(struct request_queue *q, char *page) \
192{ \
193 int bit; \
194 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
195 return queue_var_show(neg ? !bit : bit, page); \
196} \
197static ssize_t \
198queue_store_##name(struct request_queue *q, const char *page, size_t count) \
199{ \
200 unsigned long val; \
201 ssize_t ret; \
202 ret = queue_var_store(&val, page, count); \
203 if (neg) \
204 val = !val; \
205 \
206 spin_lock_irq(q->queue_lock); \
207 if (val) \
208 queue_flag_set(QUEUE_FLAG_##flag, q); \
209 else \
210 queue_flag_clear(QUEUE_FLAG_##flag, q); \
211 spin_unlock_irq(q->queue_lock); \
212 return ret; \
213}
214
215QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
216QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
217QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
218#undef QUEUE_SYSFS_BIT_FNS
219
220static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
221{
222 return queue_var_show((blk_queue_nomerges(q) << 1) |
223 blk_queue_noxmerges(q), page);
224}
225
226static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
227 size_t count)
228{
229 unsigned long nm;
230 ssize_t ret = queue_var_store(&nm, page, count);
231
232 spin_lock_irq(q->queue_lock);
233 queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
234 queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
235 if (nm == 2)
236 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
237 else if (nm)
238 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
239 spin_unlock_irq(q->queue_lock);
240
241 return ret;
242}
243
244static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
245{
246 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
247 bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
248
249 return queue_var_show(set << force, page);
250}
251
252static ssize_t
253queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
254{
255 ssize_t ret = -EINVAL;
256#if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
257 unsigned long val;
258
259 ret = queue_var_store(&val, page, count);
260 spin_lock_irq(q->queue_lock);
261 if (val == 2) {
262 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
263 queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
264 } else if (val == 1) {
265 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
266 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
267 } else if (val == 0) {
268 queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
269 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
270 }
271 spin_unlock_irq(q->queue_lock);
272#endif
273 return ret;
274}
275
276static struct queue_sysfs_entry queue_requests_entry = {
277 .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
278 .show = queue_requests_show,
279 .store = queue_requests_store,
280};
281
282static struct queue_sysfs_entry queue_ra_entry = {
283 .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
284 .show = queue_ra_show,
285 .store = queue_ra_store,
286};
287
288static struct queue_sysfs_entry queue_max_sectors_entry = {
289 .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
290 .show = queue_max_sectors_show,
291 .store = queue_max_sectors_store,
292};
293
294static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
295 .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
296 .show = queue_max_hw_sectors_show,
297};
298
299static struct queue_sysfs_entry queue_max_segments_entry = {
300 .attr = {.name = "max_segments", .mode = S_IRUGO },
301 .show = queue_max_segments_show,
302};
303
304static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
305 .attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
306 .show = queue_max_integrity_segments_show,
307};
308
309static struct queue_sysfs_entry queue_max_segment_size_entry = {
310 .attr = {.name = "max_segment_size", .mode = S_IRUGO },
311 .show = queue_max_segment_size_show,
312};
313
314static struct queue_sysfs_entry queue_iosched_entry = {
315 .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
316 .show = elv_iosched_show,
317 .store = elv_iosched_store,
318};
319
320static struct queue_sysfs_entry queue_hw_sector_size_entry = {
321 .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
322 .show = queue_logical_block_size_show,
323};
324
325static struct queue_sysfs_entry queue_logical_block_size_entry = {
326 .attr = {.name = "logical_block_size", .mode = S_IRUGO },
327 .show = queue_logical_block_size_show,
328};
329
330static struct queue_sysfs_entry queue_physical_block_size_entry = {
331 .attr = {.name = "physical_block_size", .mode = S_IRUGO },
332 .show = queue_physical_block_size_show,
333};
334
335static struct queue_sysfs_entry queue_io_min_entry = {
336 .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
337 .show = queue_io_min_show,
338};
339
340static struct queue_sysfs_entry queue_io_opt_entry = {
341 .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
342 .show = queue_io_opt_show,
343};
344
345static struct queue_sysfs_entry queue_discard_granularity_entry = {
346 .attr = {.name = "discard_granularity", .mode = S_IRUGO },
347 .show = queue_discard_granularity_show,
348};
349
350static struct queue_sysfs_entry queue_discard_max_entry = {
351 .attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
352 .show = queue_discard_max_show,
353};
354
355static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
356 .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
357 .show = queue_discard_zeroes_data_show,
358};
359
360static struct queue_sysfs_entry queue_nonrot_entry = {
361 .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
362 .show = queue_show_nonrot,
363 .store = queue_store_nonrot,
364};
365
366static struct queue_sysfs_entry queue_nomerges_entry = {
367 .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
368 .show = queue_nomerges_show,
369 .store = queue_nomerges_store,
370};
371
372static struct queue_sysfs_entry queue_rq_affinity_entry = {
373 .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
374 .show = queue_rq_affinity_show,
375 .store = queue_rq_affinity_store,
376};
377
378static struct queue_sysfs_entry queue_iostats_entry = {
379 .attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
380 .show = queue_show_iostats,
381 .store = queue_store_iostats,
382};
383
384static struct queue_sysfs_entry queue_random_entry = {
385 .attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
386 .show = queue_show_random,
387 .store = queue_store_random,
388};
389
390static struct attribute *default_attrs[] = {
391 &queue_requests_entry.attr,
392 &queue_ra_entry.attr,
393 &queue_max_hw_sectors_entry.attr,
394 &queue_max_sectors_entry.attr,
395 &queue_max_segments_entry.attr,
396 &queue_max_integrity_segments_entry.attr,
397 &queue_max_segment_size_entry.attr,
398 &queue_iosched_entry.attr,
399 &queue_hw_sector_size_entry.attr,
400 &queue_logical_block_size_entry.attr,
401 &queue_physical_block_size_entry.attr,
402 &queue_io_min_entry.attr,
403 &queue_io_opt_entry.attr,
404 &queue_discard_granularity_entry.attr,
405 &queue_discard_max_entry.attr,
406 &queue_discard_zeroes_data_entry.attr,
407 &queue_nonrot_entry.attr,
408 &queue_nomerges_entry.attr,
409 &queue_rq_affinity_entry.attr,
410 &queue_iostats_entry.attr,
411 &queue_random_entry.attr,
412 NULL,
413};
414
415#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
416
417static ssize_t
418queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
419{
420 struct queue_sysfs_entry *entry = to_queue(attr);
421 struct request_queue *q =
422 container_of(kobj, struct request_queue, kobj);
423 ssize_t res;
424
425 if (!entry->show)
426 return -EIO;
427 mutex_lock(&q->sysfs_lock);
428 if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
429 mutex_unlock(&q->sysfs_lock);
430 return -ENOENT;
431 }
432 res = entry->show(q, page);
433 mutex_unlock(&q->sysfs_lock);
434 return res;
435}
436
437static ssize_t
438queue_attr_store(struct kobject *kobj, struct attribute *attr,
439 const char *page, size_t length)
440{
441 struct queue_sysfs_entry *entry = to_queue(attr);
442 struct request_queue *q;
443 ssize_t res;
444
445 if (!entry->store)
446 return -EIO;
447
448 q = container_of(kobj, struct request_queue, kobj);
449 mutex_lock(&q->sysfs_lock);
450 if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
451 mutex_unlock(&q->sysfs_lock);
452 return -ENOENT;
453 }
454 res = entry->store(q, page, length);
455 mutex_unlock(&q->sysfs_lock);
456 return res;
457}
458
459/**
460 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
461 * @kobj: the kobj belonging of the request queue to be released
462 *
463 * Description:
464 * blk_cleanup_queue is the pair to blk_init_queue() or
465 * blk_queue_make_request(). It should be called when a request queue is
466 * being released; typically when a block device is being de-registered.
467 * Currently, its primary task it to free all the &struct request
468 * structures that were allocated to the queue and the queue itself.
469 *
470 * Caveat:
471 * Hopefully the low level driver will have finished any
472 * outstanding requests first...
473 **/
474static void blk_release_queue(struct kobject *kobj)
475{
476 struct request_queue *q =
477 container_of(kobj, struct request_queue, kobj);
478 struct request_list *rl = &q->rq;
479
480 blk_sync_queue(q);
481
482 if (q->elevator)
483 elevator_exit(q->elevator);
484
485 blk_throtl_exit(q);
486
487 if (rl->rq_pool)
488 mempool_destroy(rl->rq_pool);
489
490 if (q->queue_tags)
491 __blk_queue_free_tags(q);
492
493 blk_trace_shutdown(q);
494
495 bdi_destroy(&q->backing_dev_info);
496 kmem_cache_free(blk_requestq_cachep, q);
497}
498
499static const struct sysfs_ops queue_sysfs_ops = {
500 .show = queue_attr_show,
501 .store = queue_attr_store,
502};
503
504struct kobj_type blk_queue_ktype = {
505 .sysfs_ops = &queue_sysfs_ops,
506 .default_attrs = default_attrs,
507 .release = blk_release_queue,
508};
509
510int blk_register_queue(struct gendisk *disk)
511{
512 int ret;
513 struct device *dev = disk_to_dev(disk);
514 struct request_queue *q = disk->queue;
515
516 if (WARN_ON(!q))
517 return -ENXIO;
518
519 ret = blk_trace_init_sysfs(dev);
520 if (ret)
521 return ret;
522
523 ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
524 if (ret < 0) {
525 blk_trace_remove_sysfs(dev);
526 return ret;
527 }
528
529 kobject_uevent(&q->kobj, KOBJ_ADD);
530
531 if (!q->request_fn)
532 return 0;
533
534 ret = elv_register_queue(q);
535 if (ret) {
536 kobject_uevent(&q->kobj, KOBJ_REMOVE);
537 kobject_del(&q->kobj);
538 blk_trace_remove_sysfs(dev);
539 kobject_put(&dev->kobj);
540 return ret;
541 }
542
543 return 0;
544}
545
546void blk_unregister_queue(struct gendisk *disk)
547{
548 struct request_queue *q = disk->queue;
549
550 if (WARN_ON(!q))
551 return;
552
553 if (q->request_fn)
554 elv_unregister_queue(q);
555
556 kobject_uevent(&q->kobj, KOBJ_REMOVE);
557 kobject_del(&q->kobj);
558 blk_trace_remove_sysfs(disk_to_dev(disk));
559 kobject_put(&disk_to_dev(disk)->kobj);
560}