Searched refs:nr_sorted (Results 1 – 3 of 3) sorted by relevance
141 EBUG_ON(idx > trans->nr_sorted); in next_btree_path()143 return idx < trans->nr_sorted in next_btree_path()150 unsigned idx = path ? path->sorted_idx : trans->nr_sorted; in prev_btree_path()160 _iter.sorted_idx < (_trans)->nr_sorted); \172 _iter.sorted_idx < (_trans)->nr_sorted); \176 for (_i = trans->nr_sorted - 1; \
1024 while (i < trans->nr_sorted) { in bch2_btree_path_traverse_all()2915 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()2919 for (i = 0; i < trans->nr_sorted; i++) { in btree_trans_verify_sorted_refs()2950 int i, l = 0, r = trans->nr_sorted, inc = 1; in __bch2_btree_trans_sort_paths()2992 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()2994 trans->nr_sorted--; in btree_path_list_remove()2997 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()3002 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_remove()3017 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_add()3019 trans->nr_sorted++; in btree_path_list_add()[all …]
492 btree_path_idx_t nr_sorted; member