* Broke the "prepare" methods up into smaller methods * Removed the usage of linked lists and replaced them with arrays. Given that themes won't be added/removed throughout the execution of the program, we don't need to be able to dynamically add or remove elements to the list. In addition, once you got to ~50 themes, it took about .2 seconds to iterate through the entire list, which, while it may not sound like much, is a huge time sink when you're going through a list. Being able to randomly access any element in the list at the same speed is hugely beneficial. The downside to this is we need to keep track of the number of themes/splashes at all times, and, for splashes, have to do some weird type magic in order to properly iterate over it. However, these negatives are outweighed by the speed improvements.
35 lines
667 B
C
35 lines
667 B
C
#pragma once
|
|
|
|
#include "minizip/unzip.h"
|
|
|
|
struct theme_data
|
|
{
|
|
u16 title[0x40];
|
|
u16 description[0x80];
|
|
u16 author[0x40];
|
|
char iconData[0x1200];
|
|
u16 path[524];
|
|
bool selected;
|
|
bool bgm;
|
|
};
|
|
|
|
typedef struct theme_data theme_data;
|
|
|
|
u8 regionCode;
|
|
u32 archive1;
|
|
u32 archive2;
|
|
|
|
FS_Archive ArchiveSD;
|
|
FS_Archive ArchiveHomeExt;
|
|
FS_Archive ArchiveThemeExt;
|
|
|
|
Result prepare_archives();
|
|
int get_number_entries(char*);
|
|
Result unzip_file(char*, FS_DirectoryEntry*, u16*);
|
|
Result unzip_themes();
|
|
Result prepare_themes(theme_data**);
|
|
Result themeInstall(theme_data);
|
|
Result shuffle_install(theme_data**, int);
|
|
Result closeThemeArchives();
|
|
Result parseSmdh(theme_data*, u16*);
|