1 #ifndef _BCACHEFS_BTREE_UPDATE_H
2 #define _BCACHEFS_BTREE_UPDATE_H
4 #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_insert *trans, struct btree_iter *,
18 /* Normal update interface: */
22 struct disk_reservation *disk_res;
23 struct journal_res journal_res;
29 struct btree_insert_entry *entries;
32 int __bch2_btree_insert_at(struct btree_insert *);
34 #define BTREE_INSERT_ENTRY(_iter, _k) \
35 ((struct btree_insert_entry) { \
41 * bch_btree_insert_at - insert one or more keys at iterator positions
42 * @iter: btree iterator
43 * @insert_key: key to insert
44 * @disk_res: disk reservation
45 * @hook: extent insert callback
48 * -EINTR: locking changed, this function should be called again. Only returned
49 * if passed BTREE_INSERT_ATOMIC.
50 * -EROFS: filesystem read only
51 * -EIO: journal or btree node IO error
53 #define bch2_btree_insert_at(_c, _disk_res, _journal_seq, _flags, ...) \
54 __bch2_btree_insert_at(&(struct btree_insert) { \
56 .disk_res = (_disk_res), \
57 .journal_seq = (_journal_seq), \
59 .nr = COUNT_ARGS(__VA_ARGS__), \
60 .entries = (struct btree_insert_entry[]) { \
65 __BTREE_INSERT_ATOMIC,
66 __BTREE_INSERT_NOUNLOCK,
67 __BTREE_INSERT_NOFAIL,
68 __BTREE_INSERT_USE_RESERVE,
69 __BTREE_INSERT_USE_ALLOC_RESERVE,
70 __BTREE_INSERT_JOURNAL_REPLAY,
71 __BTREE_INSERT_NOWAIT,
72 __BTREE_INSERT_GC_LOCK_HELD,
73 __BCH_HASH_SET_MUST_CREATE,
74 __BCH_HASH_SET_MUST_REPLACE,
78 * Don't drop/retake locks before doing btree update, instead return -EINTR if
79 * we had to drop locks for any reason
81 #define BTREE_INSERT_ATOMIC (1 << __BTREE_INSERT_ATOMIC)
84 * Don't drop locks _after_ successfully updating btree:
86 #define BTREE_INSERT_NOUNLOCK (1 << __BTREE_INSERT_NOUNLOCK)
88 /* Don't check for -ENOSPC: */
89 #define BTREE_INSERT_NOFAIL (1 << __BTREE_INSERT_NOFAIL)
91 /* for copygc, or when merging btree nodes */
92 #define BTREE_INSERT_USE_RESERVE (1 << __BTREE_INSERT_USE_RESERVE)
93 #define BTREE_INSERT_USE_ALLOC_RESERVE (1 << __BTREE_INSERT_USE_ALLOC_RESERVE)
96 * Insert is for journal replay: don't get journal reservations, or mark extents
99 #define BTREE_INSERT_JOURNAL_REPLAY (1 << __BTREE_INSERT_JOURNAL_REPLAY)
101 /* Don't block on allocation failure (for new btree nodes: */
102 #define BTREE_INSERT_NOWAIT (1 << __BTREE_INSERT_NOWAIT)
103 #define BTREE_INSERT_GC_LOCK_HELD (1 << __BTREE_INSERT_GC_LOCK_HELD)
105 #define BCH_HASH_SET_MUST_CREATE (1 << __BCH_HASH_SET_MUST_CREATE)
106 #define BCH_HASH_SET_MUST_REPLACE (1 << __BCH_HASH_SET_MUST_REPLACE)
108 int bch2_btree_delete_at(struct btree_iter *, unsigned);
110 int bch2_btree_insert_list_at(struct btree_iter *, struct keylist *,
111 struct disk_reservation *, u64 *, unsigned);
113 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
114 struct disk_reservation *, u64 *, int flags);
116 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
117 struct bpos, struct bpos, u64 *);
119 int bch2_btree_node_rewrite(struct bch_fs *c, struct btree_iter *,
121 int bch2_btree_node_update_key(struct bch_fs *, struct btree_iter *,
122 struct btree *, struct bkey_i_extent *);
124 /* new transactional interface: */
127 bch2_trans_update(struct btree_trans *trans,
128 struct btree_insert_entry entry)
130 BUG_ON(trans->nr_updates >= ARRAY_SIZE(trans->updates));
132 trans->updates[trans->nr_updates++] = entry;
135 int bch2_trans_commit(struct btree_trans *,
136 struct disk_reservation *,
139 #define bch2_trans_do(_c, _journal_seq, _flags, _do) \
141 struct btree_trans trans; \
144 bch2_trans_init(&trans, (_c)); \
147 bch2_trans_begin(&trans); \
149 _ret = (_do) ?: bch2_trans_commit(&trans, NULL, \
150 (_journal_seq), (_flags)); \
151 } while (_ret == -EINTR); \
153 bch2_trans_exit(&trans); \
157 #endif /* _BCACHEFS_BTREE_UPDATE_H */