3ab001b974
This is implemented in a way similar to lib/slists.h, but it took some more effort to make rehashing not disturb the readers. We do it by just taking _highest_ k bits of ipa_hash as our hash value and sorting each box by whole ipa_hash(). Consult FIB_ITERATE_* macros in nest/route.h. Implemented fib_check() debugging function and also rewrote the rehashing algorithm to use better thresholds and not to waste time by rehashing forth and back. |
||
---|---|---|
.. | ||
bird.h | ||
config.Y | ||
iface.c | ||
iface.h | ||
Makefile | ||
proto.c | ||
protocol.h | ||
route.h | ||
rt-attr.c | ||
rt-dev.c | ||
rt-dev.h | ||
rt-fib.c | ||
rt-table.c |