summaryrefslogtreecommitdiffstats
path: root/crypto/rmd320.c
diff options
context:
space:
mode:
authorHerbert Xu <herbert@gondor.apana.org.au>2008-06-02 13:30:38 +0200
committerHerbert Xu <herbert@gondor.apana.org.au>2008-07-10 14:35:15 +0200
commit5cdcc22f25b0766fe16d5dd8e3b2efc91fa4da6e (patch)
tree90078f745a3cf28efdc32db030c3505e06c3c74a /crypto/rmd320.c
parent[CRYPTO] hifn: Simplify code using ARRAY_SIZE() macro (diff)
downloadlinux-5cdcc22f25b0766fe16d5dd8e3b2efc91fa4da6e.tar.xz
linux-5cdcc22f25b0766fe16d5dd8e3b2efc91fa4da6e.zip
[CRYPTO] rmd: Use pointer form of endian swapping operations
This patch converts the relevant code in the rmd implementations to use the pointer form of the endian swapping operations. This allows certain architectures to generate more optimised code. For example, on sparc64 this more than halves the CPU cycles on a typical hashing operation. Based on a patch by David Miller. Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
Diffstat (limited to '')
-rw-r--r--crypto/rmd320.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/crypto/rmd320.c b/crypto/rmd320.c
index 5b172f89e0c9..dba03ecf5360 100644
--- a/crypto/rmd320.c
+++ b/crypto/rmd320.c
@@ -47,7 +47,7 @@ struct rmd320_ctx {
#define F5(x, y, z) (x ^ (y | ~z))
#define ROUND(a, b, c, d, e, f, k, x, s) { \
- (a) += f((b), (c), (d)) + le32_to_cpu(x) + (k); \
+ (a) += f((b), (c), (d)) + le32_to_cpup(&(x)) + (k); \
(a) = rol32((a), (s)) + (e); \
(c) = rol32((c), 10); \
}
@@ -353,7 +353,7 @@ static void rmd320_final(struct crypto_tfm *tfm, u8 *out)
/* Store state in digest */
for (i = 0; i < 10; i++)
- dst[i] = cpu_to_le32(rctx->state[i]);
+ dst[i] = cpu_to_le32p(&rctx->state[i]);
/* Wipe context */
memset(rctx, 0, sizeof(*rctx));