2 * Functions related to sysfs handling
4 #include <linux/kernel.h>
5 #include <linux/module.h>
7 #include <linux/blkdev.h>
8 #include <linux/blktrace_api.h>
12 struct queue_sysfs_entry
{
13 struct attribute attr
;
14 ssize_t (*show
)(struct request_queue
*, char *);
15 ssize_t (*store
)(struct request_queue
*, const char *, size_t);
19 queue_var_show(unsigned long var
, char *page
)
21 return sprintf(page
, "%lu\n", var
);
25 queue_var_store(unsigned long *var
, const char *page
, size_t count
)
27 char *p
= (char *) page
;
29 *var
= simple_strtoul(p
, &p
, 10);
33 static ssize_t
queue_requests_show(struct request_queue
*q
, char *page
)
35 return queue_var_show(q
->nr_requests
, (page
));
39 queue_requests_store(struct request_queue
*q
, const char *page
, size_t count
)
41 struct request_list
*rl
= &q
->rq
;
48 ret
= queue_var_store(&nr
, page
, count
);
49 if (nr
< BLKDEV_MIN_RQ
)
52 spin_lock_irq(q
->queue_lock
);
54 blk_queue_congestion_threshold(q
);
56 if (rl
->count
[BLK_RW_SYNC
] >= queue_congestion_on_threshold(q
))
57 blk_set_queue_congested(q
, BLK_RW_SYNC
);
58 else if (rl
->count
[BLK_RW_SYNC
] < queue_congestion_off_threshold(q
))
59 blk_clear_queue_congested(q
, BLK_RW_SYNC
);
61 if (rl
->count
[BLK_RW_ASYNC
] >= queue_congestion_on_threshold(q
))
62 blk_set_queue_congested(q
, BLK_RW_ASYNC
);
63 else if (rl
->count
[BLK_RW_ASYNC
] < queue_congestion_off_threshold(q
))
64 blk_clear_queue_congested(q
, BLK_RW_ASYNC
);
66 if (rl
->count
[BLK_RW_SYNC
] >= q
->nr_requests
) {
67 blk_set_queue_full(q
, BLK_RW_SYNC
);
68 } else if (rl
->count
[BLK_RW_SYNC
]+1 <= q
->nr_requests
) {
69 blk_clear_queue_full(q
, BLK_RW_SYNC
);
70 wake_up(&rl
->wait
[BLK_RW_SYNC
]);
73 if (rl
->count
[BLK_RW_ASYNC
] >= q
->nr_requests
) {
74 blk_set_queue_full(q
, BLK_RW_ASYNC
);
75 } else if (rl
->count
[BLK_RW_ASYNC
]+1 <= q
->nr_requests
) {
76 blk_clear_queue_full(q
, BLK_RW_ASYNC
);
77 wake_up(&rl
->wait
[BLK_RW_ASYNC
]);
79 spin_unlock_irq(q
->queue_lock
);
83 static ssize_t
queue_ra_show(struct request_queue
*q
, char *page
)
85 unsigned long ra_kb
= q
->backing_dev_info
.ra_pages
<<
86 (PAGE_CACHE_SHIFT
- 10);
88 return queue_var_show(ra_kb
, (page
));
92 queue_ra_store(struct request_queue
*q
, const char *page
, size_t count
)
95 ssize_t ret
= queue_var_store(&ra_kb
, page
, count
);
97 q
->backing_dev_info
.ra_pages
= ra_kb
>> (PAGE_CACHE_SHIFT
- 10);
102 static ssize_t
queue_max_sectors_show(struct request_queue
*q
, char *page
)
104 int max_sectors_kb
= queue_max_sectors(q
) >> 1;
106 return queue_var_show(max_sectors_kb
, (page
));
109 static ssize_t
queue_logical_block_size_show(struct request_queue
*q
, char *page
)
111 return queue_var_show(queue_logical_block_size(q
), page
);
114 static ssize_t
queue_physical_block_size_show(struct request_queue
*q
, char *page
)
116 return queue_var_show(queue_physical_block_size(q
), page
);
119 static ssize_t
queue_io_min_show(struct request_queue
*q
, char *page
)
121 return queue_var_show(queue_io_min(q
), page
);
124 static ssize_t
queue_io_opt_show(struct request_queue
*q
, char *page
)
126 return queue_var_show(queue_io_opt(q
), page
);
130 queue_max_sectors_store(struct request_queue
*q
, const char *page
, size_t count
)
132 unsigned long max_sectors_kb
,
133 max_hw_sectors_kb
= queue_max_hw_sectors(q
) >> 1,
134 page_kb
= 1 << (PAGE_CACHE_SHIFT
- 10);
135 ssize_t ret
= queue_var_store(&max_sectors_kb
, page
, count
);
137 if (max_sectors_kb
> max_hw_sectors_kb
|| max_sectors_kb
< page_kb
)
140 spin_lock_irq(q
->queue_lock
);
141 q
->limits
.max_sectors
= max_sectors_kb
<< 1;
142 spin_unlock_irq(q
->queue_lock
);
147 static ssize_t
queue_max_hw_sectors_show(struct request_queue
*q
, char *page
)
149 int max_hw_sectors_kb
= queue_max_hw_sectors(q
) >> 1;
151 return queue_var_show(max_hw_sectors_kb
, (page
));
154 static ssize_t
queue_nonrot_show(struct request_queue
*q
, char *page
)
156 return queue_var_show(!blk_queue_nonrot(q
), page
);
159 static ssize_t
queue_nonrot_store(struct request_queue
*q
, const char *page
,
163 ssize_t ret
= queue_var_store(&nm
, page
, count
);
165 spin_lock_irq(q
->queue_lock
);
167 queue_flag_clear(QUEUE_FLAG_NONROT
, q
);
169 queue_flag_set(QUEUE_FLAG_NONROT
, q
);
170 spin_unlock_irq(q
->queue_lock
);
175 static ssize_t
queue_nomerges_show(struct request_queue
*q
, char *page
)
177 return queue_var_show(blk_queue_nomerges(q
), page
);
180 static ssize_t
queue_nomerges_store(struct request_queue
*q
, const char *page
,
184 ssize_t ret
= queue_var_store(&nm
, page
, count
);
186 spin_lock_irq(q
->queue_lock
);
188 queue_flag_set(QUEUE_FLAG_NOMERGES
, q
);
190 queue_flag_clear(QUEUE_FLAG_NOMERGES
, q
);
191 spin_unlock_irq(q
->queue_lock
);
196 static ssize_t
queue_rq_affinity_show(struct request_queue
*q
, char *page
)
198 bool set
= test_bit(QUEUE_FLAG_SAME_COMP
, &q
->queue_flags
);
200 return queue_var_show(set
, page
);
204 queue_rq_affinity_store(struct request_queue
*q
, const char *page
, size_t count
)
206 ssize_t ret
= -EINVAL
;
207 #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
210 ret
= queue_var_store(&val
, page
, count
);
211 spin_lock_irq(q
->queue_lock
);
213 queue_flag_set(QUEUE_FLAG_SAME_COMP
, q
);
215 queue_flag_clear(QUEUE_FLAG_SAME_COMP
, q
);
216 spin_unlock_irq(q
->queue_lock
);
221 static ssize_t
queue_iostats_show(struct request_queue
*q
, char *page
)
223 return queue_var_show(blk_queue_io_stat(q
), page
);
226 static ssize_t
queue_iostats_store(struct request_queue
*q
, const char *page
,
230 ssize_t ret
= queue_var_store(&stats
, page
, count
);
232 spin_lock_irq(q
->queue_lock
);
234 queue_flag_set(QUEUE_FLAG_IO_STAT
, q
);
236 queue_flag_clear(QUEUE_FLAG_IO_STAT
, q
);
237 spin_unlock_irq(q
->queue_lock
);
242 static struct queue_sysfs_entry queue_requests_entry
= {
243 .attr
= {.name
= "nr_requests", .mode
= S_IRUGO
| S_IWUSR
},
244 .show
= queue_requests_show
,
245 .store
= queue_requests_store
,
248 static struct queue_sysfs_entry queue_ra_entry
= {
249 .attr
= {.name
= "read_ahead_kb", .mode
= S_IRUGO
| S_IWUSR
},
250 .show
= queue_ra_show
,
251 .store
= queue_ra_store
,
254 static struct queue_sysfs_entry queue_max_sectors_entry
= {
255 .attr
= {.name
= "max_sectors_kb", .mode
= S_IRUGO
| S_IWUSR
},
256 .show
= queue_max_sectors_show
,
257 .store
= queue_max_sectors_store
,
260 static struct queue_sysfs_entry queue_max_hw_sectors_entry
= {
261 .attr
= {.name
= "max_hw_sectors_kb", .mode
= S_IRUGO
},
262 .show
= queue_max_hw_sectors_show
,
265 static struct queue_sysfs_entry queue_iosched_entry
= {
266 .attr
= {.name
= "scheduler", .mode
= S_IRUGO
| S_IWUSR
},
267 .show
= elv_iosched_show
,
268 .store
= elv_iosched_store
,
271 static struct queue_sysfs_entry queue_hw_sector_size_entry
= {
272 .attr
= {.name
= "hw_sector_size", .mode
= S_IRUGO
},
273 .show
= queue_logical_block_size_show
,
276 static struct queue_sysfs_entry queue_logical_block_size_entry
= {
277 .attr
= {.name
= "logical_block_size", .mode
= S_IRUGO
},
278 .show
= queue_logical_block_size_show
,
281 static struct queue_sysfs_entry queue_physical_block_size_entry
= {
282 .attr
= {.name
= "physical_block_size", .mode
= S_IRUGO
},
283 .show
= queue_physical_block_size_show
,
286 static struct queue_sysfs_entry queue_io_min_entry
= {
287 .attr
= {.name
= "minimum_io_size", .mode
= S_IRUGO
},
288 .show
= queue_io_min_show
,
291 static struct queue_sysfs_entry queue_io_opt_entry
= {
292 .attr
= {.name
= "optimal_io_size", .mode
= S_IRUGO
},
293 .show
= queue_io_opt_show
,
296 static struct queue_sysfs_entry queue_nonrot_entry
= {
297 .attr
= {.name
= "rotational", .mode
= S_IRUGO
| S_IWUSR
},
298 .show
= queue_nonrot_show
,
299 .store
= queue_nonrot_store
,
302 static struct queue_sysfs_entry queue_nomerges_entry
= {
303 .attr
= {.name
= "nomerges", .mode
= S_IRUGO
| S_IWUSR
},
304 .show
= queue_nomerges_show
,
305 .store
= queue_nomerges_store
,
308 static struct queue_sysfs_entry queue_rq_affinity_entry
= {
309 .attr
= {.name
= "rq_affinity", .mode
= S_IRUGO
| S_IWUSR
},
310 .show
= queue_rq_affinity_show
,
311 .store
= queue_rq_affinity_store
,
314 static struct queue_sysfs_entry queue_iostats_entry
= {
315 .attr
= {.name
= "iostats", .mode
= S_IRUGO
| S_IWUSR
},
316 .show
= queue_iostats_show
,
317 .store
= queue_iostats_store
,
320 static struct attribute
*default_attrs
[] = {
321 &queue_requests_entry
.attr
,
322 &queue_ra_entry
.attr
,
323 &queue_max_hw_sectors_entry
.attr
,
324 &queue_max_sectors_entry
.attr
,
325 &queue_iosched_entry
.attr
,
326 &queue_hw_sector_size_entry
.attr
,
327 &queue_logical_block_size_entry
.attr
,
328 &queue_physical_block_size_entry
.attr
,
329 &queue_io_min_entry
.attr
,
330 &queue_io_opt_entry
.attr
,
331 &queue_nonrot_entry
.attr
,
332 &queue_nomerges_entry
.attr
,
333 &queue_rq_affinity_entry
.attr
,
334 &queue_iostats_entry
.attr
,
338 #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
341 queue_attr_show(struct kobject
*kobj
, struct attribute
*attr
, char *page
)
343 struct queue_sysfs_entry
*entry
= to_queue(attr
);
344 struct request_queue
*q
=
345 container_of(kobj
, struct request_queue
, kobj
);
350 mutex_lock(&q
->sysfs_lock
);
351 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
352 mutex_unlock(&q
->sysfs_lock
);
355 res
= entry
->show(q
, page
);
356 mutex_unlock(&q
->sysfs_lock
);
361 queue_attr_store(struct kobject
*kobj
, struct attribute
*attr
,
362 const char *page
, size_t length
)
364 struct queue_sysfs_entry
*entry
= to_queue(attr
);
365 struct request_queue
*q
;
371 q
= container_of(kobj
, struct request_queue
, kobj
);
372 mutex_lock(&q
->sysfs_lock
);
373 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
374 mutex_unlock(&q
->sysfs_lock
);
377 res
= entry
->store(q
, page
, length
);
378 mutex_unlock(&q
->sysfs_lock
);
383 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
384 * @kobj: the kobj belonging of the request queue to be released
387 * blk_cleanup_queue is the pair to blk_init_queue() or
388 * blk_queue_make_request(). It should be called when a request queue is
389 * being released; typically when a block device is being de-registered.
390 * Currently, its primary task it to free all the &struct request
391 * structures that were allocated to the queue and the queue itself.
394 * Hopefully the low level driver will have finished any
395 * outstanding requests first...
397 static void blk_release_queue(struct kobject
*kobj
)
399 struct request_queue
*q
=
400 container_of(kobj
, struct request_queue
, kobj
);
401 struct request_list
*rl
= &q
->rq
;
406 mempool_destroy(rl
->rq_pool
);
409 __blk_queue_free_tags(q
);
411 blk_trace_shutdown(q
);
413 bdi_destroy(&q
->backing_dev_info
);
414 kmem_cache_free(blk_requestq_cachep
, q
);
417 static struct sysfs_ops queue_sysfs_ops
= {
418 .show
= queue_attr_show
,
419 .store
= queue_attr_store
,
422 struct kobj_type blk_queue_ktype
= {
423 .sysfs_ops
= &queue_sysfs_ops
,
424 .default_attrs
= default_attrs
,
425 .release
= blk_release_queue
,
428 int blk_register_queue(struct gendisk
*disk
)
431 struct device
*dev
= disk_to_dev(disk
);
433 struct request_queue
*q
= disk
->queue
;
438 ret
= blk_trace_init_sysfs(dev
);
442 ret
= kobject_add(&q
->kobj
, kobject_get(&dev
->kobj
), "%s", "queue");
446 kobject_uevent(&q
->kobj
, KOBJ_ADD
);
451 ret
= elv_register_queue(q
);
453 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
454 kobject_del(&q
->kobj
);
461 void blk_unregister_queue(struct gendisk
*disk
)
463 struct request_queue
*q
= disk
->queue
;
469 elv_unregister_queue(q
);
471 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
472 kobject_del(&q
->kobj
);
473 kobject_put(&disk_to_dev(disk
)->kobj
);