7 #include "../crc/xxhash.h"
8 #include "../crc/murmur3.h"
9 #include "../crc/crc32c.h"
10 #include "../crc/fnv.h"
18 #define BITS_PER_INDEX (sizeof(uint32_t) * 8)
19 #define BITS_INDEX_MASK (BITS_PER_INDEX - 1)
23 uint32_t (*fn)(const void *, uint32_t, uint32_t);
26 static uint32_t bloom_crc32c(const void *buf, uint32_t len, uint32_t seed)
28 return fio_crc32c(buf, len);
31 static uint32_t bloom_fnv(const void *buf, uint32_t len, uint32_t seed)
33 return fnv(buf, len, seed);
36 #define BLOOM_SEED 0x8989
38 static struct bloom_hash hashes[] = {
63 struct bloom *bloom_new(uint64_t entries)
70 b = malloc(sizeof(*b));
71 b->nentries = entries;
72 no_uints = (entries + BITS_PER_INDEX - 1) / BITS_PER_INDEX;
73 b->map = calloc(no_uints, sizeof(uint32_t));
82 void bloom_free(struct bloom *b)
88 static bool __bloom_check(struct bloom *b, const void *data, unsigned int len,
91 uint32_t hash[N_HASHES];
94 for (i = 0; i < N_HASHES; i++) {
95 hash[i] = hashes[i].fn(data, len, hashes[i].seed);
96 hash[i] = hash[i] % b->nentries;
100 for (i = 0; i < N_HASHES; i++) {
101 const unsigned int index = hash[i] / BITS_PER_INDEX;
102 const unsigned int bit = hash[i] & BITS_INDEX_MASK;
104 if (b->map[index] & (1U << bit))
107 b->map[index] |= 1U << bit;
110 return was_set == N_HASHES;
113 bool bloom_set(struct bloom *b, uint32_t *data, unsigned int nwords)
115 return __bloom_check(b, data, nwords * sizeof(uint32_t), true);
118 bool bloom_string(struct bloom *b, const char *data, unsigned int len,
121 return __bloom_check(b, data, len, set);