| /linux-6.15/fs/bcachefs/ |
| H A D | btree_iter.h | 12 void bch2_dump_trans_paths_updates(struct btree_trans *);
209 bch2_btree_path_make_mut(struct btree_trans *trans, in bch2_btree_path_make_mut()
225 bch2_btree_path_set_pos(struct btree_trans *trans, in bch2_btree_path_set_pos()
289 void bch2_trans_verify_paths(struct btree_trans *);
307 int bch2_trans_relock(struct btree_trans *);
309 void bch2_trans_unlock(struct btree_trans *);
310 void bch2_trans_unlock_long(struct btree_trans *);
376 bool bch2_btree_node_upgrade(struct btree_trans *,
390 void bch2_trans_downgrade(struct btree_trans *);
648 u32 bch2_trans_begin(struct btree_trans *);
[all …]
|
| H A D | btree_update.h | 11 void bch2_btree_node_prep_for_write(struct btree_trans *,
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 *,
52 int bch2_btree_insert_nonextent(struct btree_trans *, enum btree_id,
61 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
116 bch2_trans_jset_entry_alloc(struct btree_trans *trans, unsigned u64s) in bch2_trans_jset_entry_alloc()
129 int bch2_btree_write_buffer_insert_err(struct btree_trans *,
168 void bch2_trans_commit_hook(struct btree_trans *,
170 int __bch2_trans_commit(struct btree_trans *, unsigned);
172 int bch2_trans_log_msg(struct btree_trans *, struct printbuf *);
[all …]
|
| H A D | btree_locking.h | 18 void bch2_trans_unlock_noassert(struct btree_trans *);
19 void bch2_trans_unlock_write(struct btree_trans *);
121 void bch2_btree_node_unlock_write(struct btree_trans *,
124 static inline void btree_node_unlock(struct btree_trans *trans, in btree_node_unlock()
240 btree_node_lock_nopath(struct btree_trans *trans, in btree_node_lock_nopath()
279 static inline int btree_node_lock(struct btree_trans *trans, in btree_node_lock()
327 bch2_btree_node_lock_write(struct btree_trans *trans, in bch2_btree_node_lock_write()
334 void bch2_btree_node_lock_write_nofail(struct btree_trans *,
341 int __bch2_btree_path_relock(struct btree_trans *,
384 bool __bch2_btree_path_upgrade(struct btree_trans *,
[all …]
|
| H A D | dirent.h | 26 int bch2_casefold(struct btree_trans *, const struct bch_hash_info *,
29 static inline int bch2_maybe_casefold(struct btree_trans *trans, in bch2_maybe_casefold()
52 int bch2_dirent_read_target(struct btree_trans *, subvol_inum,
62 int bch2_dirent_create_snapshot(struct btree_trans *, u32, u64, u32,
66 int bch2_dirent_create(struct btree_trans *, subvol_inum,
82 int bch2_dirent_rename(struct btree_trans *,
89 int bch2_dirent_lookup_trans(struct btree_trans *, struct btree_iter *,
96 int bch2_empty_dir_snapshot(struct btree_trans *, u64, u32, u32);
97 int bch2_empty_dir_trans(struct btree_trans *, subvol_inum);
100 int bch2_fsck_remove_dirent(struct btree_trans *, struct bpos);
|
| H A D | inode.h | 20 int __bch2_inode_has_child_snapshots(struct btree_trans *, struct bpos);
29 int bch2_trigger_inode(struct btree_trans *, enum btree_id, unsigned,
120 int __bch2_inode_peek(struct btree_trans *, struct btree_iter *,
123 static inline int bch2_inode_peek_nowarn(struct btree_trans *trans, in bch2_inode_peek_nowarn()
131 static inline int bch2_inode_peek(struct btree_trans *trans, in bch2_inode_peek()
144 static inline int bch2_inode_write(struct btree_trans *trans, in bch2_inode_write()
163 int bch2_inode_create(struct btree_trans *, struct btree_iter *,
168 int bch2_inode_find_by_inum_nowarn_trans(struct btree_trans *,
171 int bch2_inode_find_by_inum_trans(struct btree_trans *, subvol_inum,
296 int bch2_inode_set_casefold(struct btree_trans *, subvol_inum,
[all …]
|
| H A D | subvolume.h | 14 int bch2_subvolume_trigger(struct btree_trans *, enum btree_id, unsigned,
25 int bch2_subvol_has_children(struct btree_trans *, u32);
26 int bch2_subvolume_get(struct btree_trans *, unsigned,
28 int __bch2_subvolume_get_snapshot(struct btree_trans *, u32,
30 int bch2_subvolume_get_snapshot(struct btree_trans *, u32, u32 *);
32 int bch2_subvol_is_ro_trans(struct btree_trans *, u32);
36 bch2_btree_iter_peek_in_subvolume_max_type(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_iter_peek_in_subvolume_max_type()
83 int bch2_subvolume_unlink(struct btree_trans *, u32);
84 int bch2_subvolume_create(struct btree_trans *, u64, u32, u32, u32 *, u32 *, bool);
|
| H A D | btree_locking.c | 46 void bch2_btree_node_unlock_write(struct btree_trans *trans, in bch2_btree_node_unlock_write()
58 struct btree_trans *trans;
228 struct btree_trans *trans = i->trans; in break_cycle()
256 struct btree_trans *orig_trans = g->g->trans; in lock_graph_descend()
414 struct btree_trans *trans = p; in bch2_six_check_for_deadlock()
526 bool bch2_btree_node_upgrade(struct btree_trans *trans, in bch2_btree_node_upgrade()
709 void bch2_trans_downgrade(struct btree_trans *trans) in bch2_trans_downgrade()
792 int bch2_trans_relock(struct btree_trans *trans) in bch2_trans_relock()
809 void bch2_trans_unlock(struct btree_trans *trans) in bch2_trans_unlock()
816 void bch2_trans_unlock_long(struct btree_trans *trans) in bch2_trans_unlock_long()
[all …]
|
| H A D | namei.h | 14 int bch2_create_trans(struct btree_trans *, subvol_inum,
23 int bch2_link_trans(struct btree_trans *,
28 int bch2_unlink_trans(struct btree_trans *, subvol_inum,
33 int bch2_rename_trans(struct btree_trans *,
45 int bch2_inum_to_path(struct btree_trans *, subvol_inum, struct printbuf *);
47 int __bch2_check_dirent_target(struct btree_trans *,
59 static inline int bch2_check_dirent_target(struct btree_trans *trans, in bch2_check_dirent_target()
|
| H A D | trace.h | 162 DECLARE_EVENT_CLASS(btree_trans,
163 TP_PROTO(struct btree_trans *trans),
487 TP_PROTO(struct btree_trans *trans),
492 TP_PROTO(struct btree_trans *trans),
497 TP_PROTO(struct btree_trans *trans),
502 TP_PROTO(struct btree_trans *trans),
597 TP_PROTO(struct btree_trans *trans,
667 TP_PROTO(struct btree_trans *trans,
945 TP_PROTO(struct btree_trans *trans,
963 TP_PROTO(struct btree_trans *trans,
[all …]
|
| H A D | btree_update_interior.h | 13 int bch2_btree_node_check_topology(struct btree_trans *, struct btree *);
126 struct btree_trans *,
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,
157 static inline int bch2_foreground_maybe_merge(struct btree_trans *trans, in bch2_foreground_maybe_merge()
170 int bch2_btree_node_rewrite(struct btree_trans *, struct btree_iter *,
172 int bch2_btree_node_rewrite_pos(struct btree_trans *,
175 int bch2_btree_node_rewrite_key_get_iter(struct btree_trans *,
180 int bch2_btree_node_update_key(struct btree_trans *, struct btree_iter *,
[all …]
|
| H A D | btree_cache.h | 27 void bch2_btree_node_update_key_early(struct btree_trans *, enum btree_id, unsigned,
30 void bch2_btree_cache_cannibalize_unlock(struct btree_trans *);
31 int bch2_btree_cache_cannibalize_lock(struct btree_trans *, struct closure *);
34 struct btree *bch2_btree_node_mem_alloc(struct btree_trans *, bool);
36 struct btree *bch2_btree_node_get(struct btree_trans *, struct btree_path *,
40 struct btree *bch2_btree_node_get_noiter(struct btree_trans *, const struct bkey_i *,
43 int bch2_btree_node_prefetch(struct btree_trans *, struct btree_path *,
46 void bch2_btree_node_evict(struct btree_trans *, const struct bkey_i *);
|
| H A D | btree_iter.c | 38 static void bch2_trans_srcu_lock(struct btree_trans *);
657 void bch2_trans_node_add(struct btree_trans *trans, in bch2_trans_node_add()
3224 u32 bch2_trans_begin(struct btree_trans *trans) in bch2_trans_begin()
3317 struct btree_trans *trans; in __bch2_trans_get()
3332 struct btree_trans *pos; in __bch2_trans_get()
3423 void bch2_trans_put(struct btree_trans *trans) in bch2_trans_put()
3486 struct btree_trans *trans; in bch2_current_has_btree_trans()
3587 struct btree_trans *trans; in bch2_fs_btree_iter_exit()
3592 struct btree_trans *trans = in bch2_fs_btree_iter_exit()
3648 sizeof(struct btree_trans)) ?: in bch2_fs_btree_iter_init()
[all …]
|
| H A D | snapshot.h | 15 struct bkey_i_snapshot_tree *__bch2_snapshot_tree_create(struct btree_trans *);
17 int bch2_snapshot_tree_lookup(struct btree_trans *, u32, struct bch_snapshot_tree *);
22 int bch2_mark_snapshot(struct btree_trans *, enum btree_id, unsigned,
232 int bch2_snapshot_lookup(struct btree_trans *trans, u32 id,
234 int bch2_snapshot_get_subvol(struct btree_trans *, u32,
238 int bch2_snapshot_node_create(struct btree_trans *, u32,
244 int bch2_check_key_has_snapshot(struct btree_trans *, struct btree_iter *, struct bkey_s_c);
246 int bch2_snapshot_node_set_deleted(struct btree_trans *, u32);
249 int __bch2_key_has_snapshot_overwrites(struct btree_trans *, enum btree_id, struct bpos);
251 static inline int bch2_key_has_snapshot_overwrites(struct btree_trans *trans, in bch2_key_has_snapshot_overwrites()
|
| H A D | io_misc.h | 5 int bch2_extent_fallocate(struct btree_trans *, subvol_inum, struct btree_iter *,
8 int bch2_fpunch_at(struct btree_trans *, struct btree_iter *,
19 int bch2_resume_logged_op_truncate(struct btree_trans *, struct bkey_i *);
30 int bch2_resume_logged_op_finsert(struct btree_trans *, struct bkey_i *);
|
| H A D | lru.h | 52 int bch2_lru_del(struct btree_trans *, u16, u64, u64);
53 int bch2_lru_set(struct btree_trans *, u16, u64, u64);
54 int __bch2_lru_change(struct btree_trans *, u16, u64, u64, u64);
56 static inline int bch2_lru_change(struct btree_trans *trans, in bch2_lru_change()
66 int bch2_lru_check_set(struct btree_trans *, u16, u64, u64, struct bkey_s_c, struct bkey_buf *);
|
| H A D | acl.h | 33 int bch2_set_acl_trans(struct btree_trans *, subvol_inum,
37 int bch2_acl_chmod(struct btree_trans *, subvol_inum,
43 static inline int bch2_set_acl_trans(struct btree_trans *trans, subvol_inum inum, in bch2_set_acl_trans()
50 static inline int bch2_acl_chmod(struct btree_trans *trans, subvol_inum inum, in bch2_acl_chmod()
|
| H A D | btree_journal_iter.h | 20 struct btree_trans *trans;
61 int bch2_btree_and_journal_iter_prefetch(struct btree_trans *, struct btree_path *,
70 bool bch2_key_deleted_in_journal(struct btree_trans *, enum btree_id, unsigned, struct bpos);
77 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *,
80 void bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *,
|
| H A D | btree_update.c | 27 bch2_trans_update_by_path(struct btree_trans *, btree_path_idx_t,
31 static noinline int extent_front_merge(struct btree_trans *trans, in extent_front_merge()
67 static noinline int extent_back_merge(struct btree_trans *trans, in extent_back_merge()
93 static int need_whiteout_for_snapshot(struct btree_trans *trans, in need_whiteout_for_snapshot()
123 int __bch2_insert_snapshot_whiteouts(struct btree_trans *trans, in __bch2_insert_snapshot_whiteouts()
285 static int bch2_trans_update_extent(struct btree_trans *trans, in bch2_trans_update_extent()
552 int bch2_btree_insert_clone_trans(struct btree_trans *trans, in bch2_btree_insert_clone_trans()
619 void bch2_trans_commit_hook(struct btree_trans *trans, in bch2_trans_commit_hook()
626 int bch2_btree_insert_nonextent(struct btree_trans *trans, in bch2_btree_insert_nonextent()
675 int bch2_btree_delete_at(struct btree_trans *trans, in bch2_btree_delete_at()
[all …]
|
| H A D | subvolume.c | 15 static int bch2_subvolume_delete(struct btree_trans *, u32);
28 static int check_subvol(struct btree_trans *trans, in check_subvol()
173 static int check_subvol_child(struct btree_trans *trans, in check_subvol_child()
254 int bch2_subvolume_trigger(struct btree_trans *trans, in bch2_subvolume_trigger()
274 int bch2_subvol_has_children(struct btree_trans *trans, u32 subvol) in bch2_subvol_has_children()
301 int bch2_subvolume_get(struct btree_trans *trans, unsigned subvol, in bch2_subvolume_get()
308 int bch2_subvol_is_ro_trans(struct btree_trans *trans, u32 subvol) in bch2_subvol_is_ro_trans()
325 int bch2_snapshot_get_subvol(struct btree_trans *trans, u32 snapshot, in bch2_snapshot_get_subvol()
362 static int bch2_subvolume_reparent(struct btree_trans *trans, in bch2_subvolume_reparent()
538 int bch2_subvolume_unlink(struct btree_trans *trans, u32 subvolid) in bch2_subvolume_unlink()
[all …]
|
| H A D | logged_ops.h | 11 static inline int bch2_logged_op_update(struct btree_trans *trans, struct bkey_i *op) in bch2_logged_op_update()
17 int bch2_logged_op_start(struct btree_trans *, struct bkey_i *);
18 int bch2_logged_op_finish(struct btree_trans *, struct bkey_i *);
|
| H A D | btree_trans_commit.c | 72 static inline bool same_leaf_as_prev(struct btree_trans *trans, in same_leaf_as_prev()
79 static inline bool same_leaf_as_next(struct btree_trans *trans, in same_leaf_as_next()
86 inline void bch2_btree_node_prep_for_write(struct btree_trans *trans, in bch2_btree_node_prep_for_write()
117 static inline int bch2_trans_lock_write(struct btree_trans *trans) in bch2_trans_lock_write()
151 bool bch2_btree_bset_insert_key(struct btree_trans *trans, in bch2_btree_bset_insert_key()
233 struct btree_trans *trans = bch2_trans_get(c); in __btree_node_flush()
288 inline void bch2_btree_insert_key_leaf(struct btree_trans *trans, in bch2_btree_insert_key_leaf()
372 static inline int btree_key_can_insert(struct btree_trans *trans, in btree_key_can_insert()
459 static int run_one_mem_trigger(struct btree_trans *trans, in run_one_mem_trigger()
949 do_bch2_trans_commit_to_journal_replay(struct btree_trans *trans) in do_bch2_trans_commit_to_journal_replay()
[all …]
|
| H A D | logged_ops.c | 13 int (*resume)(struct btree_trans *, struct bkey_i *);
33 static int resume_logged_op(struct btree_trans *trans, struct btree_iter *iter, in resume_logged_op()
76 static int __bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k) in __bch2_logged_op_start()
91 int bch2_logged_op_start(struct btree_trans *trans, struct bkey_i *k) in bch2_logged_op_start()
97 int bch2_logged_op_finish(struct btree_trans *trans, struct bkey_i *k) in bch2_logged_op_finish()
|
| H A D | str_hash.h | 151 bch2_hash_lookup_in_snapshot(struct btree_trans *trans, in bch2_hash_lookup_in_snapshot()
182 bch2_hash_lookup(struct btree_trans *trans, in bch2_hash_lookup()
198 bch2_hash_hole(struct btree_trans *trans, in bch2_hash_hole()
224 int bch2_hash_needs_whiteout(struct btree_trans *trans, in bch2_hash_needs_whiteout()
254 struct bkey_s_c bch2_hash_set_or_get_in_snapshot(struct btree_trans *trans, in bch2_hash_set_or_get_in_snapshot()
314 int bch2_hash_set_in_snapshot(struct btree_trans *trans, in bch2_hash_set_in_snapshot()
336 int bch2_hash_set(struct btree_trans *trans, in bch2_hash_set()
352 int bch2_hash_delete_at(struct btree_trans *trans, in bch2_hash_delete_at()
378 int bch2_hash_delete(struct btree_trans *trans, in bch2_hash_delete()
396 int __bch2_str_hash_check_key(struct btree_trans *,
[all …]
|
| H A D | btree_write_buffer.h | 22 struct btree_trans;
23 int bch2_btree_write_buffer_flush_sync(struct btree_trans *);
25 int bch2_btree_write_buffer_flush_nocheck_rw(struct btree_trans *);
26 int bch2_btree_write_buffer_tryflush(struct btree_trans *);
29 int bch2_btree_write_buffer_maybe_flush(struct btree_trans *, struct bkey_s_c, struct bkey_buf *);
|
| H A D | reflink.h | 9 int bch2_trigger_reflink_p(struct btree_trans *, enum btree_id, unsigned,
24 int bch2_trigger_reflink_v(struct btree_trans *, enum btree_id, unsigned,
40 int bch2_trigger_indirect_inline_data(struct btree_trans *,
76 struct bkey_s_c bch2_lookup_indirect_extent(struct btree_trans *, struct btree_iter *,
|