Home
last modified time | relevance | path

Searched refs:btree_path_idx_t (Results 1 – 10 of 10) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_types.h312 typedef u16 btree_path_idx_t; typedef
315 btree_path_idx_t sorted_idx;
370 btree_path_idx_t path;
371 btree_path_idx_t update_path;
372 btree_path_idx_t key_cache_path;
438 btree_path_idx_t path;
485 btree_path_idx_t *sorted;
492 btree_path_idx_t nr_sorted;
493 btree_path_idx_t nr_paths;
494 btree_path_idx_t nr_paths_max;
[all …]
H A Dbtree_iter.h164 btree_path_idx_t sorted_idx;
165 btree_path_idx_t path_idx;
205 btree_path_idx_t __bch2_btree_path_make_mut(struct btree_trans *, btree_path_idx_t,
208 static inline btree_path_idx_t __must_check
210 btree_path_idx_t path, bool intent, in bch2_btree_path_make_mut()
220 btree_path_idx_t __must_check
221 __bch2_btree_path_set_pos(struct btree_trans *, btree_path_idx_t,
224 static inline btree_path_idx_t __must_check
226 btree_path_idx_t path, struct bpos new_pos, in bch2_btree_path_set_pos()
235 btree_path_idx_t,
[all …]
H A Dbtree_update_interior.h130 int bch2_btree_split_leaf(struct btree_trans *, btree_path_idx_t, unsigned);
132 int bch2_btree_increase_depth(struct btree_trans *, btree_path_idx_t, unsigned);
134 int __bch2_foreground_maybe_merge(struct btree_trans *, btree_path_idx_t,
138 btree_path_idx_t path_idx, in bch2_foreground_maybe_merge_sibling()
158 btree_path_idx_t path, in bch2_foreground_maybe_merge()
H A Dbtree_iter.c26 btree_path_idx_t, btree_path_idx_t);
37 static btree_path_idx_t btree_path_alloc(struct btree_trans *, btree_path_idx_t);
1139 btree_path_idx_t path_idx, in bch2_btree_path_traverse_one()
1245 static btree_path_idx_t btree_path_clone(struct btree_trans *trans, btree_path_idx_t src, in btree_path_clone()
1269 btree_path_idx_t __must_check
1656 nr * sizeof(btree_path_idx_t) + 8 + in btree_paths_realloc()
1669 btree_path_idx_t *sorted = p; in btree_paths_realloc()
1690 btree_path_idx_t pos) in btree_path_alloc()
2610 btree_path_idx_t saved_path = 0; in bch2_btree_iter_peek_prev_min()
3007 btree_path_idx_t pos, in btree_path_list_add()
[all …]
H A Dtrace.h1499 __field(btree_path_idx_t, path_idx )
1503 __field(btree_path_idx_t, update_idx )
1504 __field(btree_path_idx_t, nr_updates )
1609 __field(btree_path_idx_t, idx )
1636 __field(btree_path_idx_t, idx )
1674 __field(btree_path_idx_t, idx )
1719 __field(btree_path_idx_t, idx )
1808 __field(btree_path_idx_t, idx )
1880 __field(btree_path_idx_t, idx )
1903 TP_PROTO(btree_path_idx_t path),
[all …]
H A Dbtree_key_cache.h43 int bch2_btree_path_traverse_cached(struct btree_trans *, btree_path_idx_t, unsigned);
H A Dbtree_update_interior.c41 btree_path_idx_t, struct btree *, struct keylist *);
747 btree_path_idx_t path_idx = bch2_path_get_unlocked_mut(trans, in btree_update_nodes_written()
1569 btree_path_idx_t path_idx, in btree_split_insert_keys()
1590 btree_path_idx_t path, struct btree *b, in btree_split()
1596 btree_path_idx_t path1 = 0, path2 = 0; in btree_split()
1786 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node()
1870 btree_path_idx_t path, in bch2_btree_split_leaf()
1902 btree_path_idx_t path_idx) in __btree_increase_depth()
1961 btree_path_idx_t path, in __bch2_foreground_maybe_merge()
1975 btree_path_idx_t sib_path = 0, new_path = 0; in __bch2_foreground_maybe_merge()
[all …]
H A Dbtree_update.c27 bch2_trans_update_by_path(struct btree_trans *, btree_path_idx_t,
355 btree_path_idx_t path_idx = in flush_new_cached_update()
385 bch2_trans_update_by_path(struct btree_trans *trans, btree_path_idx_t path_idx, in bch2_trans_update_by_path()
517 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update()
H A Dbtree_key_cache.c304 btree_path_idx_t ck_path_idx, in btree_key_cache_fill()
350 btree_path_idx_t path_idx) in btree_path_traverse_cached_fast()
381 btree_path_idx_t path_idx, in bch2_btree_path_traverse_cached()
H A Dbtree_locking.c294 btree_path_idx_t path_idx; in bch2_check_for_deadlock()