Code Review / vpp.git / commit
? search:
summary | shortlog | log | commit | commitdiff | review | tree
(parent: 260de86) | patch
Adjacency walk more scalable 12/12012/2
authorNeale Ranns <[email protected]>
Mon, 23 Apr 2018 12:31:19 +0000 (05:31 -0700)
committerDamjan Marion <[email protected]>
Wed, 25 Apr 2018 12:31:38 +0000 (12:31 +0000)
commit580bba72e55961b1d3f98144244ac1780855f74a
tree91fc618ab0bb717966e98d3fcb39a1fbdf04d51btree | snapshot
parent260de8684d48c1a69e169112fa053d2df1b4871fcommit | diff
Adjacency walk more scalable

When walking all adjacencies for a given {next-hop,interface} instead of
walking all the adjacencies on that interface and matching the next-hop
(which is O(n) in the number of adjacencies on that link, find all instances
of an adjacency with any link-type and wtih that {next-hop,interfacE} pair:
this is O(1).

Change-Id: Ic80399fc9e93c8df111379c039e592d8cafbab18
Signed-off-by: Neale Ranns <[email protected]>
src/vnet/adj/adj_nbr.c diff | blob | history
src/vnet/interface.h diff | blob | history
Vector Packet Processing