blk-sysfs.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  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 int var, char *page)
  17. {
  18. return sprintf(page, "%d\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 = queue_var_store(&nr, page, count);
  37. if (nr < BLKDEV_MIN_RQ)
  38. nr = BLKDEV_MIN_RQ;
  39. spin_lock_irq(q->queue_lock);
  40. q->nr_requests = nr;
  41. blk_queue_congestion_threshold(q);
  42. if (rl->count[READ] >= queue_congestion_on_threshold(q))
  43. blk_set_queue_congested(q, READ);
  44. else if (rl->count[READ] < queue_congestion_off_threshold(q))
  45. blk_clear_queue_congested(q, READ);
  46. if (rl->count[WRITE] >= queue_congestion_on_threshold(q))
  47. blk_set_queue_congested(q, WRITE);
  48. else if (rl->count[WRITE] < queue_congestion_off_threshold(q))
  49. blk_clear_queue_congested(q, WRITE);
  50. if (rl->count[READ] >= q->nr_requests) {
  51. blk_set_queue_full(q, READ);
  52. } else if (rl->count[READ]+1 <= q->nr_requests) {
  53. blk_clear_queue_full(q, READ);
  54. wake_up(&rl->wait[READ]);
  55. }
  56. if (rl->count[WRITE] >= q->nr_requests) {
  57. blk_set_queue_full(q, WRITE);
  58. } else if (rl->count[WRITE]+1 <= q->nr_requests) {
  59. blk_clear_queue_full(q, WRITE);
  60. wake_up(&rl->wait[WRITE]);
  61. }
  62. spin_unlock_irq(q->queue_lock);
  63. return ret;
  64. }
  65. static ssize_t queue_ra_show(struct request_queue *q, char *page)
  66. {
  67. int ra_kb = q->backing_dev_info.ra_pages << (PAGE_CACHE_SHIFT - 10);
  68. return queue_var_show(ra_kb, (page));
  69. }
  70. static ssize_t
  71. queue_ra_store(struct request_queue *q, const char *page, size_t count)
  72. {
  73. unsigned long ra_kb;
  74. ssize_t ret = queue_var_store(&ra_kb, page, count);
  75. q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
  76. return ret;
  77. }
  78. static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
  79. {
  80. int max_sectors_kb = q->max_sectors >> 1;
  81. return queue_var_show(max_sectors_kb, (page));
  82. }
  83. static ssize_t queue_hw_sector_size_show(struct request_queue *q, char *page)
  84. {
  85. return queue_var_show(q->hardsect_size, page);
  86. }
  87. static ssize_t
  88. queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
  89. {
  90. unsigned long max_sectors_kb,
  91. max_hw_sectors_kb = q->max_hw_sectors >> 1,
  92. page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
  93. ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
  94. if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
  95. return -EINVAL;
  96. spin_lock_irq(q->queue_lock);
  97. q->max_sectors = max_sectors_kb << 1;
  98. spin_unlock_irq(q->queue_lock);
  99. return ret;
  100. }
  101. static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
  102. {
  103. int max_hw_sectors_kb = q->max_hw_sectors >> 1;
  104. return queue_var_show(max_hw_sectors_kb, (page));
  105. }
  106. static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
  107. {
  108. return queue_var_show(blk_queue_nomerges(q), page);
  109. }
  110. static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
  111. size_t count)
  112. {
  113. unsigned long nm;
  114. ssize_t ret = queue_var_store(&nm, page, count);
  115. spin_lock_irq(q->queue_lock);
  116. if (nm)
  117. queue_flag_set(QUEUE_FLAG_NOMERGES, q);
  118. else
  119. queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
  120. spin_unlock_irq(q->queue_lock);
  121. return ret;
  122. }
  123. static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
  124. {
  125. unsigned int set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
  126. return queue_var_show(set != 0, page);
  127. }
  128. static ssize_t
  129. queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
  130. {
  131. ssize_t ret = -EINVAL;
  132. #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
  133. unsigned long val;
  134. ret = queue_var_store(&val, page, count);
  135. spin_lock_irq(q->queue_lock);
  136. if (val)
  137. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  138. else
  139. queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
  140. spin_unlock_irq(q->queue_lock);
  141. #endif
  142. return ret;
  143. }
  144. static struct queue_sysfs_entry queue_requests_entry = {
  145. .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
  146. .show = queue_requests_show,
  147. .store = queue_requests_store,
  148. };
  149. static struct queue_sysfs_entry queue_ra_entry = {
  150. .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
  151. .show = queue_ra_show,
  152. .store = queue_ra_store,
  153. };
  154. static struct queue_sysfs_entry queue_max_sectors_entry = {
  155. .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
  156. .show = queue_max_sectors_show,
  157. .store = queue_max_sectors_store,
  158. };
  159. static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
  160. .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
  161. .show = queue_max_hw_sectors_show,
  162. };
  163. static struct queue_sysfs_entry queue_iosched_entry = {
  164. .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
  165. .show = elv_iosched_show,
  166. .store = elv_iosched_store,
  167. };
  168. static struct queue_sysfs_entry queue_hw_sector_size_entry = {
  169. .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
  170. .show = queue_hw_sector_size_show,
  171. };
  172. static struct queue_sysfs_entry queue_nomerges_entry = {
  173. .attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
  174. .show = queue_nomerges_show,
  175. .store = queue_nomerges_store,
  176. };
  177. static struct queue_sysfs_entry queue_rq_affinity_entry = {
  178. .attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
  179. .show = queue_rq_affinity_show,
  180. .store = queue_rq_affinity_store,
  181. };
  182. static struct attribute *default_attrs[] = {
  183. &queue_requests_entry.attr,
  184. &queue_ra_entry.attr,
  185. &queue_max_hw_sectors_entry.attr,
  186. &queue_max_sectors_entry.attr,
  187. &queue_iosched_entry.attr,
  188. &queue_hw_sector_size_entry.attr,
  189. &queue_nomerges_entry.attr,
  190. &queue_rq_affinity_entry.attr,
  191. NULL,
  192. };
  193. #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
  194. static ssize_t
  195. queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  196. {
  197. struct queue_sysfs_entry *entry = to_queue(attr);
  198. struct request_queue *q =
  199. container_of(kobj, struct request_queue, kobj);
  200. ssize_t res;
  201. if (!entry->show)
  202. return -EIO;
  203. mutex_lock(&q->sysfs_lock);
  204. if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
  205. mutex_unlock(&q->sysfs_lock);
  206. return -ENOENT;
  207. }
  208. res = entry->show(q, page);
  209. mutex_unlock(&q->sysfs_lock);
  210. return res;
  211. }
  212. static ssize_t
  213. queue_attr_store(struct kobject *kobj, struct attribute *attr,
  214. const char *page, size_t length)
  215. {
  216. struct queue_sysfs_entry *entry = to_queue(attr);
  217. struct request_queue *q;
  218. ssize_t res;
  219. if (!entry->store)
  220. return -EIO;
  221. q = container_of(kobj, struct request_queue, kobj);
  222. mutex_lock(&q->sysfs_lock);
  223. if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
  224. mutex_unlock(&q->sysfs_lock);
  225. return -ENOENT;
  226. }
  227. res = entry->store(q, page, length);
  228. mutex_unlock(&q->sysfs_lock);
  229. return res;
  230. }
  231. /**
  232. * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
  233. * @kobj: the kobj belonging of the request queue to be released
  234. *
  235. * Description:
  236. * blk_cleanup_queue is the pair to blk_init_queue() or
  237. * blk_queue_make_request(). It should be called when a request queue is
  238. * being released; typically when a block device is being de-registered.
  239. * Currently, its primary task it to free all the &struct request
  240. * structures that were allocated to the queue and the queue itself.
  241. *
  242. * Caveat:
  243. * Hopefully the low level driver will have finished any
  244. * outstanding requests first...
  245. **/
  246. static void blk_release_queue(struct kobject *kobj)
  247. {
  248. struct request_queue *q =
  249. container_of(kobj, struct request_queue, kobj);
  250. struct request_list *rl = &q->rq;
  251. blk_sync_queue(q);
  252. if (rl->rq_pool)
  253. mempool_destroy(rl->rq_pool);
  254. if (q->queue_tags)
  255. __blk_queue_free_tags(q);
  256. blk_trace_shutdown(q);
  257. bdi_destroy(&q->backing_dev_info);
  258. kmem_cache_free(blk_requestq_cachep, q);
  259. }
  260. static struct sysfs_ops queue_sysfs_ops = {
  261. .show = queue_attr_show,
  262. .store = queue_attr_store,
  263. };
  264. struct kobj_type blk_queue_ktype = {
  265. .sysfs_ops = &queue_sysfs_ops,
  266. .default_attrs = default_attrs,
  267. .release = blk_release_queue,
  268. };
  269. int blk_register_queue(struct gendisk *disk)
  270. {
  271. int ret;
  272. struct request_queue *q = disk->queue;
  273. if (WARN_ON(!q))
  274. return -ENXIO;
  275. if (!q->request_fn)
  276. return 0;
  277. ret = kobject_add(&q->kobj, kobject_get(&disk_to_dev(disk)->kobj),
  278. "%s", "queue");
  279. if (ret < 0)
  280. return ret;
  281. kobject_uevent(&q->kobj, KOBJ_ADD);
  282. ret = elv_register_queue(q);
  283. if (ret) {
  284. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  285. kobject_del(&q->kobj);
  286. return ret;
  287. }
  288. return 0;
  289. }
  290. void blk_unregister_queue(struct gendisk *disk)
  291. {
  292. struct request_queue *q = disk->queue;
  293. if (WARN_ON(!q))
  294. return;
  295. if (q->request_fn) {
  296. elv_unregister_queue(q);
  297. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  298. kobject_del(&q->kobj);
  299. kobject_put(&disk_to_dev(disk)->kobj);
  300. }
  301. }