sysfs.c 20 KB

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