mirror of https://github.com/AxioDL/metaforce.git
158 lines
3.9 KiB
C++
158 lines
3.9 KiB
C++
#include <zlib.h>
|
|
#include <lzo/lzo1x.h>
|
|
#include "DNAMP1.hpp"
|
|
#include "PAK.hpp"
|
|
|
|
namespace Retro
|
|
{
|
|
namespace DNAMP1
|
|
{
|
|
|
|
void PAK::read(Athena::io::IStreamReader& reader)
|
|
{
|
|
atUint32 version = reader.readUint32Big();
|
|
if (version != 0x00030005)
|
|
Log.report(LogVisor::FatalError, "unexpected PAK magic");
|
|
reader.readUint32Big();
|
|
|
|
atUint32 nameCount = reader.readUint32Big();
|
|
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.readUint32Big();
|
|
m_entries.clear();
|
|
m_entries.reserve(count);
|
|
m_firstEntries.clear();
|
|
m_firstEntries.reserve(count);
|
|
m_idMap.clear();
|
|
m_idMap.reserve(count);
|
|
for (atUint32 e=0 ; e<count ; ++e)
|
|
{
|
|
m_entries.emplace_back();
|
|
Entry& ent = m_entries.back();
|
|
ent.read(reader);
|
|
if (ent.compressed && m_useLzo)
|
|
ent.compressed = 2;
|
|
}
|
|
for (Entry& entry : m_entries)
|
|
{
|
|
auto search = m_idMap.find(entry.id);
|
|
if (search == m_idMap.end())
|
|
{
|
|
m_firstEntries.push_back(&entry);
|
|
m_idMap[entry.id] = &entry;
|
|
}
|
|
}
|
|
|
|
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.writeUint32Big(0x00030005);
|
|
writer.writeUint32Big(0);
|
|
|
|
writer.writeUint32Big((atUint32)m_nameEntries.size());
|
|
for (const NameEntry& entry : m_nameEntries)
|
|
{
|
|
NameEntry copy = entry;
|
|
copy.nameLen = copy.name.size();
|
|
copy.write(writer);
|
|
}
|
|
|
|
writer.writeUint32Big(m_entries.size());
|
|
for (const Entry& entry : m_entries)
|
|
{
|
|
Entry tmp = entry;
|
|
if (tmp.compressed)
|
|
tmp.compressed = 1;
|
|
tmp.write(writer);
|
|
}
|
|
}
|
|
|
|
size_t PAK::binarySize(size_t __isz) const
|
|
{
|
|
__isz += 12;
|
|
|
|
for (const NameEntry& entry : m_nameEntries)
|
|
__isz += 12 + entry.name.size();
|
|
|
|
__isz += m_entries.size() * 20 + 4;
|
|
|
|
return __isz;
|
|
}
|
|
|
|
std::unique_ptr<atUint8[]>
|
|
PAK::Entry::getBuffer(const NOD::Node& pak, atUint64& szOut) const
|
|
{
|
|
if (compressed)
|
|
{
|
|
std::unique_ptr<NOD::IPartReadStream> strm = pak.beginReadStream(offset);
|
|
|
|
atUint32 decompSz;
|
|
strm->read(&decompSz, 4);
|
|
decompSz = HECL::SBig(decompSz);
|
|
atUint8* buf = new atUint8[decompSz];
|
|
atUint8* bufCur = buf;
|
|
|
|
atUint8 compBuf[0x8000];
|
|
if (compressed == 1)
|
|
{
|
|
atUint32 compRem = size - 4;
|
|
z_stream zs = {};
|
|
inflateInit(&zs);
|
|
zs.avail_out = decompSz;
|
|
zs.next_out = buf;
|
|
while (zs.avail_out)
|
|
{
|
|
atUint64 readSz = strm->read(compBuf, std::min(compRem, atUint32(0x8000)));
|
|
compRem -= readSz;
|
|
zs.avail_in = readSz;
|
|
zs.next_in = compBuf;
|
|
inflate(&zs, Z_FINISH);
|
|
}
|
|
inflateEnd(&zs);
|
|
}
|
|
else
|
|
{
|
|
atUint32 rem = decompSz;
|
|
while (rem)
|
|
{
|
|
atUint16 chunkSz;
|
|
strm->read(&chunkSz, 2);
|
|
chunkSz = HECL::SBig(chunkSz);
|
|
strm->read(compBuf, chunkSz);
|
|
lzo_uint dsz = rem;
|
|
lzo1x_decompress(compBuf, chunkSz, bufCur, &dsz, nullptr);
|
|
bufCur += dsz;
|
|
rem -= dsz;
|
|
}
|
|
}
|
|
|
|
szOut = decompSz;
|
|
return std::unique_ptr<atUint8[]>(buf);
|
|
}
|
|
else
|
|
{
|
|
atUint8* buf = new atUint8[size];
|
|
pak.beginReadStream(offset)->read(buf, size);
|
|
szOut = size;
|
|
return std::unique_ptr<atUint8[]>(buf);
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|