Home
last modified time | relevance | path

Searched refs:SPOS_MAX (Results 1 – 14 of 14) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbbpos_types.h16 #define BBPOS_MAX BBPOS(BTREE_ID_NR - 1, SPOS_MAX)
H A Dbbpos.h16 if (bpos_cmp(pos.pos, SPOS_MAX)) { in bbpos_successor()
H A Dbtree_iter.h409 return bch2_btree_iter_peek_max(trans, iter, SPOS_MAX); in bch2_btree_iter_peek()
788 for_each_btree_key_max_continue(_trans, _iter, SPOS_MAX, _flags, _k, _do)
805 SPOS_MAX, _flags, _k, _do)
876 SPOS_MAX, _flags, _k, _ret)
887 for_each_btree_key_max_continue_norestart(_trans, _iter, SPOS_MAX, _flags, _k, _ret)
H A Dbackpointers.c1013 *end = SPOS_MAX; in bch2_pin_backpointer_nodes_with_missing()
1037 struct bpos pinned = SPOS_MAX; in bch2_pin_backpointer_nodes_with_missing()
1127 !bpos_eq(s.bp_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
1132 !bpos_eq(s.bp_end, SPOS_MAX)) { in bch2_check_extents_to_backpointers()
1145 if (ret || bpos_eq(s.bp_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
H A Dbtree_gc.c565 bch2_shoot_down_journal_keys(c, i, 1, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_check_topology()
566 ret = bch2_get_scanned_nodes(c, i, 0, POS_MIN, SPOS_MAX); in bch2_check_topology()
727 gc_pos_set(c, gc_pos_btree(btree, b->c.level + 1, SPOS_MAX)); in bch2_gc_btree()
H A Dbtree_journal_iter.c519 if (bpos_eq(iter->pos, SPOS_MAX)) in bch2_btree_and_journal_iter_advance()
592 iter->pos = SPOS_MAX; in bch2_btree_and_journal_iter_peek()
H A Ddebug.c411 if (bpos_eq(SPOS_MAX, i->from)) in bch2_read_btree_formats()
417 i->from = !bpos_eq(SPOS_MAX, b->key.k.p) in bch2_read_btree_formats()
H A Dbkey_methods.c277 else if (bpos_eq(pos, SPOS_MAX)) in bch2_bpos_to_text()
H A Dbtree_update_interior.c79 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
461 btree_set_max(b, SPOS_MAX); in __btree_root_alloc()
2002 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) { in __bch2_foreground_maybe_merge()
2619 b->key.k.p = SPOS_MAX; in bch2_btree_root_alloc_fake_trans()
2627 btree_set_max(b, SPOS_MAX); in bch2_btree_root_alloc_fake_trans()
H A Dbtree_iter.c2042 ? bpos_eq(pos, SPOS_MAX) in bch2_btree_iter_advance()
2043 : bkey_eq(pos, SPOS_MAX)); in bch2_btree_iter_advance()
2262 bch2_btree_iter_set_pos(trans, iter, SPOS_MAX); in __bch2_btree_iter_peek()
2304 } else if (likely(!bpos_eq(l->b->key.k.p, SPOS_MAX))) { in __bch2_btree_iter_peek()
2309 bch2_btree_iter_set_pos(trans, iter, SPOS_MAX); in __bch2_btree_iter_peek()
2523 bch2_btree_iter_set_pos(trans, iter, SPOS_MAX); in __bch2_btree_iter_peek_prev()
H A Dbtree_node_scan.c528 .max_key = SPOS_MAX, in bch2_btree_has_scanned_nodes()
H A Dbcachefs_format.h177 #define SPOS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, KEY_SNAPSHOT_MAX) macro
H A Drecovery.c113 bch2_shoot_down_journal_keys(c, btree, 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in kill_btree()
H A Dalloc_background.c1059 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX)) in bch2_get_key_or_hole()