| /fs/bcachefs/ |
| A D | btree_locking.h | 88 struct btree_path *path, in mark_btree_node_locked()
161 struct btree_path *path) in __bch2_btree_path_unlock()
177 struct btree_path *linked; in __bch2_btree_node_unlock_write()
274 struct btree_path *path; in btree_node_lock_increment()
288 struct btree_path *path, in btree_node_lock()
314 struct btree_path *path, in __btree_node_lock_write()
336 struct btree_path *path, in bch2_btree_node_lock_write()
343 struct btree_path *,
403 struct btree_path *path, in bch2_btree_path_upgrade()
444 struct btree_path *,
[all …]
|
| A D | btree_locking.c | 21 struct btree_path *skip, in bch2_btree_node_lock_counts()
25 struct btree_path *path; in bch2_btree_node_lock_counts()
457 struct btree_path *path, in btree_path_get_locks()
680 struct btree_path *linked; in __bch2_btree_path_upgrade()
719 struct btree_path *path, in __bch2_btree_path_downgrade()
753 struct btree_path *path; in bch2_trans_downgrade()
766 struct btree_path *path; in __bch2_trans_unlock()
818 struct btree_path *path; in __bch2_trans_relock()
864 struct btree_path *path; in bch2_trans_unlock_write()
915 struct btree_path *path; in bch2_trans_locked()
[all …]
|
| A D | btree_iter.c | 236 struct btree_path *path; in __bch2_trans_verify_paths()
325 struct btree_path *path; in __bch2_assert_pos_locked()
424 struct btree_path *path; in bch2_btree_path_fix_key_modified()
533 struct btree_path *linked; in bch2_btree_node_iter_fix()
675 struct btree_path *prev; in bch2_trans_node_add()
705 struct btree_path *path; in bch2_trans_node_drop()
721 struct btree_path *path; in bch2_trans_node_reinit_iter()
1003 struct btree_path *path; in bch2_btree_path_traverse_all()
1345 struct btree_path *sib; in have_path_at_pos()
1360 struct btree_path *sib; in have_node_at_pos()
[all …]
|
| A D | btree_iter.h | 50 struct btree_path *path, in btree_path_set_dirty()
57 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node()
87 static inline unsigned long *trans_paths_nr(struct btree_path *paths) in trans_paths_nr()
103 static inline struct btree_path *
139 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path) in next_btree_path()
150 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path) in prev_btree_path()
182 static inline bool __path_has_node(const struct btree_path *path, in __path_has_node()
189 static inline struct btree_path *
193 struct btree_path *path; in __trans_next_path_with_node()
388 struct btree_path *, unsigned);
[all …]
|
| A D | trace.h | 648 struct btree_path *path,
718 struct btree_path *path,
1114 struct btree_path *path),
1143 struct btree_path *path),
1150 struct btree_path *path),
1167 struct btree_path *path),
1266 struct btree_path *path,
1620 TP_PROTO(struct btree_trans *trans, struct btree_path *path, struct btree_path *new),
1653 TP_PROTO(struct btree_trans *trans, struct btree_path *path, struct btree_path *new),
1658 TP_PROTO(struct btree_trans *trans, struct btree_path *path, struct btree_path *new),
[all …]
|
| A D | btree_key_cache.c | 149 bkey_cached_alloc(struct btree_trans *trans, struct btree_path *path, unsigned key_u64s) in bkey_cached_alloc()
210 struct btree_path *path, in btree_key_cache_create()
211 struct btree_path *ck_path, in btree_key_cache_create()
300 struct btree_path *ck_path, in do_trace_key_cache_fill()
316 struct btree_path *ck_path = trans->paths + ck_path_idx; in btree_key_cache_fill()
363 struct btree_path *path = trans->paths + path_idx; in btree_path_traverse_cached_fast()
402 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_traverse_cached()
498 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
507 struct btree_path *path2; in btree_key_cache_flush_pos()
620 struct btree_path *path) in bch2_btree_key_cache_drop()
[all …]
|
| A D | btree_types.h | 311 struct btree_path { struct
345 static inline struct btree_path_level *path_l(struct btree_path *path) in path_l() argument
350 static inline unsigned long btree_path_ip_allocated(struct btree_path *path) in btree_path_ip_allocated()
474 struct btree_path paths[];
493 struct btree_path *paths;
571 struct btree_path _paths[BTREE_ITER_INITIAL];
576 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path()
581 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_update.c | 343 struct btree_path *btree_path = trans->paths + path_idx; in flush_new_cached_update() local
351 bch2_btree_path_peek_slot_exact(btree_path, &k); in flush_new_cached_update()
358 btree_path_set_should_be_locked(trans, btree_path); in flush_new_cached_update()
374 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_by_path()
455 struct btree_path *path) in bch2_trans_update_get_key_cache()
457 struct btree_path *key_cache_path = btree_iter_key_cache_path(trans, iter); in bch2_trans_update_get_key_cache()
519 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update_ip()
|
| A D | btree_cache.h | 37 struct btree *bch2_btree_node_get(struct btree_trans *, struct btree_path *,
44 int bch2_btree_node_prefetch(struct btree_trans *, struct btree_path *,
|
| A D | btree_trans_commit.c | 89 struct btree_path *path, in bch2_btree_node_prep_for_write()
154 struct btree_path *path, in bch2_btree_bset_insert_key()
291 struct btree_path *path, in bch2_btree_insert_key_leaf()
336 struct btree_path *path = trans->paths + i->path; in btree_insert_entry_checks()
386 struct btree_path *path, unsigned new_u64s) in btree_key_can_insert_cached_slowpath()
423 struct btree_path *path, unsigned u64s) in btree_key_can_insert_cached()
778 struct btree_path *path = trans->paths + i->path; in bch2_trans_commit_write_locked()
1044 struct btree_path *path = trans->paths + i->path; in __bch2_trans_commit()
|
| A D | Kconfig | 100 bool "Extra btree_path tracepoints"
103 Enable extra tracepoints for debugging btree_path operations; we don't
|
| A D | btree_update.h | 13 struct btree_path *, struct btree *);
14 bool bch2_btree_bset_insert_key(struct btree_trans *, struct btree_path *,
22 void bch2_btree_insert_key_leaf(struct btree_trans *, struct btree_path *,
|
| A D | btree_key_cache.h | 48 struct btree_path *);
|
| A D | btree_journal_iter.h | 61 int bch2_btree_and_journal_iter_prefetch(struct btree_trans *, struct btree_path *,
|
| A D | btree_update_interior.c | 234 struct btree_path *path, in bch2_btree_node_free_inmem()
773 struct btree_path *path = trans->paths + path_idx; in btree_update_nodes_written()
1337 struct btree_path *path, in bch2_btree_set_root()
1378 struct btree_path *path, in bch2_insert_fixup_btree_ptr()
1437 struct btree_path *path, in bch2_btree_insert_keys_interior()
1615 struct btree_path *path = trans->paths + path_idx; in btree_split_insert_keys()
1832 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node()
1947 struct btree_path *path = trans->paths + path_idx; in __btree_increase_depth()
2244 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
2503 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
[all …]
|
| A D | btree_write_buffer.c | 120 struct btree_path *path = btree_iter_path(trans, iter); in wb_flush_one_slowpath()
141 struct btree_path *path; in wb_flush_one()
365 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
416 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
|
| A D | btree_cache.c | 898 struct btree_path *path, in bch2_btree_node_fill()
1039 static struct btree *__bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, in __bch2_btree_node_get()
1163 struct btree *bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, in bch2_btree_node_get()
1322 struct btree_path *path, in bch2_btree_node_prefetch()
|
| A D | btree_update_interior.h | 149 struct btree_path *path = trans->paths + path_idx; in bch2_foreground_maybe_merge_sibling()
|
| A D | backpointers.c | 1065 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
1089 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
|
| A D | btree_gc.c | 641 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
|
| A D | recovery.c | 275 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_journal_replay_key()
|
| A D | alloc_background.c | 1071 struct btree_path *path = btree_iter_path(trans, iter); in bch2_get_key_or_hole()
|