moonpower/P3DS-test
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Vendor Teakra, make emulator own DSP RAM and add DSP RAM to fastmem (#806)

Browse Source 
* DSP: Own DSP RAM and add it to fastmem

* Vendor Teakra

* Add MacOS support to fastmem

* Fix MacOS fastmem paths

* Fix iOS build
This commit is contained in:
wheremyfoodat
2025-08-22 02:12:21 +03:00
committed by GitHub
parent ff100dc5ac
commit 78002be334
132 changed files with 37774 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
third_party/teakra/src/makedsp1/CMakeLists.txt vendored Normal file
View File

@@ -0,0 +1,11 @@
include(CreateDirectoryGroups)
add_executable(makedsp1
main.cpp
sha256.cpp
sha256.h
)
create_target_directory_groups(makedsp1)
target_link_libraries(makedsp1 PRIVATE teakra)
target_include_directories(makedsp1 PRIVATE .)
target_compile_options(makedsp1 PRIVATE ${TEAKRA_CXX_FLAGS})

172
third_party/teakra/src/makedsp1/main.cpp vendored Normal file
View File

@@ -0,0 +1,172 @@
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string>
#include "../common_types.h"
#include "../parser.h"
#include "sha256.h"
template <typename T>
std::vector<u8> Sha256(const std::vector<T>& data) {
SHA256_CTX ctx;
sha256_init(&ctx);
sha256_update(&ctx, (const BYTE*)data.data(), data.size() * sizeof(T));
std::vector<u8> result(0x20);
sha256_final(&ctx, result.data());
return result;
}
struct Segment {
std::vector<u16> data;
u8 memory_type;
u32 target;
};
std::vector<std::string> StringToTokens(const std::string& in) {
std::vector<std::string> out;
bool need_new = true;
for (char c : in) {
if (c == ' ' || c == '\t') {
need_new = true;
} else {
if (need_new) {
need_new = false;
out.push_back("");
}
out.back() += c;
}
}
return out;
}
int main(int argc, char** argv) {
auto parser = Teakra::GenerateParser();
if (argc < 3) {
printf("Not enough parameters\n");
return -1;
}
std::ifstream in(argv[1]);
if (!in.is_open()) {
printf("Failed to open input file\n");
return -1;
}
std::string line;
std::vector<Segment> segments;
int line_number = 0;
while (std::getline(in, line)) {
++line_number;
auto comment_pos = line.find("//");
if (comment_pos != std::string::npos) {
line.erase(comment_pos);
}
auto expansion_pos = line.find("$");
bool has_expansion = expansion_pos != std::string::npos;
u16 expansion_data;
if (has_expansion) {
if (line.size() - expansion_pos < 5) {
printf("%d: unexpected line break in expansion data\n", line_number);
return -1;
}
expansion_data = (u16)std::stoi(line.substr(expansion_pos + 1, 4), 0, 16);
line = line.substr(0, expansion_pos) + "0000" + line.substr(expansion_pos + 5);
}
auto tokens = StringToTokens(line);
if (tokens.size() == 0)
continue;
if (tokens[0] == "segment") {
if (tokens.size() != 3) {
printf("%d: Wrong parameter count for 'segment'\n", line_number);
return -1;
}
Segment s;
if (tokens[1] == "p") {
s.memory_type = 0;
} else if (tokens[1] == "d") {
s.memory_type = 2;
} else {
printf("%d: Unknown segment type %s\n", line_number, tokens[1].c_str());
return -1;
}
s.target = std::stoi(tokens[2], 0, 16);
segments.push_back(s);
} else {
u16 v;
if (tokens[0] == "data") {
if (tokens.size() != 2) {
printf("%d: Wrong parameter count for 'data'\n", line_number);
return -1;
}
v = (u16)std::stoi(tokens[1], 0, 16);
segments.back().data.push_back(v);
} else {
auto maybe_v = parser->Parse(tokens);
if (maybe_v.status == Teakra::Parser::Opcode::Invalid) {
printf("%d: could not parse\n", line_number);
return -1;
}
v = maybe_v.opcode;
segments.back().data.push_back(v);
if (maybe_v.status == Teakra::Parser::Opcode::ValidWithExpansion) {
if (!has_expansion) {
printf("%d: needs expansion\n", line_number);
return -1;
}
segments.back().data.push_back(expansion_data);
} else {
if (has_expansion) {
printf("%d: unexpected expansion\n", line_number);
return -1;
}
}
}
}
}
in.close();
FILE* out = fopen(argv[2], "wb");
if (!out) {
printf("Failed to open output file\n");
return -1;
}
u32 data_ptr = 0x300;
for (unsigned i = 0; i < segments.size(); ++i) {
fseek(out, 0x120 + i * 0x30, SEEK_SET);
fwrite(&data_ptr, 4, 1, out);
fwrite(&segments[i].target, 4, 1, out);
u32 size = (u32)segments[i].data.size() * 2;
fwrite(&size, 4, 1, out);
u32 memory_type = segments[i].memory_type << 24;
fwrite(&memory_type, 4, 1, out);
auto sha = Sha256(segments[i].data);
fwrite(sha.data(), 0x20, 1, out);
fseek(out, data_ptr, SEEK_SET);
fwrite(segments[i].data.data(), size, 1, out);
data_ptr += size;
}
fseek(out, 0x100, SEEK_SET);
fwrite("DSP1", 4, 1, out);
fwrite(&data_ptr, 4, 1, out);
u32 memory_layout = 0x0000FFFF;
fwrite(&memory_layout, 4, 1, out);
u32 misc = (u32)segments.size() << 16;
fwrite(&misc, 4, 1, out);
u32 zero = 0;
fwrite(&zero, 4, 1, out);
fwrite(&zero, 4, 1, out);
fwrite(&zero, 4, 1, out);
fwrite(&zero, 4, 1, out);
fclose(out);
}

152
third_party/teakra/src/makedsp1/sha256.cpp vendored Normal file
View File

@@ -0,0 +1,152 @@
/*********************************************************************
* Filename: sha256.c
* Author: Brad Conte (brad AT bradconte.com)
* Copyright:
* Disclaimer: This code is presented "as is" without any guarantees.
* Details: Implementation of the SHA-256 hashing algorithm.
SHA-256 is one of the three algorithms in the SHA2
specification. The others, SHA-384 and SHA-512, are not
offered in this implementation.
Algorithm specification can be found here:
* http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
This implementation uses little endian byte order.
*********************************************************************/
/*************************** HEADER FILES ***************************/
#include <memory.h>
#include <stdlib.h>
#include "sha256.h"
/****************************** MACROS ******************************/
#define ROTLEFT(a, b) (((a) << (b)) | ((a) >> (32 - (b))))
#define ROTRIGHT(a, b) (((a) >> (b)) | ((a) << (32 - (b))))
#define CH(x, y, z) (((x) & (y)) ^ (~(x) & (z)))
#define MAJ(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
#define EP0(x) (ROTRIGHT(x, 2) ^ ROTRIGHT(x, 13) ^ ROTRIGHT(x, 22))
#define EP1(x) (ROTRIGHT(x, 6) ^ ROTRIGHT(x, 11) ^ ROTRIGHT(x, 25))
#define SIG0(x) (ROTRIGHT(x, 7) ^ ROTRIGHT(x, 18) ^ ((x) >> 3))
#define SIG1(x) (ROTRIGHT(x, 17) ^ ROTRIGHT(x, 19) ^ ((x) >> 10))
/**************************** VARIABLES *****************************/
static const WORD k[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};
/*********************** FUNCTION DEFINITIONS ***********************/
void sha256_transform(SHA256_CTX* ctx, const BYTE data[]) {
WORD a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
for (i = 0, j = 0; i < 16; ++i, j += 4)
m[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | (data[j + 3]);
for (; i < 64; ++i)
m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(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 < 64; ++i) {
t1 = h + EP1(e) + CH(e, f, g) + k[i] + m[i];
t2 = EP0(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 sha256_init(SHA256_CTX* ctx) {
ctx->datalen = 0;
ctx->bitlen = 0;
ctx->state[0] = 0x6a09e667;
ctx->state[1] = 0xbb67ae85;
ctx->state[2] = 0x3c6ef372;
ctx->state[3] = 0xa54ff53a;
ctx->state[4] = 0x510e527f;
ctx->state[5] = 0x9b05688c;
ctx->state[6] = 0x1f83d9ab;
ctx->state[7] = 0x5be0cd19;
}
void sha256_update(SHA256_CTX* ctx, const BYTE data[], size_t len) {
WORD i;
for (i = 0; i < len; ++i) {
ctx->data[ctx->datalen] = data[i];
ctx->datalen++;
if (ctx->datalen == 64) {
sha256_transform(ctx, ctx->data);
ctx->bitlen += 512;
ctx->datalen = 0;
}
}
}
void sha256_final(SHA256_CTX* ctx, BYTE hash[]) {
WORD i;
i = ctx->datalen;
// Pad whatever data is left in the buffer.
if (ctx->datalen < 56) {
ctx->data[i++] = 0x80;
while (i < 56)
ctx->data[i++] = 0x00;
} else {
ctx->data[i++] = 0x80;
while (i < 64)
ctx->data[i++] = 0x00;
sha256_transform(ctx, ctx->data);
memset(ctx->data, 0, 56);
}
// Append to the padding the total message's length in bits and transform.
ctx->bitlen += ctx->datalen * 8;
ctx->data[63] = (BYTE)ctx->bitlen;
ctx->data[62] = (BYTE)(ctx->bitlen >> 8);
ctx->data[61] = (BYTE)(ctx->bitlen >> 16);
ctx->data[60] = (BYTE)(ctx->bitlen >> 24);
ctx->data[59] = (BYTE)(ctx->bitlen >> 32);
ctx->data[58] = (BYTE)(ctx->bitlen >> 40);
ctx->data[57] = (BYTE)(ctx->bitlen >> 48);
ctx->data[56] = (BYTE)(ctx->bitlen >> 56);
sha256_transform(ctx, ctx->data);
// Since this implementation uses little endian byte ordering and SHA uses big endian,
// reverse all the bytes when copying the final state to the output hash.
for (i = 0; i < 4; ++i) {
hash[i] = (ctx->state[0] >> (24 - i * 8)) & 0x000000ff;
hash[i + 4] = (ctx->state[1] >> (24 - i * 8)) & 0x000000ff;
hash[i + 8] = (ctx->state[2] >> (24 - i * 8)) & 0x000000ff;
hash[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0x000000ff;
hash[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0x000000ff;
hash[i + 20] = (ctx->state[5] >> (24 - i * 8)) & 0x000000ff;
hash[i + 24] = (ctx->state[6] >> (24 - i * 8)) & 0x000000ff;
hash[i + 28] = (ctx->state[7] >> (24 - i * 8)) & 0x000000ff;
}
}

34
third_party/teakra/src/makedsp1/sha256.h vendored Normal file
View File

@@ -0,0 +1,34 @@
/*********************************************************************
* Filename: sha256.h
* Author: Brad Conte (brad AT bradconte.com)
* Copyright:
* Disclaimer: This code is presented "as is" without any guarantees.
* Details: Defines the API for the corresponding SHA1 implementation.
*********************************************************************/
#ifndef SHA256_H
#define SHA256_H
/*************************** HEADER FILES ***************************/
#include <stddef.h>
/****************************** MACROS ******************************/
#define SHA256_BLOCK_SIZE 32 // SHA256 outputs a 32 byte digest
/**************************** DATA TYPES ****************************/
typedef unsigned char BYTE; // 8-bit byte
typedef unsigned int WORD; // 32-bit word, change to "long" for 16-bit machines
typedef struct {
BYTE data[64];
WORD datalen;
unsigned long long bitlen;
WORD state[8];
} SHA256_CTX;
/*********************** FUNCTION DECLARATIONS **********************/
void sha256_init(SHA256_CTX* ctx);
void sha256_update(SHA256_CTX* ctx, const BYTE data[], size_t len);
void sha256_final(SHA256_CTX* ctx, BYTE hash[]);
#endif // SHA256_H