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