summaryrefslogtreecommitdiff
path: root/babeld/source.c
diff options
context:
space:
mode:
authorStephen Hemminger <shemminger@vyatta.com>2013-01-11 18:25:26 +0000
committerDavid Lamparter <equinox@opensourcerouting.org>2013-02-24 20:48:16 +0100
commit97c84db00c01b808337bedf69f696a1517e3d8c0 (patch)
tree1af03fc32c0fc938c148ebdf3ad1eb812e254efc /babeld/source.c
parent90645f5598ca8b25cd2692f2ac0d2778a3fd2755 (diff)
hash: dynamically grow hash table
Dynamically grow the hash table index if the chains get too long. If expansion doesn't help keep chain length short, then stop expanding, to avoid bad behavior if there is a poor hash function. Not a new idea, based on concepts in uthash. Depends on my previous patch to restrict hash to power of 2. Signed-off-by: Stephen Hemminger <shemminger@vyatta.com> [profiling results: sum of cycles spent in hash_get/jhash with RIPE RIS test data (single simple BGP peer) improved to 69% of previously spent] Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
Diffstat (limited to 'babeld/source.c')
0 files changed, 0 insertions, 0 deletions