202 	struct btree_iter *iter;  in bch_btree_node_read_done()  local
204 	iter = mempool_alloc(b->c->fill_iter, GFP_NOIO);  in bch_btree_node_read_done()
205 	iter->size = b->c->sb.bucket_size / b->c->sb.block_size;  in bch_btree_node_read_done()
206 	iter->used = 0;  in bch_btree_node_read_done()
209 	iter->b = &b->keys;  in bch_btree_node_read_done()
247 		bch_btree_iter_push(iter, i->start, bset_bkey_last(i));  in bch_btree_node_read_done()
259 	bch_btree_sort_and_fix_extents(&b->keys, iter, &b->c->sort);  in bch_btree_node_read_done()
271 	mempool_free(iter, b->c->fill_iter);  in bch_btree_node_read_done()
1250 	struct btree_iter iter;  in btree_gc_mark_node()  local
1255 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) {  in btree_gc_mark_node()
1503 	struct btree_iter iter;  in btree_gc_count_keys()  local
1506 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad)  in btree_gc_count_keys()
1518 	struct btree_iter iter;  in btree_gc_recurse()  local
1522 	bch_btree_iter_init(&b->keys, &iter, &b->c->gc_done);  in btree_gc_recurse()
1528 		k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad);  in btree_gc_recurse()
1813 	struct btree_iter iter;  in bch_btree_check_recurse()  local
1815 	for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid)  in bch_btree_check_recurse()
1821 		bch_btree_iter_init(&b->keys, &iter, NULL);  in bch_btree_check_recurse()
1824 			k = bch_btree_iter_next_filter(&iter, &b->keys,  in bch_btree_check_recurse()
2276 		struct btree_iter iter;  in bch_btree_map_nodes_recurse()  local
2278 		bch_btree_iter_init(&b->keys, &iter, from);  in bch_btree_map_nodes_recurse()
2280 		while ((k = bch_btree_iter_next_filter(&iter, &b->keys,  in bch_btree_map_nodes_recurse()
2309 	struct btree_iter iter;  in bch_btree_map_keys_recurse()  local
2311 	bch_btree_iter_init(&b->keys, &iter, from);  in bch_btree_map_keys_recurse()
2313 	while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad))) {  in bch_btree_map_keys_recurse()