332 			     found_btree_nodes *nodes_heap)  in handle_overwrites()  argument
336 	while ((r = min_heap_peek(nodes_heap)) &&  in handle_overwrites()
342 				min_heap_pop(nodes_heap, &found_btree_node_heap_cbs, NULL);  in handle_overwrites()
347 				min_heap_sift_down(nodes_heap, 0, &found_btree_node_heap_cbs, NULL);  in handle_overwrites()
355 			min_heap_pop(nodes_heap, &found_btree_node_heap_cbs, NULL);  in handle_overwrites()
358 				min_heap_pop(nodes_heap, &found_btree_node_heap_cbs, NULL);  in handle_overwrites()
363 				min_heap_sift_down(nodes_heap, 0, &found_btree_node_heap_cbs, NULL);  in handle_overwrites()
375 	found_btree_nodes nodes_heap = {};  in bch2_scan_for_btree_nodes()  local
430 	swap(nodes_heap, f->nodes);  in bch2_scan_for_btree_nodes()
435 		BUILD_BUG_ON(sizeof(nodes_heap.nr)	!= sizeof(real_heap.nr));  in bch2_scan_for_btree_nodes()
436 		BUILD_BUG_ON(sizeof(nodes_heap.size)	!= sizeof(real_heap.size));  in bch2_scan_for_btree_nodes()
441 	min_heapify_all(&nodes_heap, &found_btree_node_heap_cbs, NULL);  in bch2_scan_for_btree_nodes()
443 	if (nodes_heap.nr) {  in bch2_scan_for_btree_nodes()
444 		ret = darray_push(&f->nodes, *min_heap_peek(&nodes_heap));  in bch2_scan_for_btree_nodes()
448 		min_heap_pop(&nodes_heap, &found_btree_node_heap_cbs, NULL);  in bch2_scan_for_btree_nodes()
452 		ret = handle_overwrites(c, &darray_last(f->nodes), &nodes_heap);  in bch2_scan_for_btree_nodes()
456 		if (!nodes_heap.nr)  in bch2_scan_for_btree_nodes()
459 		ret = darray_push(&f->nodes, *min_heap_peek(&nodes_heap));  in bch2_scan_for_btree_nodes()
463 		min_heap_pop(&nodes_heap, &found_btree_node_heap_cbs, NULL);  in bch2_scan_for_btree_nodes()
480 	darray_exit(&nodes_heap);  in bch2_scan_for_btree_nodes()