Home
last modified time | relevance | path

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

/linux/fs/bcachefs/
H A Dlogged_ops.c70 ret = bch2_bkey_get_empty_slot(trans, &iter, BTREE_ID_logged_ops, POS_MAX); in __bch2_logged_op_start()
H A Dio_write.h84 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), c, err, in __bch2_bkey_invalid()
260 else if (bpos_eq(pos, POS_MAX)) in bch2_bpos_to_text()
H A Dmove.c644 id == end.btree ? end.pos : POS_MAX, in __bch2_move_data()
740 if (bkey_eq(bp_pos, POS_MAX)) in bch2_evacuate_bucket()
H A Dreflink.c357 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX, in bch2_make_extent_indirect()
H A Dbtree_update.c590 bch2_trans_iter_init(trans, iter, btree, POS_MAX, BTREE_ITER_intent); in bch2_bkey_get_empty_slot()
H A Dbcachefs_format.h176 #define POS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, 0) macro
H A Dbtree_iter.c92 !bkey_eq(pos, POS_MAX)) in btree_iter_search_key()
2269 EBUG_ON((iter->flags & BTREE_ITER_filter_snapshots) && bkey_eq(end, POS_MAX)); in bch2_btree_iter_peek_upto()
2664 next = k.k ? bkey_start_pos(k.k) : POS_MAX; in bch2_btree_iter_peek_slot()
H A Dalloc_background.c1013 k = bch2_get_key_or_hole(iter, POS_MAX, hole); in bch2_get_key_or_real_bucket_hole()
1815 struct bpos discard_pos_done = POS_MAX; in bch2_do_discards_work()
H A Dio_write.c1594 BUG_ON(bkey_eq(op->pos, POS_MAX)); in CLOSURE_CALLBACK()
H A Dalloc_foreground.c353 if (!bkey_eq(bp_pos, POS_MAX)) { in try_alloc_bucket()
H A Dsnapshot.c888 BTREE_ID_snapshots, POS_MAX, in bch2_check_snapshots()
H A Dec.c1335 if (bkey_eq(bp_pos, POS_MAX)) in ec_stripe_update_bucket()