Game-Decompilation/spm-decomp
1
0
Fork 0
mirror of https://github.com/SeekyCt/spm-decomp.git synced 2024-11-23 21:39:52 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fixed japanese assert text being utf-8 instead of shift jis

Browse Source
This commit is contained in:
Seeky 2020-12-25 18:34:28 +00:00
parent a4926130e5
commit e697355ad6
4 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
spm.bat
View File

@ -1 +1 @@
mwcceppc -O4 -proc gekko -lang C99 -S -d GAME_SPM -w all -use_lmw_stmw on -fp hard -str pool -inline on, auto -pragma "inline_max_auto_size(5)" -sdata2 4 -I- -i include src/*.c
mwcceppc -O4 -proc gekko -lang C99 -S -d GAME_SPM -w all -use_lmw_stmw on -fp hard -str pool -inline on, auto -pragma "inline_max_auto_size(5)" -enc SJIS -sdata2 4 -I- -i include src/*.c

2
src/swdrv.c
View File

@ -44,7 +44,7 @@ void swByteSet(s32 num, s32 value) {
}
else {
// "The value is strange"
assertf(num < 256, "値がおかしい sw_byte[%d] = %d", num + EVTDAT_LSW_BASE, value);
assertf(num < 256, "値がおかしい sw_byte[%d] = %d", num + EVTDAT_LSW_BASE, value);
gp->gsw[num] = (s8) value;
}
}

12
src/system.c
View File

@ -15,8 +15,8 @@ static char * pad() { // needed something in the string pool before "system.c",
}
void qqsort(char * list, size_t nel, size_t size, void * compare) {
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
comp = compare;
if (nel <= 1) return;
char * p = list;
@ -46,8 +46,8 @@ void qqsort(char * list, size_t nel, size_t size, void * compare) {
}
void qqsort(char * list, size_t nel, size_t size, char * compare) {
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
comp = compare;
if (nel > 1) {
char * p = list;
@ -78,8 +78,8 @@ void qqsort(char * list, size_t nel, size_t size, char * compare) {
}
void qqsort(char * list, size_t nel, size_t size, char * compare) {
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
assert(nel < MAX_ELEMENT, "要素数が多すぎてバッファが足りません"); // "Too many elements and not enough buffer"
assert(size < MAX_ELEMENT_SIZE, "１要素のサイズが大きくてバッファが足りません"); // "One element is too big and there is not enough buffer"
comp = compare;
if (nel > 1) {
for (int i = 0; i < nel; i++) {

2
ttyd.bat
View File

@ -1 +1 @@
mwcceppc -O4 -proc gekko -lang C99 -S -w all -I- -i include src/*.c
mwcceppc -O4 -proc gekko -lang C99 -S -w all -enc SJIS -I- -i include src/*.c