1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_STR_HASH_H
3 #define _BCACHEFS_STR_HASH_H
5 #include "btree_iter.h"
6 #include "btree_update.h"
11 #include "subvolume.h"
14 #include <linux/crc32c.h>
15 #include <crypto/hash.h>
16 #include <crypto/sha2.h>
18 typedef unsigned __bitwise bch_str_hash_flags_t;
20 enum bch_str_hash_flags {
21 __BCH_HASH_SET_MUST_CREATE,
22 __BCH_HASH_SET_MUST_REPLACE,
25 #define BCH_HASH_SET_MUST_CREATE (__force bch_str_hash_flags_t) BIT(__BCH_HASH_SET_MUST_CREATE)
26 #define BCH_HASH_SET_MUST_REPLACE (__force bch_str_hash_flags_t) BIT(__BCH_HASH_SET_MUST_REPLACE)
28 static inline enum bch_str_hash_type
29 bch2_str_hash_opt_to_type(struct bch_fs *c, enum bch_str_hash_opts opt)
32 case BCH_STR_HASH_OPT_crc32c:
33 return BCH_STR_HASH_crc32c;
34 case BCH_STR_HASH_OPT_crc64:
35 return BCH_STR_HASH_crc64;
36 case BCH_STR_HASH_OPT_siphash:
37 return c->sb.features & (1ULL << BCH_FEATURE_new_siphash)
38 ? BCH_STR_HASH_siphash
39 : BCH_STR_HASH_siphash_old;
45 struct bch_hash_info {
48 * For crc32 or crc64 string hashes the first key value of
49 * the siphash_key (k0) is used as the key.
51 SIPHASH_KEY siphash_key;
54 static inline struct bch_hash_info
55 bch2_hash_info_init(struct bch_fs *c, const struct bch_inode_unpacked *bi)
58 struct bch_hash_info info = {
59 .type = (bi->bi_flags >> INODE_STR_HASH_OFFSET) &
60 ~(~0U << INODE_STR_HASH_BITS),
61 .siphash_key = { .k0 = bi->bi_hash_seed }
64 if (unlikely(info.type == BCH_STR_HASH_siphash_old)) {
65 SHASH_DESC_ON_STACK(desc, c->sha256);
66 u8 digest[SHA256_DIGEST_SIZE];
68 desc->tfm = c->sha256;
70 crypto_shash_digest(desc, (void *) &bi->bi_hash_seed,
71 sizeof(bi->bi_hash_seed), digest);
72 memcpy(&info.siphash_key, digest, sizeof(info.siphash_key));
78 struct bch_str_hash_ctx {
86 static inline void bch2_str_hash_init(struct bch_str_hash_ctx *ctx,
87 const struct bch_hash_info *info)
90 case BCH_STR_HASH_crc32c:
91 ctx->crc32c = crc32c(~0, &info->siphash_key.k0,
92 sizeof(info->siphash_key.k0));
94 case BCH_STR_HASH_crc64:
95 ctx->crc64 = crc64_be(~0, &info->siphash_key.k0,
96 sizeof(info->siphash_key.k0));
98 case BCH_STR_HASH_siphash_old:
99 case BCH_STR_HASH_siphash:
100 SipHash24_Init(&ctx->siphash, &info->siphash_key);
107 static inline void bch2_str_hash_update(struct bch_str_hash_ctx *ctx,
108 const struct bch_hash_info *info,
109 const void *data, size_t len)
111 switch (info->type) {
112 case BCH_STR_HASH_crc32c:
113 ctx->crc32c = crc32c(ctx->crc32c, data, len);
115 case BCH_STR_HASH_crc64:
116 ctx->crc64 = crc64_be(ctx->crc64, data, len);
118 case BCH_STR_HASH_siphash_old:
119 case BCH_STR_HASH_siphash:
120 SipHash24_Update(&ctx->siphash, data, len);
127 static inline u64 bch2_str_hash_end(struct bch_str_hash_ctx *ctx,
128 const struct bch_hash_info *info)
130 switch (info->type) {
131 case BCH_STR_HASH_crc32c:
133 case BCH_STR_HASH_crc64:
134 return ctx->crc64 >> 1;
135 case BCH_STR_HASH_siphash_old:
136 case BCH_STR_HASH_siphash:
137 return SipHash24_End(&ctx->siphash) >> 1;
143 struct bch_hash_desc {
144 enum btree_id btree_id;
147 u64 (*hash_key)(const struct bch_hash_info *, const void *);
148 u64 (*hash_bkey)(const struct bch_hash_info *, struct bkey_s_c);
149 bool (*cmp_key)(struct bkey_s_c, const void *);
150 bool (*cmp_bkey)(struct bkey_s_c, struct bkey_s_c);
151 bool (*is_visible)(subvol_inum inum, struct bkey_s_c);
154 static inline bool is_visible_key(struct bch_hash_desc desc, subvol_inum inum, struct bkey_s_c k)
156 return k.k->type == desc.key_type &&
159 desc.is_visible(inum, k));
162 static __always_inline int
163 bch2_hash_lookup_in_snapshot(struct btree_trans *trans,
164 struct btree_iter *iter,
165 const struct bch_hash_desc desc,
166 const struct bch_hash_info *info,
167 subvol_inum inum, const void *key,
168 unsigned flags, u32 snapshot)
173 for_each_btree_key_upto_norestart(trans, *iter, desc.btree_id,
174 SPOS(inum.inum, desc.hash_key(info, key), snapshot),
175 POS(inum.inum, U64_MAX),
176 BTREE_ITER_SLOTS|flags, k, ret) {
177 if (is_visible_key(desc, inum, k)) {
178 if (!desc.cmp_key(k, key))
180 } else if (k.k->type == KEY_TYPE_hash_whiteout) {
183 /* hole, not found */
187 bch2_trans_iter_exit(trans, iter);
189 return ret ?: -BCH_ERR_ENOENT_str_hash_lookup;
192 static __always_inline int
193 bch2_hash_lookup(struct btree_trans *trans,
194 struct btree_iter *iter,
195 const struct bch_hash_desc desc,
196 const struct bch_hash_info *info,
197 subvol_inum inum, const void *key,
201 return bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot) ?:
202 bch2_hash_lookup_in_snapshot(trans, iter, desc, info, inum, key, flags, snapshot);
205 static __always_inline int
206 bch2_hash_hole(struct btree_trans *trans,
207 struct btree_iter *iter,
208 const struct bch_hash_desc desc,
209 const struct bch_hash_info *info,
210 subvol_inum inum, const void *key)
216 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
220 for_each_btree_key_upto_norestart(trans, *iter, desc.btree_id,
221 SPOS(inum.inum, desc.hash_key(info, key), snapshot),
222 POS(inum.inum, U64_MAX),
223 BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret)
224 if (!is_visible_key(desc, inum, k))
226 bch2_trans_iter_exit(trans, iter);
228 return ret ?: -BCH_ERR_ENOSPC_str_hash_create;
231 static __always_inline
232 int bch2_hash_needs_whiteout(struct btree_trans *trans,
233 const struct bch_hash_desc desc,
234 const struct bch_hash_info *info,
235 struct btree_iter *start)
237 struct btree_iter iter;
241 bch2_trans_copy_iter(&iter, start);
243 bch2_btree_iter_advance(&iter);
245 for_each_btree_key_continue_norestart(iter, BTREE_ITER_SLOTS, k, ret) {
246 if (k.k->type != desc.key_type &&
247 k.k->type != KEY_TYPE_hash_whiteout)
250 if (k.k->type == desc.key_type &&
251 desc.hash_bkey(info, k) <= start->pos.offset) {
257 bch2_trans_iter_exit(trans, &iter);
261 static __always_inline
262 int bch2_hash_set_in_snapshot(struct btree_trans *trans,
263 const struct bch_hash_desc desc,
264 const struct bch_hash_info *info,
265 subvol_inum inum, u32 snapshot,
266 struct bkey_i *insert,
267 bch_str_hash_flags_t str_hash_flags,
270 struct btree_iter iter, slot = { NULL };
275 for_each_btree_key_upto_norestart(trans, iter, desc.btree_id,
276 SPOS(insert->k.p.inode,
277 desc.hash_bkey(info, bkey_i_to_s_c(insert)),
279 POS(insert->k.p.inode, U64_MAX),
280 BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret) {
281 if (is_visible_key(desc, inum, k)) {
282 if (!desc.cmp_bkey(k, bkey_i_to_s_c(insert)))
285 /* hash collision: */
290 !(str_hash_flags & BCH_HASH_SET_MUST_REPLACE))
291 bch2_trans_copy_iter(&slot, &iter);
293 if (k.k->type != KEY_TYPE_hash_whiteout)
298 ret = -BCH_ERR_ENOSPC_str_hash_create;
300 bch2_trans_iter_exit(trans, &slot);
301 bch2_trans_iter_exit(trans, &iter);
308 if (!found && (str_hash_flags & BCH_HASH_SET_MUST_REPLACE)) {
309 ret = -BCH_ERR_ENOENT_str_hash_set_must_replace;
310 } else if (found && (str_hash_flags & BCH_HASH_SET_MUST_CREATE)) {
313 if (!found && slot.path)
316 insert->k.p = iter.pos;
317 ret = bch2_trans_update(trans, &iter, insert, update_flags);
323 static __always_inline
324 int bch2_hash_set(struct btree_trans *trans,
325 const struct bch_hash_desc desc,
326 const struct bch_hash_info *info,
328 struct bkey_i *insert,
329 bch_str_hash_flags_t str_hash_flags)
331 insert->k.p.inode = inum.inum;
334 return bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot) ?:
335 bch2_hash_set_in_snapshot(trans, desc, info, inum,
336 snapshot, insert, str_hash_flags, 0);
339 static __always_inline
340 int bch2_hash_delete_at(struct btree_trans *trans,
341 const struct bch_hash_desc desc,
342 const struct bch_hash_info *info,
343 struct btree_iter *iter,
344 unsigned update_flags)
346 struct bkey_i *delete;
349 delete = bch2_trans_kmalloc(trans, sizeof(*delete));
350 ret = PTR_ERR_OR_ZERO(delete);
354 ret = bch2_hash_needs_whiteout(trans, desc, info, iter);
358 bkey_init(&delete->k);
359 delete->k.p = iter->pos;
360 delete->k.type = ret ? KEY_TYPE_hash_whiteout : KEY_TYPE_deleted;
362 return bch2_trans_update(trans, iter, delete, update_flags);
365 static __always_inline
366 int bch2_hash_delete(struct btree_trans *trans,
367 const struct bch_hash_desc desc,
368 const struct bch_hash_info *info,
369 subvol_inum inum, const void *key)
371 struct btree_iter iter;
374 ret = bch2_hash_lookup(trans, &iter, desc, info, inum, key,
379 ret = bch2_hash_delete_at(trans, desc, info, &iter, 0);
380 bch2_trans_iter_exit(trans, &iter);
384 #endif /* _BCACHEFS_STR_HASH_H */