Searched refs:bkey_start_pos (Results 1 - 18 of 18) sorted by relevance

/linux-master/fs/bcachefs/
H A Dextent_update.c76 if (bkey_ge(bkey_start_pos(r_k.k), POS(0, idx + sectors)))
85 struct bpos pos = bkey_start_pos(k.k);
134 if (bkey_gt(bkey_start_pos(&insert->k), bkey_start_pos(k.k)))
H A Dbkey_methods.h75 bpos_eq(l->p, bkey_start_pos(r));
H A Dbtree_update.c194 struct bpos new_start = bkey_start_pos(new.k);
195 unsigned front_split = bkey_lt(bkey_start_pos(old.k), new_start);
295 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k),
305 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {
315 while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {
643 bch2_trans_iter_init(trans, &iter, id, bkey_start_pos(&k->k),
735 * bkey_start_pos(k.k) (for non extents they always will be the
741 * bkey_start_pos(k.k)).
H A Dextents.h709 int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m));
H A Ddata_update.c108 bkey_start_pos(&bch2_keylist_front(keys)->k),
289 k.k->p, bkey_start_pos(&insert->k)) ?:
534 m->op.pos = bkey_start_pos(k.k);
H A Dio_write.c370 bkey_start_pos(&sk.k->k),
1140 bch2_cut_front(bkey_start_pos(&orig->k), new);
1167 bkey_start_pos(&orig->k), orig->k.p,
H A Dio_misc.c426 bkey_lt(bkey_start_pos(k.k), src_pos)) {
H A Dbkey.h300 static inline struct bpos bkey_start_pos(const struct bkey *k) function
H A Dalloc_background.c673 bkey_start_pos(&k->k),
1002 struct bpos hole_start = bkey_start_pos(k.k);
1448 bkey_start_pos(k.k),
1452 bkey_start_pos(k.k),
H A Dio_read.c269 ? bkey_start_pos(k.k)
810 struct bpos data_pos = bkey_start_pos(k.k);
H A Dmove.c376 bkey_start_pos(k.k),
570 if (bkey_ge(bkey_start_pos(k.k), end))
H A Dbtree_iter.c278 BUG_ON(bkey_lt(iter->pos, bkey_start_pos(&iter->k)) ||
2014 struct bpos pos = bkey_start_pos(&iter->k);
2295 * But we can't do the full check here, because bkey_start_pos()
2368 iter_pos = bkey_max(iter->pos, bkey_start_pos(k.k));
2475 ? bpos_ge(bkey_start_pos(k.k), search_key)
2542 EBUG_ON(bkey_gt(bkey_start_pos(k.k), iter->pos));
2667 next = k.k ? bkey_start_pos(k.k) : POS_MAX;
H A Dextents.c1432 if (bkey_le(where, bkey_start_pos(k.k)))
1517 EBUG_ON(bkey_lt(where, bkey_start_pos(k.k)));
H A Dfs-io-direct.c258 if (bkey_ge(bkey_start_pos(k.k), POS(inum.inum, end)))
H A Dbtree_iter.h415 iter->pos = bkey_start_pos(&iter->k);
H A Dbtree_write_buffer.c193 bch2_trans_iter_init(trans, &iter, wb->btree, bkey_start_pos(&wb->k.k),
H A Dbtree_io.c99 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r)));
H A Dfsck.c1313 BUG_ON(bkey_le(pos1, bkey_start_pos(&pos2)));

Completed in 247 milliseconds