Searched refs:btree_path_idx_t (Results 1 – 8 of 8) sorted by relevance
| /linux/fs/bcachefs/ |
| A D | btree_types.h | 312 typedef u16 btree_path_idx_t; typedef
315 btree_path_idx_t sorted_idx;
371 btree_path_idx_t path;
372 btree_path_idx_t update_path;
373 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 …]
|
| A D | btree_iter.h | 163 btree_path_idx_t sorted_idx;
164 btree_path_idx_t path_idx;
204 btree_path_idx_t __bch2_btree_path_make_mut(struct btree_trans *, btree_path_idx_t,
207 static inline btree_path_idx_t __must_check
209 btree_path_idx_t path, bool intent, in bch2_btree_path_make_mut()
219 btree_path_idx_t __must_check
220 __bch2_btree_path_set_pos(struct btree_trans *, btree_path_idx_t,
223 static inline btree_path_idx_t __must_check
225 btree_path_idx_t path, struct bpos new_pos, in bch2_btree_path_set_pos()
234 btree_path_idx_t,
[all …]
|
| A D | btree_update_interior.h | 130 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()
|
| A D | btree_iter.c | 26 btree_path_idx_t, btree_path_idx_t);
37 static btree_path_idx_t btree_path_alloc(struct btree_trans *, btree_path_idx_t);
1133 btree_path_idx_t path_idx, in bch2_btree_path_traverse_one()
1239 static btree_path_idx_t btree_path_clone(struct btree_trans *trans, btree_path_idx_t src, in btree_path_clone()
1263 btree_path_idx_t __must_check
1643 nr * sizeof(btree_path_idx_t) + 8 + in btree_paths_realloc()
1656 btree_path_idx_t *sorted = p; in btree_paths_realloc()
1677 btree_path_idx_t pos) in btree_path_alloc()
2468 btree_path_idx_t saved_path = 0; in bch2_btree_iter_peek_prev()
2858 btree_path_idx_t pos, in btree_path_list_add()
[all …]
|
| A D | trace.h | 1455 __field(btree_path_idx_t, path_idx )
1459 __field(btree_path_idx_t, update_idx )
1460 __field(btree_path_idx_t, nr_updates )
1565 __field(btree_path_idx_t, idx )
1592 __field(btree_path_idx_t, idx )
1630 __field(btree_path_idx_t, idx )
1675 __field(btree_path_idx_t, idx )
1764 __field(btree_path_idx_t, idx )
1836 __field(btree_path_idx_t, idx )
1859 TP_PROTO(btree_path_idx_t path),
[all …]
|
| A D | btree_update_interior.c | 39 btree_path_idx_t, struct btree *, struct keylist *);
765 btree_path_idx_t path_idx = bch2_path_get_unlocked_mut(trans, in btree_update_nodes_written()
1565 btree_path_idx_t path_idx, in btree_split_insert_keys()
1584 btree_path_idx_t path, struct btree *b, in btree_split()
1590 btree_path_idx_t path1 = 0, path2 = 0; in btree_split()
1774 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node()
1847 btree_path_idx_t path, in bch2_btree_split_leaf()
1879 btree_path_idx_t path_idx) in __btree_increase_depth()
1938 btree_path_idx_t path, in __bch2_foreground_maybe_merge()
1952 btree_path_idx_t sib_path = 0, new_path = 0; in __bch2_foreground_maybe_merge()
[all …]
|
| A D | btree_update.c | 27 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()
514 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update()
|
| A D | btree_locking.c | 279 btree_path_idx_t path_idx; in bch2_check_for_deadlock()
|
Completed in 29 milliseconds