mirror of https://github.com/nmlgc/ReC98.git
126 lines
2.9 KiB
C++
126 lines
2.9 KiB
C++
#include "th01/shiftjis/scoredat.hpp"
|
|
|
|
// State
|
|
// -----
|
|
|
|
int8_t* scoredat_names; // Yeah, technically a scoredat_name_t.
|
|
int8_t* scoredat_routes; // Yeah, technically a shiftjis_kanji_t.
|
|
int16_t* scoredat_stages;
|
|
extern int32_t* scoredat_score;
|
|
// -----
|
|
|
|
#define scoredat_fn(buf) { \
|
|
switch(rank) { \
|
|
case RANK_EASY: strcpy(fn, SCOREDAT_FN_EASY); break; \
|
|
case RANK_NORMAL: strcpy(fn, SCOREDAT_FN_NORMAL); break; \
|
|
case RANK_HARD: strcpy(fn, SCOREDAT_FN_HARD); break; \
|
|
case RANK_LUNATIC: strcpy(fn, SCOREDAT_FN_LUNATIC); break; \
|
|
} \
|
|
}
|
|
|
|
int8_t scoredat_name_byte_encode(int8_t byte)
|
|
{
|
|
return (byte + SCOREDAT_NAME_KEY);
|
|
}
|
|
|
|
int8_t scoredat_name_byte_decode(int8_t byte)
|
|
{
|
|
return (byte + (0x100 - SCOREDAT_NAME_KEY));
|
|
}
|
|
|
|
#pragma warn -rch
|
|
|
|
void scoredat_recreate()
|
|
{
|
|
int i;
|
|
int16_t stage;
|
|
const shiftjis_t *route = SCOREDAT_ROUTE_NONE;
|
|
int32_t score;
|
|
scoredat_declare();
|
|
|
|
// Will be name-encoded, and therefore modified in the .data section!
|
|
char *name = scoredat_name_default;
|
|
|
|
const char *magic = SCOREDAT_MAGIC;
|
|
char fn[16];
|
|
|
|
scoredat_fn(fn);
|
|
|
|
scoredat_cli();
|
|
if(scoredat_create(fn) == 0) {
|
|
goto end;
|
|
return;
|
|
}
|
|
scoredat_write(magic, sizeof(SCOREDAT_MAGIC) - 1);
|
|
|
|
stage = SCOREDAT_PLACES;
|
|
score = (SCOREDAT_PLACES * 100);
|
|
for(i = 0; i < SCOREDAT_NAME_BYTES; i++) {
|
|
name[i] = scoredat_name_byte_encode(name[i]);
|
|
}
|
|
for(i = 0; i < SCOREDAT_PLACES; i++) {
|
|
scoredat_write(name, SCOREDAT_NAME_BYTES);
|
|
}
|
|
for(i = 0; i < SCOREDAT_PLACES; i++) {
|
|
scoredat_write(&score, sizeof(score));
|
|
score = score - 100;
|
|
}
|
|
for(i = 0; i < SCOREDAT_PLACES; i++) {
|
|
scoredat_write(&stage, sizeof(stage));
|
|
stage = stage - 1;
|
|
}
|
|
for(i = 0; i < SCOREDAT_PLACES; i++) {
|
|
scoredat_write(route, sizeof(shiftjis_kanji_t));
|
|
}
|
|
scoredat_close();
|
|
end:
|
|
scoredat_sti();
|
|
}
|
|
|
|
int scoredat_load()
|
|
{
|
|
union {
|
|
char magic[sizeof(SCOREDAT_MAGIC) - 1];
|
|
char space[50];
|
|
} buf;
|
|
char fn[16];
|
|
scoredat_declare();
|
|
|
|
scoredat_fn(fn);
|
|
if(!scoredat_exist(fn)) {
|
|
scoredat_recreate();
|
|
}
|
|
|
|
scoredat_cli();
|
|
if(scoredat_ropen(fn) == 0) {
|
|
scoredat_error(SCOREDAT_ERROR_NOT_FOUND);
|
|
scoredat_sti();
|
|
return 1;
|
|
}
|
|
scoredat_read(buf.magic, sizeof(buf.magic));
|
|
// Who cares about the last three bytes anyway, right.
|
|
if(memcmp(buf.magic, SCOREDAT_MAGIC, 4)) {
|
|
scoredat_close();
|
|
scoredat_error(SCOREDAT_ERROR_INVALID);
|
|
scoredat_sti();
|
|
return 1;
|
|
}
|
|
|
|
scoredat_names = new int8_t[SCOREDAT_NAMES_SIZE];
|
|
scoredat_stages = new int16_t[SCOREDAT_PLACES];
|
|
scoredat_routes = new int8_t[SCOREDAT_ROUTE_LEN * SCOREDAT_PLACES];
|
|
scoredat_score = new int32_t[SCOREDAT_PLACES];
|
|
|
|
scoredat_read(scoredat_names, SCOREDAT_NAMES_SIZE);
|
|
scoredat_read(scoredat_score, sizeof(int32_t) * SCOREDAT_PLACES);
|
|
scoredat_read(scoredat_stages, sizeof(int16_t) * SCOREDAT_PLACES);
|
|
scoredat_read(scoredat_routes, SCOREDAT_ROUTE_LEN * SCOREDAT_PLACES);
|
|
scoredat_close();
|
|
|
|
for(int i = 0; i < SCOREDAT_NAMES_SIZE; i++) {
|
|
scoredat_names[i] = scoredat_name_byte_decode(scoredat_names[i]);
|
|
}
|
|
scoredat_sti();
|
|
return 0;
|
|
}
|