Lines Matching refs:btree_bset_first
159 return ((void *) btree_bset_first(b)) + b->written * block_bytes(b->c); in write_block()
201 struct bset *i = btree_bset_first(b); in bch_btree_node_read_done()
457 BUG_ON(btree_bset_first(b)->seq != i->seq); in __bch_btree_node_write()
1343 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce()
1344 struct bset *n2 = btree_bset_first(new_nodes[i - 1]); in btree_gc_coalesce()
1414 BUG_ON(btree_bset_first(new_nodes[0])->keys); in btree_gc_coalesce()
1984 split = set_blocks(btree_bset_first(n1), in btree_split()
1990 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); in btree_split()
2012 while (keys < (btree_bset_first(n1)->keys * 3) / 5) in btree_split()
2013 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), in btree_split()
2017 bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2018 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2020 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; in btree_split()
2021 btree_bset_first(n1)->keys = keys; in btree_split()
2023 memcpy(btree_bset_first(n2)->start, in btree_split()
2024 bset_bkey_last(btree_bset_first(n1)), in btree_split()
2025 btree_bset_first(n2)->keys * sizeof(uint64_t)); in btree_split()
2034 trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys); in btree_split()