Home
last modified time | relevance | path

Searched refs:bkey_start_pos (Results 1 – 20 of 20) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dextent_update.c76 if (bkey_ge(bkey_start_pos(r_k.k), POS(0, idx + sectors))) in count_iters_for_insert()
85 struct bpos pos = bkey_start_pos(k.k); in count_iters_for_insert()
134 if (bkey_gt(bkey_start_pos(&insert->k), bkey_start_pos(k.k))) in bch2_extent_atomic_end()
H A Dbtree_update.c194 struct bpos new_start = bkey_start_pos(new.k); in bch2_trans_update_extent_overwrite()
195 unsigned front_split = bkey_lt(bkey_start_pos(old.k), new_start); in bch2_trans_update_extent_overwrite()
295 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k), in bch2_trans_update_extent()
305 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) { in bch2_trans_update_extent()
315 while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) { in bch2_trans_update_extent()
647 bch2_trans_iter_init(trans, &iter, id, bkey_start_pos(&k->k), in bch2_btree_insert_trans()
H A Dbkey_methods.h75 bpos_eq(l->p, bkey_start_pos(r)); in bch2_bkey_maybe_mergable()
H A Ddata_update.c199 bkey_start_pos(&bch2_keylist_front(keys)->k), in __bch2_data_update_index_update()
389 k.k->p, bkey_start_pos(&insert->k)) ?: in __bch2_data_update_index_update()
767 m->op.pos = bkey_start_pos(k.k); in bch2_data_update_init()
H A Dextents.h720 int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m)); in bch2_extent_overlap()
H A Dio_read.c312 ? bkey_start_pos(k.k) in promote_alloc()
447 u->btree_id, bkey_start_pos(&u->k.k->k), in bch2_read_retry_nodecode()
459 bkey_start_pos(&u->k.k->k), in bch2_read_retry_nodecode()
949 struct bpos data_pos = bkey_start_pos(k.k); in __bch2_read_extent()
H A Dmove.c371 bkey_start_pos(k.k), in bch2_move_extent()
554 if (bkey_lt(reflink_pos, bkey_start_pos(k.k))) { in bch2_lookup_indirect_extent_for_move()
616 if (bkey_ge(bkey_start_pos(k.k), end)) in bch2_move_data_btree()
H A Dreflink.c188 struct bpos missing_pos = bkey_start_pos(p.k); in bch2_indirect_extent_missing_error()
221 struct bpos new_start = bkey_start_pos(&new->k); in bch2_indirect_extent_missing_error()
H A Dio_write.c397 bkey_start_pos(&sk.k->k), in bch2_write_index_default()
1223 bch2_cut_front(bkey_start_pos(&orig->k), new); in bch2_nocow_write_convert_one_unwritten()
1251 bkey_start_pos(&orig->k), orig->k.p, in bch2_nocow_write_convert_unwritten()
H A Dbkey.h301 static inline struct bpos bkey_start_pos(const struct bkey *k) in bkey_start_pos() function
H A Dbtree_iter.c273 (bkey_lt(iter->pos, bkey_start_pos(&iter->k)) || in bch2_btree_iter_verify_entry_exit()
2053 struct bpos pos = bkey_start_pos(&iter->k); in bch2_btree_iter_rewind()
2438 iter_pos = bkey_max(iter->pos, bkey_start_pos(k.k)); in bch2_btree_iter_peek_max()
2604 bkey_lt(bkey_start_pos(k.k), iter->pos))) in bch2_btree_iter_peek_prev_min()
2693 iter->flags & BTREE_ITER_is_extents ? bkey_ge(bkey_start_pos(k.k), iter->pos) : in bch2_btree_iter_peek_prev_min()
2846 next = k.k ? bkey_start_pos(k.k) : POS_MAX; in bch2_btree_iter_peek_slot()
H A Dio_misc.c447 bkey_lt(bkey_start_pos(k.k), src_pos)) { in __bch2_resume_logged_op_finsert()
H A Dfs-io-direct.c271 if (bkey_ge(bkey_start_pos(k.k), POS(inum.inum, end))) in bch2_check_range_allocated()
H A Dalloc_background.c1125 struct bpos hole_start = bkey_start_pos(k.k); in bch2_get_key_or_real_bucket_hole()
1599 bkey_start_pos(k.k), in bch2_check_alloc_info()
1603 bkey_start_pos(k.k), in bch2_check_alloc_info()
H A Dextents.c1555 if (bkey_le(where, bkey_start_pos(k.k))) in bch2_cut_front_s()
1640 EBUG_ON(bkey_lt(where, bkey_start_pos(k.k))); in bch2_cut_back_s()
H A Dfs.c1438 struct bpos pagecache_start = bkey_start_pos(&cur->kbuf.k->k); in bch2_next_fiemap_extent()
1455 bkey_le(bpos_max(iter.pos, bkey_start_pos(k.k)), in bch2_next_fiemap_extent()
1462 bch2_cut_back(bkey_start_pos(k.k), cur->kbuf.k); in bch2_next_fiemap_extent()
H A Dbtree_write_buffer.c206 bch2_trans_iter_init(trans, &iter, wb->btree, bkey_start_pos(&wb->k.k), in btree_write_buffered_insert()
H A Dbtree_iter.h454 iter->pos = bkey_start_pos(&iter->k); in bch2_btree_iter_set_pos_to_extent_start()
H A Dbtree_io.c94 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r))); in verify_no_dups()
H A Dfsck.c1608 BUG_ON(bkey_le(pos1, bkey_start_pos(&pos2))); in overlapping_extents_found()