Home
last modified time | relevance | path

Searched refs:bkey_i (Results 1 – 25 of 65) sorted by relevance

123

/linux/fs/bcachefs/
H A Dbtree_update.h15 struct bkey_i *);
22 struct bkey_i *, u64);
53 struct bkey_i *, enum btree_iter_update_trigger_flags);
55 int bch2_btree_insert_trans(struct btree_trans *, enum btree_id, struct bkey_i *,
57 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *, struct
106 struct bkey_i *, enum btree_iter_update_trigger_flags);
127 int bch2_btree_insert_clone_trans(struct btree_trans *, enum btree_id, struct bkey_i *);
131 struct bkey_i *k) in bch2_trans_update_buffered()
213 static inline struct bkey_i *__bch2_bkey_make_mut_noupdate(struct btree_trans *trans, struct bkey_s… in __bch2_bkey_make_mut_noupdate()
217 struct bkey_i *mut; in __bch2_bkey_make_mut_noupdate()
[all …]
H A Dbkey_types.h15 static inline struct bkey_i *bkey_next(struct bkey_i *k) in bkey_next()
17 return (struct bkey_i *) ((u64 *) k->_data + k->k.u64s); in bkey_next()
80 static inline struct bkey_s bkey_i_to_s(struct bkey_i *k) in bkey_i_to_s()
85 static inline struct bkey_s_c bkey_i_to_s_c(const struct bkey_i *k) in bkey_i_to_s_c()
103 struct bkey_i k_i; \
130 static inline struct bkey_i_##name *bkey_i_to_##name(struct bkey_i *k) \
137 bkey_i_to_##name##_c(const struct bkey_i *k) \
178 static inline struct bkey_s_##name bkey_i_to_s_##name(struct bkey_i *k) \
188 bkey_i_to_s_c_##name(const struct bkey_i *k) \
197 static inline struct bkey_i_##name *bkey_##name##_init(struct bkey_i *_k)\
H A Dbtree_cache.h28 struct bkey_s_c, struct bkey_i *);
37 const struct bkey_i *, unsigned,
40 struct btree *bch2_btree_node_get_noiter(struct btree_trans *, const struct bkey_i *,
44 const struct bkey_i *, enum btree_id, unsigned);
46 void bch2_btree_node_evict(struct btree_trans *, const struct bkey_i *);
52 static inline u64 btree_ptr_hash_val(const struct bkey_i *k) in btree_ptr_hash_val()
68 static inline struct btree *btree_node_mem_ptr(const struct bkey_i *k) in btree_node_mem_ptr()
H A Dbtree_journal_iter.h54 struct bkey_i *bch2_journal_keys_peek_max(struct bch_fs *, enum btree_id,
56 struct bkey_i *bch2_journal_keys_peek_prev_min(struct bch_fs *, enum btree_id,
58 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *, enum btree_id,
65 unsigned, struct bkey_i *);
67 unsigned, struct bkey_i *);
H A Dlogged_ops.h11 static inline int bch2_logged_op_update(struct btree_trans *trans, struct bkey_i *op) in bch2_logged_op_update()
17 int bch2_logged_op_start(struct btree_trans *, struct bkey_i *);
18 int bch2_logged_op_finish(struct btree_trans *, struct bkey_i *);
H A Dbtree_update.c28 struct bkey_i *, enum btree_iter_update_trigger_flags,
34 struct bkey_i **insert, in extent_front_merge()
38 struct bkey_i *update; in extent_front_merge()
69 struct bkey_i *insert, in extent_back_merge()
132 struct bkey_i *update; in __bch2_insert_snapshot_whiteouts()
161 update = bch2_trans_kmalloc(trans, sizeof(struct bkey_i)); in __bch2_insert_snapshot_whiteouts()
193 struct bkey_i *update; in bch2_trans_update_extent_overwrite()
287 struct bkey_i *insert, in bch2_trans_update_extent()
386 struct bkey_i *k, enum btree_iter_update_trigger_flags flags, in bch2_trans_update_by_path()
444 struct bkey_i *j_k = in bch2_trans_update_by_path()
[all …]
H A Dlogged_ops.c13 int (*resume)(struct btree_trans *, struct bkey_i *);
76 static int __bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k) in __bch2_logged_op_start()
91 int bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k) in bch2_logged_op_start()
97 int bch2_logged_op_finish(struct btree_trans *trans, struct bkey_i *k) in bch2_logged_op_finish()
H A Dkeylist.h26 static inline void bch2_keylist_add(struct keylist *l, const struct bkey_i *k) in bch2_keylist_add()
47 static inline struct bkey_i *bch2_keylist_front(struct keylist *l) in bch2_keylist_front()
53 for (struct bkey_i *_k = (_keylist)->keys; \
H A Dbkey.h43 static inline void bkey_copy(struct bkey_i *dst, const struct bkey_i *src) in bkey_copy()
227 static inline struct bkey_packed *bkey_to_packed(struct bkey_i *k) in bkey_to_packed()
232 static inline const struct bkey_packed *bkey_to_packed_c(const struct bkey_i *k) in bkey_to_packed_c()
237 static inline struct bkey_i *packed_to_bkey(struct bkey_packed *k) in packed_to_bkey()
239 return bkey_packed(k) ? NULL : (struct bkey_i *) k; in packed_to_bkey()
384 void bch2_bkey_unpack(const struct btree *, struct bkey_i *,
386 bool bch2_bkey_pack(struct bkey_packed *, const struct bkey_i *,
502 static inline void bkey_reassemble(struct bkey_i *dst, in bkey_reassemble()
H A Dkeylist_types.h7 struct bkey_i *keys;
11 struct bkey_i *top;
H A Dextent_update.h8 struct bkey_i *, struct bpos *);
10 struct bkey_i *);
H A Dio_write.h21 enum bch_data_type, const struct bkey_i *, bool);
62 struct bkey_i *, bool *, s64 *, s64 *);
64 struct btree_iter *, struct bkey_i *,
H A Dbtree_write_buffer.h70 enum btree_id, struct bkey_i *);
74 enum btree_id btree, struct bkey_i *k) in __bch2_journal_key_to_wb()
90 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb()
H A Dio_misc.h19 int bch2_resume_logged_op_truncate(struct btree_trans *, struct bkey_i *);
30 int bch2_resume_logged_op_finsert(struct btree_trans *, struct bkey_i *);
H A Dextents.h84 static inline void __extent_entry_insert(struct bkey_i *k, in __extent_entry_insert()
470 bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
471 void bch2_extent_crc_append(struct bkey_i *,
622 void bch2_bkey_extent_entry_drop(struct bkey_i *, union bch_extent_entry *);
624 static inline void bch2_bkey_append_ptr(struct bkey_i *k, struct bch_extent_ptr ptr) in bch2_bkey_append_ptr()
646 void bch2_extent_ptr_decoded_append(struct bkey_i *,
734 static inline void bch2_cut_front(struct bpos where, struct bkey_i *k) in bch2_cut_front()
739 static inline void bch2_cut_back(struct bpos where, struct bkey_i *k) in bch2_cut_back()
H A Dbkey_buf.h9 struct bkey_i *k;
33 struct bkey_i *src) in bch2_bkey_buf_copy()
H A Dbtree_journal_iter.c75 struct bkey_i *bch2_journal_keys_peek_max(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_max()
98 struct bkey_i *ret = NULL; in bch2_journal_keys_peek_max()
131 struct bkey_i *bch2_journal_keys_peek_prev_min(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_prev_min()
154 struct bkey_i *ret = NULL; in bch2_journal_keys_peek_prev_min()
186 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_slot()
251 unsigned level, struct bkey_i *k) in bch2_journal_key_insert_take()
327 unsigned level, struct bkey_i *k) in bch2_journal_key_insert()
329 struct bkey_i *n; in bch2_journal_key_insert()
346 struct bkey_i whiteout; in bch2_journal_key_delete()
H A Dio_misc.c155 struct bkey_i delete; in bch2_fpunch_at()
245 struct bkey_i *op_k, in __bch2_resume_logged_op_truncate()
275 int bch2_resume_logged_op_truncate(struct btree_trans *trans, struct bkey_i *op_k) in bch2_resume_logged_op_truncate()
356 struct bkey_i *op_k, in __bch2_resume_logged_op_finsert()
416 struct bkey_i delete, *copy; in __bch2_resume_logged_op_finsert()
506 int bch2_resume_logged_op_finsert(struct btree_trans *trans, struct bkey_i *op_k) in bch2_resume_logged_op_finsert()
H A Dstr_hash.h260 struct bkey_i *insert, in bch2_hash_set_or_get_in_snapshot()
319 struct bkey_i *insert, in bch2_hash_set_in_snapshot()
341 struct bkey_i *insert, in bch2_hash_set()
359 struct bkey_i *delete; in bch2_hash_delete_at()
H A Dextent_update.c107 struct bkey_i *insert, in bch2_extent_atomic_end()
162 struct bkey_i *k) in bch2_extent_trim_atomic()
H A Dbkey_methods.h97 struct bkey_i deleted; in bch2_key_trigger_old()
111 struct bkey_i deleted; in bch2_key_trigger_new()
H A Dsb-clean.c55 static struct bkey_i *btree_root_find(struct bch_fs *c, in btree_root_find()
60 struct bkey_i *k; in btree_root_find()
107 struct bkey_i *k1, *k2; in bch2_verify_superblock_clean()
H A Dbtree_trans_commit.c52 struct bkey_i *j_k = in verify_update_old_key()
155 struct bkey_i *insert) in bch2_btree_bset_insert_key()
289 struct bkey_i *insert, in bch2_btree_insert_key_leaf()
384 struct bkey_i *new_k; in btree_key_can_insert_cached_slowpath()
422 struct bkey_i *new_k; in btree_key_can_insert_cached()
467 struct bkey_i *new = i->k; in run_one_mem_trigger()
764 bkey_reassemble((struct bkey_i *) entry->start, in bch2_trans_commit_write_locked()
772 bkey_copy((struct bkey_i *) entry->start, i->k); in bch2_trans_commit_write_locked()
H A Dbtree_journal_iter_types.h18 struct bkey_i *k;
H A Dfsck.h11 struct bkey_i *);

123