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