blob: 6d735122bc59499693d8682d4730c92ff63c91be [file] [log] [blame]
Jens Axboe8324aa92008-01-29 14:51:59 +01001/*
2 * Functions related to sysfs handling
3 */
4#include <linux/kernel.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +09005#include <linux/slab.h>
Jens Axboe8324aa92008-01-29 14:51:59 +01006#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
Xiaotian Feng9cb308c2009-07-17 15:26:26 +080020queue_var_show(unsigned long var, char *page)
Jens Axboe8324aa92008-01-29 14:51:59 +010021{
Xiaotian Feng9cb308c2009-07-17 15:26:26 +080022 return sprintf(page, "%lu\n", var);
Jens Axboe8324aa92008-01-29 14:51:59 +010023}
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;
Jens Axboeb8a9ae72009-09-11 22:44:29 +020044 int ret;
45
46 if (!q->request_fn)
47 return -EINVAL;
48
49 ret = queue_var_store(&nr, page, count);
Jens Axboe8324aa92008-01-29 14:51:59 +010050 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
Jens Axboe1faa16d2009-04-06 14:48:01 +020057 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);
Jens Axboe8324aa92008-01-29 14:51:59 +010061
Jens Axboe1faa16d2009-04-06 14:48:01 +020062 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);
Jens Axboe8324aa92008-01-29 14:51:59 +010066
Jens Axboe1faa16d2009-04-06 14:48:01 +020067 if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
68 blk_set_queue_full(q, BLK_RW_SYNC);
69 } else if (rl->count[BLK_RW_SYNC]+1 <= q->nr_requests) {
70 blk_clear_queue_full(q, BLK_RW_SYNC);
71 wake_up(&rl->wait[BLK_RW_SYNC]);
Jens Axboe8324aa92008-01-29 14:51:59 +010072 }
73
Jens Axboe1faa16d2009-04-06 14:48:01 +020074 if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
75 blk_set_queue_full(q, BLK_RW_ASYNC);
76 } else if (rl->count[BLK_RW_ASYNC]+1 <= q->nr_requests) {
77 blk_clear_queue_full(q, BLK_RW_ASYNC);
78 wake_up(&rl->wait[BLK_RW_ASYNC]);
Jens Axboe8324aa92008-01-29 14:51:59 +010079 }
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{
Xiaotian Feng9cb308c2009-07-17 15:26:26 +080086 unsigned long ra_kb = q->backing_dev_info.ra_pages <<
87 (PAGE_CACHE_SHIFT - 10);
Jens Axboe8324aa92008-01-29 14:51:59 +010088
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
Jens Axboe8324aa92008-01-29 14:51:59 +010098 q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
Jens Axboe8324aa92008-01-29 14:51:59 +010099
100 return ret;
101}
102
103static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
104{
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400105 int max_sectors_kb = queue_max_sectors(q) >> 1;
Jens Axboe8324aa92008-01-29 14:51:59 +0100106
107 return queue_var_show(max_sectors_kb, (page));
108}
109
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500110static 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
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200115static 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
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500120static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
121{
Martin K. Petersene692cb62010-12-01 19:41:49 +0100122 if (blk_queue_cluster(q))
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500123 return queue_var_show(queue_max_segment_size(q), (page));
124
125 return queue_var_show(PAGE_CACHE_SIZE, (page));
126}
127
Martin K. Petersene1defc42009-05-22 17:17:49 -0400128static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
Martin K. Petersene68b9032008-01-29 19:14:08 +0100129{
Martin K. Petersene1defc42009-05-22 17:17:49 -0400130 return queue_var_show(queue_logical_block_size(q), page);
Martin K. Petersene68b9032008-01-29 19:14:08 +0100131}
132
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400133static 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);
Jens Axboe8324aa92008-01-29 14:51:59 +0100146}
147
Martin K. Petersen86b37282009-11-10 11:50:21 +0100148static 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 queue_var_show(q->limits.max_discard_sectors << 9, page);
156}
157
Martin K. Petersen98262f22009-12-03 09:24:48 +0100158static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
159{
160 return queue_var_show(queue_discard_zeroes_data(q), page);
161}
162
Jens Axboe8324aa92008-01-29 14:51:59 +0100163static ssize_t
164queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
165{
166 unsigned long max_sectors_kb,
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400167 max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
Jens Axboe8324aa92008-01-29 14:51:59 +0100168 page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
169 ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
170
171 if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
172 return -EINVAL;
Wu Fengguang7c239512008-11-25 09:08:39 +0100173
Jens Axboe8324aa92008-01-29 14:51:59 +0100174 spin_lock_irq(q->queue_lock);
Nikanth Karthikesanc295fc02009-09-01 22:40:15 +0200175 q->limits.max_sectors = max_sectors_kb << 1;
Jens Axboe8324aa92008-01-29 14:51:59 +0100176 spin_unlock_irq(q->queue_lock);
177
178 return ret;
179}
180
181static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
182{
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400183 int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
Jens Axboe8324aa92008-01-29 14:51:59 +0100184
185 return queue_var_show(max_hw_sectors_kb, (page));
186}
187
Jens Axboe956bcb72010-08-07 18:13:50 +0200188#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
189static ssize_t \
190queue_show_##name(struct request_queue *q, char *page) \
191{ \
192 int bit; \
193 bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
194 return queue_var_show(neg ? !bit : bit, page); \
195} \
196static ssize_t \
197queue_store_##name(struct request_queue *q, const char *page, size_t count) \
198{ \
199 unsigned long val; \
200 ssize_t ret; \
201 ret = queue_var_store(&val, page, count); \
202 if (neg) \
203 val = !val; \
204 \
205 spin_lock_irq(q->queue_lock); \
206 if (val) \
207 queue_flag_set(QUEUE_FLAG_##flag, q); \
208 else \
209 queue_flag_clear(QUEUE_FLAG_##flag, q); \
210 spin_unlock_irq(q->queue_lock); \
211 return ret; \
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100212}
213
Jens Axboe956bcb72010-08-07 18:13:50 +0200214QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
215QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
216QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
217#undef QUEUE_SYSFS_BIT_FNS
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100218
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200219static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
220{
Alan D. Brunelle488991e2010-01-29 09:04:08 +0100221 return queue_var_show((blk_queue_nomerges(q) << 1) |
222 blk_queue_noxmerges(q), page);
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200223}
224
225static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
226 size_t count)
227{
228 unsigned long nm;
229 ssize_t ret = queue_var_store(&nm, page, count);
230
Jens Axboebf0f9702008-05-07 09:09:39 +0200231 spin_lock_irq(q->queue_lock);
Alan D. Brunelle488991e2010-01-29 09:04:08 +0100232 queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
233 queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
234 if (nm == 2)
Jens Axboebf0f9702008-05-07 09:09:39 +0200235 queue_flag_set(QUEUE_FLAG_NOMERGES, q);
Alan D. Brunelle488991e2010-01-29 09:04:08 +0100236 else if (nm)
237 queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
Jens Axboebf0f9702008-05-07 09:09:39 +0200238 spin_unlock_irq(q->queue_lock);
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100239
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200240 return ret;
241}
242
Jens Axboec7c22e42008-09-13 20:26:01 +0200243static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
244{
Xiaotian Feng9cb308c2009-07-17 15:26:26 +0800245 bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
Jens Axboec7c22e42008-09-13 20:26:01 +0200246
Xiaotian Feng9cb308c2009-07-17 15:26:26 +0800247 return queue_var_show(set, page);
Jens Axboec7c22e42008-09-13 20:26:01 +0200248}
249
250static ssize_t
251queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
252{
253 ssize_t ret = -EINVAL;
254#if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
255 unsigned long val;
256
257 ret = queue_var_store(&val, page, count);
258 spin_lock_irq(q->queue_lock);
259 if (val)
260 queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
261 else
262 queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
263 spin_unlock_irq(q->queue_lock);
264#endif
265 return ret;
266}
Jens Axboe8324aa92008-01-29 14:51:59 +0100267
268static struct queue_sysfs_entry queue_requests_entry = {
269 .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
270 .show = queue_requests_show,
271 .store = queue_requests_store,
272};
273
274static struct queue_sysfs_entry queue_ra_entry = {
275 .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
276 .show = queue_ra_show,
277 .store = queue_ra_store,
278};
279
280static struct queue_sysfs_entry queue_max_sectors_entry = {
281 .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
282 .show = queue_max_sectors_show,
283 .store = queue_max_sectors_store,
284};
285
286static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
287 .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
288 .show = queue_max_hw_sectors_show,
289};
290
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500291static struct queue_sysfs_entry queue_max_segments_entry = {
292 .attr = {.name = "max_segments", .mode = S_IRUGO },
293 .show = queue_max_segments_show,
294};
295
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200296static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
297 .attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
298 .show = queue_max_integrity_segments_show,
299};
300
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500301static struct queue_sysfs_entry queue_max_segment_size_entry = {
302 .attr = {.name = "max_segment_size", .mode = S_IRUGO },
303 .show = queue_max_segment_size_show,
304};
305
Jens Axboe8324aa92008-01-29 14:51:59 +0100306static struct queue_sysfs_entry queue_iosched_entry = {
307 .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
308 .show = elv_iosched_show,
309 .store = elv_iosched_store,
310};
311
Martin K. Petersene68b9032008-01-29 19:14:08 +0100312static struct queue_sysfs_entry queue_hw_sector_size_entry = {
313 .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
Martin K. Petersene1defc42009-05-22 17:17:49 -0400314 .show = queue_logical_block_size_show,
315};
316
317static struct queue_sysfs_entry queue_logical_block_size_entry = {
318 .attr = {.name = "logical_block_size", .mode = S_IRUGO },
319 .show = queue_logical_block_size_show,
Martin K. Petersene68b9032008-01-29 19:14:08 +0100320};
321
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400322static struct queue_sysfs_entry queue_physical_block_size_entry = {
323 .attr = {.name = "physical_block_size", .mode = S_IRUGO },
324 .show = queue_physical_block_size_show,
325};
326
327static struct queue_sysfs_entry queue_io_min_entry = {
328 .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
329 .show = queue_io_min_show,
330};
331
332static struct queue_sysfs_entry queue_io_opt_entry = {
333 .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
334 .show = queue_io_opt_show,
Jens Axboe8324aa92008-01-29 14:51:59 +0100335};
336
Martin K. Petersen86b37282009-11-10 11:50:21 +0100337static struct queue_sysfs_entry queue_discard_granularity_entry = {
338 .attr = {.name = "discard_granularity", .mode = S_IRUGO },
339 .show = queue_discard_granularity_show,
340};
341
342static struct queue_sysfs_entry queue_discard_max_entry = {
343 .attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
344 .show = queue_discard_max_show,
345};
346
Martin K. Petersen98262f22009-12-03 09:24:48 +0100347static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
348 .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
349 .show = queue_discard_zeroes_data_show,
350};
351
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100352static struct queue_sysfs_entry queue_nonrot_entry = {
353 .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
Jens Axboe956bcb72010-08-07 18:13:50 +0200354 .show = queue_show_nonrot,
355 .store = queue_store_nonrot,
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100356};
357
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200358static struct queue_sysfs_entry queue_nomerges_entry = {
359 .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
360 .show = queue_nomerges_show,
361 .store = queue_nomerges_store,
362};
363
Jens Axboec7c22e42008-09-13 20:26:01 +0200364static struct queue_sysfs_entry queue_rq_affinity_entry = {
365 .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
366 .show = queue_rq_affinity_show,
367 .store = queue_rq_affinity_store,
368};
369
Jens Axboebc58ba92009-01-23 10:54:44 +0100370static struct queue_sysfs_entry queue_iostats_entry = {
371 .attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
Jens Axboe956bcb72010-08-07 18:13:50 +0200372 .show = queue_show_iostats,
373 .store = queue_store_iostats,
Jens Axboebc58ba92009-01-23 10:54:44 +0100374};
375
Jens Axboee2e1a142010-06-09 10:42:09 +0200376static struct queue_sysfs_entry queue_random_entry = {
377 .attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
Jens Axboe956bcb72010-08-07 18:13:50 +0200378 .show = queue_show_random,
379 .store = queue_store_random,
Jens Axboee2e1a142010-06-09 10:42:09 +0200380};
381
Jens Axboe8324aa92008-01-29 14:51:59 +0100382static struct attribute *default_attrs[] = {
383 &queue_requests_entry.attr,
384 &queue_ra_entry.attr,
385 &queue_max_hw_sectors_entry.attr,
386 &queue_max_sectors_entry.attr,
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500387 &queue_max_segments_entry.attr,
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200388 &queue_max_integrity_segments_entry.attr,
Martin K. Petersenc77a5712010-03-10 00:48:33 -0500389 &queue_max_segment_size_entry.attr,
Jens Axboe8324aa92008-01-29 14:51:59 +0100390 &queue_iosched_entry.attr,
Martin K. Petersene68b9032008-01-29 19:14:08 +0100391 &queue_hw_sector_size_entry.attr,
Martin K. Petersene1defc42009-05-22 17:17:49 -0400392 &queue_logical_block_size_entry.attr,
Martin K. Petersenc72758f2009-05-22 17:17:53 -0400393 &queue_physical_block_size_entry.attr,
394 &queue_io_min_entry.attr,
395 &queue_io_opt_entry.attr,
Martin K. Petersen86b37282009-11-10 11:50:21 +0100396 &queue_discard_granularity_entry.attr,
397 &queue_discard_max_entry.attr,
Martin K. Petersen98262f22009-12-03 09:24:48 +0100398 &queue_discard_zeroes_data_entry.attr,
Bartlomiej Zolnierkiewicz1308835f2009-01-07 12:22:39 +0100399 &queue_nonrot_entry.attr,
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200400 &queue_nomerges_entry.attr,
Jens Axboec7c22e42008-09-13 20:26:01 +0200401 &queue_rq_affinity_entry.attr,
Jens Axboebc58ba92009-01-23 10:54:44 +0100402 &queue_iostats_entry.attr,
Jens Axboee2e1a142010-06-09 10:42:09 +0200403 &queue_random_entry.attr,
Jens Axboe8324aa92008-01-29 14:51:59 +0100404 NULL,
405};
406
407#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
408
409static ssize_t
410queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
411{
412 struct queue_sysfs_entry *entry = to_queue(attr);
413 struct request_queue *q =
414 container_of(kobj, struct request_queue, kobj);
415 ssize_t res;
416
417 if (!entry->show)
418 return -EIO;
419 mutex_lock(&q->sysfs_lock);
420 if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
421 mutex_unlock(&q->sysfs_lock);
422 return -ENOENT;
423 }
424 res = entry->show(q, page);
425 mutex_unlock(&q->sysfs_lock);
426 return res;
427}
428
429static ssize_t
430queue_attr_store(struct kobject *kobj, struct attribute *attr,
431 const char *page, size_t length)
432{
433 struct queue_sysfs_entry *entry = to_queue(attr);
Jens Axboe6728cb02008-01-31 13:03:55 +0100434 struct request_queue *q;
Jens Axboe8324aa92008-01-29 14:51:59 +0100435 ssize_t res;
436
437 if (!entry->store)
438 return -EIO;
Jens Axboe6728cb02008-01-31 13:03:55 +0100439
440 q = container_of(kobj, struct request_queue, kobj);
Jens Axboe8324aa92008-01-29 14:51:59 +0100441 mutex_lock(&q->sysfs_lock);
442 if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
443 mutex_unlock(&q->sysfs_lock);
444 return -ENOENT;
445 }
446 res = entry->store(q, page, length);
447 mutex_unlock(&q->sysfs_lock);
448 return res;
449}
450
451/**
452 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
453 * @kobj: the kobj belonging of the request queue to be released
454 *
455 * Description:
456 * blk_cleanup_queue is the pair to blk_init_queue() or
457 * blk_queue_make_request(). It should be called when a request queue is
458 * being released; typically when a block device is being de-registered.
459 * Currently, its primary task it to free all the &struct request
460 * structures that were allocated to the queue and the queue itself.
461 *
462 * Caveat:
463 * Hopefully the low level driver will have finished any
464 * outstanding requests first...
465 **/
466static void blk_release_queue(struct kobject *kobj)
467{
468 struct request_queue *q =
469 container_of(kobj, struct request_queue, kobj);
470 struct request_list *rl = &q->rq;
471
472 blk_sync_queue(q);
473
474 if (rl->rq_pool)
475 mempool_destroy(rl->rq_pool);
476
477 if (q->queue_tags)
478 __blk_queue_free_tags(q);
479
480 blk_trace_shutdown(q);
481
482 bdi_destroy(&q->backing_dev_info);
483 kmem_cache_free(blk_requestq_cachep, q);
484}
485
Emese Revfy52cf25d2010-01-19 02:58:23 +0100486static const struct sysfs_ops queue_sysfs_ops = {
Jens Axboe8324aa92008-01-29 14:51:59 +0100487 .show = queue_attr_show,
488 .store = queue_attr_store,
489};
490
491struct kobj_type blk_queue_ktype = {
492 .sysfs_ops = &queue_sysfs_ops,
493 .default_attrs = default_attrs,
494 .release = blk_release_queue,
495};
496
497int blk_register_queue(struct gendisk *disk)
498{
499 int ret;
Li Zefan1d54ad62009-04-14 14:00:05 +0800500 struct device *dev = disk_to_dev(disk);
Jens Axboe8324aa92008-01-29 14:51:59 +0100501 struct request_queue *q = disk->queue;
502
Akinobu Mitafb199742008-04-21 09:51:06 +0200503 if (WARN_ON(!q))
Jens Axboe8324aa92008-01-29 14:51:59 +0100504 return -ENXIO;
505
Li Zefan1d54ad62009-04-14 14:00:05 +0800506 ret = blk_trace_init_sysfs(dev);
507 if (ret)
508 return ret;
509
Linus Torvaldsc9059592009-06-11 10:52:27 -0700510 ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
Jens Axboe8324aa92008-01-29 14:51:59 +0100511 if (ret < 0)
512 return ret;
513
514 kobject_uevent(&q->kobj, KOBJ_ADD);
515
Martin K. Petersencd43e262009-05-22 17:17:52 -0400516 if (!q->request_fn)
517 return 0;
518
Jens Axboe8324aa92008-01-29 14:51:59 +0100519 ret = elv_register_queue(q);
520 if (ret) {
521 kobject_uevent(&q->kobj, KOBJ_REMOVE);
522 kobject_del(&q->kobj);
Liu Yuan80656b62011-04-13 22:14:54 +0200523 blk_trace_remove_sysfs(dev);
Xiaotian Fengc87ffbb2010-08-23 12:30:29 +0200524 kobject_put(&dev->kobj);
Jens Axboe8324aa92008-01-29 14:51:59 +0100525 return ret;
526 }
527
528 return 0;
529}
530
531void blk_unregister_queue(struct gendisk *disk)
532{
533 struct request_queue *q = disk->queue;
534
Akinobu Mitafb199742008-04-21 09:51:06 +0200535 if (WARN_ON(!q))
536 return;
537
Zdenek Kabelac48c0d4d2009-09-25 06:19:26 +0200538 if (q->request_fn)
Jens Axboe8324aa92008-01-29 14:51:59 +0100539 elv_unregister_queue(q);
540
Zdenek Kabelac48c0d4d2009-09-25 06:19:26 +0200541 kobject_uevent(&q->kobj, KOBJ_REMOVE);
542 kobject_del(&q->kobj);
543 blk_trace_remove_sysfs(disk_to_dev(disk));
544 kobject_put(&disk_to_dev(disk)->kobj);
Jens Axboe8324aa92008-01-29 14:51:59 +0100545}