| /linux-6.12.1/fs/bcachefs/ |
| D | bset.h | 273 void bch2_bset_insert(struct btree *, struct bkey_packed *, struct bkey_i *,
275 void bch2_bset_delete(struct btree *, struct bkey_packed *, unsigned);
281 const struct bkey_packed *l, in bkey_cmp_p_or_unp()
282 const struct bkey_packed *r_packed, in bkey_cmp_p_or_unp()
285 EBUG_ON(r_packed && !bkey_packed(r_packed)); in bkey_cmp_p_or_unp()
287 if (unlikely(!bkey_packed(l))) in bkey_cmp_p_or_unp()
297 bch2_bkey_to_bset_inlined(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset_inlined()
310 struct bset_tree *bch2_bkey_to_bset(struct btree *, struct bkey_packed *);
312 struct bkey_packed *bch2_bkey_prev_filter(struct btree *, struct bset_tree *,
313 struct bkey_packed *, unsigned);
[all …]
|
| D | bkey.h | 33 const struct bkey_packed *);
45 static inline void bkey_p_copy(struct bkey_packed *dst, const struct bkey_packed *src) in bkey_p_copy()
59 const struct bkey_packed *,
60 const struct bkey_packed *);
62 unsigned bch2_bkey_ffs(const struct btree *, const struct bkey_packed *);
65 int __bch2_bkey_cmp_packed_format_checked(const struct bkey_packed *,
66 const struct bkey_packed *,
71 const struct bkey_packed *,
76 const struct bkey_packed *,
77 const struct bkey_packed *);
[all …]
|
| D | bkey_sort.c | 10 const struct bkey_packed *,
11 const struct bkey_packed *);
38 static inline struct bkey_packed *sort_iter_peek(struct sort_iter *iter) in sort_iter_peek()
59 static inline struct bkey_packed *sort_iter_next(struct sort_iter *iter, in sort_iter_next()
62 struct bkey_packed *ret = sort_iter_peek(iter); in sort_iter_next()
74 const struct bkey_packed *l, in key_sort_fix_overlapping_cmp()
75 const struct bkey_packed *r) in key_sort_fix_overlapping_cmp()
98 struct bkey_packed *out = dst->start; in bch2_key_sort_fix_overlapping()
99 struct bkey_packed *k; in bch2_key_sort_fix_overlapping()
129 struct bkey_packed *in, *out = vstruct_last(dst); in bch2_sort_repack()
[all …]
|
| D | bkey_cmp.h | 89 int __bch2_bkey_cmp_packed_format_checked_inlined(const struct bkey_packed *l, in __bch2_bkey_cmp_packed_format_checked_inlined()
90 const struct bkey_packed *r, in __bch2_bkey_cmp_packed_format_checked_inlined()
96 EBUG_ON(!bkey_packed(l) || !bkey_packed(r)); in __bch2_bkey_cmp_packed_format_checked_inlined()
110 const struct bkey_packed *l, in bch2_bkey_cmp_packed_inlined()
111 const struct bkey_packed *r) in bch2_bkey_cmp_packed_inlined()
115 if (likely(bkey_packed(l) && bkey_packed(r))) in bch2_bkey_cmp_packed_inlined()
118 if (bkey_packed(l)) { in bch2_bkey_cmp_packed_inlined()
121 } else if (bkey_packed(r)) { in bch2_bkey_cmp_packed_inlined()
|
| D | bset.c | 34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset()
58 struct bkey_packed *_k, *_n; in bch2_dump_bset()
122 struct bkey_packed *k = __btree_node_offset_to_key(b, set->k); in bch2_dump_btree_node_iter()
137 struct bkey_packed *k; in bch2_btree_node_count_keys()
160 const struct bkey_packed *k, *n; in bch2_btree_node_iter_next_check()
184 struct bkey_packed *k2 = __btree_node_offset_to_key(b, set->k); in bch2_btree_node_iter_next_check()
197 struct bkey_packed *k, *p; in bch2_btree_node_iter_verify()
240 void bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where, in bch2_verify_insert_pos()
241 struct bkey_packed *insert, unsigned clobber_u64s) in bch2_verify_insert_pos()
244 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, where); in bch2_verify_insert_pos()
[all …]
|
| D | bkey.c | 14 const struct bkey_packed *k) in bch2_bkey_packed_to_binary_text()
52 static void bch2_bkey_pack_verify(const struct bkey_packed *packed, in bch2_bkey_pack_verify()
86 (struct bkey_packed *) unpacked); in bch2_bkey_pack_verify()
91 (struct bkey_packed *) &tmp); in bch2_bkey_pack_verify()
99 static inline void bch2_bkey_pack_verify(const struct bkey_packed *packed, in bch2_bkey_pack_verify()
113 struct bkey_packed *k) in pack_state_init()
127 struct bkey_packed *k) in pack_state_finish()
144 const struct bkey_packed *k) in unpack_state_init()
226 struct bkey_packed *out, in bch2_bkey_transform_key()
228 const struct bkey_packed *in) in bch2_bkey_transform_key()
[all …]
|
| D | bkey_sort.h | 11 struct bkey_packed *k, *end;
33 struct bkey_packed *k, in sort_iter_add()
34 struct bkey_packed *end) in sort_iter_add()
51 unsigned bch2_sort_keys_keep_unwritten_whiteouts(struct bkey_packed *, struct sort_iter *);
52 unsigned bch2_sort_keys(struct bkey_packed *, struct sort_iter *);
|
| D | bkey_methods.h | 119 void bch2_bkey_renumber(enum btree_node_type, struct bkey_packed *, int);
122 int, struct bkey_format *, struct bkey_packed *);
128 struct bkey_packed *k) in bch2_bkey_compat()
|
| D | btree_update_interior.h | 211 static inline struct bkey_packed *unwritten_whiteouts_start(struct btree *b) in unwritten_whiteouts_start()
216 static inline struct bkey_packed *unwritten_whiteouts_end(struct btree *b) in unwritten_whiteouts_end()
236 static inline bool bkey_written(struct btree *b, struct bkey_packed *k) in bkey_written()
299 struct bkey_packed k; in push_whiteout()
|
| D | bkey_methods.c | 366 struct bkey_packed *k, in bch2_bkey_renumber()
385 struct bkey_packed *k) in __bch2_bkey_compat()
413 if (!bkey_packed(k)) { in __bch2_bkey_compat()
460 if (!bkey_packed(k)) { in __bch2_bkey_compat()
|
| D | bkey_buf.h | 42 struct bkey_packed *src) in bch2_bkey_buf_unpack()
|
| D | btree_io.c | 78 struct bkey_packed *start, in verify_no_dups()
79 struct bkey_packed *end) in verify_no_dups()
82 struct bkey_packed *k, *p; in verify_no_dups()
100 struct bkey_packed *k; in set_needs_whiteout()
134 struct bkey_packed **ptrs, unsigned nr) in sort_bkey_ptrs()
172 struct bkey_packed *new_whiteouts, **ptrs, **ptrs_end, *k; in bch2_sort_whiteouts()
230 struct bkey_packed *k, *n, *out, *start, *end; in bch2_drop_whiteouts()
516 struct btree *b, struct bset *i, struct bkey_packed *k, in btree_err_msg()
547 struct bkey_packed *k, in __btree_err()
638 struct bkey_packed *k; in bch2_btree_node_drop_keys_outside_node()
[all …]
|
| D | btree_iter.c | 144 struct bkey_packed *p, *k; in bch2_btree_path_verify_level()
377 struct bkey_packed *k) in btree_node_iter_set_set_pos()
393 struct bkey_packed *where) in __bch2_btree_path_fix_key_modified()
406 struct bkey_packed *where) in bch2_btree_path_fix_key_modified()
421 struct bkey_packed *where, in __bch2_btree_node_iter_fix()
425 const struct bkey_packed *end = btree_bkey_last(b, t); in __bch2_btree_node_iter_fix()
483 struct bkey_packed *k, *k2, *p; in __bch2_btree_node_iter_fix()
512 struct bkey_packed *where, in bch2_btree_node_iter_fix()
541 struct bkey_packed *k) in __btree_iter_unpack()
595 struct bkey_packed *k; in btree_path_advance_to_pos()
[all …]
|
| D | btree_types.h | 686 __btree_node_key_to_offset(const struct btree *b, const struct bkey_packed *k) in __btree_node_key_to_offset()
691 static inline struct bkey_packed *
|
| D | debug.c | 131 struct bkey_packed *k; in __bch2_btree_verify()
227 struct bkey_packed *k; in bch2_btree_node_ondisk_to_text()
446 struct bkey_packed *_k = in bch2_read_bfloat_failed()
|
| D | btree_update_interior.c | 163 struct bkey_packed *k; in __bch2_btree_calc_format()
1359 struct bkey_packed *k; in bch2_insert_fixup_btree_ptr()
1413 struct bkey_packed *k; in bch2_btree_insert_keys_interior()
1451 struct bkey_packed *k; in __btree_split_node()
1456 struct bkey_packed *out[2]; in __btree_split_node()
1525 if (bch2_bkey_transform(&n[i]->format, out[i], bkey_packed(k) in __btree_split_node()
|
| D | btree_iter.h | 297 struct btree *, struct bkey_packed *);
300 struct bkey_packed *, unsigned, unsigned);
|
| D | bcachefs_format.h | 261 struct bkey_packed { struct
1396 struct bkey_packed start[0];
|
| D | btree_trans_commit.c | 157 struct bkey_packed *k; in bch2_btree_bset_insert_key()
|