1004 		btree_path_idx_t idx = trans->sorted[i];  in bch2_btree_path_traverse_all()
1539 	btree_path_idx_t *sorted = p;  in btree_paths_realloc()  local
1540 	memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t));  in btree_paths_realloc()
1550 	rcu_assign_pointer(trans->sorted,		sorted);  in btree_paths_realloc()
2594 		BUG_ON(trans->sorted[path->sorted_idx] != i);  in btree_trans_verify_sorted_refs()
2598 		unsigned idx = trans->sorted[i];  in btree_trans_verify_sorted_refs()
2638 	 * mostly sorted.  in __bch2_btree_trans_sort_paths()
2646 			if (btree_path_cmp(trans->paths + trans->sorted[i],  in __bch2_btree_trans_sort_paths()
2647 					   trans->paths + trans->sorted[i + 1]) > 0) {  in __bch2_btree_trans_sort_paths()
2648 				swap(trans->sorted[i], trans->sorted[i + 1]);  in __bch2_btree_trans_sort_paths()
2649 				trans->paths[trans->sorted[i]].sorted_idx = i;  in __bch2_btree_trans_sort_paths()
2650 				trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1;  in __bch2_btree_trans_sort_paths()
2673 	memmove_u64s_down_small(trans->sorted + path->sorted_idx,  in btree_path_list_remove()
2674 				trans->sorted + path->sorted_idx + 1,  in btree_path_list_remove()
2678 	array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx);  in btree_path_list_remove()
2681 		trans->paths[trans->sorted[i]].sorted_idx = i;  in btree_path_list_remove()
2693 	memmove_u64s_up_small(trans->sorted + path->sorted_idx + 1,  in btree_path_list_add()
2694 			      trans->sorted + path->sorted_idx,  in btree_path_list_add()
2698 	trans->sorted[path->sorted_idx] = path_idx;  in btree_path_list_add()
2700 	array_insert_item(trans->sorted, trans->nr_sorted, path->sorted_idx, path_idx);  in btree_path_list_add()
2704 		trans->paths[trans->sorted[i]].sorted_idx = i;  in btree_path_list_add()
2998 	trans->sorted		= trans->_sorted;  in __bch2_trans_get()