From 55608e7dd1aa593944f967f2549564e4f42b654e Mon Sep 17 00:00:00 2001 From: lloyd Date: Thu, 31 May 2007 03:25:19 +0000 Subject: Write functions to handle loading and saving words a block at a time, taking into account endian differences. The current code does not take advantage of the knowledge of which endianness we are running on; an optimization suggested by Yves Jerschow is to use (unsafe) casts to speed up the load/store operations. This turns out to provide large performance increases (30% or more) in some cases. Even without the unsafe casts, this version seems to average a few percent faster, probably because the longer loading loops have been partially or fully unrolled. This also makes the code implementing low-level algorithms like ciphers and hashes a bit more succint. --- src/rmd128.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'src/rmd128.cpp') diff --git a/src/rmd128.cpp b/src/rmd128.cpp index 1614de3a2..ea7c11342 100644 --- a/src/rmd128.cpp +++ b/src/rmd128.cpp @@ -58,7 +58,7 @@ inline void F4(u32bit& A, u32bit B, u32bit C, u32bit D, void RIPEMD_128::hash(const byte input[]) { for(u32bit j = 0; j != 16; ++j) - M[j] = make_u32bit(input[4*j+3], input[4*j+2], input[4*j+1], input[4*j]); + M[j] = load_le(input, j); u32bit A1 = digest[0], A2 = A1, B1 = digest[1], B2 = B1, C1 = digest[2], C2 = C1, D1 = digest[3], D2 = D1; @@ -145,8 +145,8 @@ void RIPEMD_128::hash(const byte input[]) *************************************************/ void RIPEMD_128::copy_out(byte output[]) { - for(u32bit j = 0; j != OUTPUT_LENGTH; ++j) - output[j] = get_byte(3 - (j % 4), digest[j/4]); + for(u32bit j = 0; j != OUTPUT_LENGTH; j += 4) + store_le(digest[j/4], output + j); } /************************************************* -- cgit v1.2.3