rtuDataOperationAnalysis.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404
  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. #include "blk-cgroup.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);
  16. };
  17. static ssize_t
  18. queue_var_show(unsigned long var, char *page)
  19. {
  20. return sprintf(page, "%lu\n", var);
  21. }
  22. static ssize_t
  23. queue_var_store(unsigned long *var, const char *page, size_t count)
  24. {
  25. int err;
  26. unsigned long v;
  27. err = strict_strtoul(page, 10, &v);
  28. if (err || v > UINT_MAX)
  29. return -EINVAL;
  30. *var = v;
  31. return count;
  32. }
  33. static ssize_t queue_requests_show(struct request_queue *q, char *page)
  34. {
  35. return queue_var_show(q->nr_requests, (page));
  36. }
  37. static ssize_t
  38. queue_requests_store(struct request_queue *q, const char *page, size_t count)
  39. {
  40. struct request_list *rl;
  41. unsigned long nr;
  42. int ret;
  43. if (!q->request_fn)
  44. return -EINVAL;
  45. ret = queue_var_store(&nr, page, count);
  46. if (ret < 0)
  47. return ret;
  48. if (nr < BLKDEV_MIN_RQ)
  49. nr = BLKDEV_MIN_RQ;
  50. spin_lock_irq(q->queue_lock);
  51. q->nr_requests = nr;
  52. blk_queue_congestion_threshold(q);
  53. /* congestion isn't cgroup aware and follows root blkcg for now */
  54. rl = &q->root_rl;
  55. if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
  56. blk_set_queue_congested(q, BLK_RW_SYNC);
  57. else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q))
  58. blk_clear_queue_congested(q, BLK_RW_SYNC);
  59. if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
  60. blk_set_queue_congested(q, BLK_RW_ASYNC);
  61. else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
  62. blk_clear_queue_congested(q, BLK_RW_ASYNC);
  63. blk_queue_for_each_rl(rl, q) {
  64. if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
  65. blk_set_rl_full(rl, BLK_RW_SYNC);
  66. } else {
  67. blk_clear_rl_full(rl, BLK_RW_SYNC);
  68. wake_up(&rl->wait[BLK_RW_SYNC]);
  69. }
  70. if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
  71. blk_set_rl_full(rl, BLK_RW_ASYNC);
  72. } else {
  73. blk_clear_rl_full(rl, BLK_RW_ASYNC);
  74. wake_up(&rl->wait[BLK_RW_ASYNC]);
  75. }
  76. }
  77. spin_unlock_irq(q->queue_lock);
  78. return ret;
  79. }
  80. static ssize_t queue_ra_show(struct request_queue *q, char *page)
  81. {
  82. unsigned long ra_kb = q->backing_dev_info.ra_pages <<
  83. (PAGE_CACHE_SHIFT - 10);
  84. return queue_var_show(ra_kb, (page));
  85. }
  86. static ssize_t
  87. queue_ra_store(struct request_queue *q, const char *page, size_t count)
  88. {
  89. unsigned long ra_kb;
  90. ssize_t ret = queue_var_store(&ra_kb, page, count);
  91. if (ret < 0)
  92. return ret;
  93. q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
  94. return ret;
  95. }
  96. static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
  97. {
  98. int max_sectors_kb = queue_max_sectors(q) >> 1;
  99. return queue_var_show(max_sectors_kb, (page));
  100. }
  101. static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
  102. {
  103. return queue_var_show(queue_max_segments(q), (page));
  104. }
  105. static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
  106. {
  107. return queue_var_show(q->limits.max_integrity_segments, (page));
  108. }
  109. static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
  110. {
  111. if (blk_queue_cluster(q))
  112. return queue_var_show(queue_max_segment_size(q), (page));
  113. return queue_var_show(PAGE_CACHE_SIZE, (page));
  114. }
  115. static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
  116. {
  117. return queue_var_show(queue_logical_block_size(q), page);
  118. }
  119. static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
  120. {
  121. return queue_var_show(queue_physical_block_size(q), page);
  122. }
  123. static ssize_t queue_io_min_show(struct request_queue *q, char *page)
  124. {
  125. return queue_var_show(queue_io_min(q), page);
  126. }
  127. static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
  128. {
  129. return queue_var_show(queue_io_opt(q), page);
  130. }
  131. static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
  132. {
  133. return queue_var_show(q->limits.discard_granularity, page);
  134. }
  135. static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
  136. {
  137. return sprintf(page, "%llu\n",
  138. (unsigned long long)q->limits.max_discard_sectors << 9);
  139. }
  140. static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
  141. {
  142. return queue_var_show(queue_discard_zeroes_data(q), page);
  143. }
  144. static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
  145. {
  146. return sprintf(page, "%llu\n",
  147. (unsigned long long)q->limits.max_write_same_sectors << 9);
  148. }
  149. static ssize_t
  150. queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
  151. {
  152. unsigned long max_sectors_kb,
  153. max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
  154. page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
  155. ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
  156. if (ret < 0)
  157. return ret;
  158. if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
  159. return -EINVAL;
  160. spin_lock_irq(q->queue_lock);
  161. q->limits.max_sectors = max_sectors_kb << 1;
  162. spin_unlock_irq(q->queue_lock);
  163. return ret;
  164. }
  165. static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
  166. {
  167. int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
  168. return queue_var_show(max_hw_sectors_kb, (page));
  169. }
  170. #define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
  171. static ssize_t \
  172. queue_show_##name(struct request_queue *q, char *page) \
  173. { \
  174. int bit; \
  175. bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
  176. return queue_var_show(neg ? !bit : bit, page); \
  177. } \
  178. static ssize_t \
  179. queue_store_##name(struct request_queue *q, const char *page, size_t count) \
  180. { \
  181. unsigned long val; \
  182. ssize_t ret; \
  183. ret = queue_var_store(&val, page, count); \
  184. if (ret < 0) \
  185. return ret; \
  186. if (neg) \
  187. val = !val; \
  188. \
  189. spin_lock_irq(q->queue_lock); \
  190. if (val) \
  191. queue_flag_set(QUEUE_FLAG_##flag, q); \
  192. else \
  193. queue_flag_clear(QUEUE_FLAG_##flag, q); \
  194. spin_unlock_irq(q->queue_lock); \
  195. return ret; \
  196. }
  197. QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
  198. QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
  199. QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
  200. #undef QUEUE_SYSFS_BIT_FNS
  201. static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
  202. {
  203. return queue_var_show((blk_queue_nomerges(q) << 1) |
  204. blk_queue_noxmerges(q), page);
  205. }
  206. static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
  207. size_t count)
  208. {
  209. unsigned long nm;
  210. ssize_t ret = queue_var_store(&nm, page, count);
  211. if (ret < 0)
  212. return ret;
  213. spin_lock_irq(q->queue_lock);
  214. queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
  215. queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
  216. if (nm == 2)
  217. queue_flag_set(QUEUE_FLAG_NOMERGES, q);
  218. else if (nm)
  219. queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
  220. spin_unlock_irq(q->queue_lock);
  221. return ret;
  222. }
  223. static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
  224. {
  225. bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
  226. bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
  227. return queue_var_show(set << force, page);
  228. }
  229. static ssize_t
  230. queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
  231. {
  232. ssize_t ret = -EINVAL;
  233. #if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
  234. unsigned long val;
  235. ret = queue_var_store(&val, page, count);
  236. if (ret < 0)
  237. return ret;
  238. spin_lock_irq(q->queue_lock);
  239. if (val == 2) {
  240. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  241. queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
  242. } else if (val == 1) {
  243. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  244. queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
  245. } else if (val == 0) {
  246. queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
  247. queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
  248. }
  249. spin_unlock_irq(q->queue_lock);
  250. #endif
  251. return ret;
  252. }
  253. static struct queue_sysfs_entry queue_requests_entry = {
  254. .attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
  255. .show = queue_requests_show,
  256. .store = queue_requests_store,
  257. };
  258. static struct queue_sysfs_entry queue_ra_entry = {
  259. .attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
  260. .show = queue_ra_show,
  261. .store = queue_ra_store,
  262. };
  263. static struct queue_sysfs_entry queue_max_sectors_entry = {
  264. .attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
  265. .show = queue_max_sectors_show,
  266. .store = queue_max_sectors_store,
  267. };
  268. static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
  269. .attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
  270. .show = queue_max_hw_sectors_show,
  271. };
  272. static struct queue_sysfs_entry queue_max_segments_entry = {
  273. .attr = {.name = "max_segments", .mode = S_IRUGO },
  274. .show = queue_max_segments_show,
  275. };
  276. static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
  277. .attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
  278. .show = queue_max_integrity_segments_show,
  279. };
  280. static struct queue_sysfs_entry queue_max_segment_size_entry = {
  281. .attr = {.name = "max_segment_size", .mode = S_IRUGO },
  282. .show = queue_max_segment_size_show,
  283. };
  284. static struct queue_sysfs_entry queue_iosched_entry = {
  285. .attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
  286. .show = elv_iosched_show,
  287. .store = elv_iosched_store,
  288. };
  289. static struct queue_sysfs_entry queue_hw_sector_size_entry = {
  290. .attr = {.name = "hw_sector_size", .mode = S_IRUGO },
  291. .show = queue_logical_block_size_show,
  292. };
  293. static struct queue_sysfs_entry queue_logical_block_size_entry = {
  294. .attr = {.name = "logical_block_size", .mode = S_IRUGO },
  295. .show = queue_logical_block_size_show,
  296. };
  297. static struct queue_sysfs_entry queue_physical_block_size_entry = {
  298. .attr = {.name = "physical_block_size", .mode = S_IRUGO },
  299. .show = queue_physical_block_size_show,
  300. };
  301. static struct queue_sysfs_entry queue_io_min_entry = {
  302. .attr = {.name = "minimum_io_size", .mode = S_IRUGO },
  303. .show = queue_io_min_show,
  304. };
  305. static struct queue_sysfs_entry queue_io_opt_entry = {
  306. .attr = {.name = "optimal_io_size", .mode = S_IRUGO },
  307. .show = queue_io_opt_show,
  308. };
  309. static struct queue_sysfs_entry queue_discard_granularity_entry = {
  310. .attr = {.name = "discard_granularity", .mode = S_IRUGO },
  311. .show = queue_discard_granularity_show,
  312. };
  313. static struct queue_sysfs_entry queue_discard_max_entry = {
  314. .attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
  315. .show = queue_discard_max_show,
  316. };
  317. static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
  318. .attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
  319. .show = queue_discard_zeroes_data_show,
  320. };
  321. static struct queue_sysfs_entry queue_write_same_max_entry = {
  322. .attr = {.name = "write_same_max_bytes", .mode = S_IRUGO },
  323. .show = queue_write_same_max_show,
  324. };
  325. static struct queue_sysfs_entry queue_nonrot_entry = {
  326. .attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
  327. .show = queue_show_nonrot,