diff options
| author | Herbert Xu <herbert@gondor.apana.org.au> | 2017-04-28 14:10:48 +0800 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2017-04-28 10:14:09 -0400 |
| commit | 2d2ab658d2debcb4c0e29c9e6f18e5683f3077bf (patch) | |
| tree | 163eada4e9bf806b7057e5b5843820be1b6d0ff5 | |
| parent | e221c1f0fe2590042b4f8c3a8ccccd8e7bed2c31 (diff) | |
| download | linux-exynos-2d2ab658d2debcb4c0e29c9e6f18e5683f3077bf.tar.gz linux-exynos-2d2ab658d2debcb4c0e29c9e6f18e5683f3077bf.tar.bz2 linux-exynos-2d2ab658d2debcb4c0e29c9e6f18e5683f3077bf.zip | |
rhashtable: Do not lower max_elems when max_size is zero
The commit 6d684e54690c ("rhashtable: Cap total number of entries
to 2^31") breaks rhashtable users that do not set max_size. This
is because when max_size is zero max_elems is also incorrectly set
to zero instead of 2^31.
This patch fixes it by only lowering max_elems when max_size is not
zero.
Fixes: 6d684e54690c ("rhashtable: Cap total number of entries to 2^31")
Reported-by: Florian Fainelli <f.fainelli@gmail.com>
Reported-by: kernel test robot <fengguang.wu@intel.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
Signed-off-by: David S. Miller <davem@davemloft.net>
| -rw-r--r-- | lib/rhashtable.c | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/lib/rhashtable.c b/lib/rhashtable.c index 751630bbe409..3895486ef551 100644 --- a/lib/rhashtable.c +++ b/lib/rhashtable.c @@ -958,13 +958,14 @@ int rhashtable_init(struct rhashtable *ht, if (params->min_size) ht->p.min_size = roundup_pow_of_two(params->min_size); - if (params->max_size) - ht->p.max_size = rounddown_pow_of_two(params->max_size); - /* Cap total entries at 2^31 to avoid nelems overflow. */ ht->max_elems = 1u << 31; - if (ht->p.max_size < ht->max_elems / 2) - ht->max_elems = ht->p.max_size * 2; + + if (params->max_size) { + ht->p.max_size = rounddown_pow_of_two(params->max_size); + if (ht->p.max_size < ht->max_elems / 2) + ht->max_elems = ht->p.max_size * 2; + } ht->p.min_size = max(ht->p.min_size, HASH_MIN_SIZE); |