metaforce/DataSpec/DNAMP3/PAK.hpp

93 lines
2.3 KiB
C++
Raw Normal View History

2015-07-06 01:33:06 +00:00
#ifndef __DNAMP3_PAK_HPP__
#define __DNAMP3_PAK_HPP__
#include <unordered_map>
2015-07-14 00:38:48 +00:00
#include <lzo/lzo1x.h>
#include <NOD/DiscBase.hpp>
2015-07-06 01:33:06 +00:00
#include "../DNACommon/DNACommon.hpp"
namespace Retro
{
namespace DNAMP3
{
2015-07-14 00:38:48 +00:00
extern const HECL::FourCC CMPD;
struct PAK : BigDNA
2015-07-06 01:33:06 +00:00
{
2015-07-07 03:22:44 +00:00
struct Header : BigDNA
2015-07-06 01:33:06 +00:00
{
2015-07-06 02:07:57 +00:00
DECL_DNA
2015-07-06 01:33:06 +00:00
Value<atUint32> version;
Value<atUint32> headSz;
Value<atUint8> md5sum[16];
Seek<40, Athena::Current> seek;
} m_header;
2015-07-07 03:22:44 +00:00
struct NameEntry : BigDNA
2015-07-06 01:33:06 +00:00
{
2015-07-06 02:07:57 +00:00
DECL_DNA
2015-07-06 01:33:06 +00:00
String<-1> name;
2015-07-11 22:41:10 +00:00
FourCC type;
2015-07-06 01:33:06 +00:00
UniqueID64 id;
};
2015-07-07 03:22:44 +00:00
struct Entry : BigDNA
2015-07-06 01:33:06 +00:00
{
2015-07-06 02:07:57 +00:00
DECL_DNA
Value<atUint32> compressed;
FourCC type;
2015-07-06 01:33:06 +00:00
UniqueID64 id;
2015-07-06 02:07:57 +00:00
Value<atUint32> size;
Value<atUint32> offset;
2015-07-14 00:38:48 +00:00
std::unique_ptr<atUint8[]> getBuffer(const NOD::DiscBase::IPartition::Node& pak, atUint64& szOut) const;
inline PAKEntryReadStream beginReadStream(const NOD::DiscBase::IPartition::Node& pak, atUint64 off=0) const
{
atUint64 sz;
std::unique_ptr<atUint8[]> buf = getBuffer(pak, sz);
return PAKEntryReadStream(std::move(buf), sz, off);
2015-07-14 00:38:48 +00:00
}
2015-07-06 01:33:06 +00:00
};
std::vector<NameEntry> m_nameEntries;
std::vector<Entry> m_entries;
std::unordered_map<UniqueID64, Entry*> m_idMap;
std::unordered_map<std::string, Entry*> m_nameMap;
2015-07-10 05:28:08 +00:00
DECL_EXPLICIT_DNA
2015-07-06 01:33:06 +00:00
inline const Entry* lookupEntry(const UniqueID64& id) const
{
2015-07-06 02:07:57 +00:00
std::unordered_map<UniqueID64, Entry*>::const_iterator result = m_idMap.find(id);
2015-07-06 01:33:06 +00:00
if (result != m_idMap.end())
2015-07-06 02:07:57 +00:00
return result->second;
2015-07-06 01:33:06 +00:00
return nullptr;
}
inline const Entry* lookupEntry(const std::string& name) const
{
2015-07-06 02:07:57 +00:00
std::unordered_map<std::string, Entry*>::const_iterator result = m_nameMap.find(name);
2015-07-06 01:33:06 +00:00
if (result != m_nameMap.end())
2015-07-06 02:07:57 +00:00
return result->second;
2015-07-06 01:33:06 +00:00
return nullptr;
}
2015-07-17 00:01:05 +00:00
inline std::string bestEntryName(const Entry& entry) const
{
/* Prefer named entries first */
for (const NameEntry& nentry : m_nameEntries)
if (nentry.id == entry.id)
return nentry.name;
/* Otherwise return ID format string */
return entry.type.toString() + '_' + entry.id.toString();
2015-07-17 00:01:05 +00:00
}
2015-07-06 01:33:06 +00:00
};
}
}
#endif // __DNAMP3_PAK_HPP__