Searched refs:bkey_i (Results 1 - 25 of 61) sorted by relevance

123

/linux-master/fs/bcachefs/
H A Dextent_update.h8 struct bkey_i *, struct bpos *);
10 struct bkey_i *);
H A Dkeylist_types.h7 struct bkey_i *keys;
11 struct bkey_i *top;
H A Dlogged_ops.h11 static inline int bch2_logged_op_update(struct btree_trans *trans, struct bkey_i *op)
17 int bch2_logged_op_start(struct btree_trans *, struct bkey_i *);
18 void bch2_logged_op_finish(struct btree_trans *, struct bkey_i *);
H A Dbtree_journal_iter.h29 struct bkey_i *bch2_journal_keys_peek_upto(struct bch_fs *, enum btree_id,
31 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *, enum btree_id,
38 unsigned, struct bkey_i *);
40 unsigned, struct bkey_i *);
H A Dbtree_cache.h27 const struct bkey_i *, unsigned,
30 struct btree *bch2_btree_node_get_noiter(struct btree_trans *, const struct bkey_i *,
34 const struct bkey_i *, enum btree_id, unsigned);
36 void bch2_btree_node_evict(struct btree_trans *, const struct bkey_i *);
42 static inline u64 btree_ptr_hash_val(const struct bkey_i *k)
58 static inline struct btree *btree_node_mem_ptr(const struct bkey_i *k)
H A Dbtree_update.h15 struct bkey_i *);
22 struct bkey_i *, u64);
53 struct bkey_i *, enum btree_update_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 *,
104 struct bkey_i *, enum btree_update_flags);
125 int bch2_btree_insert_clone_trans(struct btree_trans *, enum btree_id, struct bkey_i *);
129 struct bkey_i *k)
214 static inline struct bkey_i *__bch2_bkey_make_mut_noupdate(struct btree_trans *trans, struct bkey_s_c k,
218 struct bkey_i *mu
[all...]
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 Dkeylist.h26 static inline void bch2_keylist_add(struct keylist *l, const struct bkey_i *k)
47 static inline struct bkey_i *bch2_keylist_front(struct keylist *l)
53 for (struct bkey_i *_k = (_keylist)->keys; \
H A Dbkey_types.h8 * bkey_i - bkey with inline value
15 static inline struct bkey_i *bkey_next(struct bkey_i *k)
17 return (struct bkey_i *) ((u64 *) k->_data + k->k.u64s);
80 static inline struct bkey_s bkey_i_to_s(struct bkey_i *k)
85 static inline struct bkey_s_c bkey_i_to_s_c(const struct bkey_i *k)
96 * bkey_i_extent to a bkey_i - since that's always safe, instead of conversion
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 *
[all...]
H A Dlogged_ops.c13 int (*resume)(struct btree_trans *, struct bkey_i *);
65 static int __bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k)
81 int bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k)
87 void bch2_logged_op_finish(struct btree_trans *trans, struct bkey_i *k)
H A Dbkey_buf.h9 struct bkey_i *k;
33 struct bkey_i *src)
H A Dbtree_write_buffer.h34 enum btree_id, struct bkey_i *);
38 enum btree_id btree, struct bkey_i *k)
H A Dio_write.h21 enum bch_data_type, const struct bkey_i *, bool);
60 struct bkey_i *, bool *, s64 *, s64 *);
62 struct btree_iter *, struct bkey_i *,
H A Dbtree_update.c28 struct bkey_i *, enum btree_update_flags,
34 struct bkey_i **insert,
38 struct bkey_i *update;
69 struct bkey_i *insert,
132 struct bkey_i *update;
161 update = bch2_trans_kmalloc(trans, sizeof(struct bkey_i));
193 struct bkey_i *update;
287 struct bkey_i *insert,
386 struct bkey_i *k, enum btree_update_flags flags,
442 struct bkey_i *j_
[all...]
H A Dextents.h85 static inline void __extent_entry_insert(struct bkey_i *k,
467 bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
468 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)
646 void bch2_extent_ptr_decoded_append(struct bkey_i *,
692 int bch2_bkey_set_needs_rebalance(struct bch_fs *, struct bkey_i *,
717 static inline void bch2_cut_front(struct bpos where, struct bkey_i *k)
722 static inline void bch2_cut_back(struct bpos where, struct bkey_i *k)
H A Dbkey.h49 static inline void bkey_copy(struct bkey_i *dst, const struct bkey_i *src)
226 static inline struct bkey_packed *bkey_to_packed(struct bkey_i *k)
231 static inline const struct bkey_packed *bkey_to_packed_c(const struct bkey_i *k)
236 static inline struct bkey_i *packed_to_bkey(struct bkey_packed *k)
238 return bkey_packed(k) ? NULL : (struct bkey_i *) k;
383 void bch2_bkey_unpack(const struct btree *, struct bkey_i *,
385 bool bch2_bkey_pack(struct bkey_packed *, const struct bkey_i *,
501 static inline void bkey_reassemble(struct bkey_i *dst,
H A Dextent_update.c107 struct bkey_i *insert,
162 struct bkey_i *k)
H A Dbkey_methods.h141 struct bkey_i deleted;
154 struct bkey_i deleted;
H A Djournal_io.h53 for (struct bkey_i *_k = (_e)->start; \
H A Dio_misc.c153 struct bkey_i delete;
242 struct bkey_i *op_k,
271 int bch2_resume_logged_op_truncate(struct btree_trans *trans, struct bkey_i *op_k)
346 struct bkey_i *op_k,
396 struct bkey_i delete, *copy;
486 int bch2_resume_logged_op_finsert(struct btree_trans *trans, struct bkey_i *op_k)
H A Dbtree_journal_iter.c79 struct bkey_i *bch2_journal_keys_peek_upto(struct bch_fs *c, enum btree_id btree_id,
125 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *c, enum btree_id btree_id,
189 unsigned level, struct bkey_i *k)
265 unsigned level, struct bkey_i *k)
267 struct bkey_i *n;
284 struct bkey_i whiteout;
H A Dstr_hash.h266 struct bkey_i *insert,
328 struct bkey_i *insert,
346 struct bkey_i *delete;
H A Dalloc_foreground.h176 struct bkey_i *k, unsigned sectors,
202 struct bkey_i *, unsigned, bool);
H A Dbtree_io.h30 static inline unsigned btree_ptr_sectors_written(struct bkey_i *k)
135 const struct bkey_i *, unsigned);
H A Dinode.h94 struct bkey_i *bch2_inode_to_v3(struct btree_trans *, struct bkey_i *);

Completed in 175 milliseconds

123