Home
last modified time | relevance | path

Searched refs:nr_sorted (Results 1 – 3 of 3) sorted by relevance

/fs/bcachefs/
A Dbtree_iter.h143 EBUG_ON(idx > trans->nr_sorted); in next_btree_path()
145 return idx < trans->nr_sorted in next_btree_path()
152 unsigned idx = path ? path->sorted_idx : trans->nr_sorted; in prev_btree_path()
162 _iter.sorted_idx < (_trans)->nr_sorted); \
174 _iter.sorted_idx < (_trans)->nr_sorted); \
178 for (_i = trans->nr_sorted - 1; \
A Dbtree_iter.c1038 while (i < trans->nr_sorted) { in bch2_btree_path_traverse_all()
2989 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()
2993 for (i = 0; i < trans->nr_sorted; i++) { in btree_trans_verify_sorted_refs()
3024 int i, l = 0, r = trans->nr_sorted, inc = 1; in __bch2_btree_trans_sort_paths()
3066 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()
3068 trans->nr_sorted--; in btree_path_list_remove()
3071 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()
3076 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_remove()
3091 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_add()
3093 trans->nr_sorted++; in btree_path_list_add()
[all …]
A Dbtree_types.h505 btree_path_idx_t nr_sorted; member

Completed in 20 milliseconds