mirror of
https://github.com/wiidev/usbloadergx.git
synced 2024-11-22 19:29:18 +01:00
273 lines
6.3 KiB
C
273 lines
6.3 KiB
C
|
#include <ogcsys.h>
|
||
|
#include <stdlib.h>
|
||
|
#include <stdio.h>
|
||
|
#include <unistd.h>
|
||
|
#include <sys/stat.h>
|
||
|
|
||
|
#include "fatmounter.h"
|
||
|
#include "libntfs/ntfs.h"
|
||
|
#include "libwbfs/libwbfs.h"
|
||
|
#include "wbfs.h"
|
||
|
#include "wbfs_fat.h"
|
||
|
#include "usbstorage.h"
|
||
|
#include "frag.h"
|
||
|
#include "utils.h"
|
||
|
|
||
|
int _FAT_get_fragments (const char *path, _frag_append_t append_fragment, void *callback_data);
|
||
|
|
||
|
FragList *frag_list = NULL;
|
||
|
|
||
|
void frag_init(FragList *ff, int maxnum)
|
||
|
{
|
||
|
memset(ff, 0, sizeof(Fragment) * (maxnum+1));
|
||
|
ff->maxnum = maxnum;
|
||
|
}
|
||
|
|
||
|
int frag_append(FragList *ff, u32 offset, u32 sector, u32 count)
|
||
|
{
|
||
|
int n;
|
||
|
if (count) {
|
||
|
n = ff->num - 1;
|
||
|
if (ff->num > 0
|
||
|
&& ff->frag[n].offset + ff->frag[n].count == offset
|
||
|
&& ff->frag[n].sector + ff->frag[n].count == sector)
|
||
|
{
|
||
|
// merge
|
||
|
ff->frag[n].count += count;
|
||
|
}
|
||
|
else
|
||
|
{
|
||
|
// add
|
||
|
if (ff->num >= ff->maxnum) {
|
||
|
// too many fragments
|
||
|
return -500;
|
||
|
}
|
||
|
n = ff->num;
|
||
|
ff->frag[n].offset = offset;
|
||
|
ff->frag[n].sector = sector;
|
||
|
ff->frag[n].count = count;
|
||
|
ff->num++;
|
||
|
}
|
||
|
}
|
||
|
ff->size = offset + count;
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
int _frag_append(void *ff, u32 offset, u32 sector, u32 count)
|
||
|
{
|
||
|
return frag_append(ff, offset, sector, count);
|
||
|
}
|
||
|
|
||
|
int frag_concat(FragList *ff, FragList *src)
|
||
|
{
|
||
|
int i, ret;
|
||
|
u32 size = ff->size;
|
||
|
//printf("concat: %d %d <- %d %d\n", ff->num, ff->size, src->num, src->size);
|
||
|
for (i=0; i<src->num; i++) {
|
||
|
ret = frag_append(ff, size + src->frag[i].offset,
|
||
|
src->frag[i].sector, src->frag[i].count);
|
||
|
if (ret) return ret;
|
||
|
}
|
||
|
ff->size = size + src->size;
|
||
|
//printf("concat: -> %d %d\n", ff->num, ff->size);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
// in case a sparse block is requested,
|
||
|
// the returned poffset might not be equal to requested offset
|
||
|
// the difference should be filled with 0
|
||
|
int frag_get(FragList *ff, u32 offset, u32 count,
|
||
|
u32 *poffset, u32 *psector, u32 *pcount)
|
||
|
{
|
||
|
int i;
|
||
|
u32 delta;
|
||
|
//printf("frag_get(%u %u)\n", offset, count);
|
||
|
for (i=0; i<ff->num; i++) {
|
||
|
if (ff->frag[i].offset <= offset
|
||
|
&& ff->frag[i].offset + ff->frag[i].count > offset)
|
||
|
{
|
||
|
delta = offset - ff->frag[i].offset;
|
||
|
*poffset = offset;
|
||
|
*psector = ff->frag[i].sector + delta;
|
||
|
*pcount = ff->frag[i].count - delta;
|
||
|
if (*pcount > count) *pcount = count;
|
||
|
goto out;
|
||
|
}
|
||
|
if (ff->frag[i].offset > offset
|
||
|
&& ff->frag[i].offset < offset + count)
|
||
|
{
|
||
|
delta = ff->frag[i].offset - offset;
|
||
|
*poffset = ff->frag[i].offset;
|
||
|
*psector = ff->frag[i].sector;
|
||
|
*pcount = ff->frag[i].count;
|
||
|
count -= delta;
|
||
|
if (*pcount > count) *pcount = count;
|
||
|
goto out;
|
||
|
}
|
||
|
}
|
||
|
// not found
|
||
|
if (offset + count > ff->size) {
|
||
|
// error: out of range!
|
||
|
return -1;
|
||
|
}
|
||
|
// if inside range, then it must be just sparse, zero filled
|
||
|
// return empty block at the end of requested
|
||
|
*poffset = offset + count;
|
||
|
*psector = 0;
|
||
|
*pcount = 0;
|
||
|
out:
|
||
|
//printf("=>(%u %u %u)\n", *poffset, *psector, *pcount);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
int frag_remap(FragList *ff, FragList *log, FragList *phy)
|
||
|
{
|
||
|
int i;
|
||
|
int ret;
|
||
|
u32 offset;
|
||
|
u32 sector;
|
||
|
u32 count;
|
||
|
u32 delta;
|
||
|
for (i=0; i<log->num; i++) {
|
||
|
delta = 0;
|
||
|
count = 0;
|
||
|
do {
|
||
|
ret = frag_get(phy,
|
||
|
log->frag[i].sector + delta + count,
|
||
|
log->frag[i].count - delta - count,
|
||
|
&offset, §or, &count);
|
||
|
if (ret) return ret; // error
|
||
|
delta = offset - log->frag[i].sector;
|
||
|
ret = frag_append(ff, log->frag[i].offset + delta, sector, count);
|
||
|
if (ret) return ret; // error
|
||
|
} while (count + delta < log->frag[i].count);
|
||
|
}
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
|
||
|
int get_frag_list(u8 *id)
|
||
|
{
|
||
|
char fname[1024];
|
||
|
char fname1[1024];
|
||
|
struct stat st;
|
||
|
FragList *fs = NULL;
|
||
|
FragList *fa = NULL;
|
||
|
FragList *fw = NULL;
|
||
|
int ret;
|
||
|
int i, j;
|
||
|
int is_wbfs = 0;
|
||
|
int ret_val = -1;
|
||
|
|
||
|
if (wbfs_part_fs == PART_FS_WBFS) return 0;
|
||
|
|
||
|
ret = WBFS_FAT_find_fname(id, fname, sizeof(fname));
|
||
|
if (!ret) return -1;
|
||
|
|
||
|
if (strcasecmp(strrchr(fname,'.'), ".wbfs") == 0) {
|
||
|
is_wbfs = 1;
|
||
|
}
|
||
|
|
||
|
fs = malloc(sizeof(FragList));
|
||
|
fa = malloc(sizeof(FragList));
|
||
|
fw = malloc(sizeof(FragList));
|
||
|
|
||
|
frag_init(fa, MAX_FRAG);
|
||
|
|
||
|
for (i=0; i<10; i++) {
|
||
|
frag_init(fs, MAX_FRAG);
|
||
|
if (i > 0) {
|
||
|
fname[strlen(fname)-1] = '0' + i;
|
||
|
if (stat(fname, &st) == -1) break;
|
||
|
}
|
||
|
strcpy(fname1, fname);
|
||
|
//printf("::*%s\n", strrchr(fname,'/'));
|
||
|
if (wbfs_part_fs == PART_FS_FAT) {
|
||
|
ret = _FAT_get_fragments(fname, &_frag_append, fs);
|
||
|
if (ret) {
|
||
|
printf("fat getf: %d\n", ret);
|
||
|
// don't return failure, let it fallback to old method
|
||
|
//ret_val = ret;
|
||
|
ret_val = 0;
|
||
|
goto out;
|
||
|
}
|
||
|
} else if (wbfs_part_fs == PART_FS_NTFS) {
|
||
|
ret = _NTFS_get_fragments(fname, &_frag_append, fs);
|
||
|
if (ret) {
|
||
|
printf("ntfs getf: %d\n", ret);
|
||
|
if (ret == -50 || ret == -500) {
|
||
|
printf("Too many fragments! %d\n", fs->num);
|
||
|
}
|
||
|
ret_val = ret;
|
||
|
goto out;
|
||
|
}
|
||
|
// offset to start of partition
|
||
|
for (j=0; j<fs->num; j++) {
|
||
|
fs->frag[j].sector += fs_ntfs_sec;
|
||
|
}
|
||
|
}
|
||
|
frag_concat(fa, fs);
|
||
|
}
|
||
|
|
||
|
frag_list = malloc(sizeof(FragList));
|
||
|
frag_init(frag_list, MAX_FRAG);
|
||
|
if (is_wbfs) {
|
||
|
// if wbfs file format, remap.
|
||
|
//printf("=====\n");
|
||
|
wbfs_disc_t *d = WBFS_OpenDisc(id);
|
||
|
if (!d) goto out;
|
||
|
frag_init(fw, MAX_FRAG);
|
||
|
ret = wbfs_get_fragments(d, &_frag_append, fw);
|
||
|
if (ret) goto out;
|
||
|
WBFS_CloseDisc(d);
|
||
|
// DEBUG: frag_list->num = MAX_FRAG-10; // stress test
|
||
|
ret = frag_remap(frag_list, fw, fa);
|
||
|
if (ret) goto out;
|
||
|
} else {
|
||
|
// .iso does not need remap just copy
|
||
|
//printf("fa:\n");
|
||
|
memcpy(frag_list, fa, sizeof(FragList));
|
||
|
}
|
||
|
|
||
|
ret_val = 0;
|
||
|
|
||
|
out:
|
||
|
if (ret_val) {
|
||
|
// error
|
||
|
SAFE_FREE(frag_list);
|
||
|
}
|
||
|
SAFE_FREE(fs);
|
||
|
SAFE_FREE(fa);
|
||
|
SAFE_FREE(fw);
|
||
|
return ret_val;
|
||
|
}
|
||
|
|
||
|
int set_frag_list(u8 *id)
|
||
|
{
|
||
|
if (wbfs_part_fs == PART_FS_WBFS) return 0;
|
||
|
if (frag_list == NULL) {
|
||
|
if (wbfs_part_fs == PART_FS_FAT) {
|
||
|
// fall back to old fat method
|
||
|
printf("FAT: fallback to old method\n");
|
||
|
return 0;
|
||
|
}
|
||
|
// ntfs has no fallback, return error
|
||
|
return -1;
|
||
|
}
|
||
|
|
||
|
// (+1 for header which is same size as fragment)
|
||
|
int size = sizeof(Fragment) * (frag_list->num + 1);
|
||
|
int ret = USBStorage_WBFS_SetFragList(frag_list, size);
|
||
|
if (ret) {
|
||
|
printf("set_frag: %d\n", ret);
|
||
|
return ret;
|
||
|
}
|
||
|
|
||
|
// verify id matches
|
||
|
char discid[8];
|
||
|
memset(discid, 0, sizeof(discid));
|
||
|
ret = USBStorage_WBFS_Read(0, 6, discid);
|
||
|
return 0;
|
||
|
}
|
||
|
|