Function bloom_check_add

libCacheSim/dataStructure/bloom.c:52–82

}

static int bloom_check_add(struct bloom *bloom, const void *buffer, int len,
                           int add) {
  if (bloom->ready == 0) {
    printf("bloom at %p not initialized!\n", (void *)bloom);
    return -1;
  }

  int hits = 0;
  //  register unsigned int a = murmurhash2(buffer, len, 0x9747b28c);
  //  register unsigned int b = murmurhash2(buffer, len, a);
  register unsigned int a = XXH64(buffer, len, HASH_SEED0);
  register unsigned int b = XXH64(buffer, len, HASH_SEED1);
  register unsigned int x;
  register int i;

  for (i = 0; i < bloom->hashes; i++) {
    x = (a + i * b) % bloom->bits;
    if (test_bit_set_bit(bloom->bf, x, add)) {
      hits++;
    } else if (!add) {
      // Don't care about the presence of all the bits. Just our own.
      return 0;
    }
  }

  if (hits == bloom->hashes) {
    return 1;  // 1 == element already in (or collision)
  }

  return 0;
}

int bloom_init_size(struct bloom *bloom, int entries, double error,
                    unsigned int cache_size) {