mirror of
https://github.com/libretro/bsnes-libretro.git
synced 2024-11-27 02:50:32 +00:00
559a6585ef
byuu says:
First 32 instructions implemented in the TLCS900H disassembler. Only 992
to go!
I removed the use of anonymous namespaces in nall. It was something I
rarely used, because it rarely did what I wanted.
I updated all nested namespaces to use C++17-style namespace Foo::Bar {}
syntax instead of classic C++-style namespace Foo { namespace Bar {}}.
I updated ruby::Video::acquire() to return a struct, so we can use C++17
structured bindings. Long term, I want to get away from all functions
that take references for output only. Even though C++ botched structured
bindings by not allowing you to bind to existing variables, it's even
worse to have function calls that take arguments by reference and then
write to them. From the caller side, you can't tell the value is being
written, nor that the value passed in doesn't matter, which is terrible.
107 lines
3.3 KiB
C++
107 lines
3.3 KiB
C++
#pragma once
|
|
|
|
#include <nall/hash/hash.hpp>
|
|
|
|
namespace nall::Hash {
|
|
|
|
struct SHA224 : Hash {
|
|
using Hash::input;
|
|
|
|
SHA224(array_view<uint8_t> buffer = {}) {
|
|
reset();
|
|
input(buffer);
|
|
}
|
|
|
|
auto reset() -> void override {
|
|
for(auto& n : queue) n = 0;
|
|
for(auto& n : w) n = 0;
|
|
for(auto n : range(8)) h[n] = square(n);
|
|
queued = length = 0;
|
|
}
|
|
|
|
auto input(uint8_t value) -> void override {
|
|
byte(value);
|
|
length++;
|
|
}
|
|
|
|
auto output() const -> vector<uint8_t> override {
|
|
SHA224 self(*this);
|
|
self.finish();
|
|
vector<uint8_t> result;
|
|
for(auto h : range(7)) {
|
|
for(auto n : reverse(range(4))) result.append(self.h[h] >> n * 8);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
auto value() const -> uint256_t {
|
|
uint256_t value = 0;
|
|
for(auto byte : output()) value = value << 8 | byte;
|
|
return value;
|
|
}
|
|
|
|
private:
|
|
auto byte(uint8_t value) -> void {
|
|
uint32_t shift = (3 - (queued & 3)) * 8;
|
|
queue[queued >> 2] &= ~(0xff << shift);
|
|
queue[queued >> 2] |= (value << shift);
|
|
if(++queued == 64) block(), queued = 0;
|
|
}
|
|
|
|
auto block() -> void {
|
|
for(auto n : range(16)) w[n] = queue[n];
|
|
for(auto n : range(16, 64)) {
|
|
uint32_t a = ror(w[n - 15], 7) ^ ror(w[n - 15], 18) ^ (w[n - 15] >> 3);
|
|
uint32_t b = ror(w[n - 2], 17) ^ ror(w[n - 2], 19) ^ (w[n - 2] >> 10);
|
|
w[n] = w[n - 16] + w[n - 7] + a + b;
|
|
}
|
|
uint32_t t[8];
|
|
for(auto n : range(8)) t[n] = h[n];
|
|
for(auto n : range(64)) {
|
|
uint32_t a = ror(t[0], 2) ^ ror(t[0], 13) ^ ror(t[0], 22);
|
|
uint32_t b = ror(t[4], 6) ^ ror(t[4], 11) ^ ror(t[4], 25);
|
|
uint32_t c = (t[0] & t[1]) ^ (t[0] & t[2]) ^ (t[1] & t[2]);
|
|
uint32_t d = (t[4] & t[5]) ^ (~t[4] & t[6]);
|
|
uint32_t e = t[7] + w[n] + cube(n) + b + d;
|
|
t[7] = t[6]; t[6] = t[5]; t[5] = t[4]; t[4] = t[3] + e;
|
|
t[3] = t[2]; t[2] = t[1]; t[1] = t[0]; t[0] = a + c + e;
|
|
}
|
|
for(auto n : range(8)) h[n] += t[n];
|
|
}
|
|
|
|
auto finish() -> void {
|
|
byte(0x80);
|
|
while(queued != 56) byte(0x00);
|
|
for(auto n : range(8)) byte(length * 8 >> (7 - n) * 8);
|
|
}
|
|
|
|
auto square(uint n) -> uint32_t {
|
|
static const uint32_t value[8] = {
|
|
0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,
|
|
};
|
|
return value[n];
|
|
}
|
|
|
|
auto cube(uint n) -> uint32_t {
|
|
static const uint32_t value[64] = {
|
|
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
|
|
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
|
|
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
|
|
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
|
|
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
|
|
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
|
|
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
|
|
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
|
|
};
|
|
return value[n];
|
|
}
|
|
|
|
uint32_t queue[16] = {0};
|
|
uint32_t w[64] = {0};
|
|
uint32_t h[8] = {0};
|
|
uint32_t queued = 0;
|
|
uint64_t length = 0;
|
|
};
|
|
|
|
}
|