Remove unused code

diff --git a/proto/aggregator/aggregator.c b/proto/aggregator/aggregator.c
index 3ea6a7f875a15829430e7e494682d023e376c232..03290575d7e989edb53a4a1237b670fdd2428fcf 100644 (file)
--- a/proto/aggregator/aggregator.c
+++ b/proto/aggregator/aggregator.c
@@ -779,42 +779,6 @@ check_ancestors_after_aggregation(const struct trie_node *node)
     check_ancestors_after_aggregation(node->child[1]);
 }
 
-/*
- * Recover trie to the state before aggregation
- */
-static void
-deaggregate(struct trie_node *node)
-{
-  assert(node != NULL);
-
-  node->status = NON_FIB;
-  node->selected_bucket = NULL;
-  node->ancestor = NULL;
-  node->potential_buckets_count = 0;
-  memset(node->potential_buckets, 0, sizeof(node->potential_buckets));
-
-  if (ORIGINAL == node->px_origin)
-  {
-    assert(node->original_bucket != NULL);
-    node->status = IN_FIB;
-  }
-  else
-  {
-    /*
-     * Delete the original bucket as it is inherited from the closest
-     * ancestor and will be set during first pass
-     */
-    assert(node->original_bucket != NULL);
-    node->original_bucket = NULL;
-  }
-
-  if (node->child[0])
-    deaggregate(node->child[0]);
-
-  if (node->child[1])
-    deaggregate(node->child[1]);
-}
-
 /*
  * Merge sets of potential buckets going from @node upwards.
  * Stop when sets don't change and return the last updated node.