diff options
author | lloyd <[email protected]> | 2007-05-31 03:25:19 +0000 |
---|---|---|
committer | lloyd <[email protected]> | 2007-05-31 03:25:19 +0000 |
commit | 55608e7dd1aa593944f967f2549564e4f42b654e (patch) | |
tree | ec2ec03a762a6dac82eb608487d5394370135624 /include/botan.h | |
parent | 22ecdc45a0efa4c444d0b7010b7cd743aeb68c57 (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/botan.h')
-rw-r--r-- | include/botan.h | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/include/botan.h b/include/botan.h index 8ae97ace3..007bf411e 100644 --- a/include/botan.h +++ b/include/botan.h @@ -9,5 +9,4 @@ #include <botan/lookup.h> #include <botan/rng.h> #include <botan/version.h> -#include <botan/bit_ops.h> #include <botan/parsing.h> |