1 #ifndef _BCACHEFS_STR_HASH_H
2 #define _BCACHEFS_STR_HASH_H
4 #include "btree_iter.h"
5 #include "btree_update.h"
12 #include <linux/crc32c.h>
13 #include <crypto/hash.h>
15 struct bch_hash_info {
19 SIPHASH_KEY siphash_key;
23 static inline struct bch_hash_info
24 bch2_hash_info_init(struct bch_fs *c,
25 const struct bch_inode_unpacked *bi)
28 struct bch_hash_info info = {
29 .type = (bi->bi_flags >> INODE_STR_HASH_OFFSET) &
30 ~(~0U << INODE_STR_HASH_BITS)
34 case BCH_STR_HASH_CRC32C:
35 case BCH_STR_HASH_CRC64:
36 info.crc_key = bi->bi_hash_seed;
38 case BCH_STR_HASH_SIPHASH: {
39 SHASH_DESC_ON_STACK(desc, c->sha256);
40 u8 digest[crypto_shash_digestsize(c->sha256)];
42 desc->tfm = c->sha256;
45 crypto_shash_digest(desc, (void *) &bi->bi_hash_seed,
46 sizeof(bi->bi_hash_seed), digest);
47 memcpy(&info.siphash_key, digest, sizeof(info.siphash_key));
57 struct bch_str_hash_ctx {
65 static inline void bch2_str_hash_init(struct bch_str_hash_ctx *ctx,
66 const struct bch_hash_info *info)
69 case BCH_STR_HASH_CRC32C:
70 ctx->crc32c = crc32c(~0, &info->crc_key, sizeof(info->crc_key));
72 case BCH_STR_HASH_CRC64:
73 ctx->crc64 = bch2_crc64_update(~0, &info->crc_key, sizeof(info->crc_key));
75 case BCH_STR_HASH_SIPHASH:
76 SipHash24_Init(&ctx->siphash, &info->siphash_key);
83 static inline void bch2_str_hash_update(struct bch_str_hash_ctx *ctx,
84 const struct bch_hash_info *info,
85 const void *data, size_t len)
88 case BCH_STR_HASH_CRC32C:
89 ctx->crc32c = crc32c(ctx->crc32c, data, len);
91 case BCH_STR_HASH_CRC64:
92 ctx->crc64 = bch2_crc64_update(ctx->crc64, data, len);
94 case BCH_STR_HASH_SIPHASH:
95 SipHash24_Update(&ctx->siphash, data, len);
102 static inline u64 bch2_str_hash_end(struct bch_str_hash_ctx *ctx,
103 const struct bch_hash_info *info)
105 switch (info->type) {
106 case BCH_STR_HASH_CRC32C:
108 case BCH_STR_HASH_CRC64:
109 return ctx->crc64 >> 1;
110 case BCH_STR_HASH_SIPHASH:
111 return SipHash24_End(&ctx->siphash) >> 1;
117 struct bch_hash_desc {
118 enum btree_id btree_id;
122 u64 (*hash_key)(const struct bch_hash_info *, const void *);
123 u64 (*hash_bkey)(const struct bch_hash_info *, struct bkey_s_c);
124 bool (*cmp_key)(struct bkey_s_c, const void *);
125 bool (*cmp_bkey)(struct bkey_s_c, struct bkey_s_c);
128 static inline struct btree_iter *
129 bch2_hash_lookup(struct btree_trans *trans,
130 const struct bch_hash_desc desc,
131 const struct bch_hash_info *info,
132 u64 inode, const void *key,
135 struct btree_iter *iter;
138 iter = bch2_trans_get_iter(trans, desc.btree_id,
139 POS(inode, desc.hash_key(info, key)),
140 BTREE_ITER_SLOTS|flags);
144 for_each_btree_key_continue(iter, BTREE_ITER_SLOTS, k) {
145 if (iter->pos.inode != inode)
148 if (k.k->type == desc.key_type) {
149 if (!desc.cmp_key(k, key))
151 } else if (k.k->type == desc.whiteout_type) {
154 /* hole, not found */
159 return IS_ERR(k.k) ? ERR_CAST(k.k) : ERR_PTR(-ENOENT);
162 static inline struct btree_iter *
163 bch2_hash_hole(struct btree_trans *trans,
164 const struct bch_hash_desc desc,
165 const struct bch_hash_info *info,
166 u64 inode, const void *key)
168 struct btree_iter *iter;
171 iter = bch2_trans_get_iter(trans, desc.btree_id,
172 POS(inode, desc.hash_key(info, key)),
173 BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
177 for_each_btree_key_continue(iter, BTREE_ITER_SLOTS, k) {
178 if (iter->pos.inode != inode)
181 if (k.k->type != desc.key_type)
185 return IS_ERR(k.k) ? ERR_CAST(k.k) : ERR_PTR(-ENOSPC);
188 static inline int bch2_hash_needs_whiteout(struct btree_trans *trans,
189 const struct bch_hash_desc desc,
190 const struct bch_hash_info *info,
191 struct btree_iter *start)
193 struct btree_iter *iter;
196 iter = bch2_trans_copy_iter(trans, start);
198 return PTR_ERR(iter);
200 bch2_btree_iter_next_slot(iter);
202 for_each_btree_key_continue(iter, BTREE_ITER_SLOTS, k) {
203 if (k.k->type != desc.key_type &&
204 k.k->type != desc.whiteout_type)
207 if (k.k->type == desc.key_type &&
208 desc.hash_bkey(info, k) <= start->pos.offset)
211 return btree_iter_err(k);
214 static inline int __bch2_hash_set(struct btree_trans *trans,
215 const struct bch_hash_desc desc,
216 const struct bch_hash_info *info,
217 u64 inode, struct bkey_i *insert, int flags)
219 struct btree_iter *iter, *slot = NULL;
222 iter = bch2_trans_get_iter(trans, desc.btree_id,
223 POS(inode, desc.hash_bkey(info, bkey_i_to_s_c(insert))),
224 BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
226 return PTR_ERR(iter);
228 for_each_btree_key_continue(iter, BTREE_ITER_SLOTS, k) {
229 if (iter->pos.inode != inode)
232 if (k.k->type == desc.key_type) {
233 if (!desc.cmp_bkey(k, bkey_i_to_s_c(insert)))
236 /* hash collision: */
241 !(flags & BCH_HASH_SET_MUST_REPLACE)) {
242 slot = bch2_trans_copy_iter(trans, iter);
244 return PTR_ERR(slot);
247 if (k.k->type != desc.whiteout_type)
251 return btree_iter_err(k) ?: -ENOSPC;
253 if (flags & BCH_HASH_SET_MUST_REPLACE)
256 insert->k.p = slot->pos;
257 bch2_trans_update(trans, BTREE_INSERT_ENTRY(slot, insert));
260 if (flags & BCH_HASH_SET_MUST_CREATE)
263 insert->k.p = iter->pos;
264 bch2_trans_update(trans, BTREE_INSERT_ENTRY(iter, insert));
268 static inline int bch2_hash_set(const struct bch_hash_desc desc,
269 const struct bch_hash_info *info,
270 struct bch_fs *c, u64 inode,
272 struct bkey_i *insert, int flags)
274 return bch2_trans_do(c, journal_seq, flags|BTREE_INSERT_ATOMIC,
275 __bch2_hash_set(&trans, desc, info,
276 inode, insert, flags));
279 static inline int bch2_hash_delete_at(struct btree_trans *trans,
280 const struct bch_hash_desc desc,
281 const struct bch_hash_info *info,
282 struct btree_iter *iter)
284 struct bkey_i *delete;
287 ret = bch2_hash_needs_whiteout(trans, desc, info, iter);
291 delete = bch2_trans_kmalloc(trans, sizeof(*delete));
293 return PTR_ERR(delete);
295 bkey_init(&delete->k);
296 delete->k.p = iter->pos;
297 delete->k.type = ret ? desc.whiteout_type : KEY_TYPE_DELETED;
299 bch2_trans_update(trans, BTREE_INSERT_ENTRY(iter, delete));
303 static inline int bch2_hash_delete(struct btree_trans *trans,
304 const struct bch_hash_desc desc,
305 const struct bch_hash_info *info,
306 u64 inode, const void *key)
308 struct btree_iter *iter;
310 iter = bch2_hash_lookup(trans, desc, info, inode, key,
313 return PTR_ERR(iter);
315 return bch2_hash_delete_at(trans, desc, info, iter);
318 #endif /* _BCACHEFS_STR_HASH_H */