Lines Matching refs:tree
299 kfree(t->tree); in bch_btree_keys_free()
301 free_pages((unsigned long) t->tree, in bch_btree_keys_free()
307 t->tree = NULL; in bch_btree_keys_free()
324 t->tree = bset_tree_bytes(b) < PAGE_SIZE in bch_btree_keys_alloc()
327 if (!t->tree) in bch_btree_keys_alloc()
523 return cacheline_to_bkey(t, to_inorder(j, t), t->tree[j].m); in tree_to_bkey()
556 struct bkey_float *f = &t->tree[j]; in make_bfloat()
595 t->tree = t[-1].tree + j; in bset_alloc_tree()
612 if (t->tree != b->set->tree + btree_keys_cachelines(b)) { in bch_bset_build_unwritten_tree()
646 b->set->tree + btree_keys_cachelines(b) - t->tree); in bch_bset_build_written_tree()
663 t->tree[j].m = bkey_to_cacheline_offset(t, cacheline++, k); in bch_bset_build_written_tree()
762 if (t->size == b->set->tree + btree_keys_cachelines(b) - t->tree) in bch_bset_fix_lookup_table()
902 prefetch(&t->tree[p]); in bset_search_tree()
905 f = &t->tree[j]; in bset_search_tree()
935 f = &t->tree[inorder_next(j, t->size)]; in bset_search_tree()
943 f = &t->tree[inorder_prev(j, t->size)]; in bset_search_tree()
1324 if (t->tree[j].exponent == 127) in bch_btree_keys_stats()