while (i < left->potential_buckets_count && j < right->potential_buckets_count)
{
- if (node->potential_buckets_count >= MAX_POTENTIAL_NEXTHOP_COUNT)
+ if (node->potential_buckets_count >= MAX_POTENTIAL_BUCKETS_COUNT)
return;
int res = aggregator_bucket_compare(left->potential_buckets[i], right->potential_buckets[j]);
while (i < left->potential_buckets_count && j < right->potential_buckets_count)
{
- if (node->potential_buckets_count >= MAX_POTENTIAL_NEXTHOP_COUNT)
+ if (node->potential_buckets_count >= MAX_POTENTIAL_BUCKETS_COUNT)
return;
int res = aggregator_bucket_compare(left->potential_buckets[i], right->potential_buckets[j]);
while (i < left->potential_buckets_count)
{
- if (node->potential_buckets_count >= MAX_POTENTIAL_NEXTHOP_COUNT)
+ if (node->potential_buckets_count >= MAX_POTENTIAL_BUCKETS_COUNT)
return;
if (node->potential_buckets_count == 0 || node->potential_buckets[node->potential_buckets_count - 1] != left->potential_buckets[i])
while (j < right->potential_buckets_count)
{
- if (node->potential_buckets_count >= MAX_POTENTIAL_NEXTHOP_COUNT)
+ if (node->potential_buckets_count >= MAX_POTENTIAL_BUCKETS_COUNT)
return;
if (node->potential_buckets_count == 0 || node->potential_buckets[node->potential_buckets_count - 1] != right->potential_buckets[j])
#include "nest/protocol.h"
#include "lib/hash.h"
-#define MAX_POTENTIAL_NEXTHOP_COUNT 16
+#define MAX_POTENTIAL_BUCKETS_COUNT 16
struct aggregator_config {
struct proto_config c;
struct trie_node *parent;
struct trie_node *child[2];
struct aggregator_bucket *bucket;
- struct aggregator_bucket *potential_buckets[MAX_POTENTIAL_NEXTHOP_COUNT];
+ struct aggregator_bucket *potential_buckets[MAX_POTENTIAL_BUCKETS_COUNT];
int potential_buckets_count;
};