153 lines
3.6 KiB
C
153 lines
3.6 KiB
C
#include "common.h"
|
|
|
|
static menu_s s_menu[2];
|
|
static bool s_curMenu;
|
|
|
|
menu_s* menuGetCurrent(void) {
|
|
return &s_menu[s_curMenu];
|
|
}
|
|
|
|
static menuEntry_s* menuCreateEntry(MenuEntryType type) {
|
|
menuEntry_s* me = (menuEntry_s*)malloc(sizeof(menuEntry_s));
|
|
menuEntryInit(me, type);
|
|
return me;
|
|
}
|
|
|
|
static void menuDeleteEntry(menuEntry_s* me) {
|
|
menuEntryFree(me);
|
|
free(me);
|
|
}
|
|
|
|
static void menuAddEntry(menuEntry_s* me) {
|
|
menu_s* m = &s_menu[!s_curMenu];
|
|
me->menu = m;
|
|
if (m->lastEntry)
|
|
{
|
|
m->lastEntry->next = me;
|
|
m->lastEntry = me;
|
|
} else
|
|
{
|
|
m->firstEntry = me;
|
|
m->lastEntry = me;
|
|
}
|
|
m->xPos = 0;
|
|
m->nEntries ++;
|
|
}
|
|
|
|
static void menuClear(void) {
|
|
menu_s* m = &s_menu[!s_curMenu];
|
|
menuEntry_s *cur, *next;
|
|
for (cur = m->firstEntry; cur; cur = next)
|
|
{
|
|
next = cur->next;
|
|
menuDeleteEntry(cur);
|
|
}
|
|
memset(m, 0, sizeof(*m));
|
|
}
|
|
|
|
static int menuEntryCmp(const void *p1, const void *p2) {
|
|
const menuEntry_s* lhs = *(menuEntry_s**)p1;
|
|
const menuEntry_s* rhs = *(menuEntry_s**)p2;
|
|
|
|
if(lhs->type == rhs->type)
|
|
return strcasecmp(lhs->name, rhs->name);
|
|
if(lhs->type == ENTRY_TYPE_FOLDER)
|
|
return -1;
|
|
return 1;
|
|
}
|
|
|
|
static void menuSort(void) {
|
|
int i;
|
|
menu_s* m = &s_menu[!s_curMenu];
|
|
int nEntries = m->nEntries;
|
|
if (nEntries==0) return;
|
|
|
|
menuEntry_s** list = (menuEntry_s**)calloc(nEntries, sizeof(menuEntry_s*));
|
|
if(list == NULL) return;
|
|
|
|
menuEntry_s* p = m->firstEntry;
|
|
for(i = 0; i < nEntries; ++i) {
|
|
list[i] = p;
|
|
p = p->next;
|
|
}
|
|
|
|
qsort(list, nEntries, sizeof(menuEntry_s*), menuEntryCmp);
|
|
|
|
menuEntry_s** pp = &m->firstEntry;
|
|
for(i = 0; i < nEntries; ++i) {
|
|
*pp = list[i];
|
|
pp = &(*pp)->next;
|
|
}
|
|
m->lastEntry = list[nEntries-1];
|
|
*pp = NULL;
|
|
|
|
free(list);
|
|
}
|
|
|
|
int menuScan(const char* target) {
|
|
if (chdir(target) < 0) return 1;
|
|
if (getcwd(s_menu[!s_curMenu].dirname, PATH_MAX+1) == NULL)
|
|
return 1;
|
|
|
|
DIR* dir;
|
|
struct dirent* dp;
|
|
char tmp_path[PATH_MAX+1];
|
|
dir = opendir(s_menu[!s_curMenu].dirname);
|
|
if (!dir) return 2;
|
|
|
|
while ((dp = readdir(dir)))
|
|
{
|
|
menuEntry_s* me = NULL;
|
|
bool shortcut = false;
|
|
if (dp->d_name[0]=='.')
|
|
continue;
|
|
|
|
bool entrytype=0;
|
|
|
|
memset(tmp_path, 0, sizeof(tmp_path));
|
|
snprintf(tmp_path, sizeof(tmp_path)-1, "%s/%s", s_menu[!s_curMenu].dirname, dp->d_name);
|
|
|
|
#ifdef __SWITCH__
|
|
fsdev_dir_t* dirSt = (fsdev_dir_t*)dir->dirData->dirStruct;
|
|
FsDirectoryEntry* entry = &dirSt->entry_data[dirSt->index];
|
|
|
|
entrytype = entry->type == ENTRYTYPE_DIR;
|
|
#else
|
|
struct stat tmpstat;
|
|
|
|
if(stat(tmp_path, &tmpstat)==-1)
|
|
continue;
|
|
|
|
entrytype = (tmpstat.st_mode & S_IFMT) != S_IFREG;
|
|
#endif
|
|
|
|
if (entrytype)
|
|
me = menuCreateEntry(ENTRY_TYPE_FOLDER);
|
|
else
|
|
{
|
|
const char* ext = getExtension(dp->d_name);
|
|
if (strcasecmp(ext, ".nro")==0/* || (shortcut = strcasecmp(ext, ".xml")==0)*/)
|
|
me = menuCreateEntry(ENTRY_TYPE_FILE);
|
|
}
|
|
|
|
if (!me)
|
|
continue;
|
|
|
|
strncpy(me->path, tmp_path, sizeof(me->path)-1);
|
|
me->path[sizeof(me->path)-1] = 0;
|
|
if (menuEntryLoad(me, dp->d_name, shortcut))
|
|
menuAddEntry(me);
|
|
else
|
|
menuDeleteEntry(me);
|
|
}
|
|
|
|
closedir(dir);
|
|
menuSort();
|
|
|
|
// Swap the menu and clear the previous menu
|
|
s_curMenu = !s_curMenu;
|
|
menuClear();
|
|
return 0;
|
|
}
|
|
|