4 #include <linux/kernel.h>
5 #include <linux/slab.h>
6 #include <linux/module.h>
9 #include <linux/blktrace_api.h>
21 queue_var_show(
unsigned long var,
char *
page)
23 return sprintf(page,
"%lu\n", var);
27 queue_var_store(
unsigned long *var,
const char *
page,
size_t count)
43 return queue_var_show(q->nr_requests, (page));
47 queue_requests_store(
struct request_queue *
q,
const char *page,
size_t count)
49 struct request_list *rl;
56 ret = queue_var_store(&nr, page, count);
60 if (nr < BLKDEV_MIN_RQ)
63 spin_lock_irq(q->queue_lock);
70 if (rl->count[
BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
72 else if (rl->count[
BLK_RW_SYNC] < queue_congestion_off_threshold(q))
75 if (rl->count[
BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
77 else if (rl->count[
BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
96 spin_unlock_irq(q->queue_lock);
102 unsigned long ra_kb = q->backing_dev_info.ra_pages <<
105 return queue_var_show(ra_kb, (page));
109 queue_ra_store(
struct request_queue *q,
const char *page,
size_t count)
112 ssize_t ret = queue_var_store(&ra_kb, page, count);
124 int max_sectors_kb = queue_max_sectors(q) >> 1;
126 return queue_var_show(max_sectors_kb, (page));
131 return queue_var_show(queue_max_segments(q), (page));
136 return queue_var_show(q->limits.max_integrity_segments, (page));
141 if (blk_queue_cluster(q))
142 return queue_var_show(queue_max_segment_size(q), (page));
149 return queue_var_show(queue_logical_block_size(q), page);
154 return queue_var_show(queue_physical_block_size(q), page);
159 return queue_var_show(queue_io_min(q), page);
164 return queue_var_show(queue_io_opt(q), page);
169 return queue_var_show(q->limits.discard_granularity, page);
175 (
unsigned long long)q->limits.max_discard_sectors << 9);
180 return queue_var_show(queue_discard_zeroes_data(q), page);
186 (
unsigned long long)q->limits.max_write_same_sectors << 9);
191 queue_max_sectors_store(
struct request_queue *q,
const char *page,
size_t count)
193 unsigned long max_sectors_kb,
194 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
196 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
201 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
204 spin_lock_irq(q->queue_lock);
205 q->limits.max_sectors = max_sectors_kb << 1;
206 spin_unlock_irq(q->queue_lock);
213 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
215 return queue_var_show(max_hw_sectors_kb, (page));
218 #define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
220 queue_show_##name(struct request_queue *q, char *page) \
223 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
224 return queue_var_show(neg ? !bit : bit, page); \
227 queue_store_##name(struct request_queue *q, const char *page, size_t count) \
231 ret = queue_var_store(&val, page, count); \
235 spin_lock_irq(q->queue_lock); \
237 queue_flag_set(QUEUE_FLAG_##flag, q); \
239 queue_flag_clear(QUEUE_FLAG_##flag, q); \
240 spin_unlock_irq(q->queue_lock); \
247 #undef QUEUE_SYSFS_BIT_FNS
251 return queue_var_show((blk_queue_nomerges(q) << 1) |
252 blk_queue_noxmerges(q), page);
259 ssize_t ret = queue_var_store(&nm, page, count);
264 spin_lock_irq(q->queue_lock);
265 queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
266 queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
268 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
270 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
271 spin_unlock_irq(q->queue_lock);
278 bool set =
test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
279 bool force =
test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
281 return queue_var_show(
set << force, page);
285 queue_rq_affinity_store(
struct request_queue *q,
const char *page,
size_t count)
288 #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
291 ret = queue_var_store(&val, page, count);
295 spin_lock_irq(q->queue_lock);
297 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
298 queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
299 }
else if (val == 1) {
300 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
301 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
302 }
else if (val == 0) {
303 queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
304 queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
306 spin_unlock_irq(q->queue_lock);
313 .show = queue_requests_show,
314 .store = queue_requests_store,
319 .show = queue_ra_show,
320 .store = queue_ra_store,
325 .show = queue_max_sectors_show,
326 .store = queue_max_sectors_store,
330 .attr = {.name =
"max_hw_sectors_kb", .mode =
S_IRUGO },
331 .show = queue_max_hw_sectors_show,
335 .attr = {.name =
"max_segments", .mode =
S_IRUGO },
336 .show = queue_max_segments_show,
340 .attr = {.name =
"max_integrity_segments", .mode =
S_IRUGO },
341 .show = queue_max_integrity_segments_show,
345 .attr = {.name =
"max_segment_size", .mode =
S_IRUGO },
346 .show = queue_max_segment_size_show,
356 .attr = {.name =
"hw_sector_size", .mode =
S_IRUGO },
357 .show = queue_logical_block_size_show,
361 .attr = {.name =
"logical_block_size", .mode =
S_IRUGO },
362 .show = queue_logical_block_size_show,
366 .attr = {.name =
"physical_block_size", .mode =
S_IRUGO },
367 .show = queue_physical_block_size_show,
371 .attr = {.name =
"minimum_io_size", .mode =
S_IRUGO },
372 .show = queue_io_min_show,
376 .attr = {.name =
"optimal_io_size", .mode =
S_IRUGO },
377 .show = queue_io_opt_show,
381 .attr = {.name =
"discard_granularity", .mode =
S_IRUGO },
382 .show = queue_discard_granularity_show,
386 .attr = {.name =
"discard_max_bytes", .mode =
S_IRUGO },
387 .show = queue_discard_max_show,
391 .attr = {.name =
"discard_zeroes_data", .mode =
S_IRUGO },
392 .show = queue_discard_zeroes_data_show,
396 .attr = {.name =
"write_same_max_bytes", .mode =
S_IRUGO },
397 .show = queue_write_same_max_show,
402 .show = queue_show_nonrot,
403 .store = queue_store_nonrot,
408 .show = queue_nomerges_show,
409 .store = queue_nomerges_store,
414 .show = queue_rq_affinity_show,
415 .store = queue_rq_affinity_store,
420 .show = queue_show_iostats,
421 .store = queue_store_iostats,
426 .show = queue_show_random,
427 .store = queue_store_random,
430 static struct attribute *default_attrs[] = {
431 &queue_requests_entry.
attr,
432 &queue_ra_entry.
attr,
433 &queue_max_hw_sectors_entry.
attr,
434 &queue_max_sectors_entry.
attr,
435 &queue_max_segments_entry.
attr,
436 &queue_max_integrity_segments_entry.
attr,
437 &queue_max_segment_size_entry.
attr,
438 &queue_iosched_entry.
attr,
439 &queue_hw_sector_size_entry.
attr,
440 &queue_logical_block_size_entry.
attr,
441 &queue_physical_block_size_entry.
attr,
442 &queue_io_min_entry.
attr,
443 &queue_io_opt_entry.
attr,
444 &queue_discard_granularity_entry.
attr,
445 &queue_discard_max_entry.
attr,
446 &queue_discard_zeroes_data_entry.
attr,
447 &queue_write_same_max_entry.
attr,
448 &queue_nonrot_entry.
attr,
449 &queue_nomerges_entry.
attr,
450 &queue_rq_affinity_entry.
attr,
451 &queue_iostats_entry.
attr,
452 &queue_random_entry.
attr,
456 #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
469 if (blk_queue_dead(q)) {
473 res = entry->
show(q, page);
480 const char *page,
size_t length)
491 if (blk_queue_dead(q)) {
495 res = entry->
store(q, page, length);
515 static void blk_release_queue(
struct kobject *kobj)
525 spin_lock_irq(q->queue_lock);
527 spin_unlock_irq(q->queue_lock);
544 static const struct sysfs_ops queue_sysfs_ops = {
545 .show = queue_attr_show,
546 .store = queue_attr_store,
550 .sysfs_ops = &queue_sysfs_ops,
552 .release = blk_release_queue,
570 ret = blk_trace_init_sysfs(dev);