bset_tree_last
for (; start <= bset_tree_last(b); start++) {
struct bset_tree *t = bset_tree_last(b);
struct bset_tree *t = bset_tree_last(b);
for (t = b->set; t <= bset_tree_last(b); t++)
struct bset_tree *t = bset_tree_last(b);
struct bset *i = bset_tree_last(b)->data;
struct bset_tree *t = bset_tree_last(b);
struct bset *i = bset_tree_last(b)->data;
return bset_tree_last(&b->keys)->data;
top = bch_bset_search(b, bset_tree_last(b),