Searched refs:btree_bset_first (Results 1 – 6 of 6) sorted by relevance
108 return ((void *) btree_bset_first(b)) + b->written * block_bytes(b->c->cache); in write_block() 150 struct bset *i = btree_bset_first(b); in bch_btree_node_read_done() 413 BUG_ON(btree_bset_first(b)->seq != i->seq); in __bch_btree_node_write() 1404 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce() 1405 struct bset *n2 = btree_bset_first(new_nodes[i - 1]); in btree_gc_coalesce() 1475 BUG_ON(btree_bset_first(new_nodes[0])->keys); in btree_gc_coalesce() 2261 split = set_blocks(btree_bset_first(n1), in btree_split() 2267 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); in btree_split() 2289 while (keys < (btree_bset_first(n1)->keys * 3) / 5) in btree_split() 2290 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n in btree_split() [all...]
180 static inline struct bset *btree_bset_first(struct btree *b) in btree_bset_first() function
724 static inline struct bset *btree_bset_first(struct btree *b) in btree_bset_first() function
402 nr = bch2_sort_repack(btree_bset_first(dst), in bch2_btree_sort_into() 1331 set_needs_whiteout(btree_bset_first(b), true); in bch2_btree_node_read_done()
816 i->seq = btree_bset_first(b)->seq; in bch2_bset_init_next()
1513 bsets[i] = btree_bset_first(n[i]); in __btree_split_node()