171 	if (b->level && b->keys.nsets)  in bch_btree_init_next()
172 		bch_btree_sort(&b->keys, &b->c->sort);  in bch_btree_init_next()
174 		bch_btree_sort_lazy(&b->keys, &b->c->sort);  in bch_btree_init_next()
177 		bch_bset_init_next(&b->keys, write_block(b),  in bch_btree_init_next()
215 	iter->b = &b->keys;  in bch_btree_node_read_done()
222 	     b->written < btree_blocks(b) && i->seq == b->keys.set[0].data->seq;  in bch_btree_node_read_done()
250 		if (i != b->keys.set[0].data && !i->keys)  in bch_btree_node_read_done()
260 	     bset_sector_offset(&b->keys, i) < KEY_SIZE(&b->key);  in bch_btree_node_read_done()
262 		if (i->seq == b->keys.set[0].data->seq)  in bch_btree_node_read_done()
265 	bch_btree_sort_and_fix_extents(&b->keys, iter, &b->c->sort);  in bch_btree_node_read_done()
267 	i = b->keys.set[0].data;  in bch_btree_node_read_done()
269 	if (b->keys.set[0].size &&  in bch_btree_node_read_done()
270 	    bkey_cmp(&b->key, &b->keys.set[0].end) < 0)  in bch_btree_node_read_done()
274 		bch_bset_init_next(&b->keys, write_block(b),  in bch_btree_node_read_done()
283 			    bset_block_offset(b, i), i->keys);  in bch_btree_node_read_done()
310 	bch_bio_map(bio, b->keys.set[0].data);  in bch_btree_node_read()
424 		       bset_sector_offset(&b->keys, i));  in do_btree_node_write()
463 	BUG_ON(b->written && !i->keys);  in __bch_btree_node_write()
465 	bch_check_keys(&b->keys, "writing");  in __bch_btree_node_write()
486 	unsigned int nsets = b->keys.nsets;  in bch_btree_node_write()
496 	if (nsets && !b->keys.nsets)  in bch_btree_node_write()
533 	BUG_ON(!i->keys);  in bch_btree_leaf_dirty()
573 	bch_btree_keys_free(&b->keys);  in mca_data_free()
595 	if (!bch_btree_keys_alloc(&b->keys,  in mca_data_alloc()
638 	BUG_ON(btree_node_dirty(b) && !b->keys.set[0].data);  in mca_reap()
640 	if (b->keys.page_order < min_order)  in mca_reap()
813 	    c->verify_data->keys.set->data)  in bch_btree_cache_alloc()
928 			if (!b->keys.set[0].data)  in mca_alloc()
939 	if (!b->keys.set->data)  in mca_alloc()
956 		bch_btree_keys_init(&b->keys, &bch_extent_keys_ops,  in mca_alloc()
959 		bch_btree_keys_init(&b->keys, &bch_btree_keys_ops,  in mca_alloc()
1030 	for (; i <= b->keys.nsets && b->keys.set[i].size; i++) {  in bch_btree_node_get()
1031 		prefetch(b->keys.set[i].tree);  in bch_btree_node_get()
1032 		prefetch(b->keys.set[i].data);  in bch_btree_node_get()
1035 	for (; i <= b->keys.nsets; i++)  in bch_btree_node_get()
1036 		prefetch(b->keys.set[i].data);  in bch_btree_node_get()
1107 	bch_bset_init_next(&b->keys, b->keys.set->data, bset_magic(&b->c->sb));  in __bch_btree_node_alloc()
1136 		bch_btree_sort_into(&b->keys, &n->keys, &b->c->sort);  in btree_node_alloc_replacement()
1269 	unsigned int keys = 0, good_keys = 0;  in btree_gc_mark_node()  local
1276 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) {  in btree_gc_mark_node()
1278 		keys++;  in btree_gc_mark_node()
1280 		if (bch_ptr_bad(&b->keys, k))  in btree_gc_mark_node()
1290 	for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++)  in btree_gc_mark_node()
1292 			     bset_written(&b->keys, t) &&  in btree_gc_mark_node()
1302 	if ((keys - good_keys) * 2 > keys)  in btree_gc_mark_node()
1312 	unsigned int	keys;  member
1323 	unsigned int i, nodes = 0, keys = 0, blocks;  in btree_gc_coalesce()  local
1338 		keys += r[nodes++].keys;  in btree_gc_coalesce()
1343 	    __set_blocks(b->keys.set[0].data, keys,  in btree_gc_coalesce()
1370 		keys = 0;  in btree_gc_coalesce()
1376 				if (__set_blocks(n1, n1->keys + keys +  in btree_gc_coalesce()
1382 				keys += bkey_u64s(k);  in btree_gc_coalesce()
1393 			if (__set_blocks(n1, n1->keys + n2->keys,  in btree_gc_coalesce()
1398 			keys = n2->keys;  in btree_gc_coalesce()
1403 		BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c)) >  in btree_gc_coalesce()
1411 		       (void *) bset_bkey_idx(n2, keys) - (void *) n2->start);  in btree_gc_coalesce()
1413 		n1->keys += keys;  in btree_gc_coalesce()
1414 		r[i].keys = n1->keys;  in btree_gc_coalesce()
1417 			bset_bkey_idx(n2, keys),  in btree_gc_coalesce()
1419 			(void *) bset_bkey_idx(n2, keys));  in btree_gc_coalesce()
1421 		n2->keys -= keys;  in btree_gc_coalesce()
1437 	BUG_ON(btree_bset_first(new_nodes[0])->keys);  in btree_gc_coalesce()
1490 	struct keylist keys;  in btree_gc_rewrite_node()  local
1507 	bch_keylist_init(&keys);  in btree_gc_rewrite_node()
1508 	bch_keylist_add(&keys, &n->key);  in btree_gc_rewrite_node()
1510 	make_btree_freeing_key(replace, keys.top);  in btree_gc_rewrite_node()
1511 	bch_keylist_push(&keys);  in btree_gc_rewrite_node()
1513 	bch_btree_insert_node(b, op, &keys, NULL, NULL);  in btree_gc_rewrite_node()
1514 	BUG_ON(!bch_keylist_empty(&keys));  in btree_gc_rewrite_node()
1529 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad)  in btree_gc_count_keys()
1571 	bch_btree_iter_init(&b->keys, &iter, &b->c->gc_done);  in btree_gc_recurse()
1577 		k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad);  in btree_gc_recurse()
1586 			r->keys = btree_gc_count_keys(r->b);  in btree_gc_recurse()
1742 					&dc->writeback_keys.keys, node)  in bch_btree_gc_finish()
1756 		for (i = ca->sb.d; i < ca->sb.d + ca->sb.keys; i++)  in bch_btree_gc_finish()
1874 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid)  in bch_btree_check_recurse()
1880 		bch_btree_iter_init(&b->keys, &iter, NULL);  in bch_btree_check_recurse()
1883 			k = bch_btree_iter_next_filter(&iter, &b->keys,  in bch_btree_check_recurse()
1961 	status = bch_btree_insert_key(&b->keys, k, replace_key);  in btree_insert_key()
1963 		bch_check_keys(&b->keys, "%u for %s", status,  in btree_insert_key()
1975 	long ret = bch_btree_keys_u64s_remaining(&b->keys);  in insert_u64s_remaining()
1980 	if (b->keys.ops->is_extents)  in insert_u64s_remaining()
1991 	int oldsize = bch_count_data(&b->keys);  in bch_btree_insert_keys()
1994 		struct bkey *k = insert_keys->keys;  in bch_btree_insert_keys()
2007 			bkey_copy(&temp.key, insert_keys->keys);  in bch_btree_insert_keys()
2010 			bch_cut_front(&b->key, insert_keys->keys);  in bch_btree_insert_keys()
2024 	BUG_ON(bch_count_data(&b->keys) < oldsize);  in bch_btree_insert_keys()
2056 		unsigned int keys = 0;  in btree_split()  local
2058 		trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys);  in btree_split()
2080 		while (keys < (btree_bset_first(n1)->keys * 3) / 5)  in btree_split()
2081 			keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1),  in btree_split()
2082 							keys));  in btree_split()
2085 			      bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2086 		keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2088 		btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;  in btree_split()
2089 		btree_bset_first(n1)->keys = keys;  in btree_split()
2093 		       btree_bset_first(n2)->keys * sizeof(uint64_t));  in btree_split()
2102 		trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys);  in btree_split()
2176 	    b->keys.last_set_unwritten)  in bch_btree_insert_node()
2258 	struct keylist	*keys;  member
2268 	int ret = bch_btree_insert_node(b, &op->op, op->keys,  in btree_insert_fn()
2270 	if (ret && !bch_keylist_empty(op->keys))  in btree_insert_fn()
2276 int bch_btree_insert(struct cache_set *c, struct keylist *keys,  in bch_btree_insert()  argument
2283 	BUG_ON(bch_keylist_empty(keys));  in bch_btree_insert()
2286 	op.keys		= keys;  in bch_btree_insert()
2290 	while (!ret && !bch_keylist_empty(keys)) {  in bch_btree_insert()
2293 					       &START_KEY(keys->keys),  in bch_btree_insert()
2302 		while ((k = bch_keylist_pop(keys)))  in bch_btree_insert()
2346 		bch_btree_iter_init(&b->keys, &iter, from);  in bch_btree_map_nodes_recurse()
2348 		while ((k = bch_btree_iter_next_filter(&iter, &b->keys,  in bch_btree_map_nodes_recurse()
2379 	bch_btree_iter_init(&b->keys, &iter, from);  in bch_btree_map_keys_recurse()
2381 	while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad))) {  in bch_btree_map_keys_recurse()
2459 		if (RB_INSERT(&buf->keys, w, node, keybuf_cmp))  in refill_keybuf_fn()
2498 	if (!RB_EMPTY_ROOT(&buf->keys)) {  in bch_refill_keybuf()
2501 		w = RB_FIRST(&buf->keys, struct keybuf_key, node);  in bch_refill_keybuf()
2504 		w = RB_LAST(&buf->keys, struct keybuf_key, node);  in bch_refill_keybuf()
2516 	rb_erase(&w->node, &buf->keys);  in __bch_keybuf_del()
2540 	w = RB_GREATER(&buf->keys, s, node, keybuf_nonoverlapping_cmp);  in bch_keybuf_check_overlapping()
2562 	w = RB_FIRST(&buf->keys, struct keybuf_key, node);  in bch_keybuf_next()
2600 	buf->keys		= RB_ROOT;  in bch_keybuf_init()