mirrors/bird
mirrors/bird
0
0
Fork 0
mirror of https://gitlab.nic.cz/labs/bird.git synced 2025-03-22 06:17:04 +00:00
Code Releases Activity

Remove unused code

Browse Source
This commit is contained in:
Igor Putovny 2024-05-10 15:58:02 +02:00
parent 8dee6af44c
commit 9aba7b47be
1 changed files with 0 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
proto/aggregator/aggregator.c
View File

@ -488,9 +488,6 @@ second_pass(struct trie_node *node)
assert(node != NULL); assert(node != NULL);
assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT); assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT);
//if (node->parent == NULL)
//assert(node->bucket != NULL);
if (is_leaf(node)) if (is_leaf(node))
{ {
assert(node->potential_buckets_count == 1); assert(node->potential_buckets_count == 1);
@ -518,21 +515,6 @@ second_pass(struct trie_node *node)
for (int j = i + 1; j < right->potential_buckets_count; j++) for (int j = i + 1; j < right->potential_buckets_count; j++)
assert(right->potential_buckets[i] != right->potential_buckets[j]); assert(right->potential_buckets[i] != right->potential_buckets[j]);
/*
qsort(left->potential_buckets, left->potential_buckets_count, sizeof(struct aggregator_bucket *), aggregator_bucket_compare_wrapper);
qsort(right->potential_buckets, right->potential_buckets_count, sizeof(struct aggregator_bucket *), aggregator_bucket_compare_wrapper);
for (int i = 1; i < left->potential_buckets_count; i++)
{
assert((uintptr_t)left->potential_buckets[i - 1] < (uintptr_t)left->potential_buckets[i]);
}
for (int i = 1; i < right->potential_buckets_count; i++)
{
assert((uintptr_t)right->potential_buckets[i - 1] < (uintptr_t)right->potential_buckets[i]);
}
*/
if (bucket_sets_are_disjoint(left, right)) if (bucket_sets_are_disjoint(left, right))
compute_buckets_union(node, left, right); compute_buckets_union(node, left, right);
else else
@ -570,9 +552,6 @@ third_pass(struct trie_node *node)
if (node == NULL) if (node == NULL)
return; return;
//if (node->parent == NULL)
//assert(node->bucket != NULL);
assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT); assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT);
/* Root is assigned any of its potential buckets */ /* Root is assigned any of its potential buckets */
@ -580,7 +559,6 @@ third_pass(struct trie_node *node)
{ {
assert(node->potential_buckets_count > 0); assert(node->potential_buckets_count > 0);
assert(node->potential_buckets[0] != NULL); assert(node->potential_buckets[0] != NULL);
//assert(node->bucket != NULL);
node->bucket = node->potential_buckets[0]; node->bucket = node->potential_buckets[0];
} }
else else