1 // SPDX-License-Identifier: GPL-2.0
4 #include "bkey_methods.h"
5 #include "btree_types.h"
6 #include "alloc_background.h"
15 const char * const bch_bkey_types[] = {
16 #define x(name, nr) #name,
22 static const char *deleted_key_invalid(const struct bch_fs *c,
28 #define bch2_bkey_ops_deleted (struct bkey_ops) { \
29 .key_invalid = deleted_key_invalid, \
32 #define bch2_bkey_ops_discard (struct bkey_ops) { \
33 .key_invalid = deleted_key_invalid, \
36 static const char *empty_val_key_invalid(const struct bch_fs *c, struct bkey_s_c k)
38 if (bkey_val_bytes(k.k))
39 return "value size should be zero";
44 #define bch2_bkey_ops_error (struct bkey_ops) { \
45 .key_invalid = empty_val_key_invalid, \
48 static const char *key_type_cookie_invalid(const struct bch_fs *c,
51 if (bkey_val_bytes(k.k) != sizeof(struct bch_cookie))
52 return "incorrect value size";
57 #define bch2_bkey_ops_cookie (struct bkey_ops) { \
58 .key_invalid = key_type_cookie_invalid, \
61 #define bch2_bkey_ops_whiteout (struct bkey_ops) { \
62 .key_invalid = empty_val_key_invalid, \
65 static const struct bkey_ops bch2_bkey_ops[] = {
66 #define x(name, nr) [KEY_TYPE_##name] = bch2_bkey_ops_##name,
71 const char *bch2_bkey_val_invalid(struct bch_fs *c, struct bkey_s_c k)
73 if (k.k->type >= KEY_TYPE_MAX)
74 return "invalid type";
76 return bch2_bkey_ops[k.k->type].key_invalid(c, k);
79 const char *__bch2_bkey_invalid(struct bch_fs *c, struct bkey_s_c k,
80 enum btree_node_type type)
82 if (k.k->u64s < BKEY_U64s)
83 return "u64s too small";
85 if ((btree_node_type_is_extents(type) ||
86 type == BKEY_TYPE_BTREE) &&
87 bkey_val_u64s(k.k) > BKEY_EXTENT_VAL_U64s_MAX)
88 return "value too big";
90 if (btree_node_type_is_extents(type)) {
91 if ((k.k->size == 0) != bkey_deleted(k.k))
92 return "bad size field";
94 if (k.k->size > k.k->p.offset)
95 return "size greater than offset";
98 return "nonzero size field";
102 return "nonzero snapshot";
104 if (type != BKEY_TYPE_BTREE &&
105 !bkey_cmp(k.k->p, POS_MAX))
106 return "POS_MAX key";
111 const char *bch2_bkey_invalid(struct bch_fs *c, struct bkey_s_c k,
112 enum btree_node_type type)
114 return __bch2_bkey_invalid(c, k, type) ?:
115 bch2_bkey_val_invalid(c, k);
118 const char *bch2_bkey_in_btree_node(struct btree *b, struct bkey_s_c k)
120 if (bkey_cmp(bkey_start_pos(k.k), b->data->min_key) < 0)
121 return "key before start of btree node";
123 if (bkey_cmp(k.k->p, b->data->max_key) > 0)
124 return "key past end of btree node";
129 void bch2_bkey_debugcheck(struct bch_fs *c, struct btree *b, struct bkey_s_c k)
131 const struct bkey_ops *ops = &bch2_bkey_ops[k.k->type];
136 invalid = bch2_bkey_invalid(c, k, btree_node_type(b)) ?:
137 bch2_bkey_in_btree_node(b, k);
141 bch2_bkey_val_to_text(&PBUF(buf), c, k);
142 bch2_fs_bug(c, "invalid bkey %s: %s", buf, invalid);
146 if (ops->key_debugcheck)
147 ops->key_debugcheck(c, b, k);
150 void bch2_bpos_to_text(struct printbuf *out, struct bpos pos)
152 if (!bkey_cmp(pos, POS_MIN))
153 pr_buf(out, "POS_MIN");
154 else if (!bkey_cmp(pos, POS_MAX))
155 pr_buf(out, "POS_MAX");
157 pr_buf(out, "%llu:%llu", pos.inode, pos.offset);
160 void bch2_bkey_to_text(struct printbuf *out, const struct bkey *k)
162 pr_buf(out, "u64s %u type %u ", k->u64s, k->type);
164 bch2_bpos_to_text(out, k->p);
166 pr_buf(out, " snap %u len %u ver %llu",
167 k->p.snapshot, k->size, k->version.lo);
170 void bch2_val_to_text(struct printbuf *out, struct bch_fs *c,
173 const struct bkey_ops *ops = &bch2_bkey_ops[k.k->type];
175 if (likely(ops->val_to_text))
176 ops->val_to_text(out, c, k);
178 pr_buf(out, " %s", bch_bkey_types[k.k->type]);
181 void bch2_bkey_val_to_text(struct printbuf *out, struct bch_fs *c,
184 bch2_bkey_to_text(out, k.k);
186 bch2_val_to_text(out, c, k);
189 void bch2_bkey_swab(const struct bkey_format *f,
190 struct bkey_packed *k)
192 const struct bkey_ops *ops = &bch2_bkey_ops[k->type];
194 bch2_bkey_swab_key(f, k);
200 bool bch2_bkey_normalize(struct bch_fs *c, struct bkey_s k)
202 const struct bkey_ops *ops = &bch2_bkey_ops[k.k->type];
204 return ops->key_normalize
205 ? ops->key_normalize(c, k)
209 enum merge_result bch2_bkey_merge(struct bch_fs *c,
210 struct bkey_s l, struct bkey_s r)
212 const struct bkey_ops *ops = &bch2_bkey_ops[l.k->type];
213 enum merge_result ret;
215 if (key_merging_disabled(c) ||
217 l.k->type != r.k->type ||
218 bversion_cmp(l.k->version, r.k->version) ||
219 bkey_cmp(l.k->p, bkey_start_pos(r.k)))
220 return BCH_MERGE_NOMERGE;
222 ret = ops->key_merge(c, l, r);
224 if (ret != BCH_MERGE_NOMERGE)
225 l.k->needs_whiteout |= r.k->needs_whiteout;
229 static const struct old_bkey_type {
233 } bkey_renumber_table[] = {
234 {BKEY_TYPE_BTREE, 128, KEY_TYPE_btree_ptr },
235 {BKEY_TYPE_EXTENTS, 128, KEY_TYPE_extent },
236 {BKEY_TYPE_EXTENTS, 129, KEY_TYPE_extent },
237 {BKEY_TYPE_EXTENTS, 130, KEY_TYPE_reservation },
238 {BKEY_TYPE_INODES, 128, KEY_TYPE_inode },
239 {BKEY_TYPE_INODES, 130, KEY_TYPE_inode_generation },
240 {BKEY_TYPE_DIRENTS, 128, KEY_TYPE_dirent },
241 {BKEY_TYPE_DIRENTS, 129, KEY_TYPE_whiteout },
242 {BKEY_TYPE_XATTRS, 128, KEY_TYPE_xattr },
243 {BKEY_TYPE_XATTRS, 129, KEY_TYPE_whiteout },
244 {BKEY_TYPE_ALLOC, 128, KEY_TYPE_alloc },
245 {BKEY_TYPE_QUOTAS, 128, KEY_TYPE_quota },
248 void bch2_bkey_renumber(enum btree_node_type btree_node_type,
249 struct bkey_packed *k,
252 const struct old_bkey_type *i;
254 for (i = bkey_renumber_table;
255 i < bkey_renumber_table + ARRAY_SIZE(bkey_renumber_table);
257 if (btree_node_type == i->btree_node_type &&
258 k->type == (write ? i->new : i->old)) {
259 k->type = write ? i->old : i->new;