Lines Matching refs:btree

15 in erase block sized buckets, and it uses a hybrid btree/log to track cached
381    the way cache coherency is handled for cache misses. If a btree node is full,
386    cause the btree node to be split, and you need almost no write traffic for
387    this to not show up enough to be noticeable (especially since bcache's btree
513   Average data per key in the btree.
522   Amount of memory currently used by the btree cache
556   Percentage of the root btree node in use.  If this gets too high the node
564   Depth of the btree (A single node btree has depth 0).
575 duration: garbage collection, btree read, btree node sorts and btree splits.
581   Total nodes in the btree.
584   Average fraction of btree in use.
590   Longest chain in the btree node cache's hash table
609   Sum of all btree writes, in (kilo/mega/giga) bytes
635   Sum of all non data writes (btree writes and all other metadata).