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.

1 files changed, 1 insertions, 4 deletions

diff --git a/src/adler32.cpp b/src/adler32.cpp
index b27fa247b..51f6cbea3 100644
--- a/src/adler32.cpp
+++ b/src/adler32.cpp
@@ -65,10 +65,7 @@ void Adler32::add_data(const byte input[], u32bit length)
 *************************************************/
 void Adler32::final_result(byte output[])
    {
-   output[0] = get_byte(2, S2);
-   output[1] = get_byte(3, S2);
-   output[2] = get_byte(2, S1);
-   output[3] = get_byte(3, S1);
+   store_be(output, S2, S1);
    clear();
    }