mirror of https://github.com/AxioDL/metaforce.git
67 lines
1.6 KiB
C++
67 lines
1.6 KiB
C++
#include "PAK.hpp"
|
|
|
|
namespace Retro
|
|
{
|
|
namespace DNAMP1
|
|
{
|
|
|
|
void PAK::read(Athena::io::IStreamReader& reader)
|
|
{
|
|
reader.setEndian(Athena::BigEndian);
|
|
atUint32 version = reader.readUint32();
|
|
if (version != 0x00030005)
|
|
LogModule.report(LogVisor::FatalError, "unexpected PAK magic");
|
|
reader.readUint32();
|
|
|
|
atUint32 nameCount = reader.readUint32();
|
|
m_nameEntries.clear();
|
|
m_nameEntries.reserve(nameCount);
|
|
for (atUint32 n=0 ; n<nameCount ; ++n)
|
|
{
|
|
m_nameEntries.emplace_back();
|
|
m_nameEntries.back().read(reader);
|
|
}
|
|
|
|
atUint32 count = reader.readUint32();
|
|
m_entries.clear();
|
|
m_entries.reserve(count);
|
|
m_idMap.clear();
|
|
m_idMap.reserve(count);
|
|
for (atUint32 e=0 ; e<count ; ++e)
|
|
{
|
|
m_entries.emplace_back();
|
|
m_entries.back().read(reader);
|
|
m_idMap[m_entries.back().id] = &m_entries.back();
|
|
}
|
|
|
|
m_nameMap.clear();
|
|
m_nameMap.reserve(nameCount);
|
|
for (NameEntry& entry : m_nameEntries)
|
|
{
|
|
std::unordered_map<UniqueID32, Entry*>::iterator found = m_idMap.find(entry.id);
|
|
if (found != m_idMap.end())
|
|
m_nameMap[entry.name] = found->second;
|
|
}
|
|
}
|
|
|
|
void PAK::write(Athena::io::IStreamWriter& writer) const
|
|
{
|
|
writer.setEndian(Athena::BigEndian);
|
|
writer.writeUint32(0x00030005);
|
|
writer.writeUint32(0);
|
|
|
|
writer.writeUint32(m_nameEntries.size());
|
|
for (const NameEntry& entry : m_nameEntries)
|
|
{
|
|
((NameEntry&)entry).nameLen = entry.name.size();
|
|
entry.write(writer);
|
|
}
|
|
|
|
writer.writeUint32(m_entries.size());
|
|
for (const Entry& entry : m_entries)
|
|
entry.write(writer);
|
|
}
|
|
|
|
}
|
|
}
|