mirror of
https://github.com/GearsProgress/Poke_Transporter_GB.git
synced 2026-07-15 07:44:11 -05:00
1d57c10333
text_data_table was very similar in concept to FileContainerReader. But FileContainerReader is generally more flexible, as it allows you to split up your table into several chunks. This takes away the worry of these files getting too big to compress. However, we now have a maintenance duty for the text_tables file, which maps a table index to the list of chunks. We also need to be careful about every use of FileContainerReader::getPointerToFileInDecompressionBuffer(). Using it is fine when you're dealing with a single chunk or if you're sure the file doesn't span multiple chunks. But the moment you seek to a different chunk, any pointer obtained from getPointerToFileInDecompressionBuffer() becomes stale as the decompression buffer gets overwritten. Still, this function is necessary for high memory pressure situations, such as mystery_gift_builder, because we can't maintain multiple lineBuffers there.
56 lines
2.1 KiB
C++
56 lines
2.1 KiB
C++
#include "text_tables.h"
|
|
#include "translated_text.h"
|
|
#include "CREDITS_chunk0_lz10_bin.h"
|
|
#include "GB_chunk0_lz10_bin.h"
|
|
#include "GENERAL_chunk0_lz10_bin.h"
|
|
#include "PKMN_NAMES_chunk0_lz10_bin.h"
|
|
#include "PKMN_NAMES_chunk1_lz10_bin.h"
|
|
#include "PTGB_chunk0_lz10_bin.h"
|
|
#include "PTGB_chunk1_lz10_bin.h"
|
|
#include "PTGB_chunk2_lz10_bin.h"
|
|
#include "RSEFRLG_chunk0_lz10_bin.h"
|
|
|
|
static const u8 *CREDITS_chunk_list[] = {CREDITS_chunk0_lz10_bin};
|
|
static const u8 *GB_chunk_list[] = {GB_chunk0_lz10_bin};
|
|
static const u8 *GENERAL_chunk_list[] = {GENERAL_chunk0_lz10_bin};
|
|
static const u8 *PKMN_NAMES_chunk_list[] = {PKMN_NAMES_chunk0_lz10_bin, PKMN_NAMES_chunk1_lz10_bin};
|
|
static const u8 *PTGB_chunk_list[] = {PTGB_chunk0_lz10_bin, PTGB_chunk1_lz10_bin, PTGB_chunk2_lz10_bin};
|
|
static const u8 *RSEFRLG_chunk_list[] = {RSEFRLG_chunk0_lz10_bin};
|
|
|
|
void get_text_table_chunks(u32 tableIndex, const u8 ***chunkList, u32 *numChunks, u32 *chunkSize)
|
|
{
|
|
// every table except for RSEFRLG is 2048 bytes per chunk, so we can set that by default and only change it for RSEFRLG
|
|
*chunkSize = 2048;
|
|
switch(tableIndex)
|
|
{
|
|
case PTGB_INDEX:
|
|
*chunkList = PTGB_chunk_list;
|
|
*numChunks = sizeof(PTGB_chunk_list) / sizeof(PTGB_chunk_list[0]);
|
|
break;
|
|
case RSEFRLG_INDEX:
|
|
*chunkList = RSEFRLG_chunk_list;
|
|
*numChunks = sizeof(RSEFRLG_chunk_list) / sizeof(RSEFRLG_chunk_list[0]);
|
|
*chunkSize = 4096;
|
|
break;
|
|
case GB_INDEX:
|
|
*chunkList = GB_chunk_list;
|
|
*numChunks = sizeof(GB_chunk_list) / sizeof(GB_chunk_list[0]);
|
|
break;
|
|
case GENERAL_INDEX:
|
|
*chunkList = GENERAL_chunk_list;
|
|
*numChunks = sizeof(GENERAL_chunk_list) / sizeof(GENERAL_chunk_list[0]);
|
|
break;
|
|
case CREDITS_INDEX:
|
|
*chunkList = CREDITS_chunk_list;
|
|
*numChunks = sizeof(CREDITS_chunk_list) / sizeof(CREDITS_chunk_list[0]);
|
|
break;
|
|
case PKMN_NAMES_INDEX:
|
|
*chunkList = PKMN_NAMES_chunk_list;
|
|
*numChunks = sizeof(PKMN_NAMES_chunk_list) / sizeof(PKMN_NAMES_chunk_list[0]);
|
|
break;
|
|
default:
|
|
*chunkList = NULL;
|
|
*numChunks = 0;
|
|
break;
|
|
}
|
|
} |