Lines Matching refs:btree

18 in erase block sized buckets, and it uses a hybrid btree/log to track cached
388    the way cache coherency is handled for cache misses. If a btree node is full,
393    cause the btree node to be split, and you need almost no write traffic for
394    this to not show up enough to be noticeable (especially since bcache's btree
517   Average data per key in the btree.
526   Amount of memory currently used by the btree cache
560   Percentage of the root btree node in use.  If this gets too high the node
568   Depth of the btree (A single node btree has depth 0).
579 duration: garbage collection, btree read, btree node sorts and btree splits.
585   Total nodes in the btree.
588   Average fraction of btree in use.
594   Longest chain in the btree node cache's hash table
613   Sum of all btree writes, in (kilo/mega/giga) bytes
639   Sum of all non data writes (btree writes and all other metadata).