From 0290b5dfb3b3cb605ee06f23b23761610e7375c5 Mon Sep 17 00:00:00 2001 From: "Eric S. Raymond" Date: Tue, 2 Sep 2003 00:14:39 +0000 Subject: [PATCH] This appears to do reduction correctly. --- report.c | 5 ----- 1 file changed, 5 deletions(-) diff --git a/report.c b/report.c index 6bfe2b1..5897509 100644 --- a/report.c +++ b/report.c @@ -11,8 +11,6 @@ #define min(x, y) ((x < y) ? (x) : (y)) #define max(x, y) ((x > y) ? (x) : (y)) -#define DEBUG - static int local_duplicates; struct item @@ -228,7 +226,6 @@ static int merge_ranges(struct range_t *p, struct range_t *q, int nmatches) /* merge t into s, if the ranges in the match are compatible */ { int i; - return 0; /* * The general problem: you have two lists of shreds, of the same * lengths. Within each list, all shreds have the same hash. @@ -383,8 +380,6 @@ struct match_t *reduce_matches(int localdups) #endif /* DEBUG */ free(tp->matches); tp->matches = NULL; - /* if this garbages *tp the loop may fail */ - free(tp); /* list is altered, do another merge pass */ retry = 1; } -- 2.43.0