Home
last modified time | relevance | path

Searched refs:POS_MAX (Results 1 – 8 of 8) sorted by relevance

/linux/fs/bcachefs/
H A Dio_write.h86 op->pos = POS_MAX; in bch2_write_op_init()
H A Dbkey_methods.c223 bkey_fsck_err_on(bkey_eq(k.k->p, POS_MAX), in __bch2_bkey_validate()
259 else if (bpos_eq(pos, POS_MAX)) in bch2_bpos_to_text()
H A Dalloc_background.c1119 k = bch2_get_key_or_hole(iter, POS_MAX, hole); in bch2_get_key_or_real_bucket_hole()
1917 struct bpos discard_pos_done = POS_MAX; in bch2_do_discards_work()
1997 struct bpos discard_pos_done = POS_MAX; in bch2_do_discards_fast_work()
H A Dsnapshot.c833 BTREE_ID_snapshots, POS_MAX, in bch2_check_snapshots()
1724 POS_MAX, 0, k, in bch2_snapshots_read()
H A Dreflink.c499 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX, in bch2_make_extent_indirect()
H A Dbtree_iter.c92 !bkey_eq(pos, POS_MAX)) in btree_iter_search_key()
2358 EBUG_ON((iter->flags & BTREE_ITER_filter_snapshots) && bkey_eq(end, POS_MAX)); in bch2_btree_iter_peek_max()
2603 !bkey_eq(iter->pos, POS_MAX)) { in bch2_btree_iter_peek_prev_min()
2859 next = k.k ? bkey_start_pos(k.k) : POS_MAX; in bch2_btree_iter_peek_slot()
H A Dbcachefs_format.h176 #define POS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, 0) macro
H A Dio_write.c1617 BUG_ON(bkey_eq(op->pos, POS_MAX)); in CLOSURE_CALLBACK()