From 95e390fa271a0b911a5e0475f24f2fee55f3edec Mon Sep 17 00:00:00 2001
From: Marvin Borner
Date: Sun, 21 Jan 2024 12:32:30 +0100
Subject: Configurable minimum tree size

For cool optimizer in blocade, hint hint :)
---
 src/tree.c | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

(limited to 'src/tree.c')

diff --git a/src/tree.c b/src/tree.c
index 25a974e..967e616 100644
--- a/src/tree.c
+++ b/src/tree.c
@@ -55,6 +55,7 @@ static int hash_compare(const void *_a, const void *_b)
 // applies the hash function to the tree's elements (similar to merkle trees)
 // also creates a set of lists with deduplication candidates
 // TODO: as above: rethink hash choice
+extern size_t min_size;
 static struct tree *build_tree(struct term *term, void **set)
 {
 	struct tree *tree = malloc(sizeof(*tree));
@@ -90,7 +91,7 @@ static struct tree *build_tree(struct term *term, void **set)
 		fatal("invalid type %d\n", term->type);
 	}
 
-	if (tree->size < 10) // not suitable for deduplication
+	if (tree->size < min_size) // not suitable for deduplication
 		return tree;
 
 	struct hash_to_list *element = malloc(sizeof(*element));
-- 
cgit v1.2.3