19 void bch_dump_bset(struct btree_keys *b, struct bset *i, unsigned set)  in bch_dump_bset()  argument
26 		printk(KERN_ERR "block %u key %u/%u: ", set,  in bch_dump_bset()
47 		bch_dump_bset(b, b->set[i].data,  in bch_dump_bucket()
48 			      bset_sector_offset(b, b->set[i].data));  in bch_dump_bucket()
290 	struct bset_tree *t = b->set;  in bch_btree_keys_free()
314 	struct bset_tree *t = b->set;  in bch_btree_keys_alloc()
355 		b->set[i].size = 0;  in bch_btree_keys_init()
361 		b->set[i].data = NULL;  in bch_btree_keys_init()
591 	if (t != b->set) {  in bset_alloc_tree()
599 	while (t < b->set + MAX_BSETS)  in bset_alloc_tree()
612 	if (t->tree != b->set->tree + btree_keys_cachelines(b)) {  in bch_bset_build_unwritten_tree()
620 	if (i != b->set->data) {  in bch_bset_init_next()
621 		b->set[++b->nsets].data = i;  in bch_bset_init_next()
622 		i->seq = b->set->data->seq;  in bch_bset_init_next()
646 			b->set->tree + btree_keys_cachelines(b) - t->tree);  in bch_bset_build_written_tree()
686 	for (t = b->set; t <= bset_tree_last(b); t++)  in bch_bset_fix_invalidated_key()
762 	if (t->size == b->set->tree + btree_keys_cachelines(b) - t->tree)  in bch_bset_fix_lookup_table()
1076 	return __bch_btree_iter_init(b, iter, search, b->set);  in bch_btree_iter_init()
1220 		out->magic	= b->set->data->magic;  in __btree_sort()
1221 		out->seq	= b->set->data->seq;  in __btree_sort()
1222 		out->version	= b->set->data->version;  in __btree_sort()
1223 		swap(out, b->set->data);  in __btree_sort()
1225 		b->set[start].data->keys = out->keys;  in __btree_sort()
1226 		memcpy(b->set[start].data->start, out->start,  in __btree_sort()
1248 	__bch_btree_iter_init(b, &iter, NULL, &b->set[start]);  in bch_btree_sort_partial()
1254 			keys += b->set[i].data->keys;  in bch_btree_sort_partial()
1256 		order = get_order(__set_bytes(b->set->data, keys));  in bch_btree_sort_partial()
1280 	btree_mergesort(b, new->set->data, &iter, false, true);  in bch_btree_sort_into()
1284 	new->set->size = 0; // XXX: why?  in bch_btree_sort_into()
1301 		if (b->set[i].data->keys < crit) {  in bch_btree_sort_lazy()
1323 		struct bset_tree *t = &b->set[i];  in bch_btree_keys_stats()