Lines Matching refs:btree

10 in erase block sized buckets, and it uses a hybrid btree/log to track cached
182    the way cache coherency is handled for cache misses. If a btree node is full,
187    cause the btree node to be split, and you need almost no write traffic for
188    this to not show up enough to be noticeable (especially since bcache's btree
313   Average data per key in the btree.
322   Amount of memory currently used by the btree cache
357   Percentage of the root btree node in use.  If this gets too high the node
365   Depth of the btree (A single node btree has depth 0).
375 duration: garbage collection, btree read, btree node sorts and btree splits.
381   Total nodes in the btree.
384   Average fraction of btree in use.
390   Longest chain in the btree node cache's hash table
408   Sum of all btree writes, in (kilo/mega/giga) bytes
434   Sum of all non data writes (btree writes and all other metadata).