/*
	This file is part of Fennix Kernel.

	Fennix Kernel is free software: you can redistribute it and/or
	modify it under the terms of the GNU General Public License as
	published by the Free Software Foundation, either version 3 of
	the License, or (at your option) any later version.

	Fennix Kernel is distributed in the hope that it will be useful,
	but WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	GNU General Public License for more details.

	You should have received a copy of the GNU General Public License
	along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
*/

#include <sha512.h>

#include <stdint.h>
#include <string.h>
#include <stdlib.h>

static const uint64_t sha512_K[80] = {
	0x428a2f98d728ae22, 0x7137449123ef65cd, 0xb5c0fbcfec4d3b2f, 0xe9b5dba58189dbbc,
	0x3956c25bf348b538, 0x59f111f1b605d019, 0x923f82a4af194f9b, 0xab1c5ed5da6d8118,
	0xd807aa98a3030242, 0x12835b0145706fbe, 0x243185be4ee4b28c, 0x550c7dc3d5ffb4e2,
	0x72be5d74f27b896f, 0x80deb1fe3b1696b1, 0x9bdc06a725c71235, 0xc19bf174cf692694,
	0xe49b69c19ef14ad2, 0xefbe4786384f25e3, 0x0fc19dc68b8cd5b5, 0x240ca1cc77ac9c65,
	0x2de92c6f592b0275, 0x4a7484aa6ea6e483, 0x5cb0a9dcbd41fbd4, 0x76f988da831153b5,
	0x983e5152ee66dfab, 0xa831c66d2db43210, 0xb00327c898fb213f, 0xbf597fc7beef0ee4,
	0xc6e00bf33da88fc2, 0xd5a79147930aa725, 0x06ca6351e003826f, 0x142929670a0e6e70,
	0x27b70a8546d22ffc, 0x2e1b21385c26c926, 0x4d2c6dfc5ac42aed, 0x53380d139d95b3df,
	0x650a73548baf63de, 0x766a0abb3c77b2a8, 0x81c2c92e47edaee6, 0x92722c851482353b,
	0xa2bfe8a14cf10364, 0xa81a664bbc423001, 0xc24b8b70d0f89791, 0xc76c51a30654be30,
	0xd192e819d6ef5218, 0xd69906245565a910, 0xf40e35855771202a, 0x106aa07032bbd1b8,
	0x19a4c116b8d2d0c8, 0x1e376c085141ab53, 0x2748774cdf8eeb99, 0x34b0bcb5e19b48a8,
	0x391c0cb3c5c95a63, 0x4ed8aa4ae3418acb, 0x5b9cca4f7763e373, 0x682e6ff3d6b2b8a3,
	0x748f82ee5defb2fc, 0x78a5636f43172f60, 0x84c87814a1f0ab72, 0x8cc702081a6439ec,
	0x90befffa23631e28, 0xa4506cebde82bde9, 0xbef9a3f7b2c67915, 0xc67178f2e372532b,
	0xca273eceea26619c, 0xd186b8c721c0c207, 0xeada7dd6cde0eb1e, 0xf57d4f7fee6ed178,
	0x06f067aa72176fba, 0x0a637dc5a2c898a6, 0x113f9804bef90dae, 0x1b710b35131c471b,
	0x28db77f523047d84, 0x32caab7b40c72493, 0x3c9ebe0a15c9bebc, 0x431d67c49c100d4c,
	0x4cc5d4becb3e42b6, 0x597f299cfc657e2a, 0x5fcb6fab3ad6faec, 0x6c44198c4a475817};

#define ROTR(x, n) ((x >> n) | (x << (64 - n)))

#define CH(x, y, z) ((x & y) ^ (~x & z))
#define MAJ(x, y, z) ((x & y) ^ (x & z) ^ (y & z))
#define SIGMA0(x) (ROTR(x, 28) ^ ROTR(x, 34) ^ ROTR(x, 39))
#define SIGMA1(x) (ROTR(x, 14) ^ ROTR(x, 18) ^ ROTR(x, 41))
#define sigma0(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ (x >> 7))
#define sigma1(x) (ROTR(x, 19) ^ ROTR(x, 61) ^ (x >> 6))

static const uint64_t sha512_H0[8] = {
	0x6a09e667f3bcc908, 0xbb67ae8584caa73b, 0x3c6ef372fe94f82b, 0xa54ff53a5f1d36f1,
	0x510e527fade682d1, 0x9b05688c2b3e6c1f, 0x1f83d9abfb41bd6b, 0x5be0cd19137e2179};

