diff options
author | Jason A. Donenfeld <Jason@zx2c4.com> | 2017-10-03 06:18:45 +0200 |
---|---|---|
committer | Jason A. Donenfeld <Jason@zx2c4.com> | 2017-10-03 06:20:48 +0200 |
commit | 452dc76c606d47dc248f846f1202d708a7245f5e (patch) | |
tree | eb5fa1399b2a75f1681cdf0d5555e5babfe0088b /src/ratelimiter.c | |
parent | 9a93bd7a398acd6f693f6a8332fc0dc6e410a2e5 (diff) |
global: satisfy bitshift pedantry
Suggested-by: Sultan Alsawaf <sultanxda@gmail.com>
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
Diffstat (limited to 'src/ratelimiter.c')
-rw-r--r-- | src/ratelimiter.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/ratelimiter.c b/src/ratelimiter.c index c4281e1..0afcdac 100644 --- a/src/ratelimiter.c +++ b/src/ratelimiter.c @@ -150,7 +150,7 @@ int ratelimiter_init(void) * but what it shares in common is that it uses a massive hashtable. So, * we borrow their wisdom about good table sizes on different systems * dependent on RAM. This calculation here comes from there. */ - table_size = (totalram_pages > (1 << 30) / PAGE_SIZE) ? 8192 : max_t(unsigned long, 16, roundup_pow_of_two((totalram_pages << PAGE_SHIFT) / (1 << 14) / sizeof(struct hlist_head))); + table_size = (totalram_pages > (1U << 30) / PAGE_SIZE) ? 8192 : max_t(unsigned long, 16, roundup_pow_of_two((totalram_pages << PAGE_SHIFT) / (1U << 14) / sizeof(struct hlist_head))); max_entries = table_size * 8; table_v4 = kvzalloc(table_size * sizeof(struct hlist_head), GFP_KERNEL); |