Home
last modified time | relevance | path

Searched refs:btree_path (Results 1 – 22 of 22) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.h80 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()
266 struct btree_path *path; in btree_node_lock_increment()
280 struct btree_path *path, in btree_node_lock()
306 struct btree_path *path, in __btree_node_lock_write()
328 struct btree_path *path, in bch2_btree_node_lock_write()
335 struct btree_path *,
389 struct btree_path *path, in bch2_btree_path_upgrade()
427 struct btree_path *path) in btree_path_set_level_up()
[all …]
H A Dbtree_locking.c20 struct btree_path *skip, in bch2_btree_node_lock_counts()
24 struct btree_path *path; in bch2_btree_node_lock_counts()
454 struct btree_path *path, in btree_path_get_locks()
659 struct btree_path *linked; in __bch2_btree_path_upgrade()
677 struct btree_path *path, in __bch2_btree_path_downgrade()
711 struct btree_path *path; in bch2_trans_downgrade()
724 struct btree_path *path; in __bch2_trans_unlock()
775 struct btree_path *path; in __bch2_trans_relock()
824 struct btree_path *path; in bch2_trans_unlock_write()
879 struct btree_path *path; in bch2_trans_locked()
[all …]
H A Dbtree_iter.h49 static inline void btree_path_set_dirty(struct btree_path *path, in btree_path_set_dirty()
55 static inline struct btree *btree_path_node(struct btree_path *path, in btree_path_node()
85 static inline unsigned long *trans_paths_nr(struct btree_path *paths) in trans_paths_nr()
101 static inline struct btree_path *
137 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path) in next_btree_path()
148 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path) in prev_btree_path()
180 static inline bool __path_has_node(const struct btree_path *path, in __path_has_node()
187 static inline struct btree_path *
191 struct btree_path *path; in __trans_next_path_with_node()
377 struct btree_path *, unsigned);
[all …]
H A Dbtree_iter.c240 struct btree_path *path; in bch2_trans_verify_paths()
332 struct btree_path *path; in bch2_assert_pos_locked()
410 struct btree_path *path; in bch2_btree_path_fix_key_modified()
519 struct btree_path *linked; in bch2_btree_node_iter_fix()
661 struct btree_path *prev; in bch2_trans_node_add()
691 struct btree_path *path; in bch2_trans_node_drop()
707 struct btree_path *path; in bch2_trans_node_reinit_iter()
989 struct btree_path *path; in bch2_btree_path_traverse_all()
1331 struct btree_path *sib; in have_path_at_pos()
1346 struct btree_path *sib; in have_node_at_pos()
[all …]
H A Dtrace.h599 struct btree_path *path,
669 struct btree_path *path,
1085 struct btree_path *path),
1114 struct btree_path *path),
1121 struct btree_path *path),
1128 struct btree_path *path,
1180 struct btree_path *path),
1187 struct btree_path *path),
1293 struct btree_path *path,
1337 struct btree_path *path,
[all …]
H A Dbtree_key_cache.c136 bkey_cached_alloc(struct btree_trans *trans, struct btree_path *path, unsigned key_u64s) in bkey_cached_alloc()
201 struct btree_path *path, in btree_key_cache_create()
202 struct btree_path *ck_path, in btree_key_cache_create()
291 struct btree_path *ck_path, in do_trace_key_cache_fill()
307 struct btree_path *ck_path = trans->paths + ck_path_idx; in btree_key_cache_fill()
354 struct btree_path *path = trans->paths + path_idx; in btree_path_traverse_cached_fast()
393 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_traverse_cached()
489 struct btree_path *path = btree_iter_path(trans, &c_iter); in btree_key_cache_flush_pos()
498 struct btree_path *path2; in btree_key_cache_flush_pos()
611 struct btree_path *path) in bch2_btree_key_cache_drop()
[all …]
H A Dbtree_types.h314 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;
557 struct btree_path _paths[BTREE_ITER_INITIAL];
562 static inline struct btree_path *btree_iter_path(struct btree_trans *trans, struct btree_iter *iter) in btree_iter_path()
567 static inline struct btree_path *btree_iter_key_cache_path(struct btree_trans *trans, struct btree_… in btree_iter_key_cache_path()
H A Dbtree_cache.h36 struct btree *bch2_btree_node_get(struct btree_trans *, struct btree_path *,
43 int bch2_btree_node_prefetch(struct btree_trans *, struct btree_path *,
H A Dbtree_update.c362 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()
474 struct btree_path *path) in bch2_trans_update_get_key_cache()
476 struct btree_path *key_cache_path = btree_iter_key_cache_path(trans, iter); in bch2_trans_update_get_key_cache()
537 struct btree_path *path = trans->paths + path_idx; in bch2_trans_update()
H A Dbtree_trans_commit.c87 struct btree_path *path, in bch2_btree_node_prep_for_write()
152 struct btree_path *path, in bch2_btree_bset_insert_key()
289 struct btree_path *path, in bch2_btree_insert_key_leaf()
334 struct btree_path *path = trans->paths + i->path; in btree_insert_entry_checks()
383 struct btree_path *path, unsigned new_u64s) in btree_key_can_insert_cached_slowpath()
419 struct btree_path *path, unsigned u64s) in btree_key_can_insert_cached()
765 struct btree_path *path = trans->paths + i->path; in bch2_trans_commit_write_locked()
1011 struct btree_path *path = trans->paths + i->path; in __bch2_trans_commit()
H A DKconfig100 bool "Extra btree_path tracepoints"
103 Enable extra tracepoints for debugging btree_path operations; we don't
H A Dbtree_update.h12 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 *,
H A Dbtree_key_cache.h48 struct btree_path *);
H A Dbtree_journal_iter.h61 int bch2_btree_and_journal_iter_prefetch(struct btree_trans *, struct btree_path *,
H A Dbtree_write_buffer.c119 struct btree_path *path = btree_iter_path(trans, iter); in wb_flush_one_slowpath()
140 struct btree_path *path; in wb_flush_one()
363 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
414 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_btree_write_buffer_flush_locked()
H A Dbtree_update_interior.c234 struct btree_path *path, in bch2_btree_node_free_inmem()
749 struct btree_path *path = trans->paths + path_idx; in btree_update_nodes_written()
1295 struct btree_path *path, in bch2_btree_set_root()
1336 struct btree_path *path, in bch2_insert_fixup_btree_ptr()
1395 struct btree_path *path, in bch2_btree_insert_keys_interior()
1573 struct btree_path *path = trans->paths + path_idx; in btree_split_insert_keys()
1790 struct btree_path *path = trans->paths + path_idx, *linked; in bch2_btree_insert_node()
1905 struct btree_path *path = trans->paths + path_idx; in __btree_increase_depth()
2197 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_node_rewrite()
2454 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
[all …]
H A Dbtree_update_interior.h142 struct btree_path *path = trans->paths + path_idx; in bch2_foreground_maybe_merge_sibling()
H A Dbtree_cache.c898 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()
H A Dbackpointers.c1028 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
1052 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_pin_backpointer_nodes_with_missing()
H A Drecovery.c269 struct btree_path *path = btree_iter_path(trans, &iter); in bch2_journal_replay_key()
H A Dbtree_gc.c612 struct btree_path *path = btree_iter_path(trans, iter); in bch2_gc_mark_key()
H A Dalloc_background.c1058 struct btree_path *path = btree_iter_path(trans, iter); in bch2_get_key_or_hole()