[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>

1 files changed, 2 insertions, 2 deletions

diff --git a/crypto/rmd128.c b/crypto/rmd128.c
index 89a535aa6eb8..1a481df66913 100644
--- a/crypto/rmd128.c
+++ b/crypto/rmd128.c
@@ -44,7 +44,7 @@ struct rmd128_ctx {
 #define F4(x, y, z) (y ^ (z & (x ^ y))) /* z ? x : y */
 
 #define ROUND(a, b, c, d, 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)); \
 }
 
@@ -285,7 +285,7 @@ static void rmd128_final(struct crypto_tfm *tfm, u8 *out)
 
         /* Store state in digest */
         for (i = 0; i < 4; i++)
-                dst[i] = cpu_to_le32(rctx->state[i]);
+                dst[i] = cpu_to_le32p(&rctx->state[i]);
 
         /* Wipe context */
         memset(rctx, 0, sizeof(*rctx));