rvtr/TwlIPL
1
Fork 0
mirror of https://github.com/rvtr/TwlIPL.git synced 2025-10-31 06:01:12 -04:00
Code Issues Actions Packages Projects Releases Wiki Activity

少し修正

Browse Source 
git-svn-id: file:///Users/lillianskinner/Downloads/platinum/twl/TwlIPL/trunk@2909 b08762b0-b915-fc4b-9d8c-17b2551a87ff
This commit is contained in:
(no author) 2009-09-03 00:35:55 +00:00
parent 234f2a5e43
commit f3b643cb72
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
build/tests/TitleHashChecker/ARM9.TWL/src/main.c
View File

@ -127,9 +127,9 @@ static const u32 TitleIDTable[OUTPUT_SORT_TITLE_NUM] = {
0x484e4b00, // 9.HNK* サウンド 0x484e4b00, // 9.HNK* サウンド
0x484e4c00, //10.HNL* バージョンデータ 0x484e4c00, //10.HNL* バージョンデータ
NAND_FIRM_MAGIC_CODE, //11.---- NANDファーム NAND_FIRM_MAGIC_CODE, //11.---- NANDファーム
0x344e4641, //12.4NFA Nand Filer 0x344e4600, //12.4NF* Nand Filer
SHARED_FONT_MAGIC_CODE, //13.---- フォント SHARED_FONT_MAGIC_CODE, //13.---- フォント
0x34544e41 //14.4TNA TwlNmenu 0x34544e00 //14.4TN* TwlNmenu
}; };
/*---------------------------------------------------------------------------* /*---------------------------------------------------------------------------*
Prototype Prototype
@ -207,7 +207,9 @@ void TwlMain(void)
SortList( gDataList ); SortList( gDataList );
#ifndef HASH_CRC_CLCU_SKIP
OutputHashDataForSD( gDataList ); OutputHashDataForSD( gDataList );
#endif
while(TRUE) while(TRUE)
{ {
@ -633,8 +635,6 @@ static BOOL GetAppPath(DataStruct* list, char* path_buf)
*---------------------------------------------------------------------------*/ *---------------------------------------------------------------------------*/
static BOOL OutputHashDataForSD( DataStruct* list ) static BOOL OutputHashDataForSD( DataStruct* list )
{ {
#pragma unused(list)
BOOL retval = TRUE; BOOL retval = TRUE;
FSFile file; FSFile file;
u32 i; u32 i;
@ -1111,19 +1111,19 @@ static void SortList( DataStruct* list )
count++; count++;
} }
} }
// 降順に並び替え // 降順に並び替え
p = (DataStruct *)tmpList; p = (DataStruct *)tmpList;
for(i=sort_count; i<gNandAppNum-1; i++) for(i=sort_count; i<gNandAppNum-1; i++)
{ {
for(j=(u32)(gNandAppNum-1); j>=i; j--) for(j=(u32)(gNandAppNum-1); j>i; j--)
{ {
if( (u32)p[j].id > (u32)p[j+1].id ) if( (u32)p[j].id < (u32)p[j-1].id )
{ {
MI_CpuCopy8( &p[j], &buf, sizeof(DataStruct) ); MI_CpuCopy8( &p[j], &buf, sizeof(DataStruct) );
MI_CpuCopy8( &p[j+1], &p[j], sizeof(DataStruct) ); MI_CpuCopy8( &p[j-1], &p[j], sizeof(DataStruct) );
MI_CpuCopy8( &buf, &p[j+1], sizeof(DataStruct) ); MI_CpuCopy8( &buf, &p[j-1], sizeof(DataStruct) );
} }
} }
} }