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 bch_fs *, struct btree *,
13 bool bch2_btree_bset_insert_key(struct btree_iter *, struct btree *,
14 struct btree_node_iter *, struct bkey_i *);
15 void bch2_btree_journal_key(struct btree_trans *, struct btree_iter *,
19 __BTREE_INSERT_NOUNLOCK,
20 __BTREE_INSERT_NOFAIL,
21 __BTREE_INSERT_NOCHECK_RW,
22 __BTREE_INSERT_LAZY_RW,
23 __BTREE_INSERT_USE_RESERVE,
24 __BTREE_INSERT_USE_ALLOC_RESERVE,
25 __BTREE_INSERT_JOURNAL_REPLAY,
26 __BTREE_INSERT_JOURNAL_RESERVED,
27 __BTREE_INSERT_NOMARK_OVERWRITES,
28 __BTREE_INSERT_NOMARK,
29 __BTREE_INSERT_BUCKET_INVALIDATE,
30 __BTREE_INSERT_NOWAIT,
31 __BTREE_INSERT_GC_LOCK_HELD,
32 __BCH_HASH_SET_MUST_CREATE,
33 __BCH_HASH_SET_MUST_REPLACE,
37 * Don't drop locks _after_ successfully updating btree:
39 #define BTREE_INSERT_NOUNLOCK (1 << __BTREE_INSERT_NOUNLOCK)
41 /* Don't check for -ENOSPC: */
42 #define BTREE_INSERT_NOFAIL (1 << __BTREE_INSERT_NOFAIL)
44 #define BTREE_INSERT_NOCHECK_RW (1 << __BTREE_INSERT_NOCHECK_RW)
45 #define BTREE_INSERT_LAZY_RW (1 << __BTREE_INSERT_LAZY_RW)
47 /* for copygc, or when merging btree nodes */
48 #define BTREE_INSERT_USE_RESERVE (1 << __BTREE_INSERT_USE_RESERVE)
49 #define BTREE_INSERT_USE_ALLOC_RESERVE (1 << __BTREE_INSERT_USE_ALLOC_RESERVE)
51 /* Insert is for journal replay - don't get journal reservations: */
52 #define BTREE_INSERT_JOURNAL_REPLAY (1 << __BTREE_INSERT_JOURNAL_REPLAY)
54 #define BTREE_INSERT_JOURNAL_RESERVED (1 << __BTREE_INSERT_JOURNAL_RESERVED)
56 /* Don't mark overwrites, just new key: */
57 #define BTREE_INSERT_NOMARK_OVERWRITES (1 << __BTREE_INSERT_NOMARK_OVERWRITES)
59 /* Don't call mark new key at all: */
60 #define BTREE_INSERT_NOMARK (1 << __BTREE_INSERT_NOMARK)
62 #define BTREE_INSERT_BUCKET_INVALIDATE (1 << __BTREE_INSERT_BUCKET_INVALIDATE)
64 /* Don't block on allocation failure (for new btree nodes: */
65 #define BTREE_INSERT_NOWAIT (1 << __BTREE_INSERT_NOWAIT)
66 #define BTREE_INSERT_GC_LOCK_HELD (1 << __BTREE_INSERT_GC_LOCK_HELD)
68 #define BCH_HASH_SET_MUST_CREATE (1 << __BCH_HASH_SET_MUST_CREATE)
69 #define BCH_HASH_SET_MUST_REPLACE (1 << __BCH_HASH_SET_MUST_REPLACE)
71 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
73 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
74 struct disk_reservation *, u64 *, int flags);
76 int bch2_btree_delete_at_range(struct btree_trans *, struct btree_iter *,
78 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
79 struct bpos, struct bpos, u64 *);
81 int bch2_btree_node_rewrite(struct bch_fs *c, struct btree_iter *,
83 int bch2_btree_node_update_key(struct bch_fs *, struct btree_iter *,
84 struct btree *, struct bkey_i_btree_ptr *);
86 int __bch2_trans_commit(struct btree_trans *);
89 * bch2_trans_commit - insert keys at given iterator positions
91 * This is main entry point for btree updates.
94 * -EINTR: locking changed, this function should be called again.
95 * -EROFS: filesystem read only
96 * -EIO: journal or btree node IO error
98 static inline int bch2_trans_commit(struct btree_trans *trans,
99 struct disk_reservation *disk_res,
103 trans->disk_res = disk_res;
104 trans->journal_seq = journal_seq;
105 trans->flags = flags;
107 return __bch2_trans_commit(trans);
110 static inline void bch2_trans_update(struct btree_trans *trans,
111 struct btree_iter *iter,
114 EBUG_ON(trans->nr_updates >= trans->nr_iters + 4);
116 iter->flags |= BTREE_ITER_KEEP_UNTIL_COMMIT;
118 trans->updates[trans->nr_updates++] = (struct btree_insert_entry) {
123 #define __bch2_trans_do(_trans, _disk_res, _journal_seq, \
124 _flags, _reset_flags, _do) \
129 bch2_trans_reset(_trans, _reset_flags); \
131 _ret = (_do) ?: bch2_trans_commit(_trans, (_disk_res), \
132 (_journal_seq), (_flags)); \
133 } while (_ret == -EINTR); \
138 #define bch2_trans_do(_c, _disk_res, _journal_seq, _flags, _do) \
140 struct btree_trans trans; \
143 bch2_trans_init(&trans, (_c), 0, 0); \
144 _ret = __bch2_trans_do(&trans, _disk_res, _journal_seq, _flags, \
145 TRANS_RESET_MEM|TRANS_RESET_ITERS, _do); \
146 _ret2 = bch2_trans_exit(&trans); \
151 #define trans_for_each_update(_trans, _i) \
152 for ((_i) = (_trans)->updates; \
153 (_i) < (_trans)->updates + (_trans)->nr_updates; \
156 #endif /* _BCACHEFS_BTREE_UPDATE_H */