4 * s390 generic implementation of the SHA Secure Hash Algorithms.
6 * Copyright IBM Corp. 2007
7 * Author(s): Jan Glauber (jang@de.ibm.com)
9 * This program is free software; you can redistribute it and/or modify it
10 * under the terms of the GNU General Public License as published by the Free
11 * Software Foundation; either version 2 of the License, or (at your option)
16 #include <linux/crypto.h>
18 #include "crypt_s390.h"
20 void s390_sha_update(struct crypto_tfm *tfm, const u8 *data, unsigned int len)
22 struct s390_sha_ctx *ctx = crypto_tfm_ctx(tfm);
23 unsigned int bsize = crypto_tfm_alg_blocksize(tfm);
27 /* how much is already in the buffer? */
28 index = ctx->count & (bsize - 1);
31 if ((index + len) < bsize)
34 /* process one stored block */
36 memcpy(ctx->buf + index, data, bsize - index);
37 ret = crypt_s390_kimd(ctx->func, ctx->state, ctx->buf, bsize);
39 data += bsize - index;
43 /* process as many blocks as possible */
45 ret = crypt_s390_kimd(ctx->func, ctx->state, data,
47 BUG_ON(ret != (len & ~(bsize - 1)));
53 memcpy(ctx->buf + index , data, len);
55 EXPORT_SYMBOL_GPL(s390_sha_update);
57 void s390_sha_final(struct crypto_tfm *tfm, u8 *out)
59 struct s390_sha_ctx *ctx = crypto_tfm_ctx(tfm);
60 unsigned int bsize = crypto_tfm_alg_blocksize(tfm);
62 unsigned int index, end;
65 /* must perform manual padding */
66 index = ctx->count & (bsize - 1);
67 end = (index < bsize - 8) ? bsize : (2 * bsize);
69 /* start pad with 1 */
70 ctx->buf[index] = 0x80;
74 memset(ctx->buf + index, 0x00, end - index - 8);
76 bits = ctx->count * 8;
77 memcpy(ctx->buf + end - 8, &bits, sizeof(bits));
79 ret = crypt_s390_kimd(ctx->func, ctx->state, ctx->buf, end);
82 /* copy digest to out */
83 memcpy(out, ctx->state, crypto_hash_digestsize(crypto_hash_cast(tfm)));
85 memset(ctx, 0, sizeof *ctx);
87 EXPORT_SYMBOL_GPL(s390_sha_final);
89 MODULE_LICENSE("GPL");
90 MODULE_DESCRIPTION("s390 SHA cipher common functions");