mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-05-21 09:57:24 +00:00
6e7f305e54
This is based on @donaldsharp's work The current code base is the struct bgp_node data structure. The problem with this is that it creates a bunch of extra data per route_node. The table structure generates ‘holder’ nodes that are never going to receive bgp routes, and now the memory of those nodes is allocated as if they are a full bgp_node. After splitting up the bgp_node into bgp_dest and route_node, the memory of ‘holder’ node which does not have any bgp data will be allocated as the route_node, not the bgp_node, and the memory usage is reduced. The memory usage of BGP node will be reduced from 200B to 96B. The total memory usage optimization of this part is ~16.00%. Signed-off-by: Donald Sharp <sharpd@nvidia.com> Signed-off-by: Yuqing Zhao <xiaopanghu99@163.com> |
||
|---|---|---|
| .. | ||
| subdir.am | ||
| test_aspath.c | ||
| test_aspath.py | ||
| test_bgp_table.c | ||
| test_bgp_table.py | ||
| test_capability.c | ||
| test_capability.py | ||
| test_ecommunity.c | ||
| test_ecommunity.py | ||
| test_mp_attr.c | ||
| test_mp_attr.py | ||
| test_mpath.c | ||
| test_mpath.py | ||
| test_packet.c | ||
| test_peer_attr.c | ||
| test_peer_attr.py | ||