tree 4a07966ead29f783b0350a51c4c5c6338910f176
parent 155bd0ce23144e5c7067965a22646523f1a38b51
author Shawn O. Pearce <spearce@spearce.org> 1166090866 -0500
committer Junio C Hamano <junkio@cox.net> 1166092833 -0800

Bypass expensive content comparsion during rename detection.

When comparing file contents during the second loop through a rename
detection attempt we can skip the expensive byte-by-byte comparsion
if both source and destination files have valid SHA1 values.  This
improves performance by avoiding either an expensive open/mmap to
read the working tree copy, or an expensive inflate of a blob object.

Unfortunately we still have to at least initialize the sizes of the
source and destination files even if the SHA1 values don't match.
Failing to initialize the sizes causes a number of test cases to fail
and start reporting different copy/rename behavior than was expected.

Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>