mirror of
https://github.com/followmsi/android_kernel_google_msm.git
synced 2024-11-06 23:17:41 +00:00
[CRYPTO] sha1: Avoid useless memcpy()
The current code unconditionally copy the first block for every call to sha1_update(). This can be avoided if there is no pending partial block. This is always the case on the first call to sha1_update() (if the length is >= 64 of course. Furthermore, temp does need to be called if sha_transform is never invoked. Also consolidate the sha_transform calls into one to reduce code size. Signed-off-by: Nicolas Pitre <nico@cam.org> Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
This commit is contained in:
parent
c8a19c91b5
commit
cfa8d17cc8
1 changed files with 17 additions and 8 deletions
|
@ -50,22 +50,31 @@ static void sha1_update(void *ctx, const u8 *data, unsigned int len)
|
||||||
{
|
{
|
||||||
struct sha1_ctx *sctx = ctx;
|
struct sha1_ctx *sctx = ctx;
|
||||||
unsigned int i, j;
|
unsigned int i, j;
|
||||||
u32 temp[SHA_WORKSPACE_WORDS];
|
const u8 *src;
|
||||||
|
|
||||||
j = (sctx->count >> 3) & 0x3f;
|
j = (sctx->count >> 3) & 0x3f;
|
||||||
sctx->count += len << 3;
|
sctx->count += len << 3;
|
||||||
|
i = 0;
|
||||||
|
src = data;
|
||||||
|
|
||||||
if ((j + len) > 63) {
|
if ((j + len) > 63) {
|
||||||
memcpy(&sctx->buffer[j], data, (i = 64-j));
|
u32 temp[SHA_WORKSPACE_WORDS];
|
||||||
sha_transform(sctx->state, sctx->buffer, temp);
|
|
||||||
for ( ; i + 63 < len; i += 64) {
|
if (j) {
|
||||||
sha_transform(sctx->state, &data[i], temp);
|
memcpy(&sctx->buffer[j], data, (i = 64-j));
|
||||||
|
src = sctx->buffer;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
do {
|
||||||
|
sha_transform(sctx->state, src, temp);
|
||||||
|
i += 64;
|
||||||
|
src = &data[i];
|
||||||
|
} while (i + 63 < len);
|
||||||
|
|
||||||
|
memset(temp, 0, sizeof(temp));
|
||||||
j = 0;
|
j = 0;
|
||||||
}
|
}
|
||||||
else i = 0;
|
memcpy(&sctx->buffer[j], src, len - i);
|
||||||
memset(temp, 0, sizeof(temp));
|
|
||||||
memcpy(&sctx->buffer[j], &data[i], len - i);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue