Home
last modified time | relevance | path

Searched refs:bkey_p_next (Results 1 – 7 of 7) sorted by relevance

/linux-6.12.1/fs/bcachefs/
Dbkey_sort.c49 i->k = bkey_p_next(i->k); in sort_iter_advance()
111 out = bkey_p_next(out); in bch2_key_sort_fix_overlapping()
150 out = bkey_p_next(out); in bch2_sort_repack()
188 out = bkey_p_next(out); in bch2_sort_keys_keep_unwritten_whiteouts()
210 out = bkey_p_next(out); in bch2_sort_keys()
Dbset.c69 _n = bkey_p_next(_k); in bch2_dump_bset()
528 k = bkey_p_next(k); in bch2_bset_verify_rw_aux_tree()
716 k = bkey_p_next(k); in __build_ro_aux_tree()
865 for (i = p; i != k; i = bkey_p_next(i)) in bch2_bkey_prev_filter()
876 ? bkey_p_next(ret) in bch2_bkey_prev_filter()
879 i = bkey_p_next(i)) in bch2_bkey_prev_filter()
903 k = bkey_p_next(k); in rw_aux_tree_insert_entry()
1191 m = bkey_p_next(m); in bch2_bset_search_linear()
1196 m = bkey_p_next(m); in bch2_bset_search_linear()
Dbtree_io.c87 for (p = start, k = bkey_p_next(start); in verify_no_dups()
89 p = k, k = bkey_p_next(k)) { in verify_no_dups()
102 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in set_needs_whiteout()
185 k = bkey_p_next(k)) in bch2_sort_whiteouts()
194 k = bkey_p_next(k); in bch2_sort_whiteouts()
265 n = bkey_p_next(k); in bch2_drop_whiteouts()
269 out = bkey_p_next(out); in bch2_drop_whiteouts()
640 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in bch2_btree_node_drop_keys_outside_node()
653 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in bch2_btree_node_drop_keys_outside_node()
847 if (bkey_p_next(k) > vstruct_last(i)) in bkey_packed_valid()
[all …]
Dbkey_types.h13 #define bkey_p_next(_k) vstruct_next(_k) macro
Dbset.h217 _k = bkey_p_next(_k))
Ddebug.c156 for (k = inmemory->start; k != vstruct_last(inmemory); k = bkey_p_next(k)) in __bch2_btree_verify()
285 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) { in bch2_btree_node_ondisk_to_text()
Dbtree_update_interior.c1534 out[i] = bkey_p_next(out[i]); in __btree_split_node()