Matt McCutchen's Web Site
/
rsync
/
rsync-patches.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
When deleting extraneous xattrs, never delete items from the system
[rsync/rsync-patches.git]
/
dynamic_hash.diff
diff --git
a/dynamic_hash.diff
b/dynamic_hash.diff
index
d5b7e56
..
f9a41d5
100644
(file)
--- a/
dynamic_hash.diff
+++ b/
dynamic_hash.diff
@@
-5,12
+5,18
@@
modulus calculation for (up to) every byte of the source file, which slows
down the code for normal file sizes (e.g. 4 CPU seconds slower on a Pentium
III when copying a 65 MB file without very much matching data).
down the code for normal file sizes (e.g. 4 CPU seconds slower on a Pentium
III when copying a 65 MB file without very much matching data).
-This was u
dap
ted for the latest codebase from a patch written by Shachar
+This was u
pda
ted for the latest codebase from a patch written by Shachar
Shemesh.
Shemesh.
+To use this patch, run these commands for a successful build:
+
+ patch -p1 <patches/dynamic_hash.diff
+ ./configure (optional if already run)
+ make
+
--- old/match.c
+++ new/match.c
--- old/match.c
+++ new/match.c
-@@ -
37,24 +37
,31 @@ static int total_matches;
+@@ -
40,24 +40
,31 @@ static int total_matches;
extern struct stats stats;
extern struct stats stats;
@@
-49,7
+55,7
@@
Shemesh.
for (i = 0; i < s->count; i++) {
uint32 t = SUM2HASH(s->sums[i].sum1);
for (i = 0; i < s->count; i++) {
uint32 t = SUM2HASH(s->sums[i].sum1);
-@@ -16
2,11 +169
,11 @@ static void hash_search(int f,struct sum
+@@ -16
5,11 +172
,11 @@ static void hash_search(int f,struct sum
(double)offset, s2 & 0xFFFF, s1 & 0xFFFF);
}
(double)offset, s2 & 0xFFFF, s1 & 0xFFFF);
}