| /linux/fs/bcachefs/ |
| A D | btree_locking.h | 86 struct btree_path *path, in mark_btree_node_locked()
153 struct btree_path *path) in __bch2_btree_path_unlock()
169 struct btree_path *linked; in bch2_btree_node_unlock_write_inlined()
262 struct btree_path *path; in btree_node_lock_increment()
276 struct btree_path *path, in btree_node_lock()
302 struct btree_path *path, in __btree_node_lock_write()
324 struct btree_path *path, in bch2_btree_node_lock_write()
331 struct btree_path *,
385 struct btree_path *path, in bch2_btree_path_upgrade()
423 struct btree_path *path) in btree_path_set_level_up()
[all …]
|
| A D | btree_locking.c | 19 struct btree_path *skip, in bch2_btree_node_lock_counts()
23 struct btree_path *path; in bch2_btree_node_lock_counts()
439 struct btree_path *path, in btree_path_get_locks()
576 struct btree_path *path) in bch2_btree_path_relock_intent()
658 struct btree_path *linked; in __bch2_btree_path_upgrade()
676 struct btree_path *path, in __bch2_btree_path_downgrade()
710 struct btree_path *path; in bch2_trans_downgrade()
723 struct btree_path *path; in __bch2_trans_unlock()
774 struct btree_path *path; in __bch2_trans_relock()
864 struct btree_path *path; in bch2_trans_locked()
[all …]
|
| A D | btree_iter.h | 48 static inline void btree_path_set_dirty(struct btree_path *path, in btree_path_set_dirty()
54 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node()
84 static inline unsigned long *trans_paths_nr(struct btree_path *paths) in trans_paths_nr()
100 static inline struct btree_path *
136 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path) in next_btree_path()
147 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path) in prev_btree_path()
179 static inline bool __path_has_node(const struct btree_path *path, in __path_has_node()
186 static inline struct btree_path *
190 struct btree_path *path; in __trans_next_path_with_node()
362 struct btree_path *, unsigned);
[all …]
|
| A D | btree_iter.c | 240 struct btree_path *path; in bch2_trans_verify_paths()
332 struct btree_path *path; in bch2_assert_pos_locked()
408 struct btree_path *path; in bch2_btree_path_fix_key_modified()
517 struct btree_path *linked; in bch2_btree_node_iter_fix()
673 struct btree_path *prev; in bch2_trans_node_add()
706 struct btree_path *path; in bch2_trans_node_reinit_iter()
983 struct btree_path *path; in bch2_btree_path_traverse_all()
1325 struct btree_path *sib; in have_path_at_pos()
1340 struct btree_path *sib; in have_node_at_pos()
1714 struct btree_path *path; in bch2_path_get()
[all …]
|
| A D | trace.h | 551 struct btree_path *path,
621 struct btree_path *path,
1076 struct btree_path *path),
1105 struct btree_path *path),
1112 struct btree_path *path),
1119 struct btree_path *path,
1171 struct btree_path *path),
1178 struct btree_path *path),
1284 struct btree_path *path,
1322 struct btree_path *path,
[all …]
|
| A D | btree_types.h | 314 struct btree_path { struct
348 static inline struct btree_path_level *path_l(struct btree_path *path) in path_l() argument
353 static inline unsigned long btree_path_ip_allocated(struct btree_path *path) in btree_path_ip_allocated()
477 struct btree_path paths[];
484 struct btree_path *paths;
551 struct btree_path _paths[BTREE_ITER_INITIAL];
556 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path()
561 static inline struct btree_path *btree_iter_key_cache_path(struct btree_trans *trans, struct btree_… in btree_iter_key_cache_path()
|
| A D | btree_key_cache.h | 43 int bch2_btree_path_traverse_cached(struct btree_trans *, struct btree_path *,
49 struct btree_path *);
|
| A D | btree_key_cache.c | 42 static inline void btree_path_cached_set(struct btree_trans *trans, struct btree_path *path, in btree_path_cached_set()
136 bkey_cached_alloc(struct btree_trans *trans, struct btree_path *path, unsigned key_u64s) in bkey_cached_alloc()
200 static int btree_key_cache_create(struct btree_trans *trans, struct btree_path *path, in btree_key_cache_create()
282 struct btree_path *ck_path, in btree_key_cache_fill()
321 struct btree_path *path) in btree_path_traverse_cached_fast()
350 int bch2_btree_path_traverse_cached(struct btree_trans *trans, struct btree_path *path, in bch2_btree_path_traverse_cached()
447 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
456 struct btree_path *path2; in btree_key_cache_flush_pos()
569 struct btree_path *path) in bch2_btree_key_cache_drop()
|
| A D | btree_cache.h | 36 struct btree *bch2_btree_node_get(struct btree_trans *, struct btree_path *,
43 int bch2_btree_node_prefetch(struct btree_trans *, struct btree_path *,
|
| A D | btree_update.c | 362 struct btree_path *btree_path = trans->paths + path_idx; in flush_new_cached_update() local
370 bch2_btree_path_peek_slot_exact(btree_path, &k); in flush_new_cached_update()
377 btree_path_set_should_be_locked(trans, btree_path); in flush_new_cached_update()
393 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_by_path()
473 struct btree_path *path) in bch2_trans_update_get_key_cache()
475 struct btree_path *key_cache_path = btree_iter_key_cache_path(trans, iter); in bch2_trans_update_get_key_cache()
534 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update()
|
| A D | Kconfig | 91 bool "Extra btree_path tracepoints"
94 Enable extra tracepoints for debugging btree_path operations; we don't
|
| A D | btree_trans_commit.c | 87 struct btree_path *path, in bch2_btree_node_prep_for_write()
152 struct btree_path *path, in bch2_btree_bset_insert_key()
288 struct btree_path *path, in bch2_btree_insert_key_leaf()
333 struct btree_path *path = trans->paths + i->path; in btree_insert_entry_checks()
381 struct btree_path *path, unsigned new_u64s) in btree_key_can_insert_cached_slowpath()
417 struct btree_path *path, unsigned u64s) in btree_key_can_insert_cached()
817 struct btree_path *path = trans->paths + i->path; in bch2_trans_commit_write_locked()
1081 struct btree_path *path = trans->paths + i->path; in __bch2_trans_commit()
|
| A D | btree_update.h | 12 struct btree_path *, struct btree *);
13 bool bch2_btree_bset_insert_key(struct btree_trans *, struct btree_path *,
21 void bch2_btree_insert_key_leaf(struct btree_trans *, struct btree_path *,
|
| A D | btree_journal_iter.h | 51 int bch2_btree_and_journal_iter_prefetch(struct btree_trans *, struct btree_path *,
|
| A D | btree_update_interior.c | 243 struct btree_path *path, in bch2_btree_node_free_inmem()
273 struct btree_path *path; in bch2_btree_node_free_never_used()
767 struct btree_path *path = trans->paths + path_idx; in btree_update_nodes_written()
1312 struct btree_path *path, in bch2_btree_set_root()
1353 struct btree_path *path, in bch2_insert_fixup_btree_ptr()
1407 struct btree_path *path, in bch2_btree_insert_keys_interior()
1569 struct btree_path *path = trans->paths + path_idx; in btree_split_insert_keys()
1778 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node()
1882 struct btree_path *path = trans->paths + path_idx; in __btree_increase_depth()
2146 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
[all …]
|
| A D | btree_write_buffer.c | 121 struct btree_path *path = btree_iter_path(trans, iter); in wb_flush_one_slowpath()
142 struct btree_path *path; in wb_flush_one()
344 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
395 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
|
| A D | btree_update_interior.h | 142 struct btree_path *path = trans->paths + path_idx; in bch2_foreground_maybe_merge_sibling()
|
| A D | btree_cache.c | 895 struct btree_path *path, in bch2_btree_node_fill()
1038 static struct btree *__bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, in __bch2_btree_node_get()
1162 struct btree *bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, in bch2_btree_node_get()
1321 struct btree_path *path, in bch2_btree_node_prefetch()
|
| A D | recovery.c | 212 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_journal_replay_key()
|
| A D | btree_gc.c | 584 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
|
| A D | alloc_background.c | 1038 struct btree_path *path = btree_iter_path(iter->trans, iter); in bch2_get_key_or_hole()
|