bcachefs: Make bkey types globally unique
[linux-block.git] / fs / bcachefs / btree_update.h
1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_UPDATE_H
3 #define _BCACHEFS_BTREE_UPDATE_H
4
5 #include "btree_iter.h"
6 #include "journal.h"
7
8 struct bch_fs;
9 struct btree;
10 struct btree_insert;
11
12 void bch2_btree_node_lock_for_insert(struct bch_fs *, struct btree *,
13                                      struct btree_iter *);
14 bool bch2_btree_bset_insert_key(struct btree_iter *, struct btree *,
15                                 struct btree_node_iter *, struct bkey_i *);
16 void bch2_btree_journal_key(struct btree_insert *trans, struct btree_iter *,
17                             struct bkey_i *);
18
19 /* Normal update interface: */
20
21 struct btree_insert {
22         struct bch_fs           *c;
23         struct disk_reservation *disk_res;
24         struct journal_res      journal_res;
25         u64                     *journal_seq;
26         unsigned                flags;
27         bool                    did_work;
28
29         unsigned short          nr;
30         struct btree_insert_entry  *entries;
31 };
32
33 int __bch2_btree_insert_at(struct btree_insert *);
34
35 #define BTREE_INSERT_ENTRY(_iter, _k)                                   \
36         ((struct btree_insert_entry) {                                  \
37                 .iter           = (_iter),                              \
38                 .k              = (_k),                                 \
39         })
40
41 /**
42  * bch_btree_insert_at - insert one or more keys at iterator positions
43  * @iter:               btree iterator
44  * @insert_key:         key to insert
45  * @disk_res:           disk reservation
46  * @hook:               extent insert callback
47  *
48  * Return values:
49  * -EINTR: locking changed, this function should be called again. Only returned
50  *  if passed BTREE_INSERT_ATOMIC.
51  * -EROFS: filesystem read only
52  * -EIO: journal or btree node IO error
53  */
54 #define bch2_btree_insert_at(_c, _disk_res, _journal_seq, _flags, ...)  \
55         __bch2_btree_insert_at(&(struct btree_insert) {                 \
56                 .c              = (_c),                                 \
57                 .disk_res       = (_disk_res),                          \
58                 .journal_seq    = (_journal_seq),                       \
59                 .flags          = (_flags),                             \
60                 .nr             = COUNT_ARGS(__VA_ARGS__),              \
61                 .entries        = (struct btree_insert_entry[]) {       \
62                         __VA_ARGS__                                     \
63                 }})
64
65 enum {
66         __BTREE_INSERT_ATOMIC,
67         __BTREE_INSERT_NOUNLOCK,
68         __BTREE_INSERT_NOFAIL,
69         __BTREE_INSERT_USE_RESERVE,
70         __BTREE_INSERT_USE_ALLOC_RESERVE,
71         __BTREE_INSERT_JOURNAL_REPLAY,
72         __BTREE_INSERT_NOWAIT,
73         __BTREE_INSERT_GC_LOCK_HELD,
74         __BCH_HASH_SET_MUST_CREATE,
75         __BCH_HASH_SET_MUST_REPLACE,
76 };
77
78 /*
79  * Don't drop/retake locks before doing btree update, instead return -EINTR if
80  * we had to drop locks for any reason
81  */
82 #define BTREE_INSERT_ATOMIC             (1 << __BTREE_INSERT_ATOMIC)
83
84 /*
85  * Don't drop locks _after_ successfully updating btree:
86  */
87 #define BTREE_INSERT_NOUNLOCK           (1 << __BTREE_INSERT_NOUNLOCK)
88
89 /* Don't check for -ENOSPC: */
90 #define BTREE_INSERT_NOFAIL             (1 << __BTREE_INSERT_NOFAIL)
91
92 /* for copygc, or when merging btree nodes */
93 #define BTREE_INSERT_USE_RESERVE        (1 << __BTREE_INSERT_USE_RESERVE)
94 #define BTREE_INSERT_USE_ALLOC_RESERVE  (1 << __BTREE_INSERT_USE_ALLOC_RESERVE)
95
96 /*
97  * Insert is for journal replay: don't get journal reservations, or mark extents
98  * (bch_mark_key)
99  */
100 #define BTREE_INSERT_JOURNAL_REPLAY     (1 << __BTREE_INSERT_JOURNAL_REPLAY)
101
102 /* Don't block on allocation failure (for new btree nodes: */
103 #define BTREE_INSERT_NOWAIT             (1 << __BTREE_INSERT_NOWAIT)
104 #define BTREE_INSERT_GC_LOCK_HELD       (1 << __BTREE_INSERT_GC_LOCK_HELD)
105
106 #define BCH_HASH_SET_MUST_CREATE        (1 << __BCH_HASH_SET_MUST_CREATE)
107 #define BCH_HASH_SET_MUST_REPLACE       (1 << __BCH_HASH_SET_MUST_REPLACE)
108
109 int bch2_btree_delete_at(struct btree_iter *, unsigned);
110
111 int bch2_btree_insert_list_at(struct btree_iter *, struct keylist *,
112                              struct disk_reservation *, u64 *, unsigned);
113
114 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
115                      struct disk_reservation *, u64 *, int flags);
116
117 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
118                             struct bpos, struct bpos, u64 *);
119
120 int bch2_btree_node_rewrite(struct bch_fs *c, struct btree_iter *,
121                             __le64, unsigned);
122 int bch2_btree_node_update_key(struct bch_fs *, struct btree_iter *,
123                                struct btree *, struct bkey_i_btree_ptr *);
124
125 /* new transactional interface: */
126
127 static inline void
128 bch2_trans_update(struct btree_trans *trans,
129                   struct btree_insert_entry entry)
130 {
131         BUG_ON(trans->nr_updates >= ARRAY_SIZE(trans->updates));
132
133         trans->updates[trans->nr_updates++] = entry;
134 }
135
136 int bch2_trans_commit(struct btree_trans *,
137                       struct disk_reservation *,
138                       u64 *, unsigned);
139
140 #define bch2_trans_do(_c, _journal_seq, _flags, _do)                    \
141 ({                                                                      \
142         struct btree_trans trans;                                       \
143         int _ret;                                                       \
144                                                                         \
145         bch2_trans_init(&trans, (_c));                                  \
146                                                                         \
147         do {                                                            \
148                 bch2_trans_begin(&trans);                               \
149                                                                         \
150                 _ret = (_do) ?: bch2_trans_commit(&trans, NULL,         \
151                                         (_journal_seq), (_flags));      \
152         } while (_ret == -EINTR);                                       \
153                                                                         \
154         bch2_trans_exit(&trans);                                        \
155         _ret;                                                           \
156 })
157
158 #endif /* _BCACHEFS_BTREE_UPDATE_H */