mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-04-02 10:42:14 -04:00
81f43a4d01
This represents a major code restructuring. The dot-based and scanline-based renderers are now split into two separate core libraries, asnes and bsnes. For now at least, these are -internal- names. I'm not entirely decided on how I'm going to handle releasing these two separate builds. Regardless, the folders need names. asnes has had all of the processor subfolders collapsed back into their parent folders. In other words, ppu's functions were moved into ppu/sppu, and then ppu was deleted, and then ppu/sppu became the new ppu. Repeat this for the cpu, smp and dsp and there you go. asnes/dsp also removed the DSP_STATE_MACHINE option. This was done for the sake of consistency with the rest of the core. asnes' debugger mode is currently extremely broken, but I will be fixing it in time. And for now, bsnes has kept the processor abstraction layer. I may keep it around, not sure yet. It doesn't hurt speed or anything, so I'm not too worried about making a decision right away. I may throw snesfilter, snesreader and supergameboy into this folder, just to have everything in one place. The alternate GUI forks are definitely going in there as dotnet, cocoa and python. Compiled output goes to the out/ folder now, to prevent conflicts with a file and folder named bsnes, for instance.
157 lines
3.5 KiB
C++
157 lines
3.5 KiB
C++
#ifndef NALL_STRING_UTILITY_HPP
|
|
#define NALL_STRING_UTILITY_HPP
|
|
|
|
namespace nall {
|
|
|
|
unsigned strlcpy(string &dest, const char *src, unsigned length) {
|
|
dest.reserve(length);
|
|
return strlcpy(dest(), src, length);
|
|
}
|
|
|
|
unsigned strlcat(string &dest, const char *src, unsigned length) {
|
|
dest.reserve(length);
|
|
return strlcat(dest(), src, length);
|
|
}
|
|
|
|
string substr(const char *src, unsigned start, unsigned length) {
|
|
string dest;
|
|
if(length == 0) {
|
|
//copy entire string
|
|
dest = src + start;
|
|
} else {
|
|
//copy partial string
|
|
strlcpy(dest, src + start, length + 1);
|
|
}
|
|
return dest;
|
|
}
|
|
|
|
/* arithmetic <> string */
|
|
|
|
template<unsigned length, char padding> string strhex(uintmax_t value) {
|
|
string output;
|
|
unsigned offset = 0;
|
|
|
|
//render string backwards, as we do not know its length yet
|
|
do {
|
|
unsigned n = value & 15;
|
|
output[offset++] = n < 10 ? '0' + n : 'a' + n - 10;
|
|
value >>= 4;
|
|
} while(value);
|
|
|
|
while(offset < length) output[offset++] = padding;
|
|
output[offset--] = 0;
|
|
|
|
//reverse the string in-place
|
|
for(unsigned i = 0; i < (offset + 1) >> 1; i++) {
|
|
char temp = output[i];
|
|
output[i] = output[offset - i];
|
|
output[offset - i] = temp;
|
|
}
|
|
|
|
return output;
|
|
}
|
|
|
|
template<unsigned length, char padding> string strsigned(intmax_t value) {
|
|
string output;
|
|
unsigned offset = 0;
|
|
|
|
bool negative = value < 0;
|
|
if(negative) value = abs(value);
|
|
|
|
do {
|
|
unsigned n = value % 10;
|
|
output[offset++] = '0' + n;
|
|
value /= 10;
|
|
} while(value);
|
|
|
|
while(offset < length) output[offset++] = padding;
|
|
if(negative) output[offset++] = '-';
|
|
output[offset--] = 0;
|
|
|
|
for(unsigned i = 0; i < (offset + 1) >> 1; i++) {
|
|
char temp = output[i];
|
|
output[i] = output[offset - i];
|
|
output[offset - i] = temp;
|
|
}
|
|
|
|
return output;
|
|
}
|
|
|
|
template<unsigned length, char padding> string strunsigned(uintmax_t value) {
|
|
string output;
|
|
unsigned offset = 0;
|
|
|
|
do {
|
|
unsigned n = value % 10;
|
|
output[offset++] = '0' + n;
|
|
value /= 10;
|
|
} while(value);
|
|
|
|
while(offset < length) output[offset++] = padding;
|
|
output[offset--] = 0;
|
|
|
|
for(unsigned i = 0; i < (offset + 1) >> 1; i++) {
|
|
char temp = output[i];
|
|
output[i] = output[offset - i];
|
|
output[offset - i] = temp;
|
|
}
|
|
|
|
return output;
|
|
}
|
|
|
|
template<unsigned length, char padding> string strbin(uintmax_t value) {
|
|
string output;
|
|
unsigned offset = 0;
|
|
|
|
do {
|
|
unsigned n = value & 1;
|
|
output[offset++] = '0' + n;
|
|
value >>= 1;
|
|
} while(value);
|
|
|
|
while(offset < length) output[offset++] = padding;
|
|
output[offset--] = 0;
|
|
|
|
for(unsigned i = 0; i < (offset + 1) >> 1; i++) {
|
|
char temp = output[i];
|
|
output[i] = output[offset - i];
|
|
output[offset - i] = temp;
|
|
}
|
|
|
|
return output;
|
|
}
|
|
|
|
//using sprintf is certainly not the most ideal method to convert
|
|
//a double to a string ... but attempting to parse a double by
|
|
//hand, digit-by-digit, results in subtle rounding errors.
|
|
unsigned strdouble(char *str, double value) {
|
|
char buffer[256];
|
|
sprintf(buffer, "%f", value);
|
|
|
|
//remove excess 0's in fraction (2.500000 -> 2.5)
|
|
for(char *p = buffer; *p; p++) {
|
|
if(*p == '.') {
|
|
char *p = buffer + strlen(buffer) - 1;
|
|
while(*p == '0') {
|
|
if(*(p - 1) != '.') *p = 0; //... but not for eg 1.0 -> 1.
|
|
p--;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
unsigned length = strlen(buffer);
|
|
if(str) strcpy(str, buffer);
|
|
return length + 1;
|
|
}
|
|
|
|
string strdouble(double value) {
|
|
string temp;
|
|
temp.reserve(strdouble(0, value));
|
|
strdouble(temp(), value);
|
|
return temp;
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|