mirror/bsnes
1
0
Fork 0
mirror of https://github.com/bsnes-emu/bsnes.git synced 2025-08-14 06:44:10 +02:00
Code Issues Projects Releases Wiki Activity

Update to v106r2 release.

Browse Source 
byuu says:

Changelog:

  - Super Famicom: added support for loading manifests without embedded
    mapping information¹
  - genius: initial commit
  - various Makefile cleanups

¹: so the idea here is to try and aim for a stable manifest format,
and to allow direct transposition of icarus/genius database entries into
manifest files. The exact mechanics of how this is going to work is
currently in flux, but we'll get there.

For right now, `Super Famicom.sys` gains `boards.bml`, which is the raw
database from my board-editor tool, and higan itself tries to load
`boards.bml`, match an entry to game/board from the game's `manifest.bml`
file, and then transform it into the format currently used by higan. It
does this only when the game's `manifest.bml` file lacks a board node.
When such a board node exists, it works as previous versions of higan
did.

The only incompatible change right now is information/title is now
located at game/label. I may transition window title display to just use
the filenames instead.

Longer term, some thought is going to need to go into the format of the
`boards.bml` database itself, and at which point in the process I should
be transforming things.

Give it time, we'll refine this into something nicer.
This commit is contained in:
Tim Allen
2018-02-01 19:20:37 +11:00
parent aef8d5e962
commit 2f81b5a3e7
41 changed files with 29372 additions and 13627 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
nall/encode/base64.hpp
View File

@@ -2,14 +2,15 @@
namespace nall { namespace Encode {
inline auto Base64(const void* vdata, unsigned size, const string& format = "MIME") -> string {
auto data = (const uint8_t*)vdata;
vector<uint8_t> result;
char lookup[65];
for(unsigned n = 0; n < 26; n++) lookup[ 0 + n] = 'A' + n;
for(unsigned n = 0; n < 26; n++) lookup[26 + n] = 'a' + n;
for(unsigned n = 0; n < 10; n++) lookup[52 + n] = '0' + n;
inline auto Base64(const void* vdata, uint size, const string& format = "MIME") -> string {
static bool initialized = false;
static char lookup[65] = {0};
if(!initialized) {
initialized = true;
for(uint n : range(26)) lookup[n + 0] = 'A' + n;
for(uint n : range(26)) lookup[n + 26] = 'a' + n;
for(uint n : range(10)) lookup[n + 52] = '0' + n;
}
if(format == "MIME") {
lookup[62] = '+';
@@ -21,37 +22,36 @@ inline auto Base64(const void* vdata, unsigned size, const string& format = "MIM
lookup[64] = 0;
} else return "";
unsigned overflow = (3 - (size % 3)) % 3; //bytes to round to nearest multiple of 3
auto data = (const uint8_t*)vdata;
uint overflow = (3 - (size % 3)) % 3; //bytes to round to nearest multiple of 3
string result;
uint8_t buffer;
for(unsigned i = 0; i < size; i++) {
switch(i % 3) {
for(uint n : range(size)) {
switch(n % 3) {
case 0:
buffer = data[i] >> 2;
result.append(lookup[buffer]);
buffer = (data[i] & 3) << 4;
buffer = data[n] >> 2;
result.append(lookup[buffer]);
buffer = (data[n] & 3) << 4;
break;
case 1:
buffer |= data[i] >> 4;
result.right() = lookup[buffer];
buffer = (data[i] & 15) << 2;
buffer |= data[n] >> 4;
result.append(lookup[buffer]);
buffer = (data[n] & 15) << 2;
break;
case 2:
buffer |= data[i] >> 6;
result.right() = lookup[buffer];
buffer = (data[i] & 63);
buffer |= data[n] >> 6;
result.append(lookup[buffer]);
buffer = (data[n] & 63);
result.append(lookup[buffer]);
break;
}
}
if(overflow) result.append(lookup[buffer]);
if(lookup[64]) {
if(overflow >= 1) result.append(lookup[64]);
if(overflow >= 2) result.append(lookup[64]);
while(result.size() % 4) result.append(lookup[64]);
}
return result;