1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_UPDATE_H
3 #define _BCACHEFS_BTREE_UPDATE_H
5 #include "btree_iter.h"
11 void bch2_btree_node_lock_for_insert(struct btree_trans *, struct btree_path *,
13 bool bch2_btree_bset_insert_key(struct btree_trans *, struct btree_path *,
14 struct btree *, struct btree_node_iter *,
16 void bch2_btree_add_journal_pin(struct bch_fs *, struct btree *, u64);
18 enum btree_insert_flags {
19 /* First two bits for journal watermark: */
20 __BTREE_INSERT_NOFAIL = 2,
21 __BTREE_INSERT_NOCHECK_RW,
22 __BTREE_INSERT_LAZY_RW,
23 __BTREE_INSERT_USE_RESERVE,
24 __BTREE_INSERT_JOURNAL_REPLAY,
25 __BTREE_INSERT_JOURNAL_RECLAIM,
26 __BTREE_INSERT_NOWAIT,
27 __BTREE_INSERT_GC_LOCK_HELD,
28 __BCH_HASH_SET_MUST_CREATE,
29 __BCH_HASH_SET_MUST_REPLACE,
32 /* Don't check for -ENOSPC: */
33 #define BTREE_INSERT_NOFAIL (1 << __BTREE_INSERT_NOFAIL)
35 #define BTREE_INSERT_NOCHECK_RW (1 << __BTREE_INSERT_NOCHECK_RW)
36 #define BTREE_INSERT_LAZY_RW (1 << __BTREE_INSERT_LAZY_RW)
38 /* for copygc, or when merging btree nodes */
39 #define BTREE_INSERT_USE_RESERVE (1 << __BTREE_INSERT_USE_RESERVE)
41 /* Insert is for journal replay - don't get journal reservations: */
42 #define BTREE_INSERT_JOURNAL_REPLAY (1 << __BTREE_INSERT_JOURNAL_REPLAY)
44 /* Insert is being called from journal reclaim path: */
45 #define BTREE_INSERT_JOURNAL_RECLAIM (1 << __BTREE_INSERT_JOURNAL_RECLAIM)
47 /* Don't block on allocation failure (for new btree nodes: */
48 #define BTREE_INSERT_NOWAIT (1 << __BTREE_INSERT_NOWAIT)
49 #define BTREE_INSERT_GC_LOCK_HELD (1 << __BTREE_INSERT_GC_LOCK_HELD)
51 #define BCH_HASH_SET_MUST_CREATE (1 << __BCH_HASH_SET_MUST_CREATE)
52 #define BCH_HASH_SET_MUST_REPLACE (1 << __BCH_HASH_SET_MUST_REPLACE)
54 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
56 int __bch2_btree_insert(struct btree_trans *, enum btree_id, struct bkey_i *);
57 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
58 struct disk_reservation *, u64 *, int flags);
60 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
61 struct bpos, struct bpos, unsigned, u64 *);
62 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
63 struct bpos, struct bpos, unsigned, u64 *);
65 int bch2_btree_node_rewrite(struct btree_trans *, struct btree_iter *,
66 struct btree *, unsigned);
67 void bch2_btree_node_rewrite_async(struct bch_fs *, struct btree *);
68 int bch2_btree_node_update_key(struct btree_trans *, struct btree_iter *,
69 struct btree *, struct bkey_i *, bool);
70 int bch2_btree_node_update_key_get_iter(struct btree_trans *,
71 struct btree *, struct bkey_i *, bool);
73 int bch2_trans_update_extent(struct btree_trans *, struct btree_iter *,
74 struct bkey_i *, enum btree_update_flags);
76 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
77 struct bkey_i *, enum btree_update_flags);
79 void bch2_trans_commit_hook(struct btree_trans *,
80 struct btree_trans_commit_hook *);
81 int __bch2_trans_commit(struct btree_trans *);
84 * bch2_trans_commit - insert keys at given iterator positions
86 * This is main entry point for btree updates.
89 * -EINTR: locking changed, this function should be called again.
90 * -EROFS: filesystem read only
91 * -EIO: journal or btree node IO error
93 static inline int bch2_trans_commit(struct btree_trans *trans,
94 struct disk_reservation *disk_res,
98 trans->disk_res = disk_res;
99 trans->journal_seq = journal_seq;
100 trans->flags = flags;
102 return __bch2_trans_commit(trans);
105 #define lockrestart_do(_trans, _do) \
110 bch2_trans_begin(_trans); \
112 } while (_ret == -EINTR); \
117 #define __bch2_trans_do(_trans, _disk_res, _journal_seq, _flags, _do) \
118 lockrestart_do(_trans, _do ?: bch2_trans_commit(_trans, (_disk_res),\
119 (_journal_seq), (_flags)))
121 #define bch2_trans_do(_c, _disk_res, _journal_seq, _flags, _do) \
123 struct btree_trans trans; \
126 bch2_trans_init(&trans, (_c), 0, 0); \
127 _ret = __bch2_trans_do(&trans, _disk_res, _journal_seq, _flags, \
129 bch2_trans_exit(&trans); \
134 #define trans_for_each_update(_trans, _i) \
135 for ((_i) = (_trans)->updates; \
136 (_i) < (_trans)->updates + (_trans)->nr_updates; \
139 #endif /* _BCACHEFS_BTREE_UPDATE_H */