blk-sysfs.c 14 KB

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