Configurable minimum tree sizeHEADmain

For cool optimizer in blocade, hint hint :)

3 files changed, 10 insertions, 3 deletions

diff --git a/src/log.c b/src/log.c
index a34c8e8..80985a3 100644
--- a/src/log.c
+++ b/src/log.c
@@ -14,7 +14,7 @@ void debug(const char *format, ...)
 	if (!debug_enabled)
 		return;
 
-	fprintf(stderr, "[DEBUG] ");
+	fprintf(stderr, "[DEBUG] BLoC: ");
 
 	va_list ap;
 	va_start(ap, format);
@@ -29,7 +29,7 @@ void debug_enable(int enable)
 
 void fatal(const char *format, ...)
 {
-	fprintf(stderr, "[FATAL] ");
+	fprintf(stderr, "[FATAL] BLoC: ");
 
 	va_list ap;
 	va_start(ap, format);
diff --git a/src/main.c b/src/main.c
index 8a47a44..f217cf7 100644
--- a/src/main.c
+++ b/src/main.c
@@ -17,6 +17,9 @@
 // automatically generated using gengetopt
 #include "cmdline.h"
 
+// min size for a term to be considered for deduplication
+size_t min_size = 0;
+
 #define BUF_SIZE 1024
 static char *read_stdin(void)
 {
@@ -179,6 +182,9 @@ int main(int argc, char **argv)
 	if (!input)
 		return 1;
 
+	min_size = args.min_size_arg;
+	debug("min tree size: %lu\n", min_size);
+
 	if (args.test_flag && args.from_blc_flag && !args.from_bloc_flag) {
 		test(input);
 		return 0;
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));