2916 		BUG_ON(path->sorted_idx >= trans->nr_sorted);  in btree_trans_verify_sorted_refs()
2917 		BUG_ON(trans->sorted[path->sorted_idx] != i);  in btree_trans_verify_sorted_refs()
2924 		BUG_ON(trans->paths[idx].sorted_idx != i);  in btree_trans_verify_sorted_refs()
2972 				trans->paths[trans->sorted[i]].sorted_idx = i;  in __bch2_btree_trans_sort_paths()
2973 				trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1;  in __bch2_btree_trans_sort_paths()
2993 	EBUG_ON(path->sorted_idx >= trans->nr_sorted);  in btree_path_list_remove()
2996 	memmove_u64s_down_small(trans->sorted + path->sorted_idx,  in btree_path_list_remove()
2997 				trans->sorted + path->sorted_idx + 1,  in btree_path_list_remove()
2998 				DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx,  in btree_path_list_remove()
3001 	array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx);  in btree_path_list_remove()
3003 	for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++)  in btree_path_list_remove()
3004 		trans->paths[trans->sorted[i]].sorted_idx = i;  in btree_path_list_remove()
3013 	path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted;  in btree_path_list_add()
3016 	memmove_u64s_up_small(trans->sorted + path->sorted_idx + 1,  in btree_path_list_add()
3017 			      trans->sorted + path->sorted_idx,  in btree_path_list_add()
3018 			      DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx,  in btree_path_list_add()
3021 	trans->sorted[path->sorted_idx] = path_idx;  in btree_path_list_add()
3023 	array_insert_item(trans->sorted, trans->nr_sorted, path->sorted_idx, path_idx);  in btree_path_list_add()
3026 	for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++)  in btree_path_list_add()
3027 		trans->paths[trans->sorted[i]].sorted_idx = i;  in btree_path_list_add()