Home
last modified time | relevance | path

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

/linux-6.12.1/fs/bcachefs/
Dbbpos_types.h16 #define BBPOS_MAX BBPOS(BTREE_ID_NR - 1, SPOS_MAX)
Dbbpos.h16 if (bpos_cmp(pos.pos, SPOS_MAX)) { in bbpos_successor()
Dbtree_iter.h392 return bch2_btree_iter_peek_upto(iter, SPOS_MAX); in bch2_btree_iter_peek()
771 for_each_btree_key_upto_continue(_trans, _iter, SPOS_MAX, _flags, _k, _do)
788 SPOS_MAX, _flags, _k, _do)
858 SPOS_MAX, _flags, _k, _ret)
869 for_each_btree_key_upto_continue_norestart(_iter, SPOS_MAX, _flags, _k, _ret)
Drecovery.c103 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
105 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
107 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
109 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
111 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
Dbackpointers.c261 *bp_pos = SPOS_MAX; in bch2_get_next_backpointer()
920 !bpos_eq(s.bucket_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
925 !bpos_eq(s.bucket_end, SPOS_MAX)) { in bch2_check_extents_to_backpointers()
938 if (ret || bpos_eq(s.bucket_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
Dbtree_journal_iter.c368 if (bpos_eq(iter->pos, SPOS_MAX)) in bch2_btree_and_journal_iter_advance()
434 iter->pos = SPOS_MAX; in bch2_btree_and_journal_iter_peek()
Dbtree_gc.c538 bch2_shoot_down_journal_keys(c, i, 1, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_check_topology()
539 ret = bch2_get_scanned_nodes(c, i, 0, POS_MIN, SPOS_MAX); in bch2_check_topology()
696 gc_pos_set(c, gc_pos_btree(btree, b->c.level + 1, SPOS_MAX)); in bch2_gc_btree()
Ddebug.c409 if (bpos_eq(SPOS_MAX, i->from)) in bch2_read_btree_formats()
415 i->from = !bpos_eq(SPOS_MAX, b->key.k.p) in bch2_read_btree_formats()
Dbkey_methods.c260 else if (bpos_eq(pos, SPOS_MAX)) in bch2_bpos_to_text()
Dbtree_update_interior.c70 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
481 btree_set_max(b, SPOS_MAX); in __btree_root_alloc()
1980 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) { in __bch2_foreground_maybe_merge()
2545 b->key.k.p = SPOS_MAX; in bch2_btree_root_alloc_fake_trans()
2553 btree_set_max(b, SPOS_MAX); in bch2_btree_root_alloc_fake_trans()
Dbtree_iter.c2030 ? bpos_eq(pos, SPOS_MAX) in bch2_btree_iter_advance()
2031 : bkey_eq(pos, SPOS_MAX)); in bch2_btree_iter_advance()
2223 bch2_btree_iter_set_pos(iter, SPOS_MAX); in __bch2_btree_iter_peek()
2266 } else if (likely(!bpos_eq(l->b->key.k.p, SPOS_MAX))) { in __bch2_btree_iter_peek()
2271 bch2_btree_iter_set_pos(iter, SPOS_MAX); in __bch2_btree_iter_peek()
Dbtree_node_scan.c479 .max_key = SPOS_MAX, in bch2_btree_has_scanned_nodes()
Dbcachefs_format.h177 #define SPOS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, KEY_SNAPSHOT_MAX) macro
Dalloc_background.c1039 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX)) in bch2_get_key_or_hole()
Dec.c1295 if (bpos_eq(*bp_pos, SPOS_MAX)) in ec_stripe_update_extent()