Home
last modified time | relevance | path

Searched refs:bpos_successor (Results 1 – 10 of 10) sorted by relevance

/linux/fs/bcachefs/
H A Dbbpos.h17 pos.pos = bpos_successor(pos.pos); in bbpos_successor()
H A Ddebug.c378 i->from = bpos_successor(iter.pos); in bch2_read_btree()
411 ? bpos_successor(b->key.k.p) in bch2_read_btree_formats()
451 i->from = bpos_successor(iter.pos); in bch2_read_bfloat_failed()
H A Dbtree_node_scan.c343 r->min_key = bpos_successor(l->max_key); in handle_overwrites()
359 r->min_key = bpos_successor(l->max_key); in handle_overwrites()
H A Dbkey.h255 static inline struct bpos bpos_successor(struct bpos p) in bpos_successor() function
H A Dbtree_gc.c225 : bpos_successor(prev->key.k.p); in btree_check_node_boundaries()
318 bpos_successor(child->key.k.p), b->key.k.p); in btree_repair_node_end()
H A Dbtree_update_interior.c101 : bpos_successor(prev.k->k.p); in bch2_btree_node_check_topology()
1546 btree_set_min(n[1], bpos_successor(n1_pos)); in __btree_split_node()
2052 : bpos_successor(b->data->max_key); in __bch2_foreground_maybe_merge()
2078 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) { in __bch2_foreground_maybe_merge()
H A Dbtree_journal_iter.c527 iter->pos = bpos_successor(iter->pos); in bch2_btree_and_journal_iter_advance()
H A Ddisk_accounting.c590 pos = bpos_successor(e->pos); in bch2_gc_accounting_done()
H A Dbackpointers.c1164 s.bp_start = bpos_successor(s.bp_end); in bch2_check_extents_to_backpointers()
H A Dinode.c699 bpos_successor(pos), in bch2_bkey_get_iter_snapshot_parent()