2 * Functions related to sysfs handling
4 #include <linux/kernel.h>
5 #include <linux/slab.h>
6 #include <linux/module.h>
8 #include <linux/blkdev.h>
9 #include <linux/blktrace_api.h>
13 struct 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);
20 queue_var_show(unsigned long var
, char *page
)
22 return sprintf(page
, "%lu\n", var
);
26 queue_var_store(unsigned long *var
, const char *page
, size_t count
)
28 char *p
= (char *) page
;
30 *var
= simple_strtoul(p
, &p
, 10);
34 static ssize_t
queue_requests_show(struct request_queue
*q
, char *page
)
36 return queue_var_show(q
->nr_requests
, (page
));
40 queue_requests_store(struct request_queue
*q
, const char *page
, size_t count
)
42 struct request_list
*rl
= &q
->rq
;
49 ret
= queue_var_store(&nr
, page
, count
);
50 if (nr
< BLKDEV_MIN_RQ
)
53 spin_lock_irq(q
->queue_lock
);
55 blk_queue_congestion_threshold(q
);
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
);
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
);
67 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
68 blk_set_queue_full(q
, BLK_RW_SYNC
);
70 blk_clear_queue_full(q
, BLK_RW_SYNC
);
71 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
74 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
75 blk_set_queue_full(q
, BLK_RW_ASYNC
);
77 blk_clear_queue_full(q
, BLK_RW_ASYNC
);
78 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
80 spin_unlock_irq(q
->queue_lock
);
84 static ssize_t
queue_ra_show(struct request_queue
*q
, char *page
)
86 unsigned long ra_kb
= q
->backing_dev_info
.ra_pages
<<
87 (PAGE_CACHE_SHIFT
- 10);
89 return queue_var_show(ra_kb
, (page
));
93 queue_ra_store(struct request_queue
*q
, const char *page
, size_t count
)
96 ssize_t ret
= queue_var_store(&ra_kb
, page
, count
);
98 q
->backing_dev_info
.ra_pages
= ra_kb
>> (PAGE_CACHE_SHIFT
- 10);
103 static ssize_t
queue_max_sectors_show(struct request_queue
*q
, char *page
)
105 int max_sectors_kb
= queue_max_sectors(q
) >> 1;
107 return queue_var_show(max_sectors_kb
, (page
));
110 static ssize_t
queue_max_segments_show(struct request_queue
*q
, char *page
)
112 return queue_var_show(queue_max_segments(q
), (page
));
115 static ssize_t
queue_max_integrity_segments_show(struct request_queue
*q
, char *page
)
117 return queue_var_show(q
->limits
.max_integrity_segments
, (page
));
120 static ssize_t
queue_max_segment_size_show(struct request_queue
*q
, char *page
)
122 if (blk_queue_cluster(q
))
123 return queue_var_show(queue_max_segment_size(q
), (page
));
125 return queue_var_show(PAGE_CACHE_SIZE
, (page
));
128 static ssize_t
queue_logical_block_size_show(struct request_queue
*q
, char *page
)
130 return queue_var_show(queue_logical_block_size(q
), page
);
133 static ssize_t
queue_physical_block_size_show(struct request_queue
*q
, char *page
)
135 return queue_var_show(queue_physical_block_size(q
), page
);
138 static ssize_t
queue_io_min_show(struct request_queue
*q
, char *page
)
140 return queue_var_show(queue_io_min(q
), page
);
143 static ssize_t
queue_io_opt_show(struct request_queue
*q
, char *page
)
145 return queue_var_show(queue_io_opt(q
), page
);
148 static ssize_t
queue_discard_granularity_show(struct request_queue
*q
, char *page
)
150 return queue_var_show(q
->limits
.discard_granularity
, page
);
153 static ssize_t
queue_discard_max_show(struct request_queue
*q
, char *page
)
155 return sprintf(page
, "%llu\n",
156 (unsigned long long)q
->limits
.max_discard_sectors
<< 9);
159 static ssize_t
queue_discard_zeroes_data_show(struct request_queue
*q
, char *page
)
161 return queue_var_show(queue_discard_zeroes_data(q
), page
);
165 queue_max_sectors_store(struct request_queue
*q
, const char *page
, size_t count
)
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
);
172 if (max_sectors_kb
> max_hw_sectors_kb
|| max_sectors_kb
< page_kb
)
175 spin_lock_irq(q
->queue_lock
);
176 q
->limits
.max_sectors
= max_sectors_kb
<< 1;
177 spin_unlock_irq(q
->queue_lock
);
182 static ssize_t
queue_max_hw_sectors_show(struct request_queue
*q
, char *page
)
184 int max_hw_sectors_kb
= queue_max_hw_sectors(q
) >> 1;
186 return queue_var_show(max_hw_sectors_kb
, (page
));
189 #define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
191 queue_show_##name(struct request_queue *q, char *page) \
194 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
195 return queue_var_show(neg ? !bit : bit, page); \
198 queue_store_##name(struct request_queue *q, const char *page, size_t count) \
202 ret = queue_var_store(&val, page, count); \
206 spin_lock_irq(q->queue_lock); \
208 queue_flag_set(QUEUE_FLAG_##flag, q); \
210 queue_flag_clear(QUEUE_FLAG_##flag, q); \
211 spin_unlock_irq(q->queue_lock); \
215 QUEUE_SYSFS_BIT_FNS(nonrot
, NONROT
, 1);
216 QUEUE_SYSFS_BIT_FNS(random
, ADD_RANDOM
, 0);
217 QUEUE_SYSFS_BIT_FNS(iostats
, IO_STAT
, 0);
218 #undef QUEUE_SYSFS_BIT_FNS
220 static ssize_t
queue_nomerges_show(struct request_queue
*q
, char *page
)
222 return queue_var_show((blk_queue_nomerges(q
) << 1) |
223 blk_queue_noxmerges(q
), page
);
226 static ssize_t
queue_nomerges_store(struct request_queue
*q
, const char *page
,
230 ssize_t ret
= queue_var_store(&nm
, page
, count
);
232 spin_lock_irq(q
->queue_lock
);
233 queue_flag_clear(QUEUE_FLAG_NOMERGES
, q
);
234 queue_flag_clear(QUEUE_FLAG_NOXMERGES
, q
);
236 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
238 queue_flag_set(QUEUE_FLAG_NOXMERGES
, q
);
239 spin_unlock_irq(q
->queue_lock
);
244 static ssize_t
queue_rq_affinity_show(struct request_queue
*q
, char *page
)
246 bool set
= test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
);
248 return queue_var_show(set
, page
);
252 queue_rq_affinity_store(struct request_queue
*q
, const char *page
, size_t count
)
254 ssize_t ret
= -EINVAL
;
255 #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
258 ret
= queue_var_store(&val
, page
, count
);
259 spin_lock_irq(q
->queue_lock
);
261 queue_flag_set(QUEUE_FLAG_SAME_COMP
, q
);
263 queue_flag_clear(QUEUE_FLAG_SAME_COMP
, q
);
264 spin_unlock_irq(q
->queue_lock
);
269 static struct queue_sysfs_entry queue_requests_entry
= {
270 .attr
= {.name
= "nr_requests", .mode
= S_IRUGO
| S_IWUSR
},
271 .show
= queue_requests_show
,
272 .store
= queue_requests_store
,
275 static struct queue_sysfs_entry queue_ra_entry
= {
276 .attr
= {.name
= "read_ahead_kb", .mode
= S_IRUGO
| S_IWUSR
},
277 .show
= queue_ra_show
,
278 .store
= queue_ra_store
,
281 static struct queue_sysfs_entry queue_max_sectors_entry
= {
282 .attr
= {.name
= "max_sectors_kb", .mode
= S_IRUGO
| S_IWUSR
},
283 .show
= queue_max_sectors_show
,
284 .store
= queue_max_sectors_store
,
287 static struct queue_sysfs_entry queue_max_hw_sectors_entry
= {
288 .attr
= {.name
= "max_hw_sectors_kb", .mode
= S_IRUGO
},
289 .show
= queue_max_hw_sectors_show
,
292 static struct queue_sysfs_entry queue_max_segments_entry
= {
293 .attr
= {.name
= "max_segments", .mode
= S_IRUGO
},
294 .show
= queue_max_segments_show
,
297 static struct queue_sysfs_entry queue_max_integrity_segments_entry
= {
298 .attr
= {.name
= "max_integrity_segments", .mode
= S_IRUGO
},
299 .show
= queue_max_integrity_segments_show
,
302 static struct queue_sysfs_entry queue_max_segment_size_entry
= {
303 .attr
= {.name
= "max_segment_size", .mode
= S_IRUGO
},
304 .show
= queue_max_segment_size_show
,
307 static struct queue_sysfs_entry queue_iosched_entry
= {
308 .attr
= {.name
= "scheduler", .mode
= S_IRUGO
| S_IWUSR
},
309 .show
= elv_iosched_show
,
310 .store
= elv_iosched_store
,
313 static struct queue_sysfs_entry queue_hw_sector_size_entry
= {
314 .attr
= {.name
= "hw_sector_size", .mode
= S_IRUGO
},
315 .show
= queue_logical_block_size_show
,
318 static struct queue_sysfs_entry queue_logical_block_size_entry
= {
319 .attr
= {.name
= "logical_block_size", .mode
= S_IRUGO
},
320 .show
= queue_logical_block_size_show
,
323 static struct queue_sysfs_entry queue_physical_block_size_entry
= {
324 .attr
= {.name
= "physical_block_size", .mode
= S_IRUGO
},
325 .show
= queue_physical_block_size_show
,
328 static struct queue_sysfs_entry queue_io_min_entry
= {
329 .attr
= {.name
= "minimum_io_size", .mode
= S_IRUGO
},
330 .show
= queue_io_min_show
,
333 static struct queue_sysfs_entry queue_io_opt_entry
= {
334 .attr
= {.name
= "optimal_io_size", .mode
= S_IRUGO
},
335 .show
= queue_io_opt_show
,
338 static struct queue_sysfs_entry queue_discard_granularity_entry
= {
339 .attr
= {.name
= "discard_granularity", .mode
= S_IRUGO
},
340 .show
= queue_discard_granularity_show
,
343 static struct queue_sysfs_entry queue_discard_max_entry
= {
344 .attr
= {.name
= "discard_max_bytes", .mode
= S_IRUGO
},
345 .show
= queue_discard_max_show
,
348 static struct queue_sysfs_entry queue_discard_zeroes_data_entry
= {
349 .attr
= {.name
= "discard_zeroes_data", .mode
= S_IRUGO
},
350 .show
= queue_discard_zeroes_data_show
,
353 static struct queue_sysfs_entry queue_nonrot_entry
= {
354 .attr
= {.name
= "rotational", .mode
= S_IRUGO
| S_IWUSR
},
355 .show
= queue_show_nonrot
,
356 .store
= queue_store_nonrot
,
359 static struct queue_sysfs_entry queue_nomerges_entry
= {
360 .attr
= {.name
= "nomerges", .mode
= S_IRUGO
| S_IWUSR
},
361 .show
= queue_nomerges_show
,
362 .store
= queue_nomerges_store
,
365 static struct queue_sysfs_entry queue_rq_affinity_entry
= {
366 .attr
= {.name
= "rq_affinity", .mode
= S_IRUGO
| S_IWUSR
},
367 .show
= queue_rq_affinity_show
,
368 .store
= queue_rq_affinity_store
,
371 static struct queue_sysfs_entry queue_iostats_entry
= {
372 .attr
= {.name
= "iostats", .mode
= S_IRUGO
| S_IWUSR
},
373 .show
= queue_show_iostats
,
374 .store
= queue_store_iostats
,
377 static struct queue_sysfs_entry queue_random_entry
= {
378 .attr
= {.name
= "add_random", .mode
= S_IRUGO
| S_IWUSR
},
379 .show
= queue_show_random
,
380 .store
= queue_store_random
,
383 static struct attribute
*default_attrs
[] = {
384 &queue_requests_entry
.attr
,
385 &queue_ra_entry
.attr
,
386 &queue_max_hw_sectors_entry
.attr
,
387 &queue_max_sectors_entry
.attr
,
388 &queue_max_segments_entry
.attr
,
389 &queue_max_integrity_segments_entry
.attr
,
390 &queue_max_segment_size_entry
.attr
,
391 &queue_iosched_entry
.attr
,
392 &queue_hw_sector_size_entry
.attr
,
393 &queue_logical_block_size_entry
.attr
,
394 &queue_physical_block_size_entry
.attr
,
395 &queue_io_min_entry
.attr
,
396 &queue_io_opt_entry
.attr
,
397 &queue_discard_granularity_entry
.attr
,
398 &queue_discard_max_entry
.attr
,
399 &queue_discard_zeroes_data_entry
.attr
,
400 &queue_nonrot_entry
.attr
,
401 &queue_nomerges_entry
.attr
,
402 &queue_rq_affinity_entry
.attr
,
403 &queue_iostats_entry
.attr
,
404 &queue_random_entry
.attr
,
408 #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
411 queue_attr_show(struct kobject
*kobj
, struct attribute
*attr
, char *page
)
413 struct queue_sysfs_entry
*entry
= to_queue(attr
);
414 struct request_queue
*q
=
415 container_of(kobj
, struct request_queue
, kobj
);
420 mutex_lock(&q
->sysfs_lock
);
421 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
422 mutex_unlock(&q
->sysfs_lock
);
425 res
= entry
->show(q
, page
);
426 mutex_unlock(&q
->sysfs_lock
);
431 queue_attr_store(struct kobject
*kobj
, struct attribute
*attr
,
432 const char *page
, size_t length
)
434 struct queue_sysfs_entry
*entry
= to_queue(attr
);
435 struct request_queue
*q
;
441 q
= container_of(kobj
, struct request_queue
, kobj
);
442 mutex_lock(&q
->sysfs_lock
);
443 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
444 mutex_unlock(&q
->sysfs_lock
);
447 res
= entry
->store(q
, page
, length
);
448 mutex_unlock(&q
->sysfs_lock
);
453 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
454 * @kobj: the kobj belonging of the request queue to be released
457 * blk_cleanup_queue is the pair to blk_init_queue() or
458 * blk_queue_make_request(). It should be called when a request queue is
459 * being released; typically when a block device is being de-registered.
460 * Currently, its primary task it to free all the &struct request
461 * structures that were allocated to the queue and the queue itself.
464 * Hopefully the low level driver will have finished any
465 * outstanding requests first...
467 static void blk_release_queue(struct kobject
*kobj
)
469 struct request_queue
*q
=
470 container_of(kobj
, struct request_queue
, kobj
);
471 struct request_list
*rl
= &q
->rq
;
476 elevator_exit(q
->elevator
);
481 mempool_destroy(rl
->rq_pool
);
484 __blk_queue_free_tags(q
);
486 blk_trace_shutdown(q
);
488 bdi_destroy(&q
->backing_dev_info
);
489 kmem_cache_free(blk_requestq_cachep
, q
);
492 static const struct sysfs_ops queue_sysfs_ops
= {
493 .show
= queue_attr_show
,
494 .store
= queue_attr_store
,
497 struct kobj_type blk_queue_ktype
= {
498 .sysfs_ops
= &queue_sysfs_ops
,
499 .default_attrs
= default_attrs
,
500 .release
= blk_release_queue
,
503 int blk_register_queue(struct gendisk
*disk
)
506 struct device
*dev
= disk_to_dev(disk
);
507 struct request_queue
*q
= disk
->queue
;
512 ret
= blk_trace_init_sysfs(dev
);
516 ret
= kobject_add(&q
->kobj
, kobject_get(&dev
->kobj
), "%s", "queue");
518 blk_trace_remove_sysfs(dev
);
522 kobject_uevent(&q
->kobj
, KOBJ_ADD
);
527 ret
= elv_register_queue(q
);
529 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
530 kobject_del(&q
->kobj
);
531 blk_trace_remove_sysfs(dev
);
532 kobject_put(&dev
->kobj
);
539 void blk_unregister_queue(struct gendisk
*disk
)
541 struct request_queue
*q
= disk
->queue
;
547 elv_unregister_queue(q
);
549 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
550 kobject_del(&q
->kobj
);
551 blk_trace_remove_sysfs(disk_to_dev(disk
));
552 kobject_put(&disk_to_dev(disk
)->kobj
);