ocfs2: fix ocfs2 read block panic
[linux-2.6/btrfs-unstable.git] / include / crypto / sm3_base.h
blob256948e39296412c3b2a7820292a57681394e8ce
1 /*
2 * sm3_base.h - core logic for SM3 implementations
4 * Copyright (C) 2017 ARM Limited or its affiliates.
5 * Written by Gilad Ben-Yossef <gilad@benyossef.com>
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
20 #include <crypto/internal/hash.h>
21 #include <crypto/sm3.h>
22 #include <linux/crypto.h>
23 #include <linux/module.h>
24 #include <asm/unaligned.h>
26 typedef void (sm3_block_fn)(struct sm3_state *sst, u8 const *src, int blocks);
28 static inline int sm3_base_init(struct shash_desc *desc)
30 struct sm3_state *sctx = shash_desc_ctx(desc);
32 sctx->state[0] = SM3_IVA;
33 sctx->state[1] = SM3_IVB;
34 sctx->state[2] = SM3_IVC;
35 sctx->state[3] = SM3_IVD;
36 sctx->state[4] = SM3_IVE;
37 sctx->state[5] = SM3_IVF;
38 sctx->state[6] = SM3_IVG;
39 sctx->state[7] = SM3_IVH;
40 sctx->count = 0;
42 return 0;
45 static inline int sm3_base_do_update(struct shash_desc *desc,
46 const u8 *data,
47 unsigned int len,
48 sm3_block_fn *block_fn)
50 struct sm3_state *sctx = shash_desc_ctx(desc);
51 unsigned int partial = sctx->count % SM3_BLOCK_SIZE;
53 sctx->count += len;
55 if (unlikely((partial + len) >= SM3_BLOCK_SIZE)) {
56 int blocks;
58 if (partial) {
59 int p = SM3_BLOCK_SIZE - partial;
61 memcpy(sctx->buffer + partial, data, p);
62 data += p;
63 len -= p;
65 block_fn(sctx, sctx->buffer, 1);
68 blocks = len / SM3_BLOCK_SIZE;
69 len %= SM3_BLOCK_SIZE;
71 if (blocks) {
72 block_fn(sctx, data, blocks);
73 data += blocks * SM3_BLOCK_SIZE;
75 partial = 0;
77 if (len)
78 memcpy(sctx->buffer + partial, data, len);
80 return 0;
83 static inline int sm3_base_do_finalize(struct shash_desc *desc,
84 sm3_block_fn *block_fn)
86 const int bit_offset = SM3_BLOCK_SIZE - sizeof(__be64);
87 struct sm3_state *sctx = shash_desc_ctx(desc);
88 __be64 *bits = (__be64 *)(sctx->buffer + bit_offset);
89 unsigned int partial = sctx->count % SM3_BLOCK_SIZE;
91 sctx->buffer[partial++] = 0x80;
92 if (partial > bit_offset) {
93 memset(sctx->buffer + partial, 0x0, SM3_BLOCK_SIZE - partial);
94 partial = 0;
96 block_fn(sctx, sctx->buffer, 1);
99 memset(sctx->buffer + partial, 0x0, bit_offset - partial);
100 *bits = cpu_to_be64(sctx->count << 3);
101 block_fn(sctx, sctx->buffer, 1);
103 return 0;
106 static inline int sm3_base_finish(struct shash_desc *desc, u8 *out)
108 struct sm3_state *sctx = shash_desc_ctx(desc);
109 __be32 *digest = (__be32 *)out;
110 int i;
112 for (i = 0; i < SM3_DIGEST_SIZE / sizeof(__be32); i++)
113 put_unaligned_be32(sctx->state[i], digest++);
115 *sctx = (struct sm3_state){};
116 return 0;