mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-08-18 07:11:25 +02:00
Update to v093 release.
byuu says: Changelog: - added Cocoa target: higan can now be compiled for OS X Lion [Cydrak, byuu] - SNES/accuracy profile hires color blending improvements - fixes Marvelous text [AWJ] - fixed a slight bug in SNES/SA-1 VBR support caused by a typo - added support for multi-pass shaders that can load external textures (requires OpenGL 3.2+) - added game library path (used by ananke->Import Game) to Settings->Advanced - system profiles, shaders and cheats database can be stored in "all users" shared folders now (eg /usr/share on Linux) - all configuration files are in BML format now, instead of XML (much easier to read and edit this way) - main window supports drag-and-drop of game folders (but not game files / ZIP archives) - audio buffer clears when entering a modal loop on Windows (prevents audio repetition with DirectSound driver) - a substantial amount of code clean-up (probably the biggest refactoring to date) One highly desired target for this release was to default to the optimal drivers instead of the safest drivers, but because AMD drivers don't seem to like my OpenGL 3.2 driver, I've decided to postpone that. AMD has too big a market share. Hopefully with v093 officially released, we can get some public input on what AMD doesn't like.
This commit is contained in:
157
nall/string/markup/bml.hpp
Normal file
157
nall/string/markup/bml.hpp
Normal file
@@ -0,0 +1,157 @@
|
||||
#ifdef NALL_STRING_INTERNAL_HPP
|
||||
|
||||
//BML v1.0 parser
|
||||
//revision 0.03
|
||||
|
||||
namespace nall {
|
||||
namespace BML {
|
||||
|
||||
struct Node : Markup::Node {
|
||||
protected:
|
||||
//test to verify if a valid character for a node name
|
||||
bool valid(char p) const { //A-Z, a-z, 0-9, -.
|
||||
return p - 'A' < 26u || p - 'a' < 26u || p - '0' < 10u || p - '-' < 2u;
|
||||
}
|
||||
|
||||
//determine indentation level, without incrementing pointer
|
||||
unsigned readDepth(const char* p) {
|
||||
unsigned depth = 0;
|
||||
while(p[depth] == '\t' || p[depth] == ' ') depth++;
|
||||
return depth;
|
||||
}
|
||||
|
||||
//determine indentation level
|
||||
unsigned parseDepth(const char*& p) {
|
||||
unsigned depth = readDepth(p);
|
||||
p += depth;
|
||||
return depth;
|
||||
}
|
||||
|
||||
//read name
|
||||
void parseName(const char*& p) {
|
||||
unsigned length = 0;
|
||||
while(valid(p[length])) length++;
|
||||
if(length == 0) throw "Invalid node name";
|
||||
name = substr(p, 0, length);
|
||||
p += length;
|
||||
}
|
||||
|
||||
void parseData(const char*& p) {
|
||||
if(*p == '=' && *(p + 1) == '\"') {
|
||||
unsigned length = 2;
|
||||
while(p[length] && p[length] != '\n' && p[length] != '\"') length++;
|
||||
if(p[length] != '\"') throw "Unescaped value";
|
||||
data = {substr(p, 2, length - 2), "\n"};
|
||||
p += length + 1;
|
||||
} else if(*p == '=') {
|
||||
unsigned length = 1;
|
||||
while(p[length] && p[length] != '\n' && p[length] != '\"' && p[length] != ' ') length++;
|
||||
if(p[length] == '\"') throw "Illegal character in value";
|
||||
data = {substr(p, 1, length - 1), "\n"};
|
||||
p += length;
|
||||
} else if(*p == ':') {
|
||||
unsigned length = 1;
|
||||
while(p[length] && p[length] != '\n') length++;
|
||||
data = {substr(p, 1, length - 1), "\n"};
|
||||
p += length;
|
||||
}
|
||||
}
|
||||
|
||||
//read all attributes for a node
|
||||
void parseAttributes(const char*& p) {
|
||||
while(*p && *p != '\n') {
|
||||
if(*p != ' ') throw "Invalid node name";
|
||||
while(*p == ' ') p++; //skip excess spaces
|
||||
if(*(p + 0) == '/' && *(p + 1) == '/') break; //skip comments
|
||||
|
||||
Node node;
|
||||
node.attribute = true;
|
||||
unsigned length = 0;
|
||||
while(valid(p[length])) length++;
|
||||
if(length == 0) throw "Invalid attribute name";
|
||||
node.name = substr(p, 0, length);
|
||||
node.parseData(p += length);
|
||||
node.data.rtrim<1>("\n");
|
||||
children.append(node);
|
||||
}
|
||||
}
|
||||
|
||||
//read a node and all of its child nodes
|
||||
void parseNode(const lstring& text, unsigned& y) {
|
||||
const char* p = text[y++];
|
||||
level = parseDepth(p);
|
||||
parseName(p);
|
||||
parseData(p);
|
||||
parseAttributes(p);
|
||||
|
||||
while(y < text.size()) {
|
||||
unsigned depth = readDepth(text[y]);
|
||||
if(depth <= level) break;
|
||||
|
||||
if(text[y][depth] == ':') {
|
||||
data.append(substr(text[y++], depth + 1), "\n");
|
||||
continue;
|
||||
}
|
||||
|
||||
Node node;
|
||||
node.parseNode(text, y);
|
||||
children.append(node);
|
||||
}
|
||||
|
||||
data.rtrim<1>("\n");
|
||||
}
|
||||
|
||||
//read top-level nodes
|
||||
void parse(const string& document) {
|
||||
lstring text = string{document}.replace("\r", "").split("\n");
|
||||
|
||||
//remove empty lines and comment lines
|
||||
for(unsigned y = 0; y < text.size();) {
|
||||
unsigned x = 0;
|
||||
bool empty = true;
|
||||
while(x < text[y].size()) {
|
||||
if(text[y][x] == ' ' || text[y][x] == '\t') { x++; continue; }
|
||||
empty = (text[y][x + 0] == '/' && text[y][x + 1] == '/');
|
||||
break;
|
||||
}
|
||||
if(empty) text.remove(y);
|
||||
else y++;
|
||||
}
|
||||
|
||||
unsigned y = 0;
|
||||
while(y < text.size()) {
|
||||
Node node;
|
||||
node.parseNode(text, y);
|
||||
if(node.level > 0) throw "Root nodes cannot be indented";
|
||||
children.append(node);
|
||||
}
|
||||
}
|
||||
|
||||
friend class Document;
|
||||
};
|
||||
|
||||
struct Document : Node {
|
||||
string error;
|
||||
|
||||
bool load(const string& document) {
|
||||
name = "", data = "";
|
||||
|
||||
try {
|
||||
parse(document);
|
||||
} catch(const char* error) {
|
||||
this->error = error;
|
||||
children.reset();
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
Document(const string& document = "") {
|
||||
load(document);
|
||||
}
|
||||
};
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
Reference in New Issue
Block a user