aboutsummaryrefslogtreecommitdiffstats
path: root/include/adler32.h
diff options
context:
space:
mode:
authorlloyd <[email protected]>2007-05-31 03:25:19 +0000
committerlloyd <[email protected]>2007-05-31 03:25:19 +0000
commit55608e7dd1aa593944f967f2549564e4f42b654e (patch)
treeec2ec03a762a6dac82eb608487d5394370135624 /include/adler32.h
parent22ecdc45a0efa4c444d0b7010b7cd743aeb68c57 (diff)
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.
Diffstat (limited to 'include/adler32.h')
-rw-r--r--include/adler32.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/include/adler32.h b/include/adler32.h
index 4a6975e90..4beb3bdb6 100644
--- a/include/adler32.h
+++ b/include/adler32.h
@@ -25,7 +25,7 @@ class Adler32 : public HashFunction
void add_data(const byte[], u32bit);
void final_result(byte[]);
void hash(const byte[], u32bit);
- u32bit S1, S2;
+ u16bit S1, S2;
};
}