Home
last modified time | relevance | path

Searched refs:btree_trans (Results 1 – 25 of 85) sorted by relevance

1234

/linux/fs/bcachefs/
H A Dbtree_update.h12 void bch2_btree_node_prep_for_write(struct btree_trans *,
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 *,
50 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
51 int bch2_btree_delete(struct btree_trans *, enum btree_id, struct bpos, unsigned);
53 int bch2_btree_insert_nonextent(struct btree_trans *, enum btree_id,
56 int bch2_btree_insert_trans(struct btree_trans *, enum btree_id, struct bkey_i *,
62 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
67 int bch2_btree_bit_mod_iter(struct btree_trans *, struct btree_iter *, bool);
68 int bch2_btree_bit_mod(struct btree_trans *, enu
[all...]
H A Dbtree_locking.h18 void bch2_trans_unlock_write(struct btree_trans *);
25 static inline struct btree_transaction_stats *btree_trans_stats(struct btree_trans *trans) in btree_trans_stats()
87 static inline void mark_btree_node_locked(struct btree_trans *trans, in mark_btree_node_locked()
117 static void btree_trans_lock_hold_time_update(struct btree_trans *trans, in btree_trans_lock_hold_time_update()
129 void bch2_btree_node_unlock_write(struct btree_trans *,
132 static inline void btree_node_unlock(struct btree_trans *trans, in btree_node_unlock()
160 static inline void __bch2_btree_path_unlock(struct btree_trans *trans, in __bch2_btree_path_unlock()
174 __bch2_btree_node_unlock_write(struct btree_trans *trans, struct btree *b) in __bch2_btree_node_unlock_write()
188 bch2_btree_node_unlock_write_inlined(struct btree_trans *trans, struct btree_path *path, in bch2_btree_node_unlock_write_inlined()
203 static inline void trans_set_locked(struct btree_trans *tran
[all...]
H A Dnamei.h14 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 *);
46 int bch2_inum_snapshot_to_path(struct btree_trans *, u64, u32,
49 int __bch2_check_dirent_target(struct btree_trans *,
61 static inline int bch2_check_dirent_target(struct btree_trans *trans, in bch2_check_dirent_target()
74 int bch2_maybe_propagate_has_case_insensitive(struct btree_trans *, subvol_inum,
76 int bch2_check_inode_has_case_insensitive(struct btree_trans *, struc
[all...]
H A Ddirent.h27 int bch2_casefold(struct btree_trans *, const struct bch_hash_info *,
30 static inline int bch2_casefold(struct btree_trans *trans, const struct bch_hash_info *info, in bch2_casefold()
37 static inline int bch2_maybe_casefold(struct btree_trans *trans, in bch2_maybe_casefold()
60 int bch2_dirent_read_target(struct btree_trans *, subvol_inum,
75 struct bkey_i_dirent *bch2_dirent_create_key(struct btree_trans *,
79 int bch2_dirent_create_snapshot(struct btree_trans *, u32, u64, u32,
83 int bch2_dirent_create(struct btree_trans *, subvol_inum,
99 int bch2_dirent_rename(struct btree_trans *,
106 int bch2_dirent_lookup_trans(struct btree_trans *, struct btree_iter *,
113 int bch2_empty_dir_snapshot(struct btree_trans *, u6
[all...]
H A Dinode.h20 int __bch2_inode_has_child_snapshots(struct btree_trans *, struct bpos);
22 static inline int bch2_inode_has_child_snapshots(struct btree_trans *trans, struct bpos pos) in bch2_inode_has_child_snapshots()
29 int bch2_trigger_inode(struct btree_trans *, enum btree_id, unsigned,
116 struct bkey_i *bch2_inode_to_v3(struct btree_trans *, struct bkey_i *);
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()
139 int bch2_inode_find_by_inum_snapshot(struct btree_trans *, u64, u32,
141 int bch2_inode_find_by_inum_nowarn_trans(struct btree_trans *,
144 int bch2_inode_find_by_inum_trans(struct btree_trans *, subvol_inu
[all...]
H A Dsubvolume.h14 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()
80 int bch2_subvolume_unlink(struct btree_trans *, u32);
81 int bch2_subvolume_create(struct btree_trans *, u64, u32, u32, u32 *, u32 *, bool);
H A Dbtree_locking.c20 struct six_lock_count bch2_btree_node_lock_counts(struct btree_trans *trans, in bch2_btree_node_lock_counts()
47 void bch2_btree_node_unlock_write(struct btree_trans *trans, in bch2_btree_node_unlock_write()
59 struct btree_trans *trans;
120 static void __lock_graph_down(struct lock_graph *g, struct btree_trans *trans) in __lock_graph_down()
129 static void lock_graph_down(struct lock_graph *g, struct btree_trans *trans) in lock_graph_down()
155 static void trace_would_deadlock(struct lock_graph *g, struct btree_trans *trans) in trace_would_deadlock()
186 static int btree_trans_abort_preference(struct btree_trans *trans) in btree_trans_abort_preference()
205 struct btree_trans *trans = i->trans; in break_cycle_fail()
258 static int lock_graph_descend(struct lock_graph *g, struct btree_trans *trans, in lock_graph_descend()
261 struct btree_trans *orig_tran in lock_graph_descend()
[all...]
H A Dbtree_update_interior.h13 int bch2_btree_node_check_topology(struct btree_trans *, struct btree *);
133 struct btree_trans *,
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,
144 static inline int bch2_foreground_maybe_merge_sibling(struct btree_trans *trans, in bch2_foreground_maybe_merge_sibling()
164 static inline int bch2_foreground_maybe_merge(struct btree_trans *trans, in bch2_foreground_maybe_merge()
177 int bch2_btree_node_rewrite(struct btree_trans *, struct btree_iter *,
179 int bch2_btree_node_rewrite_key(struct btree_trans *,
182 int bch2_btree_node_rewrite_pos(struct btree_trans *,
[all...]
H A Dtrace.h52 TP_PROTO(struct btree_trans *trans, unsigned long caller_ip, const char *str),
75 TP_PROTO(struct btree_trans *trans, const char *str),
121 TP_PROTO(struct btree_trans *trans, struct btree *b),
162 DECLARE_EVENT_CLASS(btree_trans,
163 TP_PROTO(struct btree_trans *trans),
535 DEFINE_EVENT(btree_trans, btree_cache_cannibalize_lock_fail,
536 TP_PROTO(struct btree_trans *trans),
540 DEFINE_EVENT(btree_trans, btree_cache_cannibalize_lock,
541 TP_PROTO(struct btree_trans *trans),
545 DEFINE_EVENT(btree_trans, btree_cache_cannibaliz
[all...]
H A Dsnapshot.h15 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,
207 int bch2_snapshot_lookup(struct btree_trans *trans, u32 id,
209 int bch2_snapshot_get_subvol(struct btree_trans *, u32,
213 int bch2_snapshot_node_create(struct btree_trans *, u32,
220 int __bch2_check_key_has_snapshot(struct btree_trans *, struct btree_iter *, struct bkey_s_c);
222 static inline int bch2_check_key_has_snapshot(struct btree_trans *trans, in bch2_check_key_has_snapshot()
231 int __bch2_get_snapshot_overwrites(struct btree_trans *,
238 static inline int bch2_get_snapshot_overwrites(struct btree_trans *tran
[all...]
H A Dio_misc.h5 int bch2_extent_fallocate(struct btree_trans *, subvol_inum, struct btree_iter *,
9 int bch2_fpunch_snapshot(struct btree_trans *, struct bpos, struct bpos);
10 int bch2_fpunch_at(struct btree_trans *, struct btree_iter *,
21 int bch2_resume_logged_op_truncate(struct btree_trans *, struct bkey_i *);
32 int bch2_resume_logged_op_finsert(struct btree_trans *, struct bkey_i *);
H A Dbtree_cache.h27 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 *);
35 struct btree *bch2_btree_node_mem_alloc(struct btree_trans *, bool);
37 struct btree *bch2_btree_node_get(struct btree_trans *, struct btree_path *,
41 struct btree *bch2_btree_node_get_noiter(struct btree_trans *, const struct bkey_i *,
44 int bch2_btree_node_prefetch(struct btree_trans *, struct btree_path *,
47 void bch2_btree_node_evict(struct btree_trans *, const struct bkey_i *);
H A Dlru.h52 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 Dbtree_update.c29 bch2_trans_update_by_path(struct btree_trans *, btree_path_idx_t,
33 static noinline int extent_front_merge(struct btree_trans *trans, in extent_front_merge()
69 static noinline int extent_back_merge(struct btree_trans *trans, in extent_back_merge()
95 static int need_whiteout_for_snapshot(struct btree_trans *trans, in need_whiteout_for_snapshot()
125 int __bch2_insert_snapshot_whiteouts(struct btree_trans *trans, in __bch2_insert_snapshot_whiteouts()
167 int bch2_trans_update_extent_overwrite(struct btree_trans *trans, in bch2_trans_update_extent_overwrite()
266 static int bch2_trans_update_extent(struct btree_trans *trans, in bch2_trans_update_extent()
328 static noinline int flush_new_cached_update(struct btree_trans *trans, 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()
453 static noinline int bch2_trans_update_get_key_cache(struct btree_trans *tran
[all...]
H A Dacl.h33 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 Dstr_hash.h151 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()
315 int bch2_hash_set_in_snapshot(struct btree_trans *trans, in bch2_hash_set_in_snapshot()
337 int bch2_hash_set(struct btree_trans *trans, in bch2_hash_set()
353 int bch2_hash_delete_at(struct btree_trans *trans, in bch2_hash_delete_at()
379 int bch2_hash_delete(struct btree_trans *trans, in bch2_hash_delete()
396 int bch2_repair_inode_hash_info(struct btree_trans *, struc
[all...]
H A Dbtree_journal_iter.h20 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 Dsubvolume.c16 static int bch2_subvolume_delete(struct btree_trans *, u32);
45 static int check_subvol(struct btree_trans *trans, in check_subvol()
196 static int check_subvol_child(struct btree_trans *trans, in check_subvol_child()
277 static int subvolume_children_mod(struct btree_trans *trans, struct bpos pos, bool set) in subvolume_children_mod()
284 int bch2_subvolume_trigger(struct btree_trans *trans, in bch2_subvolume_trigger()
304 int bch2_subvol_has_children(struct btree_trans *trans, u32 subvol) in bch2_subvol_has_children()
318 bch2_subvolume_get_inlined(struct btree_trans *trans, unsigned subvol, in bch2_subvolume_get_inlined()
330 int bch2_subvolume_get(struct btree_trans *trans, unsigned subvol, in bch2_subvolume_get()
337 int bch2_subvol_is_ro_trans(struct btree_trans *trans, u32 subvol) in bch2_subvol_is_ro_trans()
354 int bch2_snapshot_get_subvol(struct btree_trans *tran
[all...]
H A Dlogged_ops.h11 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 Dlogged_ops.c13 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 Dbtree_trans_commit.c46 static void verify_update_old_key(struct btree_trans *trans, struct btree_insert_entry *i) in verify_update_old_key()
69 static inline struct btree_path_level *insert_l(struct btree_trans *trans, struct btree_insert_entry *i) in insert_l()
74 static inline bool same_leaf_as_prev(struct btree_trans *trans, in same_leaf_as_prev()
81 static inline bool same_leaf_as_next(struct btree_trans *trans, in same_leaf_as_next()
88 inline void bch2_btree_node_prep_for_write(struct btree_trans *trans, in bch2_btree_node_prep_for_write()
106 static noinline int trans_lock_write_fail(struct btree_trans *trans, struct btree_insert_entry *i) in trans_lock_write_fail()
119 static inline int bch2_trans_lock_write(struct btree_trans *trans) in bch2_trans_lock_write()
138 static inline void bch2_trans_unlock_updates_write(struct btree_trans *trans) in bch2_trans_unlock_updates_write()
153 bool bch2_btree_bset_insert_key(struct btree_trans *trans, in bch2_btree_bset_insert_key()
235 struct btree_trans *tran in __btree_node_flush()
[all...]
H A Dbtree_write_buffer.h22 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 Dbkey_methods.h9 struct btree_trans;
31 int (*trigger)(struct btree_trans *, enum btree_id, unsigned,
80 static inline int bch2_key_trigger(struct btree_trans *trans, in bch2_key_trigger()
92 static inline int bch2_key_trigger_old(struct btree_trans *trans, in bch2_key_trigger_old()
106 static inline int bch2_key_trigger_new(struct btree_trans *trans, in bch2_key_trigger_new()
H A Derror.h53 bool bch2_trans_inconsistent(struct btree_trans *, const char *, ...);
93 int __bch2_fsck_err(struct bch_fs *, struct btree_trans *,
99 type_is(c, struct btree_trans *) ? (struct btree_trans *) c : NULL,\
251 int bch2_inum_offset_err_msg_trans(struct btree_trans *, struct printbuf *, subvol_inum, u64);
255 int bch2_inum_snap_offset_err_msg_trans(struct btree_trans *, struct printbuf *, struct bpos);
H A Dmigrate.c43 static int drop_btree_ptrs(struct btree_trans *trans, struct btree_iter *iter, in drop_btree_ptrs()
60 static int bch2_dev_usrdata_drop_key(struct btree_trans *trans, in bch2_dev_usrdata_drop_key()
100 static int bch2_dev_btree_drop_key(struct btree_trans *trans, in bch2_dev_btree_drop_key()
122 struct btree_trans *trans = bch2_trans_get(c); in bch2_dev_usrdata_drop()
149 struct btree_trans *trans; in bch2_dev_metadata_drop()
209 static int data_drop_bp(struct btree_trans *trans, unsigned dev_idx, in data_drop_bp()
243 struct btree_trans *trans = bch2_trans_get(c); in bch2_dev_data_drop_by_backpointers()

1234