summaryrefslogtreecommitdiff
path: root/diffcore-delta.c
AgeCommit message (Collapse)AuthorFilesLines
2007-06-30diffcore-delta.c: Ignore CR in CRLF for text filesLibravatar Junio C Hamano1-3/+11
This ignores CR byte in CRLF sequence in text file when computing similarity of two blobs. Usually this should not matter as nobody sane would be checking in a file with CRLF line endings to the repository (they would use autocrlf so that the repository copy would have LF line endings). Signed-off-by: Junio C Hamano <gitster@pobox.com>
2007-06-30diffcore-delta.c: update the comment on the algorithm.Libravatar Junio C Hamano1-12/+9
The comment at the top of the file described an old algorithm that was neutral to text/binary differences (it hashed sliding window of N-byte sequences and counted overlaps), but long time ago we switched to a new heuristics that are more suitable for line oriented (read: text) files that are much faster. Signed-off-by: Junio C Hamano <gitster@pobox.com>
2007-06-30diffcore_count_changes: pass diffcore_filespecLibravatar Junio C Hamano1-4/+4
We may want to use richer information on the data we are dealing with in this function, so instead of passing a buffer address and length, just pass the diffcore_filespec structure. Existing callers always call this function with parameters taken from a filespec anyway, so there is no functionality changes. Signed-off-by: Junio C Hamano <gitster@pobox.com>
2006-03-15diffcore-delta: 64-byte-or-EOL ultrafast replacement (hash fix).Libravatar Linus Torvalds1-9/+10
The rotating 64-bit number was not really rotating, and worse yet ulong was longer than 64-bit on 64-bit architectures X-<. Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-03-15diffcore-delta: 64-byte-or-EOL ultrafast replacement.Libravatar Linus Torvalds1-18/+16
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-03-12diffcore-delta: tweak hashbase value.Libravatar Junio C Hamano1-1/+8
This tweaks the maximum hashvalue we use to hash the string into without making the maximum size of the hashtable can grow from the current limit. With this, the renames detected becomes a bit more precise without incurring additional paging cost. Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-03-12diffcore-delta: make the hash a bit denser.Libravatar Junio C Hamano1-4/+9
To reduce wasted memory, wait until the hash fills up more densely before we rehash. This reduces the working set size a bit further. Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-03-12diffcore-rename: somewhat optimized.Libravatar Junio C Hamano1-21/+140
This changes diffcore-rename to reuse statistics information gathered during similarity estimation, and updates the hashtable implementation used to keep track of the statistics to be denser. This seems to give better performance. Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-03-04diffcore-delta: make change counter to byte oriented again.Libravatar Junio C Hamano1-28/+68
The textual line oriented change counter was fun but was not very effective. It tended to overcount the changes. This one changes it to a simple N-letter substring based implementation. Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-02-28diffcore-rename: split out the delta counting code.Libravatar Junio C Hamano1-0/+43
This is to rework diffcore break/rename/copy detection code so that it does not affected when deltifier code gets improved. Signed-off-by: Junio C Hamano <junkio@cox.net>