mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-04-02 10:42:14 -04:00
84e98833ca
byuu says:
This release refines HSU1 support as a bidirectional protocol, nests SFC
manifests as "release/cartridge" and "release/information" (but release/
is not guaranteed to be finalized just yet), removes the database
integration, and adds support for ananke.
ananke represents inevitability. It's a library that, when installed,
higan can use to load files from the command-line, and also from a new
File -> Load Game menu option.
I need to change the build rules a bit for it to work on Windows (need
to make phoenix a DLL, basically), but it works now on Linux.
Right now, it only takes *.sfc file names, looks them up in the included
database, converts them to game folders, and returns the game folder
path for higan to load.
The idea is to continue expanding it to support everything we can that
I don't want in the higan core:
- load *.sfc, *.smc, *.swc, *.fig files
- remove SNES copier headers
- split apart merged firmware files
- pull in external firmware files (eg dsp1b.rom - these are staying
merged, just as SPC7110 prg+dat are merged)
- load *.zip and *.7z archives
- prompt for selection on multi-file archives
- generate manifest files based on heuristics
- apply BPS patches
The "Load" menu option has been renamed to "Library", to represent games
in your library. I'm going to add some sort of suffix to indicate
unverified games, and use a different folder icon for those (eg
manifests built on heuristics rather than from the database.)
So basically, to future end users:
File -> Load Game will be how they play games.
Library -> (specific system) can be thought of as an infinitely-sized
recent games list.
purify will likely become a simple stub that invokes ananke's functions.
No reason to duplicate all that code.
118 lines
2.6 KiB
C++
118 lines
2.6 KiB
C++
#ifndef NALL_BASE64_HPP
|
|
#define NALL_BASE64_HPP
|
|
|
|
#include <nall/stdint.hpp>
|
|
#include <nall/string.hpp>
|
|
|
|
namespace nall {
|
|
struct base64 {
|
|
static bool encode(char *&output, const uint8_t* input, unsigned inlength) {
|
|
output = new char[inlength * 8 / 6 + 8]();
|
|
|
|
unsigned i = 0, o = 0;
|
|
while(i < inlength) {
|
|
switch(i % 3) {
|
|
|
|
case 0: {
|
|
output[o++] = enc(input[i] >> 2);
|
|
output[o] = enc((input[i] & 3) << 4);
|
|
break;
|
|
}
|
|
|
|
case 1: {
|
|
uint8_t prev = dec(output[o]);
|
|
output[o++] = enc(prev + (input[i] >> 4));
|
|
output[o] = enc((input[i] & 15) << 2);
|
|
break;
|
|
}
|
|
|
|
case 2: {
|
|
uint8_t prev = dec(output[o]);
|
|
output[o++] = enc(prev + (input[i] >> 6));
|
|
output[o++] = enc(input[i] & 63);
|
|
break;
|
|
}
|
|
|
|
}
|
|
|
|
i++;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
static string encode(const string &data) {
|
|
char *buffer = nullptr;
|
|
encode(buffer, (const uint8_t*)(const char*)data, data.length());
|
|
string result = buffer;
|
|
delete[] buffer;
|
|
return result;
|
|
}
|
|
|
|
static bool decode(uint8_t *&output, unsigned &outlength, const char *input) {
|
|
unsigned inlength = strlen(input), infix = 0;
|
|
output = new uint8_t[inlength + 1]();
|
|
|
|
unsigned i = 0, o = 0;
|
|
while(i < inlength) {
|
|
uint8_t x = dec(input[i]);
|
|
|
|
switch(i++ & 3) {
|
|
|
|
case 0: {
|
|
output[o] = x << 2;
|
|
break;
|
|
}
|
|
|
|
case 1: {
|
|
output[o++] |= x >> 4;
|
|
output[o] = (x & 15) << 4;
|
|
break;
|
|
}
|
|
|
|
case 2: {
|
|
output[o++] |= x >> 2;
|
|
output[o] = (x & 3) << 6;
|
|
break;
|
|
}
|
|
|
|
case 3: {
|
|
output[o++] |= x;
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
outlength = o;
|
|
return true;
|
|
}
|
|
|
|
static string decode(const string &data) {
|
|
uint8_t *buffer = nullptr;
|
|
unsigned size = 0;
|
|
decode(buffer, size, (const char*)data);
|
|
string result = (const char*)buffer;
|
|
delete[] buffer;
|
|
return result;
|
|
}
|
|
|
|
private:
|
|
static char enc(uint8_t n) {
|
|
//base64 for URL encodings (URL = -_, MIME = +/)
|
|
static char lookup_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
|
|
return lookup_table[n & 63];
|
|
}
|
|
|
|
static uint8_t dec(char n) {
|
|
if(n >= 'A' && n <= 'Z') return n - 'A';
|
|
if(n >= 'a' && n <= 'z') return n - 'a' + 26;
|
|
if(n >= '0' && n <= '9') return n - '0' + 52;
|
|
if(n == '-') return 62;
|
|
if(n == '_') return 63;
|
|
return 0;
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif
|