Home
last modified time | relevance | path

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

/fs/bcachefs/
A 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()
A Dbset.c69 _n = bkey_p_next(_k); in bch2_dump_bset()
529 k = bkey_p_next(k); in __bch2_bset_verify_rw_aux_tree()
724 k = bkey_p_next(k); in __build_ro_aux_tree()
873 for (i = p; i != k; i = bkey_p_next(i)) in bch2_bkey_prev_filter()
884 ? bkey_p_next(ret) in bch2_bkey_prev_filter()
887 i = bkey_p_next(i)) in bch2_bkey_prev_filter()
911 k = bkey_p_next(k); in rw_aux_tree_insert_entry()
1199 m = bkey_p_next(m); in bch2_bset_search_linear()
1204 m = bkey_p_next(m); in bch2_bset_search_linear()
A Dbtree_io.c90 for (p = start, k = bkey_p_next(start); in verify_no_dups()
92 p = k, k = bkey_p_next(k)) { in verify_no_dups()
188 k = bkey_p_next(k)) in bch2_sort_whiteouts()
197 k = bkey_p_next(k); in bch2_sort_whiteouts()
268 n = bkey_p_next(k); in bch2_drop_whiteouts()
272 out = bkey_p_next(out); in bch2_drop_whiteouts()
907 if (bkey_p_next(k) > vstruct_last(i)) in bkey_packed_valid()
953 if (btree_err_on(bkey_p_next(k) > vstruct_last(i), in validate_bset_keys()
1013 k = bkey_p_next(k); in validate_bset_keys()
1310 memmove_u64s_down(k, bkey_p_next(k), in bch2_btree_node_read_done()
[all …]
A Dbkey_types.h13 #define bkey_p_next(_k) vstruct_next(_k) macro
A Dbset.h217 _k = bkey_p_next(_k))
A Ddebug.c160 for (k = inmemory->start; k != vstruct_last(inmemory); k = bkey_p_next(k)) in __bch2_btree_verify()
290 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) { in bch2_btree_node_ondisk_to_text()
A Dbtree_update_interior.c1580 out[i] = bkey_p_next(out[i]); in __btree_split_node()

Completed in 26 milliseconds