dovecot-1.1: sort index: Removed some optimization checks that w...
dovecot at dovecot.org
dovecot at dovecot.org
Fri Jun 6 20:08:27 EEST 2008
details: http://hg.dovecot.org/dovecot-1.1/rev/5824e6f1d279
changeset: 7612:5824e6f1d279
user: Timo Sirainen <tss at iki.fi>
date: Fri Jun 06 19:40:07 2008 +0300
description:
sort index: Removed some optimization checks that wouldn't always be true,
causing bad results.
diffstat:
1 file changed, 1 insertion(+), 2 deletions(-)
src/lib-storage/index/index-sort-string.c | 3 +--
diffs (13 lines):
diff -r 5f481022db04 -r 5824e6f1d279 src/lib-storage/index/index-sort-string.c
--- a/src/lib-storage/index/index-sort-string.c Fri Jun 06 17:15:14 2008 +0300
+++ b/src/lib-storage/index/index-sort-string.c Fri Jun 06 19:40:07 2008 +0300
@@ -483,8 +483,7 @@ index_sort_add_ids_range(struct sort_str
right_sort_id = nodes[right_idx].sort_id;
/* check if all of them should have the same sort IDs. we don't want
to hit the renumbering code in that situation. */
- if ((left_sort_id == right_sort_id && left_sort_id != 0) ||
- left_sort_id == (uint32_t)-1 || right_sort_id == 1) {
+ if (left_sort_id == right_sort_id && left_sort_id != 0) {
/* they should all have the same sort ID */
for (i = left_idx + 1; i < right_idx; i++) {
nodes[i].sort_id = left_sort_id;
More information about the dovecot-cvs
mailing list