blk-sysfs.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509
  1. /*
  2. * Functions related to sysfs handling
  3. */
  4. #include <linux/kernel.h>
  5. #include <linux/module.h>
  6. #include <linux/bio.h>
  7. #include <linux/blkdev.h>
  8. #include <linux/blktrace_api.h>
  9. #include "blk.h"
  10. struct queue_sysfs_entry {
  11. struct attribute attr;
  12. ssize_t (*show)(struct request_queue *, char *);
  13. ssize_t (*store)(struct request_queue *, const char *, size_t);
  14. };
  15. static ssize_t
  16. queue_var_show(unsigned long var, char *page)
  17. {
  18. return sprintf(page, "%lu\n", var);
  19. }
  20. static ssize_t
  21. queue_var_store(unsigned long *var, const char *page, size_t count)
  22. {
  23. char *p = (char *) page;
  24. *var = simple_strtoul(p, &p, 10);
  25. return count;
  26. }
  27. static ssize_t queue_requests_show(struct request_queue *q, char *page)
  28. {
  29. return queue_var_show(q->nr_requests, (page));
  30. }
  31. static ssize_t
  32. queue_requests_store(struct request_queue *q, const char *page, size_t count)
  33. {
  34. struct request_list *rl = &q->rq;
  35. unsigned long nr;
  36. int ret;
  37. if (!q->request_fn)
  38. return -EINVAL;
  39. ret = queue_var_store(&nr, page, count);
  40. if (nr < BLKDEV_MIN_RQ)
  41. nr = BLKDEV_MIN_RQ;
  42. spin_lock_irq(q->queue_lock);
  43. q->nr_requests = nr;
  44. blk_queue_congestion_threshold(q);
  45. if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
  46. blk_set_queue_congested(q, BLK_RW_SYNC);
  47. else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q))
  48. blk_clear_queue_congested(q, BLK_RW_SYNC);
  49. if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
  50. blk_set_queue_congested(q, BLK_RW_ASYNC);
  51. else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
  52. blk_clear_queue_congested(q, BLK_RW_ASYNC);
  53. if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
  54. blk_set_queue_full(q, BLK_RW_SYNC);
  55. } else if (rl->count[BLK_RW_SYNC]+1 <= q->nr_requests) {
  56. blk_clear_queue_full(q, BLK_RW_SYNC);
  57. wake_up(&rl->wait[BLK_RW_SYNC]);
  58. }
  59. if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
  60. blk_set_queue_full(q, BLK_RW_ASYNC);
  61. } else if (rl->count[BLK_RW_ASYNC]+1 <= q->nr_requests) {
  62. blk_clear_queue_full(q, BLK_RW_ASYNC);
  63. wake_up(&rl->wait[BLK_RW_ASYNC]);
  64. }
  65. spin_unlock_irq(q->queue_lock);
  66. return ret;
  67. }
  68. static ssize_t queue_ra_show(struct request_queue *q, char *page)
  69. {
  70. unsigned long ra_kb = q->backing_dev_info.ra_pages <<
  71. (PAGE_CACHE_SHIFT - 10);
  72. return queue_var_show(ra_kb, (page));
  73. }
  74. static ssize_t
  75. queue_ra_store(struct request_queue *q, const char *page, size_t count)
  76. {
  77. unsigned long ra_kb;
  78. ssize_t ret = queue_var_store(&ra_kb, page, count);
  79. q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
  80. return ret;
  81. }
  82. static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
  83. {
  84. int max_sectors_kb = queue_max_sectors(q) >> 1;
  85. return queue_var_show(max_sectors_kb, (page));
  86. }
  87. static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
  88. {
  89. return queue_var_show(queue_logical_block_size(q), page);
  90. }
  91. static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
  92. {
  93. return queue_var_show(queue_physical_block_size(q), page);
  94. }
  95. static ssize_t queue_io_min_show(struct request_queue *q, char *page)
  96. {
  97. return queue_var_show(queue_io_min(q), page);
  98. }
  99. static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
  100. {
  101. return queue_var_show(queue_io_opt(q), page);
  102. }
  103. static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
  104. {
  105. return queue_var_show(q->limits.discard_granularity, page);
  106. }
  107. static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
  108. {
  109. return queue_var_show(q->limits.max_discard_sectors << 9, page);
  110. }
  111. static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
  112. {
  113. return queue_var_show(queue_discard_zeroes_data(q), page);
  114. }
  115. static ssize_t
  116. queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
  117. {
  118. unsigned long max_sectors_kb,
  119. max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
  120. page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
  121. ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
  122. if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
  123. return -EINVAL;
  124. spin_lock_irq(q->queue_lock);
  125. q->limits.max_sectors = max_sectors_kb << 1;
  126. spin_unlock_irq(q->queue_lock);
  127. return ret;
  128. }
  129. static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
  130. {
  131. int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
  132. return queue_var_show(max_hw_sectors_kb, (page));
  133. }
  134. static ssize_t queue_nonrot_show(struct request_queue *q, char *page)
  135. {
  136. return queue_var_show(!blk_queue_nonrot(q), page);
  137. }
  138. static ssize_t queue_nonrot_store(struct request_queue *q, const char *page,
  139. size_t count)
  140. {
  141. unsigned long nm;
  142. ssize_t ret = queue_var_store(&nm, page, count);
  143. spin_lock_irq(q->queue_lock);
  144. if (nm)
  145. queue_flag_clear(QUEUE_FLAG_NONROT, q);
  146. else
  147. queue_flag_set(QUEUE_FLAG_NONROT, q);
  148. spin_unlock_irq(q->queue_lock);
  149. return ret;
  150. }
  151. static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
  152. {
  153. return queue_var_show(blk_queue_nomerges(q), page);
  154. }
  155. static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
  156. size_t count)
  157. {
  158. unsigned long nm;
  159. ssize_t ret = queue_var_store(&nm, page, count);
  160. spin_lock_irq(q->queue_lock);
  161. if (nm)
  162. queue_flag_set(QUEUE_FLAG_NOMERGES, q);
  163. else
  164. queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
  165. spin_unlock_irq(q->queue_lock);
  166. return ret;
  167. }
  168. static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
  169. {
  170. bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
  171. return queue_var_show(set, page);
  172. }
  173. static ssize_t
  174. queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
  175. {
  176. ssize_t ret = -EINVAL;
  177. #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
  178. unsigned long val;
  179. ret = queue_var_store(&val, page, count);
  180. spin_lock_irq(q->queue_lock);
  181. if (val)
  182. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  183. else
  184. queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
  185. spin_unlock_irq(q->queue_lock);
  186. #endif
  187. return ret;
  188. }
  189. static ssize_t queue_iostats_show(struct request_queue *q, char *page)
  190. {
  191. return queue_var_show(blk_queue_io_stat(q), page);
  192. }
  193. static ssize_t queue_iostats_store(struct request_queue *q, const char *page,
  194. size_t count)
  195. {
  196. unsigned long stats;
  197. ssize_t ret = queue_var_store(&stats, page, count);
  198. spin_lock_irq(q->queue_lock);
  199. if (stats)
  200. queue_flag_set(QUEUE_FLAG_IO_STAT, q);
  201. else
  202. queue_flag_clear(QUEUE_FLAG_IO_STAT, q);
  203. spin_unlock_irq(q->queue_lock);
  204. return ret;
  205. }
  206. static struct queue_sysfs_entry queue_requests_entry = {
  207. .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
  208. .show = queue_requests_show,
  209. .store = queue_requests_store,
  210. };
  211. static struct queue_sysfs_entry queue_ra_entry = {
  212. .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
  213. .show = queue_ra_show,
  214. .store = queue_ra_store,
  215. };
  216. static struct queue_sysfs_entry queue_max_sectors_entry = {
  217. .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
  218. .show = queue_max_sectors_show,
  219. .store = queue_max_sectors_store,
  220. };
  221. static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
  222. .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
  223. .show = queue_max_hw_sectors_show,
  224. };
  225. static struct queue_sysfs_entry queue_iosched_entry = {
  226. .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
  227. .show = elv_iosched_show,
  228. .store = elv_iosched_store,
  229. };
  230. static struct queue_sysfs_entry queue_hw_sector_size_entry = {
  231. .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
  232. .show = queue_logical_block_size_show,
  233. };
  234. static struct queue_sysfs_entry queue_logical_block_size_entry = {
  235. .attr = {.name = "logical_block_size", .mode = S_IRUGO },
  236. .show = queue_logical_block_size_show,
  237. };
  238. static struct queue_sysfs_entry queue_physical_block_size_entry = {
  239. .attr = {.name = "physical_block_size", .mode = S_IRUGO },
  240. .show = queue_physical_block_size_show,
  241. };
  242. static struct queue_sysfs_entry queue_io_min_entry = {
  243. .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
  244. .show = queue_io_min_show,
  245. };
  246. static struct queue_sysfs_entry queue_io_opt_entry = {
  247. .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
  248. .show = queue_io_opt_show,
  249. };
  250. static struct queue_sysfs_entry queue_discard_granularity_entry = {
  251. .attr = {.name = "discard_granularity", .mode = S_IRUGO },
  252. .show = queue_discard_granularity_show,
  253. };
  254. static struct queue_sysfs_entry queue_discard_max_entry = {
  255. .attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
  256. .show = queue_discard_max_show,
  257. };
  258. static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
  259. .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
  260. .show = queue_discard_zeroes_data_show,
  261. };
  262. static struct queue_sysfs_entry queue_nonrot_entry = {
  263. .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
  264. .show = queue_nonrot_show,
  265. .store = queue_nonrot_store,
  266. };
  267. static struct queue_sysfs_entry queue_nomerges_entry = {
  268. .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
  269. .show = queue_nomerges_show,
  270. .store = queue_nomerges_store,
  271. };
  272. static struct queue_sysfs_entry queue_rq_affinity_entry = {
  273. .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
  274. .show = queue_rq_affinity_show,
  275. .store = queue_rq_affinity_store,
  276. };
  277. static struct queue_sysfs_entry queue_iostats_entry = {
  278. .attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
  279. .show = queue_iostats_show,
  280. .store = queue_iostats_store,
  281. };
  282. static struct attribute *default_attrs[] = {
  283. &queue_requests_entry.attr,
  284. &queue_ra_entry.attr,
  285. &queue_max_hw_sectors_entry.attr,
  286. &queue_max_sectors_entry.attr,
  287. &queue_iosched_entry.attr,
  288. &queue_hw_sector_size_entry.attr,
  289. &queue_logical_block_size_entry.attr,
  290. &queue_physical_block_size_entry.attr,
  291. &queue_io_min_entry.attr,
  292. &queue_io_opt_entry.attr,
  293. &queue_discard_granularity_entry.attr,
  294. &queue_discard_max_entry.attr,
  295. &queue_discard_zeroes_data_entry.attr,
  296. &queue_nonrot_entry.attr,
  297. &queue_nomerges_entry.attr,
  298. &queue_rq_affinity_entry.attr,
  299. &queue_iostats_entry.attr,
  300. NULL,
  301. };
  302. #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
  303. static ssize_t
  304. queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  305. {
  306. struct queue_sysfs_entry *entry = to_queue(attr);
  307. struct request_queue *q =
  308. container_of(kobj, struct request_queue, kobj);
  309. ssize_t res;
  310. if (!entry->show)
  311. return -EIO;
  312. mutex_lock(&q->sysfs_lock);
  313. if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
  314. mutex_unlock(&q->sysfs_lock);
  315. return -ENOENT;
  316. }
  317. res = entry->show(q, page);
  318. mutex_unlock(&q->sysfs_lock);
  319. return res;
  320. }
  321. static ssize_t
  322. queue_attr_store(struct kobject *kobj, struct attribute *attr,
  323. const char *page, size_t length)
  324. {
  325. struct queue_sysfs_entry *entry = to_queue(attr);
  326. struct request_queue *q;
  327. ssize_t res;
  328. if (!entry->store)
  329. return -EIO;
  330. q = container_of(kobj, struct request_queue, kobj);
  331. mutex_lock(&q->sysfs_lock);
  332. if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
  333. mutex_unlock(&q->sysfs_lock);
  334. return -ENOENT;
  335. }
  336. res = entry->store(q, page, length);
  337. mutex_unlock(&q->sysfs_lock);
  338. return res;
  339. }
  340. /**
  341. * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
  342. * @kobj: the kobj belonging of the request queue to be released
  343. *
  344. * Description:
  345. * blk_cleanup_queue is the pair to blk_init_queue() or
  346. * blk_queue_make_request(). It should be called when a request queue is
  347. * being released; typically when a block device is being de-registered.
  348. * Currently, its primary task it to free all the &struct request
  349. * structures that were allocated to the queue and the queue itself.
  350. *
  351. * Caveat:
  352. * Hopefully the low level driver will have finished any
  353. * outstanding requests first...
  354. **/
  355. static void blk_release_queue(struct kobject *kobj)
  356. {
  357. struct request_queue *q =
  358. container_of(kobj, struct request_queue, kobj);
  359. struct request_list *rl = &q->rq;
  360. blk_sync_queue(q);
  361. if (rl->rq_pool)
  362. mempool_destroy(rl->rq_pool);
  363. if (q->queue_tags)
  364. __blk_queue_free_tags(q);
  365. blk_trace_shutdown(q);
  366. bdi_destroy(&q->backing_dev_info);
  367. kmem_cache_free(blk_requestq_cachep, q);
  368. }
  369. static struct sysfs_ops queue_sysfs_ops = {
  370. .show = queue_attr_show,
  371. .store = queue_attr_store,
  372. };
  373. struct kobj_type blk_queue_ktype = {
  374. .sysfs_ops = &queue_sysfs_ops,
  375. .default_attrs = default_attrs,
  376. .release = blk_release_queue,
  377. };
  378. int blk_register_queue(struct gendisk *disk)
  379. {
  380. int ret;
  381. struct device *dev = disk_to_dev(disk);
  382. struct request_queue *q = disk->queue;
  383. if (WARN_ON(!q))
  384. return -ENXIO;
  385. ret = blk_trace_init_sysfs(dev);
  386. if (ret)
  387. return ret;
  388. ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
  389. if (ret < 0)
  390. return ret;
  391. kobject_uevent(&q->kobj, KOBJ_ADD);
  392. if (!q->request_fn)
  393. return 0;
  394. ret = elv_register_queue(q);
  395. if (ret) {
  396. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  397. kobject_del(&q->kobj);
  398. blk_trace_remove_sysfs(disk_to_dev(disk));
  399. return ret;
  400. }
  401. return 0;
  402. }
  403. void blk_unregister_queue(struct gendisk *disk)
  404. {
  405. struct request_queue *q = disk->queue;
  406. if (WARN_ON(!q))
  407. return;
  408. if (q->request_fn)
  409. elv_unregister_queue(q);
  410. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  411. kobject_del(&q->kobj);
  412. blk_trace_remove_sysfs(disk_to_dev(disk));
  413. kobject_put(&disk_to_dev(disk)->kobj);
  414. }