Searched refs:btree_path_idx_t (Results 1 – 8 of 8) sorted by relevance
/linux/fs/bcachefs/ ! |
H A D | btree_types.h | 309 typedef u16 btree_path_idx_t; typedef 312 btree_path_idx_t sorted_idx; 367 btree_path_idx_t path; 368 btree_path_idx_t update_path; 369 btree_path_idx_t key_cache_path; 435 btree_path_idx_t path; 494 btree_path_idx_t *sorted; 505 btree_path_idx_t nr_sorted; 506 btree_path_idx_t nr_paths; 507 btree_path_idx_t nr_paths_ma [all...] |
H A D | btree_update_interior.h | 137 int bch2_btree_split_leaf(struct btree_trans *, btree_path_idx_t, unsigned); 139 int bch2_btree_increase_depth(struct btree_trans *, btree_path_idx_t, unsigned); 141 int __bch2_foreground_maybe_merge(struct btree_trans *, btree_path_idx_t, 145 btree_path_idx_t path_idx, in bch2_foreground_maybe_merge_sibling() 165 btree_path_idx_t path, in bch2_foreground_maybe_merge()
|
H A D | btree_key_cache.h | 43 int bch2_btree_path_traverse_cached(struct btree_trans *, btree_path_idx_t, unsigned);
|
H A D | trace.h | 1449 __field(btree_path_idx_t, path_idx ) 1453 __field(btree_path_idx_t, update_idx ) 1454 __field(btree_path_idx_t, nr_updates ) 1559 __field(btree_path_idx_t, idx ) 1586 __field(btree_path_idx_t, idx ) 1624 __field(btree_path_idx_t, idx ) 1669 __field(btree_path_idx_t, idx ) 1758 __field(btree_path_idx_t, idx ) 1826 TP_PROTO(struct btree_trans *trans, btree_path_idx_t path, struct btree_path *dup), 1830 __field(btree_path_idx_t, id [all...] |
H A D | btree_update.c | 29 bch2_trans_update_by_path(struct btree_trans *, btree_path_idx_t, 336 btree_path_idx_t path_idx = in flush_new_cached_update() 366 bch2_trans_update_by_path(struct btree_trans *trans, btree_path_idx_t path_idx, in bch2_trans_update_by_path() 499 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update_ip()
|
H A D | btree_update_interior.c | 42 btree_path_idx_t, struct btree *, struct keylist *); 771 btree_path_idx_t path_idx = bch2_path_get_unlocked_mut(trans, in btree_update_nodes_written() 1611 btree_path_idx_t path_idx, in btree_split_insert_keys() 1632 btree_path_idx_t path, struct btree *b, in btree_split() 1638 btree_path_idx_t path1 = 0, path2 = 0; in btree_split() 1828 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node() 1912 btree_path_idx_t path, in bch2_btree_split_leaf() 1944 btree_path_idx_t path_idx) in __btree_increase_depth() 1984 int bch2_btree_increase_depth(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) in bch2_btree_increase_depth() 2004 btree_path_idx_t pat in __bch2_foreground_maybe_merge() [all...] |
H A D | btree_key_cache.c | 313 btree_path_idx_t ck_path_idx, in btree_key_cache_fill() 359 btree_path_idx_t path_idx) in btree_path_traverse_cached_fast() 390 btree_path_idx_t path_idx, in bch2_btree_path_traverse_cached()
|
H A D | btree_locking.c | 298 btree_path_idx_t path_idx; in bch2_check_for_deadlock()
|