summaryrefslogtreecommitdiff
path: root/python/xref2vtysh.py
diff options
context:
space:
mode:
authorDonald Sharp <sharpd@nvidia.com>2024-09-06 10:39:41 -0400
committerDonald Sharp <sharpd@nvidia.com>2024-09-06 10:39:41 -0400
commitbb78f73fa624bb5c2ee8612124ae51af6f6dc91c (patch)
treea2ff17c93f87098a5e245647a4b961a2ea2a21ef /python/xref2vtysh.py
parentf3f96f95bd836c438dd549327baed334ba8d44fe (diff)
bgpd: Reduce # of iterations when doing llgr
Code was scanning a table then identifying a prefix that needed to be modified then calling code that reran bestpath on the entire table again. If you had multiple items that needed processing you would end up scanning and setting the entire table to be scanned multiple times. No bueno. a) We do not need to reprocess items that are not being modified. b) We do not need to walk the entire table multiple times, we have the data that is needed already. Modify the code to just call bgp_process on the interesting nodes. Signed-off-by: Donald Sharp <sharpd@nvidia.com>
Diffstat (limited to 'python/xref2vtysh.py')
0 files changed, 0 insertions, 0 deletions