greg/pcompress
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Speed up sort comparator function.

Browse source
This commit is contained in:
Moinak Ghosh 2012-08-17 13:18:50 +05:30
parent 2dadf411fa
commit 023dcae19a
1 changed files with 11 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

19
rabin/rabin_polynomial.c
View file

@ -264,18 +264,21 @@ cmpblks(const void *a, const void *b)
if (a1->cksum_n_offset < b1->cksum_n_offset) { if (a1->cksum_n_offset < b1->cksum_n_offset) {
return (-1); return (-1);
} else if (a1->cksum_n_offset == b1->cksum_n_offset) { } else if (a1->cksum_n_offset == b1->cksum_n_offset) {
int l1 = a1->length;
int l2 = b1->length;
/* /*
* If fingerprints match then compare lengths. Length match makes * If fingerprints match then compare lengths. Length match makes
* for strong exact detection/ordering during sort while stopping * for strong exact detection/ordering during sort while stopping
* short of expensive memcmp(). * short of expensive memcmp() during sorting.
*
* Even though rabin_blockentry_t->length is unsigned we use signed
* int here to avoid branches. In practice a rabin block size at
* this point varies from 2K to 128K. The length is unsigned in
* order to support non-duplicate block merging and large blocks
* after this point.
*/ */
if (a1->length < b1->length) { return (l1 - l2);
return (-1);
} else if (a1->length == b1->length) {
return (0);
} else {
return (1);
}
} else { } else {
return (1); return (1);
} }