diff options
| author |   Neale Ranns <nranns@cisco.com> | 2016-10-03 13:05:48 +0100 |
|---|---|---|
| committer |   Damjan Marion <dmarion.lists@gmail.com> | 2016-10-07 21:32:24 +0000 |
| commit | 3ee44040c66cbe47ff292ac7fb0badccbe2afe6d (patch) | |
| tree | a52a4dd0750467845f237ee5e4e88aa95ea11bab /vnet/vnet/dpo/load_balance_map.h | |
| parent | 4a7e58bf481adb843707eec4a81213776a6d5212 (diff) | |
unicast RPF for FIB2.0
In a heirarchical FIB performing a unicast RPF check would require the traversal of the data-plane graph to seek out all the adjacency objects and then read those to find their interface. This is not efficient. Instead, for each path-list we construct a list of unique input interfaces and link this uRPF-list against the entry in the prefix table. In the data-plane the uRPF list can be retrieved from the load-balance lookup result and the RPF check is a simple and efficient walk across the minimal interface list. The uRPF-list is maintained as the routing heirarchy changes, in a similar way to the data-plane object graph.
We also provide a knob to allow an arbitrary prefix to pass the loose check.
Change-Id: Ie7c0ae3c4483ef467cfd5b136ee0315ff98ec15b
Signed-off-by: Neale Ranns <nranns@cisco.com>
Diffstat (limited to 'vnet/vnet/dpo/load_balance_map.h')
| -rw-r--r-- | vnet/vnet/dpo/load_balance_map.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/vnet/vnet/dpo/load_balance_map.h b/vnet/vnet/dpo/load_balance_map.h index f080e97ccad..454bf4b3763 100644 --- a/vnet/vnet/dpo/load_balance_map.h +++ b/vnet/vnet/dpo/load_balance_map.h @@ -60,6 +60,7 @@ extern void load_balance_map_unlock(index_t lbmi); extern void load_balance_map_path_state_change(fib_node_index_t path_index); extern u8* format_load_balance_map(u8 *s, va_list ap); +extern void load_balance_map_show_mem(void); /** * The encapsulation breakages are for fast DP access |