Searched refs:bpos_predecessor (Results 1 – 7 of 7) sorted by relevance
264 static inline struct bpos bpos_predecessor(struct bpos p) in bpos_predecessor() function
231 bpos_predecessor(cur->data->min_key)); in btree_check_node_boundaries()252 bpos_predecessor(cur->data->min_key)); in btree_check_node_boundaries()
345 l->max_key = bpos_predecessor(r->min_key); in handle_overwrites()
78 p = bpos_predecessor(p); in bkey_predecessor()2576 search_key = bpos_predecessor(k.k->p); in __bch2_btree_iter_peek_prev()2579 search_key = bpos_predecessor(path->l[0].b->data->min_key); in __bch2_btree_iter_peek_prev()2670 search_key = bpos_predecessor(k.k->p); in bch2_btree_iter_peek_prev_min()2696 search_key = bpos_predecessor(k.k->p); in bch2_btree_iter_peek_prev_min()
657 BTREE_ID_inodes, POS(0, pos.offset), bpos_predecessor(pos), in __bch2_inode_has_child_snapshots()
1680 for_each_btree_key_reverse_norestart(trans, iter, id, bpos_predecessor(pos), in __bch2_key_has_snapshot_overwrites()
1982 ? bpos_predecessor(b->data->min_key) in __bch2_foreground_maybe_merge()