| commit | e869e113c8f91999f9a433436e0b863fe2727b61 | |
| author | Linus Torvalds <torvalds@linux-foundation.org> | |
| Thu, 6 Aug 2009 14:27:57 +0000 (6 07:27 -0700) | ||
| committer | Junio C Hamano <gitster@pobox.com> | |
| Thu, 6 Aug 2009 20:56:45 +0000 (6 13:56 -0700) | ||
| tree | 06462d71c0f8dbbf735da04994967cc0e92f9da2 | treesnapshot (tar.gz zip) |
| parent | ab14c823dfbf1245712c8179952b51822135d8a8 | commitdiff |
block-sha1: Use '(B&C)+(D&(B^C))' instead of '(B&C)|(D&(B|C))' in round 3
It's an equivalent expression, but the '+' gives us some freedom in
instruction selection (for example, we can use 'lea' rather than 'add'),
and associates with the other additions around it to give some minor
scheduling freedom.
Suggested-by: linux@horizon.com
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
It's an equivalent expression, but the '+' gives us some freedom in
instruction selection (for example, we can use 'lea' rather than 'add'),
and associates with the other additions around it to give some minor
scheduling freedom.
Suggested-by: linux@horizon.com
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
| block-sha1/sha1.c | diffblobblamehistory |