summaryrefslogtreecommitdiff
path: root/python
diff options
context:
space:
mode:
authorDonald Sharp <sharpd@nvidia.com>2022-11-08 14:38:02 -0500
committerDonald Sharp <sharpd@nvidia.com>2022-11-09 07:26:26 -0500
commitfcbb9447c52e65faf887f2c55a55a0afec2c41c1 (patch)
treeb84c54fdc34864fa8282effbfc50b35957b5fad8 /python
parent36c54fce566f1eaeeb61a2170f22e3b459cc8ef8 (diff)
bgpd: rpki was decrementing the node lock one time too many
The code was this: 1) match = bgp_table_subtree_lookup(rrp->bgp->rib[rrp->afi][rrp->safi], &rrp->prefix); 2) node = match; while (node) { if (bgp_dest_has_bgp_path_info_data(node)) { revalidate_bgp_node(node, rrp->afi, rrp->safi); } 3) node = bgp_route_next_until(node, match); } if (match) 4) bgp_dest_unlock_node(match); At 1) match was locked and became +1 At 2) match and node are now equal At 3) On first iteration, match is decremented( as that node points at it ) and the next item is locked, if it is found, and returned which becomes node If 3 is run again because node is non-null then, current node is decremented and the next node found is incremented and returned which becomes node again. So if we get to 4) match is unlocked again which is now a double unlock which, frankly, is not good. In all code paths that I can see the test for `if (match) ...` is not needed so let's just remove it. Signed-off-by: Donald Sharp <sharpd@nvidia.com>
Diffstat (limited to 'python')
0 files changed, 0 insertions, 0 deletions