From: Mathieu Desnoyers Date: Tue, 27 Aug 2013 21:58:22 +0000 (-0400) Subject: Fix: hash table growth (for small tables) should be limited X-Git-Tag: v0.8.0~1 X-Git-Url: https://git.liburcu.org/?a=commitdiff_plain;h=e53ab1eb49ad61eddcc9481bd6a6fbaf1b257439;hp=e53ab1eb49ad61eddcc9481bd6a6fbaf1b257439;p=urcu.git Fix: hash table growth (for small tables) should be limited Buckets with many entries encountered in a hash table could cause it to grow to a large size, beyond the scope for which this mechanism is expected to play a role when node accounting is available. Indeed, when the hash table grows to larger size, split-counter node accounting is expected to deal with resize/shrink rather than relying on an heuristic based on the largest bucket size. This is fixing an issue where we see hash tables sometimes reaching 65k entries index (65536*8 = 524288 bytes) for a workload limited to adding 1000 entries and then removing all of them, done in a loop (random keys). Signed-off-by: Mathieu Desnoyers ---