From 0e4a9bc81d0af7358f14a1c2a9bc3351f1b6a0b1 Mon Sep 17 00:00:00 2001 From: Jens Axboe Date: Sun, 25 Sep 2016 14:10:24 -0600 Subject: [PATCH] bloom: don't enforce minimum entry count We defaulted to 1G of entries, which is crazy. Assume the caller passes in the right amount. Fixes: 1b2a83dcda75 ("file: add bloom filter to avoid quadratic lookup behavior") Signed-off-by: Jens Axboe --- lib/bloom.c | 3 --- 1 file changed, 3 deletions(-) diff --git a/lib/bloom.c b/lib/bloom.c index 9ccec5fa..fa38db95 100644 --- a/lib/bloom.c +++ b/lib/bloom.c @@ -60,8 +60,6 @@ static struct bloom_hash hashes[] = { #define N_HASHES 5 -#define MIN_ENTRIES 1073741824UL - struct bloom *bloom_new(uint64_t entries) { struct bloom *b; @@ -72,7 +70,6 @@ struct bloom *bloom_new(uint64_t entries) b = malloc(sizeof(*b)); b->nentries = entries; no_uints = (entries + BITS_PER_INDEX - 1) / BITS_PER_INDEX; - no_uints = max((unsigned long) no_uints, MIN_ENTRIES); b->map = calloc(no_uints, sizeof(uint32_t)); if (!b->map) { free(b); -- 2.25.1