42 …tic void found_btree_nodes_to_text(struct printbuf *out, struct bch_fs *c, found_btree_nodes nodes)  in found_btree_nodes_to_text()  argument
45 	darray_for_each(nodes, i) {  in found_btree_nodes_to_text()
121  * Given two found btree nodes, if their sequence numbers are equal, take the
221 		if (darray_push(&f->nodes, n))  in try_read_btree_node()
372 	if (f->nodes.nr)  in bch2_scan_for_btree_nodes()
381 	if (!f->nodes.nr) {  in bch2_scan_for_btree_nodes()
382 		bch_err(c, "%s: no btree nodes found", __func__);  in bch2_scan_for_btree_nodes()
389 		prt_printf(&buf, "%s: nodes found:\n", __func__);  in bch2_scan_for_btree_nodes()
390 		found_btree_nodes_to_text(&buf, c, f->nodes);  in bch2_scan_for_btree_nodes()
394 	sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_cookie, NULL);  in bch2_scan_for_btree_nodes()
397 	darray_for_each(f->nodes, i) {  in bch2_scan_for_btree_nodes()
398 		struct found_btree_node *prev = dst ? f->nodes.data + dst - 1 : NULL;  in bch2_scan_for_btree_nodes()
409 			f->nodes.data[dst++] = *i;  in bch2_scan_for_btree_nodes()
412 	f->nodes.nr = dst;  in bch2_scan_for_btree_nodes()
414 	sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_pos, NULL);  in bch2_scan_for_btree_nodes()
418 		prt_printf(&buf, "%s: nodes after merging replicas:\n", __func__);  in bch2_scan_for_btree_nodes()
419 		found_btree_nodes_to_text(&buf, c, f->nodes);  in bch2_scan_for_btree_nodes()
423 	swap(nodes_heap, f->nodes);  in bch2_scan_for_btree_nodes()
437 		ret = darray_push(&f->nodes, *min_heap_peek(&nodes_heap));  in bch2_scan_for_btree_nodes()
445 		ret = handle_overwrites(c, &darray_last(f->nodes), &nodes_heap);  in bch2_scan_for_btree_nodes()
452 		ret = darray_push(&f->nodes, *min_heap_peek(&nodes_heap));  in bch2_scan_for_btree_nodes()
459 	for (struct found_btree_node *n = f->nodes.data; n < &darray_last(f->nodes); n++)  in bch2_scan_for_btree_nodes()
464 		prt_printf(&buf, "%s: nodes found after overwrites:\n", __func__);  in bch2_scan_for_btree_nodes()
465 		found_btree_nodes_to_text(&buf, c, f->nodes);  in bch2_scan_for_btree_nodes()
468 		bch_info(c, "btree node scan found %zu nodes after overwrites", f->nodes.nr);  in bch2_scan_for_btree_nodes()
471 …eytzinger0_sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_pos, NU…  in bch2_scan_for_btree_nodes()
489 	for (size_t _idx = eytzinger0_find_gt((_f)->nodes.data, (_f)->nodes.nr,		\
490 					sizeof((_f)->nodes.data[0]),			\
492 	     _idx < (_f)->nodes.nr &&							\
493 	     (_f)->nodes.data[_idx].btree_id == _search.btree_id &&			\
494 	     (_f)->nodes.data[_idx].level == _search.level &&				\
495 	     bpos_lt((_f)->nodes.data[_idx].min_key, _search.max_key);			\
496 	     _idx = eytzinger0_next(_idx, (_f)->nodes.nr))
510 		if (f->nodes.data[idx].seq > BTREE_NODE_SEQ(b->data))  in bch2_btree_node_is_stale()
563 		struct found_btree_node n = f->nodes.data[idx];  in bch2_get_scanned_nodes()
597 	darray_exit(&f->nodes);  in bch2_find_btree_nodes_exit()