sysfs.c 21 KB

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