sysfs.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820
  1. /*
  2. * bcache sysfs interfaces
  3. *
  4. * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
  5. * Copyright 2012 Google, Inc.
  6. */
  7. #include "bcache.h"
  8. #include "sysfs.h"
  9. #include "btree.h"
  10. #include "request.h"
  11. #include "writeback.h"
  12. #include <linux/blkdev.h>
  13. #include <linux/sort.h>
  14. static const char * const cache_replacement_policies[] = {
  15. "lru",
  16. "fifo",
  17. "random",
  18. NULL
  19. };
  20. write_attribute(attach);
  21. write_attribute(detach);
  22. write_attribute(unregister);
  23. write_attribute(stop);
  24. write_attribute(clear_stats);
  25. write_attribute(trigger_gc);
  26. write_attribute(prune_cache);
  27. write_attribute(flash_vol_create);
  28. read_attribute(bucket_size);
  29. read_attribute(block_size);
  30. read_attribute(nbuckets);
  31. read_attribute(tree_depth);
  32. read_attribute(root_usage_percent);
  33. read_attribute(priority_stats);
  34. read_attribute(btree_cache_size);
  35. read_attribute(btree_cache_max_chain);
  36. read_attribute(cache_available_percent);
  37. read_attribute(written);
  38. read_attribute(btree_written);
  39. read_attribute(metadata_written);
  40. read_attribute(active_journal_entries);
  41. sysfs_time_stats_attribute(btree_gc, sec, ms);
  42. sysfs_time_stats_attribute(btree_split, sec, us);
  43. sysfs_time_stats_attribute(btree_sort, ms, us);
  44. sysfs_time_stats_attribute(btree_read, ms, us);
  45. sysfs_time_stats_attribute(try_harder, ms, us);
  46. read_attribute(btree_nodes);
  47. read_attribute(btree_used_percent);
  48. read_attribute(average_key_size);
  49. read_attribute(dirty_data);
  50. read_attribute(bset_tree_stats);
  51. read_attribute(state);
  52. read_attribute(cache_read_races);
  53. read_attribute(writeback_keys_done);
  54. read_attribute(writeback_keys_failed);
  55. read_attribute(io_errors);
  56. read_attribute(congested);
  57. rw_attribute(congested_read_threshold_us);
  58. rw_attribute(congested_write_threshold_us);
  59. rw_attribute(sequential_cutoff);
  60. rw_attribute(sequential_merge);
  61. rw_attribute(data_csum);
  62. rw_attribute(cache_mode);
  63. rw_attribute(writeback_metadata);
  64. rw_attribute(writeback_running);
  65. rw_attribute(writeback_percent);
  66. rw_attribute(writeback_delay);
  67. rw_attribute(writeback_rate);
  68. rw_attribute(writeback_rate_update_seconds);
  69. rw_attribute(writeback_rate_d_term);
  70. rw_attribute(writeback_rate_p_term_inverse);
  71. rw_attribute(writeback_rate_d_smooth);
  72. read_attribute(writeback_rate_debug);
  73. rw_attribute(synchronous);
  74. rw_attribute(journal_delay_ms);
  75. rw_attribute(discard);
  76. rw_attribute(running);
  77. rw_attribute(label);
  78. rw_attribute(readahead);
  79. rw_attribute(io_error_limit);
  80. rw_attribute(io_error_halflife);
  81. rw_attribute(verify);
  82. rw_attribute(key_merging_disabled);
  83. rw_attribute(gc_always_rewrite);
  84. rw_attribute(freelist_percent);
  85. rw_attribute(cache_replacement_policy);
  86. rw_attribute(btree_shrinker_disabled);
  87. rw_attribute(copy_gc_enabled);
  88. rw_attribute(size);
  89. SHOW(__bch_cached_dev)
  90. {
  91. struct cached_dev *dc = container_of(kobj, struct cached_dev,
  92. disk.kobj);
  93. const char *states[] = { "no cache", "clean", "dirty", "inconsistent" };
  94. #define var(stat) (dc->stat)
  95. if (attr == &sysfs_cache_mode)
  96. return bch_snprint_string_list(buf, PAGE_SIZE,
  97. bch_cache_modes + 1,
  98. BDEV_CACHE_MODE(&dc->sb));
  99. sysfs_printf(data_csum, "%i", dc->disk.data_csum);
  100. var_printf(verify, "%i");
  101. var_printf(writeback_metadata, "%i");
  102. var_printf(writeback_running, "%i");
  103. var_print(writeback_delay);
  104. var_print(writeback_percent);
  105. sysfs_print(writeback_rate, dc->writeback_rate.rate);
  106. var_print(writeback_rate_update_seconds);
  107. var_print(writeback_rate_d_term);
  108. var_print(writeback_rate_p_term_inverse);
  109. var_print(writeback_rate_d_smooth);
  110. if (attr == &sysfs_writeback_rate_debug) {
  111. char dirty[20];
  112. char derivative[20];
  113. char target[20];
  114. bch_hprint(dirty,
  115. bcache_dev_sectors_dirty(&dc->disk) << 9);
  116. bch_hprint(derivative, dc->writeback_rate_derivative << 9);
  117. bch_hprint(target, dc->writeback_rate_target << 9);
  118. return sprintf(buf,
  119. "rate:\t\t%u\n"
  120. "change:\t\t%i\n"
  121. "dirty:\t\t%s\n"
  122. "derivative:\t%s\n"
  123. "target:\t\t%s\n",
  124. dc->writeback_rate.rate,
  125. dc->writeback_rate_change,
  126. dirty, derivative, target);
  127. }
  128. sysfs_hprint(dirty_data,
  129. bcache_dev_sectors_dirty(&dc->disk) << 9);
  130. var_printf(sequential_merge, "%i");
  131. var_hprint(sequential_cutoff);
  132. var_hprint(readahead);
  133. sysfs_print(running, atomic_read(&dc->running));
  134. sysfs_print(state, states[BDEV_STATE(&dc->sb)]);
  135. if (attr == &sysfs_label) {
  136. memcpy(buf, dc->sb.label, SB_LABEL_SIZE);
  137. buf[SB_LABEL_SIZE + 1] = '\0';
  138. strcat(buf, "\n");
  139. return strlen(buf);
  140. }
  141. #undef var
  142. return 0;
  143. }
  144. SHOW_LOCKED(bch_cached_dev)
  145. STORE(__cached_dev)
  146. {
  147. struct cached_dev *dc = container_of(kobj, struct cached_dev,
  148. disk.kobj);
  149. unsigned v = size;
  150. struct cache_set *c;
  151. #define d_strtoul(var) sysfs_strtoul(var, dc->var)
  152. #define d_strtoi_h(var) sysfs_hatoi(var, dc->var)
  153. sysfs_strtoul(data_csum, dc->disk.data_csum);
  154. d_strtoul(verify);
  155. d_strtoul(writeback_metadata);
  156. d_strtoul(writeback_running);
  157. d_strtoul(writeback_delay);
  158. sysfs_strtoul_clamp(writeback_rate,
  159. dc->writeback_rate.rate, 1, 1000000);
  160. sysfs_strtoul_clamp(writeback_percent, dc->writeback_percent, 0, 40);
  161. d_strtoul(writeback_rate_update_seconds);
  162. d_strtoul(writeback_rate_d_term);
  163. d_strtoul(writeback_rate_p_term_inverse);
  164. sysfs_strtoul_clamp(writeback_rate_p_term_inverse,
  165. dc->writeback_rate_p_term_inverse, 1, INT_MAX);
  166. d_strtoul(writeback_rate_d_smooth);
  167. d_strtoul(sequential_merge);
  168. d_strtoi_h(sequential_cutoff);
  169. d_strtoi_h(readahead);
  170. if (attr == &sysfs_clear_stats)
  171. bch_cache_accounting_clear(&dc->accounting);
  172. if (attr == &sysfs_running &&
  173. strtoul_or_return(buf))
  174. bch_cached_dev_run(dc);
  175. if (attr == &sysfs_cache_mode) {
  176. ssize_t v = bch_read_string_list(buf, bch_cache_modes + 1);
  177. if (v < 0)
  178. return v;
  179. if ((unsigned) v != BDEV_CACHE_MODE(&dc->sb)) {
  180. SET_BDEV_CACHE_MODE(&dc->sb, v);
  181. bch_write_bdev_super(dc, NULL);
  182. }
  183. }
  184. if (attr == &sysfs_label) {
  185. memcpy(dc->sb.label, buf, SB_LABEL_SIZE);
  186. bch_write_bdev_super(dc, NULL);
  187. if (dc->disk.c) {
  188. memcpy(dc->disk.c->uuids[dc->disk.id].label,
  189. buf, SB_LABEL_SIZE);
  190. bch_uuid_write(dc->disk.c);
  191. }
  192. }
  193. if (attr == &sysfs_attach) {
  194. if (bch_parse_uuid(buf, dc->sb.set_uuid) < 16)
  195. return -EINVAL;
  196. list_for_each_entry(c, &bch_cache_sets, list) {
  197. v = bch_cached_dev_attach(dc, c);
  198. if (!v)
  199. return size;
  200. }
  201. pr_err("Can't attach %s: cache set not found", buf);
  202. size = v;
  203. }
  204. if (attr == &sysfs_detach && dc->disk.c)
  205. bch_cached_dev_detach(dc);
  206. if (attr == &sysfs_stop)
  207. bcache_device_stop(&dc->disk);
  208. return size;
  209. }
  210. STORE(bch_cached_dev)
  211. {
  212. struct cached_dev *dc = container_of(kobj, struct cached_dev,
  213. disk.kobj);
  214. mutex_lock(&bch_register_lock);
  215. size = __cached_dev_store(kobj, attr, buf, size);
  216. if (attr == &sysfs_writeback_running)
  217. bch_writeback_queue(dc);
  218. if (attr == &sysfs_writeback_percent)
  219. schedule_delayed_work(&dc->writeback_rate_update,
  220. dc->writeback_rate_update_seconds * HZ);
  221. mutex_unlock(&bch_register_lock);
  222. return size;
  223. }
  224. static struct attribute *bch_cached_dev_files[] = {
  225. &sysfs_attach,
  226. &sysfs_detach,
  227. &sysfs_stop,
  228. #if 0
  229. &sysfs_data_csum,
  230. #endif
  231. &sysfs_cache_mode,
  232. &sysfs_writeback_metadata,
  233. &sysfs_writeback_running,
  234. &sysfs_writeback_delay,
  235. &sysfs_writeback_percent,
  236. &sysfs_writeback_rate,
  237. &sysfs_writeback_rate_update_seconds,
  238. &sysfs_writeback_rate_d_term,
  239. &sysfs_writeback_rate_p_term_inverse,
  240. &sysfs_writeback_rate_d_smooth,
  241. &sysfs_writeback_rate_debug,
  242. &sysfs_dirty_data,
  243. &sysfs_sequential_cutoff,
  244. &sysfs_sequential_merge,
  245. &sysfs_clear_stats,
  246. &sysfs_running,
  247. &sysfs_state,
  248. &sysfs_label,
  249. &sysfs_readahead,
  250. #ifdef CONFIG_BCACHE_DEBUG
  251. &sysfs_verify,
  252. #endif
  253. NULL
  254. };
  255. KTYPE(bch_cached_dev);
  256. SHOW(bch_flash_dev)
  257. {
  258. struct bcache_device *d = container_of(kobj, struct bcache_device,
  259. kobj);
  260. struct uuid_entry *u = &d->c->uuids[d->id];
  261. sysfs_printf(data_csum, "%i", d->data_csum);
  262. sysfs_hprint(size, u->sectors << 9);
  263. if (attr == &sysfs_label) {
  264. memcpy(buf, u->label, SB_LABEL_SIZE);
  265. buf[SB_LABEL_SIZE + 1] = '\0';
  266. strcat(buf, "\n");
  267. return strlen(buf);
  268. }
  269. return 0;
  270. }
  271. STORE(__bch_flash_dev)
  272. {
  273. struct bcache_device *d = container_of(kobj, struct bcache_device,
  274. kobj);
  275. struct uuid_entry *u = &d->c->uuids[d->id];
  276. sysfs_strtoul(data_csum, d->data_csum);
  277. if (attr == &sysfs_size) {
  278. uint64_t v;
  279. strtoi_h_or_return(buf, v);
  280. u->sectors = v >> 9;
  281. bch_uuid_write(d->c);
  282. set_capacity(d->disk, u->sectors);
  283. }
  284. if (attr == &sysfs_label) {
  285. memcpy(u->label, buf, SB_LABEL_SIZE);
  286. bch_uuid_write(d->c);
  287. }
  288. if (attr == &sysfs_unregister) {
  289. atomic_set(&d->detaching, 1);
  290. bcache_device_stop(d);
  291. }
  292. return size;
  293. }
  294. STORE_LOCKED(bch_flash_dev)
  295. static struct attribute *bch_flash_dev_files[] = {
  296. &sysfs_unregister,
  297. #if 0
  298. &sysfs_data_csum,
  299. #endif
  300. &sysfs_label,
  301. &sysfs_size,
  302. NULL
  303. };
  304. KTYPE(bch_flash_dev);
  305. SHOW(__bch_cache_set)
  306. {
  307. unsigned root_usage(struct cache_set *c)
  308. {
  309. unsigned bytes = 0;
  310. struct bkey *k;
  311. struct btree *b;
  312. struct btree_iter iter;
  313. goto lock_root;
  314. do {
  315. rw_unlock(false, b);
  316. lock_root:
  317. b = c->root;
  318. rw_lock(false, b, b->level);
  319. } while (b != c->root);
  320. for_each_key_filter(b, k, &iter, bch_ptr_bad)
  321. bytes += bkey_bytes(k);
  322. rw_unlock(false, b);
  323. return (bytes * 100) / btree_bytes(c);
  324. }
  325. size_t cache_size(struct cache_set *c)
  326. {
  327. size_t ret = 0;
  328. struct btree *b;
  329. mutex_lock(&c->bucket_lock);
  330. list_for_each_entry(b, &c->btree_cache, list)
  331. ret += 1 << (b->page_order + PAGE_SHIFT);
  332. mutex_unlock(&c->bucket_lock);
  333. return ret;
  334. }
  335. unsigned cache_max_chain(struct cache_set *c)
  336. {
  337. unsigned ret = 0;
  338. struct hlist_head *h;
  339. mutex_lock(&c->bucket_lock);
  340. for (h = c->bucket_hash;
  341. h < c->bucket_hash + (1 << BUCKET_HASH_BITS);
  342. h++) {
  343. unsigned i = 0;
  344. struct hlist_node *p;
  345. hlist_for_each(p, h)
  346. i++;
  347. ret = max(ret, i);
  348. }
  349. mutex_unlock(&c->bucket_lock);
  350. return ret;
  351. }
  352. unsigned btree_used(struct cache_set *c)
  353. {
  354. return div64_u64(c->gc_stats.key_bytes * 100,
  355. (c->gc_stats.nodes ?: 1) * btree_bytes(c));
  356. }
  357. unsigned average_key_size(struct cache_set *c)
  358. {
  359. return c->gc_stats.nkeys
  360. ? div64_u64(c->gc_stats.data, c->gc_stats.nkeys)
  361. : 0;
  362. }
  363. struct cache_set *c = container_of(kobj, struct cache_set, kobj);
  364. sysfs_print(synchronous, CACHE_SYNC(&c->sb));
  365. sysfs_print(journal_delay_ms, c->journal_delay_ms);
  366. sysfs_hprint(bucket_size, bucket_bytes(c));
  367. sysfs_hprint(block_size, block_bytes(c));
  368. sysfs_print(tree_depth, c->root->level);
  369. sysfs_print(root_usage_percent, root_usage(c));
  370. sysfs_hprint(btree_cache_size, cache_size(c));
  371. sysfs_print(btree_cache_max_chain, cache_max_chain(c));
  372. sysfs_print(cache_available_percent, 100 - c->gc_stats.in_use);
  373. sysfs_print_time_stats(&c->btree_gc_time, btree_gc, sec, ms);
  374. sysfs_print_time_stats(&c->btree_split_time, btree_split, sec, us);
  375. sysfs_print_time_stats(&c->sort_time, btree_sort, ms, us);
  376. sysfs_print_time_stats(&c->btree_read_time, btree_read, ms, us);
  377. sysfs_print_time_stats(&c->try_harder_time, try_harder, ms, us);
  378. sysfs_print(btree_used_percent, btree_used(c));
  379. sysfs_print(btree_nodes, c->gc_stats.nodes);
  380. sysfs_hprint(dirty_data, c->gc_stats.dirty);
  381. sysfs_hprint(average_key_size, average_key_size(c));
  382. sysfs_print(cache_read_races,
  383. atomic_long_read(&c->cache_read_races));
  384. sysfs_print(writeback_keys_done,
  385. atomic_long_read(&c->writeback_keys_done));
  386. sysfs_print(writeback_keys_failed,
  387. atomic_long_read(&c->writeback_keys_failed));
  388. /* See count_io_errors for why 88 */
  389. sysfs_print(io_error_halflife, c->error_decay * 88);
  390. sysfs_print(io_error_limit, c->error_limit >> IO_ERROR_SHIFT);
  391. sysfs_hprint(congested,
  392. ((uint64_t) bch_get_congested(c)) << 9);
  393. sysfs_print(congested_read_threshold_us,
  394. c->congested_read_threshold_us);
  395. sysfs_print(congested_write_threshold_us,
  396. c->congested_write_threshold_us);
  397. sysfs_print(active_journal_entries, fifo_used(&c->journal.pin));
  398. sysfs_printf(verify, "%i", c->verify);
  399. sysfs_printf(key_merging_disabled, "%i", c->key_merging_disabled);
  400. sysfs_printf(gc_always_rewrite, "%i", c->gc_always_rewrite);
  401. sysfs_printf(btree_shrinker_disabled, "%i", c->shrinker_disabled);
  402. sysfs_printf(copy_gc_enabled, "%i", c->copy_gc_enabled);
  403. if (attr == &sysfs_bset_tree_stats)
  404. return bch_bset_print_stats(c, buf);
  405. return 0;
  406. }
  407. SHOW_LOCKED(bch_cache_set)
  408. STORE(__bch_cache_set)
  409. {
  410. struct cache_set *c = container_of(kobj, struct cache_set, kobj);
  411. if (attr == &sysfs_unregister)
  412. bch_cache_set_unregister(c);
  413. if (attr == &sysfs_stop)
  414. bch_cache_set_stop(c);
  415. if (attr == &sysfs_synchronous) {
  416. bool sync = strtoul_or_return(buf);
  417. if (sync != CACHE_SYNC(&c->sb)) {
  418. SET_CACHE_SYNC(&c->sb, sync);
  419. bcache_write_super(c);
  420. }
  421. }
  422. if (attr == &sysfs_flash_vol_create) {
  423. int r;
  424. uint64_t v;
  425. strtoi_h_or_return(buf, v);
  426. r = bch_flash_dev_create(c, v);
  427. if (r)
  428. return r;
  429. }
  430. if (attr == &sysfs_clear_stats) {
  431. atomic_long_set(&c->writeback_keys_done, 0);
  432. atomic_long_set(&c->writeback_keys_failed, 0);
  433. memset(&c->gc_stats, 0, sizeof(struct gc_stat));
  434. bch_cache_accounting_clear(&c->accounting);
  435. }
  436. if (attr == &sysfs_trigger_gc)
  437. bch_queue_gc(c);
  438. if (attr == &sysfs_prune_cache) {
  439. struct shrink_control sc;
  440. sc.gfp_mask = GFP_KERNEL;
  441. sc.nr_to_scan = strtoul_or_return(buf);
  442. c->shrink.shrink(&c->shrink, &sc);
  443. }
  444. sysfs_strtoul(congested_read_threshold_us,
  445. c->congested_read_threshold_us);
  446. sysfs_strtoul(congested_write_threshold_us,
  447. c->congested_write_threshold_us);
  448. if (attr == &sysfs_io_error_limit)
  449. c->error_limit = strtoul_or_return(buf) << IO_ERROR_SHIFT;
  450. /* See count_io_errors() for why 88 */
  451. if (attr == &sysfs_io_error_halflife)
  452. c->error_decay = strtoul_or_return(buf) / 88;
  453. sysfs_strtoul(journal_delay_ms, c->journal_delay_ms);
  454. sysfs_strtoul(verify, c->verify);
  455. sysfs_strtoul(key_merging_disabled, c->key_merging_disabled);
  456. sysfs_strtoul(gc_always_rewrite, c->gc_always_rewrite);
  457. sysfs_strtoul(btree_shrinker_disabled, c->shrinker_disabled);
  458. sysfs_strtoul(copy_gc_enabled, c->copy_gc_enabled);
  459. return size;
  460. }
  461. STORE_LOCKED(bch_cache_set)
  462. SHOW(bch_cache_set_internal)
  463. {
  464. struct cache_set *c = container_of(kobj, struct cache_set, internal);
  465. return bch_cache_set_show(&c->kobj, attr, buf);
  466. }
  467. STORE(bch_cache_set_internal)
  468. {
  469. struct cache_set *c = container_of(kobj, struct cache_set, internal);
  470. return bch_cache_set_store(&c->kobj, attr, buf, size);
  471. }
  472. static void bch_cache_set_internal_release(struct kobject *k)
  473. {
  474. }
  475. static struct attribute *bch_cache_set_files[] = {
  476. &sysfs_unregister,
  477. &sysfs_stop,
  478. &sysfs_synchronous,
  479. &sysfs_journal_delay_ms,
  480. &sysfs_flash_vol_create,
  481. &sysfs_bucket_size,
  482. &sysfs_block_size,
  483. &sysfs_tree_depth,
  484. &sysfs_root_usage_percent,
  485. &sysfs_btree_cache_size,
  486. &sysfs_cache_available_percent,
  487. &sysfs_average_key_size,
  488. &sysfs_dirty_data,
  489. &sysfs_io_error_limit,
  490. &sysfs_io_error_halflife,
  491. &sysfs_congested,
  492. &sysfs_congested_read_threshold_us,
  493. &sysfs_congested_write_threshold_us,
  494. &sysfs_clear_stats,
  495. NULL
  496. };
  497. KTYPE(bch_cache_set);
  498. static struct attribute *bch_cache_set_internal_files[] = {
  499. &sysfs_active_journal_entries,
  500. sysfs_time_stats_attribute_list(btree_gc, sec, ms)
  501. sysfs_time_stats_attribute_list(btree_split, sec, us)
  502. sysfs_time_stats_attribute_list(btree_sort, ms, us)
  503. sysfs_time_stats_attribute_list(btree_read, ms, us)
  504. sysfs_time_stats_attribute_list(try_harder, ms, us)
  505. &sysfs_btree_nodes,
  506. &sysfs_btree_used_percent,
  507. &sysfs_btree_cache_max_chain,
  508. &sysfs_bset_tree_stats,
  509. &sysfs_cache_read_races,
  510. &sysfs_writeback_keys_done,
  511. &sysfs_writeback_keys_failed,
  512. &sysfs_trigger_gc,
  513. &sysfs_prune_cache,
  514. #ifdef CONFIG_BCACHE_DEBUG
  515. &sysfs_verify,
  516. &sysfs_key_merging_disabled,
  517. #endif
  518. &sysfs_gc_always_rewrite,
  519. &sysfs_btree_shrinker_disabled,
  520. &sysfs_copy_gc_enabled,
  521. NULL
  522. };
  523. KTYPE(bch_cache_set_internal);
  524. SHOW(__bch_cache)
  525. {
  526. struct cache *ca = container_of(kobj, struct cache, kobj);
  527. sysfs_hprint(bucket_size, bucket_bytes(ca));
  528. sysfs_hprint(block_size, block_bytes(ca));
  529. sysfs_print(nbuckets, ca->sb.nbuckets);
  530. sysfs_print(discard, ca->discard);
  531. sysfs_hprint(written, atomic_long_read(&ca->sectors_written) << 9);
  532. sysfs_hprint(btree_written,
  533. atomic_long_read(&ca->btree_sectors_written) << 9);
  534. sysfs_hprint(metadata_written,
  535. (atomic_long_read(&ca->meta_sectors_written) +
  536. atomic_long_read(&ca->btree_sectors_written)) << 9);
  537. sysfs_print(io_errors,
  538. atomic_read(&ca->io_errors) >> IO_ERROR_SHIFT);
  539. sysfs_print(freelist_percent, ca->free.size * 100 /
  540. ((size_t) ca->sb.nbuckets));
  541. if (attr == &sysfs_cache_replacement_policy)
  542. return bch_snprint_string_list(buf, PAGE_SIZE,
  543. cache_replacement_policies,
  544. CACHE_REPLACEMENT(&ca->sb));
  545. if (attr == &sysfs_priority_stats) {
  546. int cmp(const void *l, const void *r)
  547. { return *((uint16_t *) r) - *((uint16_t *) l); }
  548. size_t n = ca->sb.nbuckets, i, unused, btree;
  549. uint64_t sum = 0;
  550. /* Compute 31 quantiles */
  551. uint16_t q[31], *p, *cached;
  552. ssize_t ret;
  553. cached = p = vmalloc(ca->sb.nbuckets * sizeof(uint16_t));
  554. if (!p)
  555. return -ENOMEM;
  556. mutex_lock(&ca->set->bucket_lock);
  557. for (i = ca->sb.first_bucket; i < n; i++)
  558. p[i] = ca->buckets[i].prio;
  559. mutex_unlock(&ca->set->bucket_lock);
  560. sort(p, n, sizeof(uint16_t), cmp, NULL);
  561. while (n &&
  562. !cached[n - 1])
  563. --n;
  564. unused = ca->sb.nbuckets - n;
  565. while (cached < p + n &&
  566. *cached == BTREE_PRIO)
  567. cached++;
  568. btree = cached - p;
  569. n -= btree;
  570. for (i = 0; i < n; i++)
  571. sum += INITIAL_PRIO - cached[i];
  572. if (n)
  573. do_div(sum, n);
  574. for (i = 0; i < ARRAY_SIZE(q); i++)
  575. q[i] = INITIAL_PRIO - cached[n * (i + 1) /
  576. (ARRAY_SIZE(q) + 1)];
  577. vfree(p);
  578. ret = scnprintf(buf, PAGE_SIZE,
  579. "Unused: %zu%%\n"
  580. "Metadata: %zu%%\n"
  581. "Average: %llu\n"
  582. "Sectors per Q: %zu\n"
  583. "Quantiles: [",
  584. unused * 100 / (size_t) ca->sb.nbuckets,
  585. btree * 100 / (size_t) ca->sb.nbuckets, sum,
  586. n * ca->sb.bucket_size / (ARRAY_SIZE(q) + 1));
  587. for (i = 0; i < ARRAY_SIZE(q); i++)
  588. ret += scnprintf(buf + ret, PAGE_SIZE - ret,
  589. "%u ", q[i]);
  590. ret--;
  591. ret += scnprintf(buf + ret, PAGE_SIZE - ret, "]\n");
  592. return ret;
  593. }
  594. return 0;
  595. }
  596. SHOW_LOCKED(bch_cache)
  597. STORE(__bch_cache)
  598. {
  599. struct cache *ca = container_of(kobj, struct cache, kobj);
  600. if (attr == &sysfs_discard) {
  601. bool v = strtoul_or_return(buf);
  602. if (blk_queue_discard(bdev_get_queue(ca->bdev)))
  603. ca->discard = v;
  604. if (v != CACHE_DISCARD(&ca->sb)) {
  605. SET_CACHE_DISCARD(&ca->sb, v);
  606. bcache_write_super(ca->set);
  607. }
  608. }
  609. if (attr == &sysfs_cache_replacement_policy) {
  610. ssize_t v = bch_read_string_list(buf, cache_replacement_policies);
  611. if (v < 0)
  612. return v;
  613. if ((unsigned) v != CACHE_REPLACEMENT(&ca->sb)) {
  614. mutex_lock(&ca->set->bucket_lock);
  615. SET_CACHE_REPLACEMENT(&ca->sb, v);
  616. mutex_unlock(&ca->set->bucket_lock);
  617. bcache_write_super(ca->set);
  618. }
  619. }
  620. if (attr == &sysfs_freelist_percent) {
  621. DECLARE_FIFO(long, free);
  622. long i;
  623. size_t p = strtoul_or_return(buf);
  624. p = clamp_t(size_t,
  625. ((size_t) ca->sb.nbuckets * p) / 100,
  626. roundup_pow_of_two(ca->sb.nbuckets) >> 9,
  627. ca->sb.nbuckets / 2);
  628. if (!init_fifo_exact(&free, p, GFP_KERNEL))
  629. return -ENOMEM;
  630. mutex_lock(&ca->set->bucket_lock);
  631. fifo_move(&free, &ca->free);
  632. fifo_swap(&free, &ca->free);
  633. mutex_unlock(&ca->set->bucket_lock);
  634. while (fifo_pop(&free, i))
  635. atomic_dec(&ca->buckets[i].pin);
  636. free_fifo(&free);
  637. }
  638. if (attr == &sysfs_clear_stats) {
  639. atomic_long_set(&ca->sectors_written, 0);
  640. atomic_long_set(&ca->btree_sectors_written, 0);
  641. atomic_long_set(&ca->meta_sectors_written, 0);
  642. atomic_set(&ca->io_count, 0);
  643. atomic_set(&ca->io_errors, 0);
  644. }
  645. return size;
  646. }
  647. STORE_LOCKED(bch_cache)
  648. static struct attribute *bch_cache_files[] = {
  649. &sysfs_bucket_size,
  650. &sysfs_block_size,
  651. &sysfs_nbuckets,
  652. &sysfs_priority_stats,
  653. &sysfs_discard,
  654. &sysfs_written,
  655. &sysfs_btree_written,
  656. &sysfs_metadata_written,
  657. &sysfs_io_errors,
  658. &sysfs_clear_stats,
  659. &sysfs_freelist_percent,
  660. &sysfs_cache_replacement_policy,
  661. NULL
  662. };
  663. KTYPE(bch_cache);