Searched refs:sorted_idx (Results 1 – 3 of 3) sorted by relevance
140 unsigned idx = path ? path->sorted_idx + 1 : 0; in next_btree_path()151 unsigned idx = path ? path->sorted_idx : trans->nr_sorted; in prev_btree_path()160 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \161 _iter.sorted_idx < (_trans)->nr_sorted); \162 _iter.sorted_idx++)165 btree_path_idx_t sorted_idx; member171 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \173 _iter.sorted_idx < (_trans)->nr_sorted); \174 _iter.sorted_idx++)
2930 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()2931 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()2938 BUG_ON(trans->paths[idx].sorted_idx != i); in btree_trans_verify_sorted_refs()2986 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()2987 trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1; in __bch2_btree_trans_sort_paths()3007 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()3010 memmove_u64s_down_small(trans->sorted + path->sorted_idx, in btree_path_list_remove()3011 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()3012 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()3015 array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx); in btree_path_list_remove()[all …]
315 btree_path_idx_t sorted_idx; member