mirror of
https://github.com/pret/pokeruby.git
synced 2025-01-19 11:12:26 +00:00
decompile item.c (#91)
* start decompiling * decompile item.c * use static
This commit is contained in:
parent
813ac22885
commit
865f6f6f4f
1308
asm/item.s
1308
asm/item.s
File diff suppressed because it is too large
Load Diff
@ -113,7 +113,7 @@ SECTIONS {
|
||||
asm/rom_8094928.o(.text);
|
||||
asm/item_menu.o(.text);
|
||||
asm/battle_anim_80A7E7C.o(.text);
|
||||
asm/item.o(.text);
|
||||
src/item.o(.text);
|
||||
asm/matuda_debug_menu.o(.text);
|
||||
asm/contest.o(.text);
|
||||
asm/shop.o(.text);
|
||||
|
530
src/item.c
Normal file
530
src/item.c
Normal file
@ -0,0 +1,530 @@
|
||||
#include "global.h"
|
||||
#include "berry.h"
|
||||
#include "string_util.h"
|
||||
|
||||
extern struct Berry *GetBerryInfo(u8 berry);
|
||||
|
||||
extern u8 gOtherText_Berry2[];
|
||||
extern u8 gUnknown_02038560;
|
||||
|
||||
typedef void (*ItemUseFunc)(u8);
|
||||
|
||||
struct Item
|
||||
{
|
||||
u8 name[14];
|
||||
u16 itemId;
|
||||
u16 price;
|
||||
u8 holdEffect;
|
||||
u8 holdEffectParam;
|
||||
u8 *description;
|
||||
u8 importance;
|
||||
u8 unk19;
|
||||
u8 pocket;
|
||||
u8 type;
|
||||
ItemUseFunc fieldUseFunc;
|
||||
u8 battleUsage;
|
||||
ItemUseFunc battleUseFunc;
|
||||
u8 secondaryId;
|
||||
};
|
||||
|
||||
extern struct Item gItems[];
|
||||
|
||||
struct BagPocket
|
||||
{
|
||||
struct ItemSlot *itemSlots;
|
||||
u8 capacity;
|
||||
};
|
||||
|
||||
extern struct BagPocket gBagPockets[5];
|
||||
|
||||
enum
|
||||
{
|
||||
ITEMS_POCKET,
|
||||
BALLS_POCKET,
|
||||
TMHM_POCKET,
|
||||
BERRIES_POCKET,
|
||||
KEYITEMS_POCKET
|
||||
};
|
||||
|
||||
struct Item *ItemId_GetItem(u16);
|
||||
u8 ItemId_GetPocket(u16);
|
||||
static void CompactPCItems(void);
|
||||
|
||||
void CopyItemName(u16 itemId, u8 *string)
|
||||
{
|
||||
if (itemId == 0xAF)
|
||||
{
|
||||
StringCopy(string, GetBerryInfo(0x2B)->name);
|
||||
StringAppend(string, gOtherText_Berry2);
|
||||
}
|
||||
else
|
||||
StringCopy(string, ItemId_GetItem(itemId)->name);
|
||||
}
|
||||
|
||||
//Unreferenced
|
||||
static s8 CountUsedBagPocketSlots(u8 pocket)
|
||||
{
|
||||
u8 i;
|
||||
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == 0)
|
||||
return i;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
bool8 IsBagPocketNonEmpty(u8 pocket)
|
||||
{
|
||||
u8 i;
|
||||
|
||||
for (i = 0; i < gBagPockets[pocket - 1].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket - 1].itemSlots[i].itemId != 0)
|
||||
return TRUE;
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
bool8 CheckBagHasItem(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
u8 pocket;
|
||||
|
||||
if (ItemId_GetPocket(itemId) == 0)
|
||||
return FALSE;
|
||||
pocket = ItemId_GetPocket(itemId) - 1;
|
||||
//Check for item slots that contain the item
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == itemId)
|
||||
{
|
||||
//Does this item slot contain enough of the item?
|
||||
if (gBagPockets[pocket].itemSlots[i].quantity >= count)
|
||||
return TRUE;
|
||||
count -= gBagPockets[pocket].itemSlots[i].quantity;
|
||||
//Does this item slot and all previous slots contain enough of the item?
|
||||
if (count == 0)
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
bool8 CheckBagHasSpace(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
u8 pocket;
|
||||
u16 slotCapacity;
|
||||
|
||||
if (ItemId_GetPocket(itemId) == 0)
|
||||
return FALSE;
|
||||
pocket = ItemId_GetPocket(itemId) - 1;
|
||||
if (pocket != BERRIES_POCKET)
|
||||
slotCapacity = 99;
|
||||
else
|
||||
slotCapacity = 999;
|
||||
|
||||
//Check space in any existing item slots that already contain this item
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == itemId)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].quantity + count <= slotCapacity)
|
||||
return TRUE;
|
||||
if (pocket == TMHM_POCKET || pocket == BERRIES_POCKET)
|
||||
return FALSE;
|
||||
count -= slotCapacity - gBagPockets[pocket].itemSlots[i].quantity;
|
||||
if (count == 0)
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
|
||||
//Check space in empty item slots
|
||||
if (count > 0)
|
||||
{
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == 0)
|
||||
{
|
||||
if (count <= slotCapacity)
|
||||
return TRUE;
|
||||
else
|
||||
count -= slotCapacity;
|
||||
}
|
||||
}
|
||||
if (count > 0)
|
||||
return FALSE; //No more item slots. The bag is full
|
||||
}
|
||||
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
bool8 AddBagItem(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
u8 pocket;
|
||||
u16 slotCapacity;
|
||||
struct ItemSlot newItems[64];
|
||||
|
||||
if (ItemId_GetPocket(itemId) == 0)
|
||||
return FALSE;
|
||||
pocket = ItemId_GetPocket(itemId) - 1;
|
||||
//Copy the bag pocket
|
||||
memcpy(newItems, gBagPockets[pocket].itemSlots, gBagPockets[pocket].capacity * sizeof(struct ItemSlot));
|
||||
if (pocket != BERRIES_POCKET)
|
||||
slotCapacity = 99;
|
||||
else
|
||||
slotCapacity = 999;
|
||||
|
||||
//Use any item slots that already contain this item
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (newItems[i].itemId == itemId)
|
||||
{
|
||||
if (newItems[i].quantity + count <= slotCapacity)
|
||||
{
|
||||
newItems[i].quantity += count;
|
||||
//Copy pocket back into the bag.
|
||||
memcpy(gBagPockets[pocket].itemSlots, newItems, gBagPockets[pocket].capacity * sizeof(struct ItemSlot));
|
||||
return TRUE;
|
||||
}
|
||||
if (pocket == TMHM_POCKET || pocket == BERRIES_POCKET)
|
||||
return FALSE;
|
||||
count -= slotCapacity - newItems[i].quantity;
|
||||
newItems[i].quantity = slotCapacity;
|
||||
if (count == 0)
|
||||
goto copy_items;
|
||||
}
|
||||
}
|
||||
|
||||
//Put any remaining items into new item slots.
|
||||
if (count > 0)
|
||||
{
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (newItems[i].itemId == 0)
|
||||
{
|
||||
newItems[i].itemId = itemId;
|
||||
if (count <= slotCapacity)
|
||||
{
|
||||
newItems[i].quantity = count;
|
||||
goto copy_items;
|
||||
}
|
||||
count -= slotCapacity;
|
||||
newItems[i].quantity = slotCapacity;
|
||||
}
|
||||
}
|
||||
if (count > 0)
|
||||
return FALSE; //No more empty item slots. The bag is full.
|
||||
}
|
||||
|
||||
copy_items:
|
||||
//Copy pocket back into the bag.
|
||||
memcpy(gBagPockets[pocket].itemSlots, newItems, gBagPockets[pocket].capacity * sizeof(struct ItemSlot));
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
bool8 RemoveBagItem(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
u8 pocket;
|
||||
u16 totalQuantity = 0;
|
||||
|
||||
if (ItemId_GetPocket(itemId) == 0 || itemId == 0)
|
||||
return FALSE;
|
||||
pocket = ItemId_GetPocket(itemId) - 1;
|
||||
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == itemId)
|
||||
totalQuantity += gBagPockets[pocket].itemSlots[i].quantity;
|
||||
}
|
||||
if (totalQuantity < count)
|
||||
return FALSE; //We don't have enough of the item
|
||||
|
||||
if (gBagPockets[pocket].capacity > gUnknown_02038560
|
||||
&& gBagPockets[pocket].itemSlots[gUnknown_02038560].itemId == itemId)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[gUnknown_02038560].quantity >= count)
|
||||
{
|
||||
gBagPockets[pocket].itemSlots[gUnknown_02038560].quantity -= count;
|
||||
count = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
count -= gBagPockets[pocket].itemSlots[gUnknown_02038560].quantity;
|
||||
gBagPockets[pocket].itemSlots[gUnknown_02038560].quantity = 0;
|
||||
}
|
||||
if (gBagPockets[pocket].itemSlots[gUnknown_02038560].quantity == 0)
|
||||
gBagPockets[pocket].itemSlots[gUnknown_02038560].itemId = 0;
|
||||
if (count == 0)
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
for (i = 0; i < gBagPockets[pocket].capacity; i++)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].itemId == itemId)
|
||||
{
|
||||
if (gBagPockets[pocket].itemSlots[i].quantity >= count)
|
||||
{
|
||||
gBagPockets[pocket].itemSlots[i].quantity -= count;
|
||||
count = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
count -= gBagPockets[pocket].itemSlots[i].quantity;
|
||||
gBagPockets[pocket].itemSlots[i].quantity = 0;
|
||||
}
|
||||
if (gBagPockets[pocket].itemSlots[i].quantity == 0)
|
||||
gBagPockets[pocket].itemSlots[i].itemId = 0;
|
||||
if (count == 0)
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
u8 GetPocketByItemId(u16 itemId)
|
||||
{
|
||||
return ItemId_GetPocket(itemId);
|
||||
}
|
||||
|
||||
void ClearItemSlots(struct ItemSlot *itemSlots, u8 b)
|
||||
{
|
||||
u16 i;
|
||||
|
||||
for (i = 0; i < b; i++)
|
||||
{
|
||||
itemSlots[i].itemId = 0;
|
||||
itemSlots[i].quantity = 0;
|
||||
}
|
||||
}
|
||||
|
||||
static s32 FindFreePCItemSlot(void)
|
||||
{
|
||||
s8 i;
|
||||
|
||||
for (i = 0; i < 50; i++)
|
||||
{
|
||||
if (gSaveBlock1.pcItems[i].itemId == 0)
|
||||
return i;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
u8 CountUsedPCItemSlots(void)
|
||||
{
|
||||
u8 usedSlots = 0;
|
||||
u8 i;
|
||||
|
||||
for (i = 0; i < 50; i++)
|
||||
{
|
||||
if (gSaveBlock1.pcItems[i].itemId != 0)
|
||||
usedSlots++;
|
||||
}
|
||||
return usedSlots;
|
||||
}
|
||||
|
||||
bool8 CheckPCHasItem(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
|
||||
for (i = 0; i < 50; i++)
|
||||
{
|
||||
if (gSaveBlock1.pcItems[i].itemId == itemId && gSaveBlock1.pcItems[i].quantity >= count)
|
||||
return TRUE;
|
||||
}
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
bool8 AddPCItem(u16 itemId, u16 count)
|
||||
{
|
||||
u8 i;
|
||||
s8 freeSlot;
|
||||
struct ItemSlot newItems[50];
|
||||
|
||||
//Copy PC items
|
||||
memcpy(newItems, gSaveBlock1.pcItems, sizeof(newItems));
|
||||
|
||||
//Use any item slots that already contain this item
|
||||
for (i = 0; i < 50; i++)
|
||||
{
|
||||
if (newItems[i].itemId == itemId)
|
||||
{
|
||||
if (newItems[i].quantity + count <= 999)
|
||||
{
|
||||
newItems[i].quantity += count;
|
||||
memcpy(gSaveBlock1.pcItems, newItems, sizeof(gSaveBlock1.pcItems));
|
||||
return TRUE;
|
||||
}
|
||||
count += newItems[i].quantity - 999;
|
||||
newItems[i].quantity = 999;
|
||||
if (count == 0)
|
||||
{
|
||||
memcpy(gSaveBlock1.pcItems, newItems, sizeof(gSaveBlock1.pcItems));
|
||||
return TRUE;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//Put any remaining items into a new item slot.
|
||||
if (count > 0)
|
||||
{
|
||||
freeSlot = FindFreePCItemSlot();
|
||||
if (freeSlot == -1)
|
||||
return FALSE;
|
||||
newItems[freeSlot].itemId = itemId;
|
||||
newItems[freeSlot].quantity = count;
|
||||
}
|
||||
|
||||
//Copy items back to the PC
|
||||
memcpy(gSaveBlock1.pcItems, newItems, sizeof(gSaveBlock1.pcItems));
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
void RemovePCItem(u8 index, u16 count)
|
||||
{
|
||||
gSaveBlock1.pcItems[index].quantity -= count;
|
||||
if (gSaveBlock1.pcItems[index].quantity == 0)
|
||||
{
|
||||
gSaveBlock1.pcItems[index].itemId = 0;
|
||||
CompactPCItems();
|
||||
}
|
||||
}
|
||||
|
||||
static void CompactPCItems(void)
|
||||
{
|
||||
u16 i;
|
||||
u16 j;
|
||||
|
||||
for (i = 0; i < 49; i++)
|
||||
{
|
||||
for (j = i + 1; j <= 49; j++)
|
||||
{
|
||||
if (gSaveBlock1.pcItems[i].itemId == 0)
|
||||
{
|
||||
struct ItemSlot temp = gSaveBlock1.pcItems[i];
|
||||
gSaveBlock1.pcItems[i] = gSaveBlock1.pcItems[j];
|
||||
gSaveBlock1.pcItems[j] = temp;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void SwapRegisteredBike(void)
|
||||
{
|
||||
switch(gSaveBlock1.registeredItem)
|
||||
{
|
||||
case 0x103:
|
||||
gSaveBlock1.registeredItem = 0x110;
|
||||
break;
|
||||
case 0x110:
|
||||
gSaveBlock1.registeredItem = 0x103;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
static u16 SanitizeItemId(u16 itemId)
|
||||
{
|
||||
if (itemId > 0x15C)
|
||||
return 0;
|
||||
else
|
||||
return itemId;
|
||||
}
|
||||
|
||||
struct Item *ItemId_GetItem(u16 itemId)
|
||||
{
|
||||
return &gItems[SanitizeItemId(itemId)];
|
||||
}
|
||||
|
||||
u16 ItemId_GetId(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].itemId;
|
||||
}
|
||||
|
||||
u16 ItemId_GetPrice(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].price;
|
||||
}
|
||||
|
||||
u8 ItemId_GetHoldEffect(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].holdEffect;
|
||||
}
|
||||
|
||||
u8 ItemId_GetHoldEffectParam(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].holdEffectParam;
|
||||
}
|
||||
|
||||
u8 *ItemId_GetDescription(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].description;
|
||||
}
|
||||
|
||||
bool8 ItemId_CopyDescription(u8 *a, u32 itemId, u32 c)
|
||||
{
|
||||
u32 r5 = c + 1;
|
||||
u8 *description = gItems[SanitizeItemId(itemId)].description;
|
||||
u8 *str = a;
|
||||
|
||||
for (;;)
|
||||
{
|
||||
if (*description == 0xFF || *description == 0xFE)
|
||||
{
|
||||
r5--;
|
||||
if (r5 == 0)
|
||||
{
|
||||
*str = 0xFF;
|
||||
return TRUE;
|
||||
}
|
||||
if (*description == 0xFF)
|
||||
return FALSE;
|
||||
str = a;
|
||||
description++;
|
||||
}
|
||||
else
|
||||
*(str++) = *(description++);
|
||||
}
|
||||
}
|
||||
|
||||
u8 ItemId_GetImportance(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].importance;
|
||||
}
|
||||
|
||||
u8 ItemId_GetUnknownValue(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].unk19;
|
||||
}
|
||||
|
||||
u8 ItemId_GetPocket(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].pocket;
|
||||
}
|
||||
|
||||
u8 ItemId_GetType(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].type;
|
||||
}
|
||||
|
||||
ItemUseFunc ItemId_GetFieldFunc(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].fieldUseFunc;
|
||||
}
|
||||
|
||||
u8 ItemId_GetBattleUsage(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].battleUsage;
|
||||
}
|
||||
|
||||
ItemUseFunc ItemId_GetBattleFunc(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].battleUseFunc;
|
||||
}
|
||||
|
||||
u8 ItemId_GetSecondaryId(u16 itemId)
|
||||
{
|
||||
return gItems[SanitizeItemId(itemId)].secondaryId;
|
||||
}
|
Loading…
x
Reference in New Issue
Block a user