blk-sysfs.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Functions related to sysfs handling
  4. */
  5. #include <linux/kernel.h>
  6. #include <linux/slab.h>
  7. #include <linux/module.h>
  8. #include <linux/bio.h>
  9. #include <linux/blkdev.h>
  10. #include <linux/backing-dev.h>
  11. #include <linux/blktrace_api.h>
  12. #include <linux/blk-mq.h>
  13. #include <linux/blk-cgroup.h>
  14. #include "blk.h"
  15. #include "blk-mq.h"
  16. #include "blk-mq-debugfs.h"
  17. #include "blk-wbt.h"
  18. struct queue_sysfs_entry {
  19. struct attribute attr;
  20. ssize_t (*show)(struct request_queue *, char *);
  21. ssize_t (*store)(struct request_queue *, const char *, size_t);
  22. };
  23. static ssize_t
  24. queue_var_show(unsigned long var, char *page)
  25. {
  26. return sprintf(page, "%lu\n", var);
  27. }
  28. static ssize_t
  29. queue_var_store(unsigned long *var, const char *page, size_t count)
  30. {
  31. int err;
  32. unsigned long v;
  33. err = kstrtoul(page, 10, &v);
  34. if (err || v > UINT_MAX)
  35. return -EINVAL;
  36. *var = v;
  37. return count;
  38. }
  39. static ssize_t queue_var_store64(s64 *var, const char *page)
  40. {
  41. int err;
  42. s64 v;
  43. err = kstrtos64(page, 10, &v);
  44. if (err < 0)
  45. return err;
  46. *var = v;
  47. return 0;
  48. }
  49. static ssize_t queue_requests_show(struct request_queue *q, char *page)
  50. {
  51. return queue_var_show(q->nr_requests, (page));
  52. }
  53. static ssize_t
  54. queue_requests_store(struct request_queue *q, const char *page, size_t count)
  55. {
  56. unsigned long nr;
  57. int ret, err;
  58. if (!q->request_fn && !q->mq_ops)
  59. return -EINVAL;
  60. ret = queue_var_store(&nr, page, count);
  61. if (ret < 0)
  62. return ret;
  63. if (nr < BLKDEV_MIN_RQ)
  64. nr = BLKDEV_MIN_RQ;
  65. if (q->request_fn)
  66. err = blk_update_nr_requests(q, nr);
  67. else
  68. err = blk_mq_update_nr_requests(q, nr);
  69. if (err)
  70. return err;
  71. return ret;
  72. }
  73. static ssize_t queue_ra_show(struct request_queue *q, char *page)
  74. {
  75. unsigned long ra_kb = q->backing_dev_info->ra_pages <<
  76. (PAGE_SHIFT - 10);
  77. return queue_var_show(ra_kb, (page));
  78. }
  79. static ssize_t
  80. queue_ra_store(struct request_queue *q, const char *page, size_t count)
  81. {
  82. unsigned long ra_kb;
  83. ssize_t ret = queue_var_store(&ra_kb, page, count);
  84. if (ret < 0)
  85. return ret;
  86. q->backing_dev_info->ra_pages = ra_kb >> (PAGE_SHIFT - 10);
  87. return ret;
  88. }
  89. static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
  90. {
  91. int max_sectors_kb = queue_max_sectors(q) >> 1;
  92. return queue_var_show(max_sectors_kb, (page));
  93. }
  94. static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
  95. {
  96. return queue_var_show(queue_max_segments(q), (page));
  97. }
  98. static ssize_t queue_max_discard_segments_show(struct request_queue *q,
  99. char *page)
  100. {
  101. return queue_var_show(queue_max_discard_segments(q), (page));
  102. }
  103. static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
  104. {
  105. return queue_var_show(q->limits.max_integrity_segments, (page));
  106. }
  107. static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
  108. {
  109. if (blk_queue_cluster(q))
  110. return queue_var_show(queue_max_segment_size(q), (page));
  111. return queue_var_show(PAGE_SIZE, (page));
  112. }
  113. static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
  114. {
  115. return queue_var_show(queue_logical_block_size(q), page);
  116. }
  117. static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
  118. {
  119. return queue_var_show(queue_physical_block_size(q), page);
  120. }
  121. static ssize_t queue_chunk_sectors_show(struct request_queue *q, char *page)
  122. {
  123. return queue_var_show(q->limits.chunk_sectors, page);
  124. }
  125. static ssize_t queue_io_min_show(struct request_queue *q, char *page)
  126. {
  127. return queue_var_show(queue_io_min(q), page);
  128. }
  129. static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
  130. {
  131. return queue_var_show(queue_io_opt(q), page);
  132. }
  133. static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
  134. {
  135. return queue_var_show(q->limits.discard_granularity, page);
  136. }
  137. static ssize_t queue_discard_max_hw_show(struct request_queue *q, char *page)
  138. {
  139. return sprintf(page, "%llu\n",
  140. (unsigned long long)q->limits.max_hw_discard_sectors << 9);
  141. }
  142. static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
  143. {
  144. return sprintf(page, "%llu\n",
  145. (unsigned long long)q->limits.max_discard_sectors << 9);
  146. }
  147. static ssize_t queue_discard_max_store(struct request_queue *q,
  148. const char *page, size_t count)
  149. {
  150. unsigned long max_discard;
  151. ssize_t ret = queue_var_store(&max_discard, page, count);
  152. if (ret < 0)
  153. return ret;
  154. if (max_discard & (q->limits.discard_granularity - 1))
  155. return -EINVAL;
  156. max_discard >>= 9;
  157. if (max_discard > UINT_MAX)
  158. return -EINVAL;
  159. if (max_discard > q->limits.max_hw_discard_sectors)
  160. max_discard = q->limits.max_hw_discard_sectors;
  161. q->limits.max_discard_sectors = max_discard;
  162. return ret;
  163. }
  164. static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
  165. {
  166. return queue_var_show(0, page);
  167. }
  168. static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
  169. {
  170. return sprintf(page, "%llu\n",
  171. (unsigned long long)q->limits.max_write_same_sectors << 9);
  172. }
  173. static ssize_t queue_write_zeroes_max_show(struct request_queue *q, char *page)
  174. {
  175. return sprintf(page, "%llu\n",
  176. (unsigned long long)q->limits.max_write_zeroes_sectors << 9);
  177. }
  178. static ssize_t
  179. queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
  180. {
  181. unsigned long max_sectors_kb,
  182. max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
  183. page_kb = 1 << (PAGE_SHIFT - 10);
  184. ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
  185. if (ret < 0)
  186. return ret;
  187. max_hw_sectors_kb = min_not_zero(max_hw_sectors_kb, (unsigned long)
  188. q->limits.max_dev_sectors >> 1);
  189. if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
  190. return -EINVAL;
  191. spin_lock_irq(q->queue_lock);
  192. q->limits.max_sectors = max_sectors_kb << 1;
  193. q->backing_dev_info->io_pages = max_sectors_kb >> (PAGE_SHIFT - 10);
  194. spin_unlock_irq(q->queue_lock);
  195. return ret;
  196. }
  197. static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
  198. {
  199. int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
  200. return queue_var_show(max_hw_sectors_kb, (page));
  201. }
  202. #define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
  203. static ssize_t \
  204. queue_show_##name(struct request_queue *q, char *page) \
  205. { \
  206. int bit; \
  207. bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
  208. return queue_var_show(neg ? !bit : bit, page); \
  209. } \
  210. static ssize_t \
  211. queue_store_##name(struct request_queue *q, const char *page, size_t count) \
  212. { \
  213. unsigned long val; \
  214. ssize_t ret; \
  215. ret = queue_var_store(&val, page, count); \
  216. if (ret < 0) \
  217. return ret; \
  218. if (neg) \
  219. val = !val; \
  220. \
  221. if (val) \
  222. blk_queue_flag_set(QUEUE_FLAG_##flag, q); \
  223. else \
  224. blk_queue_flag_clear(QUEUE_FLAG_##flag, q); \
  225. return ret; \
  226. }
  227. QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
  228. QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
  229. QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
  230. #undef QUEUE_SYSFS_BIT_FNS
  231. static ssize_t queue_zoned_show(struct request_queue *q, char *page)
  232. {
  233. switch (blk_queue_zoned_model(q)) {
  234. case BLK_ZONED_HA:
  235. return sprintf(page, "host-aware\n");
  236. case BLK_ZONED_HM:
  237. return sprintf(page, "host-managed\n");
  238. default:
  239. return sprintf(page, "none\n");
  240. }
  241. }
  242. static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
  243. {
  244. return queue_var_show((blk_queue_nomerges(q) << 1) |
  245. blk_queue_noxmerges(q), page);
  246. }
  247. static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
  248. size_t count)
  249. {
  250. unsigned long nm;
  251. ssize_t ret = queue_var_store(&nm, page, count);
  252. if (ret < 0)
  253. return ret;
  254. spin_lock_irq(q->queue_lock);
  255. queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
  256. queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
  257. if (nm == 2)
  258. queue_flag_set(QUEUE_FLAG_NOMERGES, q);
  259. else if (nm)
  260. queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
  261. spin_unlock_irq(q->queue_lock);
  262. return ret;
  263. }
  264. static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
  265. {
  266. bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
  267. bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
  268. return queue_var_show(set << force, page);
  269. }
  270. static ssize_t
  271. queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
  272. {
  273. ssize_t ret = -EINVAL;
  274. #ifdef CONFIG_SMP
  275. unsigned long val;
  276. ret = queue_var_store(&val, page, count);
  277. if (ret < 0)
  278. return ret;
  279. spin_lock_irq(q->queue_lock);
  280. if (val == 2) {
  281. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  282. queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
  283. } else if (val == 1) {
  284. queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
  285. queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
  286. } else if (val == 0) {
  287. queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
  288. queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
  289. }
  290. spin_unlock_irq(q->queue_lock);
  291. #endif
  292. return ret;
  293. }
  294. static ssize_t queue_poll_delay_show(struct request_queue *q, char *page)
  295. {
  296. int val;
  297. if (q->poll_nsec == -1)
  298. val = -1;
  299. else
  300. val = q->poll_nsec / 1000;
  301. return sprintf(page, "%d\n", val);
  302. }
  303. static ssize_t queue_poll_delay_store(struct request_queue *q, const char *page,
  304. size_t count)
  305. {
  306. int err, val;
  307. if (!q->mq_ops || !q->mq_ops->poll)
  308. return -EINVAL;
  309. err = kstrtoint(page, 10, &val);
  310. if (err < 0)
  311. return err;
  312. if (val == -1)
  313. q->poll_nsec = -1;
  314. else
  315. q->poll_nsec = val * 1000;
  316. return count;
  317. }
  318. static ssize_t queue_poll_show(struct request_queue *q, char *page)
  319. {
  320. return queue_var_show(test_bit(QUEUE_FLAG_POLL, &q->queue_flags), page);
  321. }
  322. static ssize_t queue_poll_store(struct request_queue *q, const char *page,
  323. size_t count)
  324. {
  325. unsigned long poll_on;
  326. ssize_t ret;
  327. if (!q->mq_ops || !q->mq_ops->poll)
  328. return -EINVAL;
  329. ret = queue_var_store(&poll_on, page, count);
  330. if (ret < 0)
  331. return ret;
  332. if (poll_on)
  333. blk_queue_flag_set(QUEUE_FLAG_POLL, q);
  334. else
  335. blk_queue_flag_clear(QUEUE_FLAG_POLL, q);
  336. return ret;
  337. }
  338. static ssize_t queue_wb_lat_show(struct request_queue *q, char *page)
  339. {
  340. if (!wbt_rq_qos(q))
  341. return -EINVAL;
  342. return sprintf(page, "%llu\n", div_u64(wbt_get_min_lat(q), 1000));
  343. }
  344. static ssize_t queue_wb_lat_store(struct request_queue *q, const char *page,
  345. size_t count)
  346. {
  347. struct rq_qos *rqos;
  348. ssize_t ret;
  349. s64 val;
  350. ret = queue_var_store64(&val, page);
  351. if (ret < 0)
  352. return ret;
  353. if (val < -1)
  354. return -EINVAL;
  355. rqos = wbt_rq_qos(q);
  356. if (!rqos) {
  357. ret = wbt_init(q);
  358. if (ret)
  359. return ret;
  360. }
  361. if (val == -1)
  362. val = wbt_default_latency_nsec(q);
  363. else if (val >= 0)
  364. val *= 1000ULL;
  365. wbt_set_min_lat(q, val);
  366. wbt_update_limits(q);
  367. return count;
  368. }
  369. static ssize_t queue_wc_show(struct request_queue *q, char *page)
  370. {
  371. if (test_bit(QUEUE_FLAG_WC, &q->queue_flags))
  372. return sprintf(page, "write back\n");
  373. return sprintf(page, "write through\n");
  374. }
  375. static ssize_t queue_wc_store(struct request_queue *q, const char *page,
  376. size_t count)
  377. {
  378. int set = -1;
  379. if (!strncmp(page, "write back", 10))
  380. set = 1;
  381. else if (!strncmp(page, "write through", 13) ||
  382. !strncmp(page, "none", 4))
  383. set = 0;
  384. if (set == -1)
  385. return -EINVAL;
  386. if (set)
  387. blk_queue_flag_set(QUEUE_FLAG_WC, q);
  388. else
  389. blk_queue_flag_clear(QUEUE_FLAG_WC, q);
  390. return count;
  391. }
  392. static ssize_t queue_fua_show(struct request_queue *q, char *page)
  393. {
  394. return sprintf(page, "%u\n", test_bit(QUEUE_FLAG_FUA, &q->queue_flags));
  395. }
  396. static ssize_t queue_dax_show(struct request_queue *q, char *page)
  397. {
  398. return queue_var_show(blk_queue_dax(q), page);
  399. }
  400. static struct queue_sysfs_entry queue_requests_entry = {
  401. .attr = {.name = "nr_requests", .mode = 0644 },
  402. .show = queue_requests_show,
  403. .store = queue_requests_store,
  404. };
  405. static struct queue_sysfs_entry queue_ra_entry = {
  406. .attr = {.name = "read_ahead_kb", .mode = 0644 },
  407. .show = queue_ra_show,
  408. .store = queue_ra_store,
  409. };
  410. static struct queue_sysfs_entry queue_max_sectors_entry = {
  411. .attr = {.name = "max_sectors_kb", .mode = 0644 },
  412. .show = queue_max_sectors_show,
  413. .store = queue_max_sectors_store,
  414. };
  415. static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
  416. .attr = {.name = "max_hw_sectors_kb", .mode = 0444 },
  417. .show = queue_max_hw_sectors_show,
  418. };
  419. static struct queue_sysfs_entry queue_max_segments_entry = {
  420. .attr = {.name = "max_segments", .mode = 0444 },
  421. .show = queue_max_segments_show,
  422. };
  423. static struct queue_sysfs_entry queue_max_discard_segments_entry = {
  424. .attr = {.name = "max_discard_segments", .mode = 0444 },
  425. .show = queue_max_discard_segments_show,
  426. };
  427. static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
  428. .attr = {.name = "max_integrity_segments", .mode = 0444 },
  429. .show = queue_max_integrity_segments_show,
  430. };
  431. static struct queue_sysfs_entry queue_max_segment_size_entry = {
  432. .attr = {.name = "max_segment_size", .mode = 0444 },
  433. .show = queue_max_segment_size_show,
  434. };
  435. static struct queue_sysfs_entry queue_iosched_entry = {
  436. .attr = {.name = "scheduler", .mode = 0644 },
  437. .show = elv_iosched_show,
  438. .store = elv_iosched_store,
  439. };
  440. static struct queue_sysfs_entry queue_hw_sector_size_entry = {
  441. .attr = {.name = "hw_sector_size", .mode = 0444 },
  442. .show = queue_logical_block_size_show,
  443. };
  444. static struct queue_sysfs_entry queue_logical_block_size_entry = {
  445. .attr = {.name = "logical_block_size", .mode = 0444 },
  446. .show = queue_logical_block_size_show,
  447. };
  448. static struct queue_sysfs_entry queue_physical_block_size_entry = {
  449. .attr = {.name = "physical_block_size", .mode = 0444 },
  450. .show = queue_physical_block_size_show,
  451. };
  452. static struct queue_sysfs_entry queue_chunk_sectors_entry = {
  453. .attr = {.name = "chunk_sectors", .mode = 0444 },
  454. .show = queue_chunk_sectors_show,
  455. };
  456. static struct queue_sysfs_entry queue_io_min_entry = {
  457. .attr = {.name = "minimum_io_size", .mode = 0444 },
  458. .show = queue_io_min_show,
  459. };
  460. static struct queue_sysfs_entry queue_io_opt_entry = {
  461. .attr = {.name = "optimal_io_size", .mode = 0444 },
  462. .show = queue_io_opt_show,
  463. };
  464. static struct queue_sysfs_entry queue_discard_granularity_entry = {
  465. .attr = {.name = "discard_granularity", .mode = 0444 },
  466. .show = queue_discard_granularity_show,
  467. };
  468. static struct queue_sysfs_entry queue_discard_max_hw_entry = {
  469. .attr = {.name = "discard_max_hw_bytes", .mode = 0444 },
  470. .show = queue_discard_max_hw_show,
  471. };
  472. static struct queue_sysfs_entry queue_discard_max_entry = {
  473. .attr = {.name = "discard_max_bytes", .mode = 0644 },
  474. .show = queue_discard_max_show,
  475. .store = queue_discard_max_store,
  476. };
  477. static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
  478. .attr = {.name = "discard_zeroes_data", .mode = 0444 },
  479. .show = queue_discard_zeroes_data_show,
  480. };
  481. static struct queue_sysfs_entry queue_write_same_max_entry = {
  482. .attr = {.name = "write_same_max_bytes", .mode = 0444 },
  483. .show = queue_write_same_max_show,
  484. };
  485. static struct queue_sysfs_entry queue_write_zeroes_max_entry = {
  486. .attr = {.name = "write_zeroes_max_bytes", .mode = 0444 },
  487. .show = queue_write_zeroes_max_show,
  488. };
  489. static struct queue_sysfs_entry queue_nonrot_entry = {
  490. .attr = {.name = "rotational", .mode = 0644 },
  491. .show = queue_show_nonrot,
  492. .store = queue_store_nonrot,
  493. };
  494. static struct queue_sysfs_entry queue_zoned_entry = {
  495. .attr = {.name = "zoned", .mode = 0444 },
  496. .show = queue_zoned_show,
  497. };
  498. static struct queue_sysfs_entry queue_nomerges_entry = {
  499. .attr = {.name = "nomerges", .mode = 0644 },
  500. .show = queue_nomerges_show,
  501. .store = queue_nomerges_store,
  502. };
  503. static struct queue_sysfs_entry queue_rq_affinity_entry = {
  504. .attr = {.name = "rq_affinity", .mode = 0644 },
  505. .show = queue_rq_affinity_show,
  506. .store = queue_rq_affinity_store,
  507. };
  508. static struct queue_sysfs_entry queue_iostats_entry = {
  509. .attr = {.name = "iostats", .mode = 0644 },
  510. .show = queue_show_iostats,
  511. .store = queue_store_iostats,
  512. };
  513. static struct queue_sysfs_entry queue_random_entry = {
  514. .attr = {.name = "add_random", .mode = 0644 },
  515. .show = queue_show_random,
  516. .store = queue_store_random,
  517. };
  518. static struct queue_sysfs_entry queue_poll_entry = {
  519. .attr = {.name = "io_poll", .mode = 0644 },
  520. .show = queue_poll_show,
  521. .store = queue_poll_store,
  522. };
  523. static struct queue_sysfs_entry queue_poll_delay_entry = {
  524. .attr = {.name = "io_poll_delay", .mode = 0644 },
  525. .show = queue_poll_delay_show,
  526. .store = queue_poll_delay_store,
  527. };
  528. static struct queue_sysfs_entry queue_wc_entry = {
  529. .attr = {.name = "write_cache", .mode = 0644 },
  530. .show = queue_wc_show,
  531. .store = queue_wc_store,
  532. };
  533. static struct queue_sysfs_entry queue_fua_entry = {
  534. .attr = {.name = "fua", .mode = 0444 },
  535. .show = queue_fua_show,
  536. };
  537. static struct queue_sysfs_entry queue_dax_entry = {
  538. .attr = {.name = "dax", .mode = 0444 },
  539. .show = queue_dax_show,
  540. };
  541. static struct queue_sysfs_entry queue_wb_lat_entry = {
  542. .attr = {.name = "wbt_lat_usec", .mode = 0644 },
  543. .show = queue_wb_lat_show,
  544. .store = queue_wb_lat_store,
  545. };
  546. #ifdef CONFIG_BLK_DEV_THROTTLING_LOW
  547. static struct queue_sysfs_entry throtl_sample_time_entry = {
  548. .attr = {.name = "throttle_sample_time", .mode = 0644 },
  549. .show = blk_throtl_sample_time_show,
  550. .store = blk_throtl_sample_time_store,
  551. };
  552. #endif
  553. static struct attribute *default_attrs[] = {
  554. &queue_requests_entry.attr,
  555. &queue_ra_entry.attr,
  556. &queue_max_hw_sectors_entry.attr,
  557. &queue_max_sectors_entry.attr,
  558. &queue_max_segments_entry.attr,
  559. &queue_max_discard_segments_entry.attr,
  560. &queue_max_integrity_segments_entry.attr,
  561. &queue_max_segment_size_entry.attr,
  562. &queue_iosched_entry.attr,
  563. &queue_hw_sector_size_entry.attr,
  564. &queue_logical_block_size_entry.attr,
  565. &queue_physical_block_size_entry.attr,
  566. &queue_chunk_sectors_entry.attr,
  567. &queue_io_min_entry.attr,
  568. &queue_io_opt_entry.attr,
  569. &queue_discard_granularity_entry.attr,
  570. &queue_discard_max_entry.attr,
  571. &queue_discard_max_hw_entry.attr,
  572. &queue_discard_zeroes_data_entry.attr,
  573. &queue_write_same_max_entry.attr,
  574. &queue_write_zeroes_max_entry.attr,
  575. &queue_nonrot_entry.attr,
  576. &queue_zoned_entry.attr,
  577. &queue_nomerges_entry.attr,
  578. &queue_rq_affinity_entry.attr,
  579. &queue_iostats_entry.attr,
  580. &queue_random_entry.attr,
  581. &queue_poll_entry.attr,
  582. &queue_wc_entry.attr,
  583. &queue_fua_entry.attr,
  584. &queue_dax_entry.attr,
  585. &queue_wb_lat_entry.attr,
  586. &queue_poll_delay_entry.attr,
  587. #ifdef CONFIG_BLK_DEV_THROTTLING_LOW
  588. &throtl_sample_time_entry.attr,
  589. #endif
  590. NULL,
  591. };
  592. #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
  593. static ssize_t
  594. queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
  595. {
  596. struct queue_sysfs_entry *entry = to_queue(attr);
  597. struct request_queue *q =
  598. container_of(kobj, struct request_queue, kobj);
  599. ssize_t res;
  600. if (!entry->show)
  601. return -EIO;
  602. mutex_lock(&q->sysfs_lock);
  603. if (blk_queue_dying(q)) {
  604. mutex_unlock(&q->sysfs_lock);
  605. return -ENOENT;
  606. }
  607. res = entry->show(q, page);
  608. mutex_unlock(&q->sysfs_lock);
  609. return res;
  610. }
  611. static ssize_t
  612. queue_attr_store(struct kobject *kobj, struct attribute *attr,
  613. const char *page, size_t length)
  614. {
  615. struct queue_sysfs_entry *entry = to_queue(attr);
  616. struct request_queue *q;
  617. ssize_t res;
  618. if (!entry->store)
  619. return -EIO;
  620. q = container_of(kobj, struct request_queue, kobj);
  621. mutex_lock(&q->sysfs_lock);
  622. if (blk_queue_dying(q)) {
  623. mutex_unlock(&q->sysfs_lock);
  624. return -ENOENT;
  625. }
  626. res = entry->store(q, page, length);
  627. mutex_unlock(&q->sysfs_lock);
  628. return res;
  629. }
  630. static void blk_free_queue_rcu(struct rcu_head *rcu_head)
  631. {
  632. struct request_queue *q = container_of(rcu_head, struct request_queue,
  633. rcu_head);
  634. kmem_cache_free(blk_requestq_cachep, q);
  635. }
  636. /**
  637. * __blk_release_queue - release a request queue when it is no longer needed
  638. * @work: pointer to the release_work member of the request queue to be released
  639. *
  640. * Description:
  641. * blk_release_queue is the counterpart of blk_init_queue(). It should be
  642. * called when a request queue is being released; typically when a block
  643. * device is being de-registered. Its primary task it to free the queue
  644. * itself.
  645. *
  646. * Notes:
  647. * The low level driver must have finished any outstanding requests first
  648. * via blk_cleanup_queue().
  649. *
  650. * Although blk_release_queue() may be called with preemption disabled,
  651. * __blk_release_queue() may sleep.
  652. */
  653. static void __blk_release_queue(struct work_struct *work)
  654. {
  655. struct request_queue *q = container_of(work, typeof(*q), release_work);
  656. if (test_bit(QUEUE_FLAG_POLL_STATS, &q->queue_flags))
  657. blk_stat_remove_callback(q, q->poll_cb);
  658. blk_stat_free_callback(q->poll_cb);
  659. if (!blk_queue_dead(q)) {
  660. /*
  661. * Last reference was dropped without having called
  662. * blk_cleanup_queue().
  663. */
  664. WARN_ONCE(blk_queue_init_done(q),
  665. "request queue %p has been registered but blk_cleanup_queue() has not been called for that queue\n",
  666. q);
  667. blk_exit_queue(q);
  668. }
  669. WARN(blk_queue_root_blkg(q),
  670. "request queue %p is being released but it has not yet been removed from the blkcg controller\n",
  671. q);
  672. blk_free_queue_stats(q->stats);
  673. blk_exit_rl(q, &q->root_rl);
  674. if (q->queue_tags)
  675. __blk_queue_free_tags(q);
  676. if (!q->mq_ops) {
  677. if (q->exit_rq_fn)
  678. q->exit_rq_fn(q, q->fq->flush_rq);
  679. blk_free_flush_queue(q->fq);
  680. } else {
  681. blk_mq_release(q);
  682. }
  683. blk_trace_shutdown(q);
  684. if (q->mq_ops)
  685. blk_mq_debugfs_unregister(q);
  686. bioset_exit(&q->bio_split);
  687. ida_simple_remove(&blk_queue_ida, q->id);
  688. call_rcu(&q->rcu_head, blk_free_queue_rcu);
  689. }
  690. static void blk_release_queue(struct kobject *kobj)
  691. {
  692. struct request_queue *q =
  693. container_of(kobj, struct request_queue, kobj);
  694. INIT_WORK(&q->release_work, __blk_release_queue);
  695. schedule_work(&q->release_work);
  696. }
  697. static const struct sysfs_ops queue_sysfs_ops = {
  698. .show = queue_attr_show,
  699. .store = queue_attr_store,
  700. };
  701. struct kobj_type blk_queue_ktype = {
  702. .sysfs_ops = &queue_sysfs_ops,
  703. .default_attrs = default_attrs,
  704. .release = blk_release_queue,
  705. };
  706. /**
  707. * blk_register_queue - register a block layer queue with sysfs
  708. * @disk: Disk of which the request queue should be registered with sysfs.
  709. */
  710. int blk_register_queue(struct gendisk *disk)
  711. {
  712. int ret;
  713. struct device *dev = disk_to_dev(disk);
  714. struct request_queue *q = disk->queue;
  715. if (WARN_ON(!q))
  716. return -ENXIO;
  717. WARN_ONCE(test_bit(QUEUE_FLAG_REGISTERED, &q->queue_flags),
  718. "%s is registering an already registered queue\n",
  719. kobject_name(&dev->kobj));
  720. queue_flag_set_unlocked(QUEUE_FLAG_REGISTERED, q);
  721. /*
  722. * SCSI probing may synchronously create and destroy a lot of
  723. * request_queues for non-existent devices. Shutting down a fully
  724. * functional queue takes measureable wallclock time as RCU grace
  725. * periods are involved. To avoid excessive latency in these
  726. * cases, a request_queue starts out in a degraded mode which is
  727. * faster to shut down and is made fully functional here as
  728. * request_queues for non-existent devices never get registered.
  729. */
  730. if (!blk_queue_init_done(q)) {
  731. queue_flag_set_unlocked(QUEUE_FLAG_INIT_DONE, q);
  732. percpu_ref_switch_to_percpu(&q->q_usage_counter);
  733. blk_queue_bypass_end(q);
  734. }
  735. ret = blk_trace_init_sysfs(dev);
  736. if (ret)
  737. return ret;
  738. /* Prevent changes through sysfs until registration is completed. */
  739. mutex_lock(&q->sysfs_lock);
  740. ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
  741. if (ret < 0) {
  742. blk_trace_remove_sysfs(dev);
  743. goto unlock;
  744. }
  745. if (q->mq_ops) {
  746. __blk_mq_register_dev(dev, q);
  747. blk_mq_debugfs_register(q);
  748. }
  749. kobject_uevent(&q->kobj, KOBJ_ADD);
  750. wbt_enable_default(q);
  751. blk_throtl_register_queue(q);
  752. if (q->request_fn || (q->mq_ops && q->elevator)) {
  753. ret = elv_register_queue(q);
  754. if (ret) {
  755. mutex_unlock(&q->sysfs_lock);
  756. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  757. kobject_del(&q->kobj);
  758. blk_trace_remove_sysfs(dev);
  759. kobject_put(&dev->kobj);
  760. return ret;
  761. }
  762. }
  763. ret = 0;
  764. unlock:
  765. mutex_unlock(&q->sysfs_lock);
  766. return ret;
  767. }
  768. EXPORT_SYMBOL_GPL(blk_register_queue);
  769. /**
  770. * blk_unregister_queue - counterpart of blk_register_queue()
  771. * @disk: Disk of which the request queue should be unregistered from sysfs.
  772. *
  773. * Note: the caller is responsible for guaranteeing that this function is called
  774. * after blk_register_queue() has finished.
  775. */
  776. void blk_unregister_queue(struct gendisk *disk)
  777. {
  778. struct request_queue *q = disk->queue;
  779. if (WARN_ON(!q))
  780. return;
  781. /* Return early if disk->queue was never registered. */
  782. if (!test_bit(QUEUE_FLAG_REGISTERED, &q->queue_flags))
  783. return;
  784. /*
  785. * Since sysfs_remove_dir() prevents adding new directory entries
  786. * before removal of existing entries starts, protect against
  787. * concurrent elv_iosched_store() calls.
  788. */
  789. mutex_lock(&q->sysfs_lock);
  790. blk_queue_flag_clear(QUEUE_FLAG_REGISTERED, q);
  791. /*
  792. * Remove the sysfs attributes before unregistering the queue data
  793. * structures that can be modified through sysfs.
  794. */
  795. if (q->mq_ops)
  796. blk_mq_unregister_dev(disk_to_dev(disk), q);
  797. mutex_unlock(&q->sysfs_lock);
  798. kobject_uevent(&q->kobj, KOBJ_REMOVE);
  799. kobject_del(&q->kobj);
  800. blk_trace_remove_sysfs(disk_to_dev(disk));
  801. rq_qos_exit(q);
  802. mutex_lock(&q->sysfs_lock);
  803. if (q->request_fn || (q->mq_ops && q->elevator))
  804. elv_unregister_queue(q);
  805. mutex_unlock(&q->sysfs_lock);
  806. kobject_put(&disk_to_dev(disk)->kobj);
  807. }