293 		kfree(t->prev);  in bch_btree_keys_free()
295 		free_pages((unsigned long) t->prev,  in bch_btree_keys_free()
306 	t->prev = NULL;  in bch_btree_keys_free()
330 	t->prev = bset_prev_bytes(b) < PAGE_SIZE  in bch_btree_keys_alloc()
333 	if (!t->prev)  in bch_btree_keys_alloc()
528 	return (void *) (((uint64_t *) tree_to_bkey(t, j)) - t->prev[j]);  in tree_to_prev_bkey()
537 	return cacheline_to_bkey(t, cacheline, t->prev[cacheline]);  in table_to_bkey()
596 		t->prev = t[-1].prev + j;  in bset_alloc_tree()
613 		t->prev[0] = bkey_to_cacheline_offset(t, 0, t->data->start);  in bch_bset_build_unwritten_tree()
637 	struct bkey *prev = NULL, *k = t->data->start;  in bch_bset_build_written_tree()  local
660 			prev = k, k = bkey_next(k);  in bch_bset_build_written_tree()
662 		t->prev[j] = bkey_u64s(prev);  in bch_bset_build_written_tree()
750 		t->prev[j] += shift;  in bch_bset_fix_lookup_table()
752 		if (t->prev[j] > 7) {  in bch_bset_fix_lookup_table()
758 			t->prev[j] = bkey_to_cacheline_offset(t, j, k);  in bch_bset_fix_lookup_table()
771 			t->prev[t->size] = bkey_to_cacheline_offset(t, t->size, k);  in bch_bset_fix_lookup_table()
824 	struct bkey *m, *prev = NULL;  in bch_btree_insert_key()  local
840 		prev = m, m = bkey_next(m);  in bch_btree_insert_key()
844 	if (prev &&  in bch_btree_insert_key()
845 	    bch_bkey_try_merge(b, prev, k))  in bch_btree_insert_key()