Home
last modified time | relevance | path

Searched refs:bkey_packed (Results 1 – 19 of 19) sorted by relevance

/linux/fs/bcachefs/
A Dbset.h287 if (unlikely(!bkey_packed(l))) in bkey_cmp_p_or_unp()
315 static inline struct bkey_packed *
369 const struct bkey_packed *l, in bkey_iter_cmp()
370 const struct bkey_packed *r) in bkey_iter_cmp()
388 const struct bkey_packed *l, in bkey_iter_pos_cmp()
422 struct bkey_packed *k; in bch2_btree_node_iter_peek()
467 struct bkey_packed *k, in btree_keys_account_key()
473 if (bkey_packed(k)) in btree_keys_account_key()
480 struct bkey_packed *k, in btree_keys_account_val_delta()
512 struct bkey_packed *);
[all …]
A Dbkey.h45 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 *);
71 const struct bkey_packed *,
76 const struct bkey_packed *,
77 const struct bkey_packed *);
81 const struct bkey_packed *,
224 #define bkey_packed(_k) \ macro
361 struct bkey_packed *,
392 const struct bkey_packed *);
[all …]
A Dbkey_sort.c10 const struct bkey_packed *,
11 const struct bkey_packed *);
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()
158 const struct bkey_packed *l, in keep_unwritten_whiteouts_cmp()
159 const struct bkey_packed *r) in keep_unwritten_whiteouts_cmp()
175 struct bkey_packed *in, *next, *out = dst; in bch2_sort_keys_keep_unwritten_whiteouts()
[all …]
A Dbkey_cmp.h89 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()
A Dbset.c58 struct bkey_packed *_k, *_n; in bch2_dump_bset()
137 struct bkey_packed *k; in bch2_btree_node_count_keys()
197 struct bkey_packed *k, *p; in bch2_btree_node_iter_verify()
569 EBUG_ON(!bkey_packed(k)); in bkey_mantissa()
608 if (!bkey_packed(l) || !bkey_packed(r) || !bkey_packed(m) || in make_bfloat()
679 struct bkey_packed *k; in __build_rw_aux_tree()
822 struct bkey_packed *p; in __bkey_prev()
1099 struct bkey_packed *k; in bset_search_tree()
1185 struct bkey_packed *m) in bch2_bset_search_linear()
1243 struct bkey_packed *k; in btree_node_iter_init_pack_failed()
[all …]
A Dbkey.c14 const struct bkey_packed *k) in bch2_bkey_packed_to_binary_text()
91 (struct bkey_packed *) &tmp); in bch2_bkey_pack_verify()
113 struct bkey_packed *k) in pack_state_init()
127 struct bkey_packed *k) in pack_state_finish()
226 struct bkey_packed *out, in bch2_bkey_transform_key()
253 struct bkey_packed *out, in bch2_bkey_transform()
255 const struct bkey_packed *in) in bch2_bkey_transform()
369 struct bkey_packed tmp; in bch2_bkey_pack()
404 struct bkey_packed k) in bkey_packed_successor()
534 struct bkey_packed successor; in bch2_bkey_pack_pos_lossy()
[all …]
A Dbkey_sort.h11 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 *);
A Dbkey_methods.h119 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()
A Dbtree_update_interior.h211 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()
A Dbkey_methods.c366 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()
A Dbkey_buf.h42 struct bkey_packed *src) in bch2_bkey_buf_unpack()
A Dbtree_io.c78 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()
230 struct bkey_packed *k, *n, *out, *start, *end; in bch2_drop_whiteouts()
547 struct bkey_packed *k, in __btree_err()
638 struct bkey_packed *k; in bch2_btree_node_drop_keys_outside_node()
845 struct bset *i, struct bkey_packed *k) in bkey_packed_valid()
866 struct bkey_packed *k, *prev = NULL; in validate_bset_keys()
[all …]
A Dbtree_iter.c144 struct bkey_packed *p, *k; in bch2_btree_path_verify_level()
377 struct bkey_packed *k) in btree_node_iter_set_set_pos()
406 struct bkey_packed *where) in bch2_btree_path_fix_key_modified()
421 struct bkey_packed *where, 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()
783 struct bkey_packed *k; in btree_path_prefetch()
855 struct bkey_packed *k; in btree_node_mem_ptr_set()
[all …]
A Dbtree_types.h686 __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 *
A Ddebug.c131 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()
A Dbtree_update_interior.c163 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()
A Dbtree_iter.h297 struct btree *, struct bkey_packed *);
300 struct bkey_packed *, unsigned, unsigned);
A Dbcachefs_format.h261 struct bkey_packed { struct
1396 struct bkey_packed start[0];
A Dbtree_trans_commit.c157 struct bkey_packed *k; in bch2_btree_bset_insert_key()

Completed in 51 milliseconds