60 	min_heap_init(&iter.heap, NULL, MAX_BSETS);  in __bch_count_data()
75 	min_heap_init(&iter.heap, NULL, MAX_BSETS);  in __bch_check_keys()
117 	struct bkey *k = iter->heap.data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()
119 	if (next < iter->heap.data->end &&  in bch_btree_iter_next_check()
410  * a heap), it converts a node in the tree - referenced by array index - to the
892 	min_heap_init(&iter.heap, NULL, MAX_BSETS);  in bch_btree_insert_key()
1098 	return !iter->heap.nr;  in btree_iter_end()
1110 		BUG_ON(!min_heap_push(&iter->heap,  in bch_btree_iter_push()
1123 	iter->heap.size = ARRAY_SIZE(iter->heap.preallocated);  in __bch_btree_iter_init()
1124 	iter->heap.nr = 0;  in __bch_btree_iter_init()
1158 		ret = iter->heap.data->k;  in __bch_btree_iter_next()
1159 		iter->heap.data->k = bkey_next(iter->heap.data->k);  in __bch_btree_iter_next()
1161 		if (iter->heap.data->k > iter->heap.data->end) {  in __bch_btree_iter_next()
1163 			iter->heap.data->k = iter->heap.data->end;  in __bch_btree_iter_next()
1166 		if (iter->heap.data->k == iter->heap.data->end) {  in __bch_btree_iter_next()
1167 			if (iter->heap.nr) {  in __bch_btree_iter_next()
1168 				b = min_heap_peek(&iter->heap)[0];  in __bch_btree_iter_next()
1169 				min_heap_pop(&iter->heap, &callbacks, NULL);  in __bch_btree_iter_next()
1173 			min_heap_sift_down(&iter->heap, 0, &callbacks, NULL);  in __bch_btree_iter_next()
1230 	min_heapify_all(&iter->heap, &callbacks, NULL);  in btree_mergesort()
1322 	min_heap_init(&iter.heap, NULL, MAX_BSETS);  in bch_btree_sort_partial()
1352 	min_heap_init(&iter.heap, NULL, MAX_BSETS);  in bch_btree_sort_into()