void sha512_transform(SHA512_CTX *ctx, const uint8_t *data)
{
	uint64_t m[80], a, b, c, d, e, f, g, h, t1, t2;
	size_t i;

	for (i = 0; i < 16; ++i)
	{
		m[i] = ((uint64_t)data[i * 8] << 56) | ((uint64_t)data[i * 8 + 1] << 48) |
			   ((uint64_t)data[i * 8 + 2] << 40) | ((uint64_t)data[i * 8 + 3] << 32) |
			   ((uint64_t)data[i * 8 + 4] << 24) | ((uint64_t)data[i * 8 + 5] << 16) |
			   ((uint64_t)data[i * 8 + 6] << 8) | ((uint64_t)data[i * 8 + 7]);
	}

	for (; i < 80; ++i)
		m[i] = sigma1(m[i - 2]) + m[i - 7] + sigma0(m[i - 15]) + m[i - 16];

	a = ctx->state[0];
	b = ctx->state[1];
	c = ctx->state[2];
	d = ctx->state[3];
	e = ctx->state[4];
	f = ctx->state[5];
	g = ctx->state[6];
	h = ctx->state[7];

	for (i = 0; i < 80; ++i)
	{
		t1 = h + SIGMA1(e) + CH(e, f, g) + sha512_K[i] + m[i];
		t2 = SIGMA0(a) + MAJ(a, b, c);
		h = g;
		g = f;
		f = e;
		e = d + t1;
		d = c;
		c = b;
		b = a;
		a = t1 + t2;
	}

	ctx->state[0] += a;
	ctx->state[1] += b;
	ctx->state[2] += c;
	ctx->state[3] += d;
	ctx->state[4] += e;
	ctx->state[5] += f;
	ctx->state[6] += g;
	ctx->state[7] += h;
}

void sha512_init(SHA512_CTX *ctx)
{
	memcpy(ctx->state, sha512_H0, sizeof(sha512_H0));
	ctx->bitlen = 0;
	ctx->datalen = 0;
}

void sha512_update(SHA512_CTX *ctx, const uint8_t *data, size_t len)
{
	for (size_t i = 0; i < len; ++i)
	{
		ctx->data[ctx->datalen] = data[i];
		ctx->datalen++;
		if (ctx->datalen != SHA512_BLOCK_SIZE)
			continue;

		sha512_transform(ctx, ctx->data);
		ctx->bitlen += ctx->datalen * 8;
		ctx->datalen = 0;
	}
}

void sha512_final(SHA512_CTX *ctx, uint8_t *hash)
{
	ctx->bitlen += ctx->datalen * 8;
	ctx->data[ctx->datalen++] = 0x80;
	if (ctx->datalen > 112)
	{
		while (ctx->datalen < SHA512_BLOCK_SIZE)
			ctx->data[ctx->datalen++] = 0x00;
		sha512_transform(ctx, ctx->data);
		ctx->datalen = 0;
	}

	while (ctx->datalen < 112)
		ctx->data[ctx->datalen++] = 0x00;

	for (size_t i = 0; i < 8; ++i)
		ctx->data[127 - i] = ctx->bitlen >> (i * 8);

	sha512_transform(ctx, ctx->data);

	for (size_t i = 0; i < 8; ++i)
	{
		hash[i * 8] = (ctx->state[i] >> 56) & 0xff;
		hash[i * 8 + 1] = (ctx->state[i] >> 48) & 0xff;
		hash[i * 8 + 2] = (ctx->state[i] >> 40) & 0xff;
		hash[i * 8 + 3] = (ctx->state[i] >> 32) & 0xff;
		hash[i * 8 + 4] = (ctx->state[i] >> 24) & 0xff;
		hash[i * 8 + 5] = (ctx->state[i] >> 16) & 0xff;
		hash[i * 8 + 6] = (ctx->state[i] >> 8) & 0xff;
		hash[i * 8 + 7] = ctx->state[i] & 0xff;
	}
}

uint8_t *sha512_sum(const uint8_t *input, size_t len)
{
	SHA512_CTX ctx;
	uint8_t *hash = (uint8_t *)malloc(SHA512_DIGEST_SIZE);
	if (!hash)
		return NULL;

	sha512_init(&ctx);
	sha512_update(&ctx, input, len);
	sha512_final(&ctx, hash);

	return hash;
}