1d2912cb1SThomas Gleixner /* SPDX-License-Identifier: GPL-2.0-only */
2c4d5b9ffSArd Biesheuvel /*
3c4d5b9ffSArd Biesheuvel * sha1_base.h - core logic for SHA-1 implementations
4c4d5b9ffSArd Biesheuvel *
5c4d5b9ffSArd Biesheuvel * Copyright (C) 2015 Linaro Ltd <ard.biesheuvel@linaro.org>
6c4d5b9ffSArd Biesheuvel */
7c4d5b9ffSArd Biesheuvel
868289c63SMasahiro Yamada #ifndef _CRYPTO_SHA1_BASE_H
968289c63SMasahiro Yamada #define _CRYPTO_SHA1_BASE_H
1068289c63SMasahiro Yamada
11c4d5b9ffSArd Biesheuvel #include <crypto/internal/hash.h>
12*a24d22b2SEric Biggers #include <crypto/sha1.h>
13c4d5b9ffSArd Biesheuvel #include <linux/crypto.h>
14c4d5b9ffSArd Biesheuvel #include <linux/module.h>
15458c0480SArvind Sankar #include <linux/string.h>
16c4d5b9ffSArd Biesheuvel
17c4d5b9ffSArd Biesheuvel #include <asm/unaligned.h>
18c4d5b9ffSArd Biesheuvel
19c4d5b9ffSArd Biesheuvel typedef void (sha1_block_fn)(struct sha1_state *sst, u8 const *src, int blocks);
20c4d5b9ffSArd Biesheuvel
sha1_base_init(struct shash_desc * desc)21c4d5b9ffSArd Biesheuvel static inline int sha1_base_init(struct shash_desc *desc)
22c4d5b9ffSArd Biesheuvel {
23c4d5b9ffSArd Biesheuvel struct sha1_state *sctx = shash_desc_ctx(desc);
24c4d5b9ffSArd Biesheuvel
25c4d5b9ffSArd Biesheuvel sctx->state[0] = SHA1_H0;
26c4d5b9ffSArd Biesheuvel sctx->state[1] = SHA1_H1;
27c4d5b9ffSArd Biesheuvel sctx->state[2] = SHA1_H2;
28c4d5b9ffSArd Biesheuvel sctx->state[3] = SHA1_H3;
29c4d5b9ffSArd Biesheuvel sctx->state[4] = SHA1_H4;
30c4d5b9ffSArd Biesheuvel sctx->count = 0;
31c4d5b9ffSArd Biesheuvel
32c4d5b9ffSArd Biesheuvel return 0;
33c4d5b9ffSArd Biesheuvel }
34c4d5b9ffSArd Biesheuvel
sha1_base_do_update(struct shash_desc * desc,const u8 * data,unsigned int len,sha1_block_fn * block_fn)35c4d5b9ffSArd Biesheuvel static inline int sha1_base_do_update(struct shash_desc *desc,
36c4d5b9ffSArd Biesheuvel const u8 *data,
37c4d5b9ffSArd Biesheuvel unsigned int len,
38c4d5b9ffSArd Biesheuvel sha1_block_fn *block_fn)
39c4d5b9ffSArd Biesheuvel {
40c4d5b9ffSArd Biesheuvel struct sha1_state *sctx = shash_desc_ctx(desc);
41c4d5b9ffSArd Biesheuvel unsigned int partial = sctx->count % SHA1_BLOCK_SIZE;
42c4d5b9ffSArd Biesheuvel
43c4d5b9ffSArd Biesheuvel sctx->count += len;
44c4d5b9ffSArd Biesheuvel
45c4d5b9ffSArd Biesheuvel if (unlikely((partial + len) >= SHA1_BLOCK_SIZE)) {
46c4d5b9ffSArd Biesheuvel int blocks;
47c4d5b9ffSArd Biesheuvel
48c4d5b9ffSArd Biesheuvel if (partial) {
49c4d5b9ffSArd Biesheuvel int p = SHA1_BLOCK_SIZE - partial;
50c4d5b9ffSArd Biesheuvel
51c4d5b9ffSArd Biesheuvel memcpy(sctx->buffer + partial, data, p);
52c4d5b9ffSArd Biesheuvel data += p;
53c4d5b9ffSArd Biesheuvel len -= p;
54c4d5b9ffSArd Biesheuvel
55c4d5b9ffSArd Biesheuvel block_fn(sctx, sctx->buffer, 1);
56c4d5b9ffSArd Biesheuvel }
57c4d5b9ffSArd Biesheuvel
58c4d5b9ffSArd Biesheuvel blocks = len / SHA1_BLOCK_SIZE;
59c4d5b9ffSArd Biesheuvel len %= SHA1_BLOCK_SIZE;
60c4d5b9ffSArd Biesheuvel
61c4d5b9ffSArd Biesheuvel if (blocks) {
62c4d5b9ffSArd Biesheuvel block_fn(sctx, data, blocks);
63c4d5b9ffSArd Biesheuvel data += blocks * SHA1_BLOCK_SIZE;
64c4d5b9ffSArd Biesheuvel }
65c4d5b9ffSArd Biesheuvel partial = 0;
66c4d5b9ffSArd Biesheuvel }
67c4d5b9ffSArd Biesheuvel if (len)
68c4d5b9ffSArd Biesheuvel memcpy(sctx->buffer + partial, data, len);
69c4d5b9ffSArd Biesheuvel
70c4d5b9ffSArd Biesheuvel return 0;
71c4d5b9ffSArd Biesheuvel }
72c4d5b9ffSArd Biesheuvel
sha1_base_do_finalize(struct shash_desc * desc,sha1_block_fn * block_fn)73c4d5b9ffSArd Biesheuvel static inline int sha1_base_do_finalize(struct shash_desc *desc,
74c4d5b9ffSArd Biesheuvel sha1_block_fn *block_fn)
75c4d5b9ffSArd Biesheuvel {
76c4d5b9ffSArd Biesheuvel const int bit_offset = SHA1_BLOCK_SIZE - sizeof(__be64);
77c4d5b9ffSArd Biesheuvel struct sha1_state *sctx = shash_desc_ctx(desc);
78c4d5b9ffSArd Biesheuvel __be64 *bits = (__be64 *)(sctx->buffer + bit_offset);
79c4d5b9ffSArd Biesheuvel unsigned int partial = sctx->count % SHA1_BLOCK_SIZE;
80c4d5b9ffSArd Biesheuvel
81c4d5b9ffSArd Biesheuvel sctx->buffer[partial++] = 0x80;
82c4d5b9ffSArd Biesheuvel if (partial > bit_offset) {
83c4d5b9ffSArd Biesheuvel memset(sctx->buffer + partial, 0x0, SHA1_BLOCK_SIZE - partial);
84c4d5b9ffSArd Biesheuvel partial = 0;
85c4d5b9ffSArd Biesheuvel
86c4d5b9ffSArd Biesheuvel block_fn(sctx, sctx->buffer, 1);
87c4d5b9ffSArd Biesheuvel }
88c4d5b9ffSArd Biesheuvel
89c4d5b9ffSArd Biesheuvel memset(sctx->buffer + partial, 0x0, bit_offset - partial);
90c4d5b9ffSArd Biesheuvel *bits = cpu_to_be64(sctx->count << 3);
91c4d5b9ffSArd Biesheuvel block_fn(sctx, sctx->buffer, 1);
92c4d5b9ffSArd Biesheuvel
93c4d5b9ffSArd Biesheuvel return 0;
94c4d5b9ffSArd Biesheuvel }
95c4d5b9ffSArd Biesheuvel
sha1_base_finish(struct shash_desc * desc,u8 * out)96c4d5b9ffSArd Biesheuvel static inline int sha1_base_finish(struct shash_desc *desc, u8 *out)
97c4d5b9ffSArd Biesheuvel {
98c4d5b9ffSArd Biesheuvel struct sha1_state *sctx = shash_desc_ctx(desc);
99c4d5b9ffSArd Biesheuvel __be32 *digest = (__be32 *)out;
100c4d5b9ffSArd Biesheuvel int i;
101c4d5b9ffSArd Biesheuvel
102c4d5b9ffSArd Biesheuvel for (i = 0; i < SHA1_DIGEST_SIZE / sizeof(__be32); i++)
103c4d5b9ffSArd Biesheuvel put_unaligned_be32(sctx->state[i], digest++);
104c4d5b9ffSArd Biesheuvel
105458c0480SArvind Sankar memzero_explicit(sctx, sizeof(*sctx));
106c4d5b9ffSArd Biesheuvel return 0;
107c4d5b9ffSArd Biesheuvel }
10868289c63SMasahiro Yamada
10968289c63SMasahiro Yamada #endif /* _CRYPTO_SHA1_BASE_H */
110