isisd: fix vertex queue comparator

While vertizes should be strictly ordered on insertion, deletion
will of course encouter equality.

Signed-off-by: Christian Franke <chris@opensourcerouting.org>
This commit is contained in:
Christian Franke 2017-10-02 16:01:58 +02:00
parent f5129394ec
commit 60d3914270
2 changed files with 2 additions and 2 deletions

View File

@ -153,7 +153,7 @@ static int isis_vertex_queue_tent_cmp(void *a, void *b)
if (va->insert_counter > vb->insert_counter)
return 1;
assert(!"Vertizes should be strictly ordered");
return 0;
}
static struct skiplist *isis_vertex_queue_skiplist(void)

View File

@ -89,7 +89,7 @@ static void test_ordered(void)
assert(isis_vertex_queue_pop(&q) == vertices[1]);
assert(isis_find_vertex(&q, vertices[1]->N.id, vertices[1]->type) == NULL);
assert(isis_vertex_queue_pop(&q) == vertices[4]);
isis_vertex_queue_delete(&q, vertices[4]);
assert(isis_find_vertex(&q, vertices[4]->N.id, vertices[4]->type) == NULL);
assert(isis_vertex_queue_count(&q) == 0);