Searched refs:bkey_start_pos (Results 1 – 18 of 18) sorted by relevance
| /linux-6.12.1/fs/bcachefs/ |
| D | extent_update.c | 76 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()
|
| D | btree_update.c | 194 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()
|
| D | bkey_methods.h | 74 bpos_eq(l->p, bkey_start_pos(r)); in bch2_bkey_maybe_mergable()
|
| D | data_update.c | 181 bkey_start_pos(&bch2_keylist_front(keys)->k), in __bch2_data_update_index_update()
362 k.k->p, bkey_start_pos(&insert->k)) ?: in __bch2_data_update_index_update()
645 m->op.pos = bkey_start_pos(k.k); in bch2_data_update_init()
|
| D | extents.h | 736 int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m)); in bch2_extent_overlap()
|
| D | io_write.c | 369 bkey_start_pos(&sk.k->k), in bch2_write_index_default()
1142 bch2_cut_front(bkey_start_pos(&orig->k), new); in bch2_nocow_write_convert_one_unwritten()
1169 bkey_start_pos(&orig->k), orig->k.p, in bch2_nocow_write_convert_unwritten()
|
| D | btree_iter.c | 273 BUG_ON(bkey_lt(iter->pos, bkey_start_pos(&iter->k)) || in bch2_btree_iter_verify_entry_exit()
2041 struct bpos pos = bkey_start_pos(&iter->k); in bch2_btree_iter_rewind()
2395 iter_pos = bkey_max(iter->pos, bkey_start_pos(k.k)); in bch2_btree_iter_peek_upto()
2502 ? bpos_ge(bkey_start_pos(k.k), search_key) in bch2_btree_iter_peek_prev()
2570 EBUG_ON(bkey_gt(bkey_start_pos(k.k), iter->pos)); in bch2_btree_iter_peek_prev()
2695 next = k.k ? bkey_start_pos(k.k) : POS_MAX; in bch2_btree_iter_peek_slot()
|
| D | move.c | 351 bkey_start_pos(k.k), in bch2_move_extent()
546 if (bkey_ge(bkey_start_pos(k.k), end)) in bch2_move_data_btree()
|
| D | alloc_background.c | 709 bkey_start_pos(&k->k), in bch2_bucket_do_index()
1104 struct bpos hole_start = bkey_start_pos(k.k); in bch2_get_key_or_real_bucket_hole()
1548 bkey_start_pos(k.k), in bch2_check_alloc_info()
1552 bkey_start_pos(k.k), in bch2_check_alloc_info()
|
| D | bkey.h | 308 static inline struct bpos bkey_start_pos(const struct bkey *k) in bkey_start_pos() function
|
| D | io_read.c | 296 ? bkey_start_pos(k.k) in promote_alloc()
850 struct bpos data_pos = bkey_start_pos(k.k); in __bch2_read_extent()
|
| D | io_misc.c | 444 bkey_lt(bkey_start_pos(k.k), src_pos)) { in __bch2_resume_logged_op_finsert()
|
| D | fs-io-direct.c | 258 if (bkey_ge(bkey_start_pos(k.k), POS(inum.inum, end))) in bch2_check_range_allocated()
|
| D | extents.c | 1562 if (bkey_le(where, bkey_start_pos(k.k))) in bch2_cut_front_s()
1647 EBUG_ON(bkey_lt(where, bkey_start_pos(k.k))); in bch2_cut_back_s()
|
| D | btree_write_buffer.c | 208 bch2_trans_iter_init(trans, &iter, wb->btree, bkey_start_pos(&wb->k.k), in btree_write_buffered_insert()
|
| D | btree_iter.h | 432 iter->pos = bkey_start_pos(&iter->k); in bch2_btree_iter_set_pos_to_extent_start()
|
| D | btree_io.c | 93 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r))); in verify_no_dups()
|
| D | fsck.c | 1751 BUG_ON(bkey_le(pos1, bkey_start_pos(&pos2))); in overlapping_extents_found()
|