summaryrefslogtreecommitdiff
path: root/usr.sbin/bgpd/mrt.h
diff options
context:
space:
mode:
authorClaudio Jeker <claudio@cvs.openbsd.org>2018-09-07 10:49:23 +0000
committerClaudio Jeker <claudio@cvs.openbsd.org>2018-09-07 10:49:23 +0000
commitf1fda29977d90ff17e7d9baa04ea5155ea74b57f (patch)
tree7f41c4d97e2efed226f41b6529f8887616f86789 /usr.sbin/bgpd/mrt.h
parent07b9214816598008f3c55b9dd7571699ebc5f379 (diff)
Implement a fast presix-set lookup. This magic trie is able to match a
prefix addr/plen to a prefix-set spec addr/plen prefixlen min - max (a prefix including prefixlen range). Every addr/plen pair is a node in the trie and the prefixlen is added as a bitmask to those nodes. For the lookup the any match is OK, there is no need to do longest or best prefix matching. Inspiration for this solution comes from the way bird implements this which was done by Ondrej Zajicek santiago (at) crfreenet.org OK benno@
Diffstat (limited to 'usr.sbin/bgpd/mrt.h')
0 files changed, 0 insertions, 0 deletions