metaforce/DataSpec/DNAMP1/PAK.cpp

138 lines
3.6 KiB
C++
Raw Normal View History

2015-07-14 00:38:48 +00:00
#include <zlib.h>
#include <lzo/lzo1x.h>
2015-07-16 01:57:34 +00:00
#include "DNAMP1.hpp"
2015-07-06 02:07:57 +00:00
#include "PAK.hpp"
2015-07-10 05:28:08 +00:00
namespace Retro
2015-07-06 02:07:57 +00:00
{
2015-07-10 05:28:08 +00:00
namespace DNAMP1
2015-07-06 02:07:57 +00:00
{
2015-07-10 05:28:08 +00:00
void PAK::read(Athena::io::IStreamReader& reader)
2015-07-06 02:07:57 +00:00
{
2015-07-10 05:28:08 +00:00
reader.setEndian(Athena::BigEndian);
atUint32 version = reader.readUint32();
if (version != 0x00030005)
2015-07-16 01:57:34 +00:00
Log.report(LogVisor::FatalError, "unexpected PAK magic");
2015-07-10 05:28:08 +00:00
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();
Entry& ent = m_entries.back();
ent.read(reader);
if (ent.compressed && m_useLzo)
ent.compressed = 2;
2015-07-10 05:28:08 +00:00
}
2015-07-12 04:26:26 +00:00
for (Entry& entry : m_entries)
m_idMap[entry.id] = &entry;
2015-07-12 04:26:26 +00:00
2015-07-10 05:28:08 +00:00
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;
}
2015-07-06 02:07:57 +00:00
}
2015-07-10 05:28:08 +00:00
void PAK::write(Athena::io::IStreamWriter& writer) const
2015-07-06 02:07:57 +00:00
{
2015-07-10 05:28:08 +00:00
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 tmp = entry;
if (tmp.compressed)
tmp.compressed = 1;
tmp.write(writer);
}
2015-07-06 02:07:57 +00:00
}
std::unique_ptr<atUint8[]>
PAK::Entry::getBuffer(const NOD::DiscBase::IPartition::Node& pak, atUint64& szOut) const
2015-07-14 00:38:48 +00:00
{
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)
2015-07-14 00:38:48 +00:00
{
atUint32 compRem = size - 4;
z_stream zs = {};
2015-07-14 00:38:48 +00:00
inflateInit(&zs);
zs.avail_out = decompSz;
zs.next_out = buf;
while (zs.avail_out)
{
atUint64 readSz = strm->read(compBuf, MIN(compRem, 0x8000));
2015-07-14 00:38:48 +00:00
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);
}
}
2015-07-10 05:28:08 +00:00
}
}