summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorDavid Lamparter <equinox@opensourcerouting.org>2017-07-14 17:53:59 +0200
committerDavid Lamparter <equinox@opensourcerouting.org>2017-07-14 17:53:59 +0200
commit33cef919327fe03dbce53a422caccecb3f09faca (patch)
treed841b5e5d8ea7ec784e439428c4d4d364b7cae19
parentnhrpd: enable -Werror (diff)
downloadfrr-33cef919327fe03dbce53a422caccecb3f09faca.tar.xz
frr-33cef919327fe03dbce53a422caccecb3f09faca.zip
lib: parser: remove incorrect assert
A {foo|bar|baz} graph node will have more than 1/2 incoming links even if no other references are left to it (which is what the assert was previously trying to ensure.) I don't see a good way to "fix" the assert so I'm just removing it. Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
-rw-r--r--lib/command_graph.c2
1 files changed, 0 insertions, 2 deletions
diff --git a/lib/command_graph.c b/lib/command_graph.c
index 4254b91d9..2ae294e5a 100644
--- a/lib/command_graph.c
+++ b/lib/command_graph.c
@@ -348,8 +348,6 @@ cmd_merge_nodes (struct graph *oldgraph, struct graph *newgraph,
/* nothing found => add new to old */
if (i == vector_active (old->to) && direction > 0)
{
- assert (vector_count (cnew->from) ==
- (cmd_nodes_link (cnew, cnew) ? 2 : 1));
graph_remove_edge (new, cnew);
cmd_reparent_tree (newgraph, oldgraph, cnew);