mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-08-06 16:20:08 +00:00
![]() * Each node in the routing table is changed into a list, holding the multiple equal-cost paths. * If one of the multiple entries gets less-preferred (greater metric or greater distance), it will be directly deleted instead of starting a garbage-collection timer for it. The garbage-collection timer is started only when the last entry in the list gets INFINITY. * Some new functions are used to maintain the ECMP list. And hence ripng_route_process(), ripng_redistribute_add() and ripng_timeout() are significantly simplified. * ripng_zebra_ipv6_add() and ripng_zebra_ipv6_delete() now can share the common code. The common part is moved to ripng_zebra_ipv6_send(). Signed-off-by: Feng Lu <lu.feng@6wind.com> Reviewed-by: Alain Ritoux <alain.ritoux@6wind.com> Signed-off-by: Nicolas Dichtel <nicolas.dichtel@6wind.com> Acked-by: Vincent Jardin <vincent.jardin@6wind.com> Signed-off-by: David Lamparter <equinox@opensourcerouting.org> |
||
---|---|---|
.. | ||
.gitignore | ||
Makefile.am | ||
ripng_debug.c | ||
ripng_debug.h | ||
ripng_interface.c | ||
ripng_main.c | ||
ripng_nexthop.c | ||
ripng_nexthop.h | ||
ripng_offset.c | ||
ripng_peer.c | ||
ripng_route.c | ||
ripng_route.h | ||
ripng_routemap.c | ||
ripng_zebra.c | ||
ripngd.c | ||
ripngd.conf.sample | ||
ripngd.h |