Searched refs:sorted_idx (Results 1 – 3 of 3) sorted by relevance
139 unsigned idx = path ? path->sorted_idx + 1 : 0; in next_btree_path()150 unsigned idx = path ? path->sorted_idx : trans->nr_sorted; in prev_btree_path()159 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \160 _iter.sorted_idx < (_trans)->nr_sorted); \161 _iter.sorted_idx++)164 btree_path_idx_t sorted_idx; member170 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \172 _iter.sorted_idx < (_trans)->nr_sorted); \173 _iter.sorted_idx++)
2915 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()2916 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()2923 BUG_ON(trans->paths[idx].sorted_idx != i); in btree_trans_verify_sorted_refs()2971 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()2992 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()2996 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()3003 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_remove()3012 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()3016 trans->sorted + path->sorted_idx, in btree_path_list_add()3020 trans->sorted[path->sorted_idx] = path_idx; in btree_path_list_add()[all …]
315 btree_path_idx_t sorted_idx; member