implemented 'vav' archives.

This commit is contained in:
morkt 2018-03-11 20:55:24 +04:00
parent 981a2c54cc
commit 5468ef58f7

View File

@ -0,0 +1,209 @@
//! \file ArcVAV.cs
//! \date 2018 Mar 10
//! \brief FrontWing ADV System resource archive.
//
// Copyright (C) 2018 by morkt
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
//
using System;
using System.Collections.Generic;
using System.ComponentModel.Composition;
using System.IO;
namespace GameRes.Formats.FrontWing
{
internal class VavEntry : PackedEntry
{
public int Compression;
}
[Export(typeof(ArchiveFormat))]
public class PakOpener : ArchiveFormat
{
public override string Tag { get { return "PAK/vav"; } }
public override string Description { get { return "FrontWing ADV System resource archive"; } }
public override uint Signature { get { return 0x766176; } } // 'vav'
public override bool IsHierarchic { get { return false; } }
public override bool CanWrite { get { return false; } }
public override ArcFile TryOpen (ArcView file)
{
int version = file.View.ReadInt32 (4);
if (version != 200 && version != 201)
return null;
int count = file.View.ReadInt32 (8);
if (!IsSaneCount (count))
return null;
uint index_offset = file.View.ReadUInt32 (0xC);
var dir = new List<Entry> (count);
for (int i = 0; i < count; ++i)
{
var name = file.View.ReadString (index_offset, 0x20);
var entry = FormatCatalog.Instance.Create<VavEntry> (name);
entry.Size = file.View.ReadUInt32 (index_offset+0x20);
entry.UnpackedSize = file.View.ReadUInt32 (index_offset+0x24);
entry.Offset = file.View.ReadUInt32 (index_offset+0x28);
if (!entry.CheckPlacement (file.MaxOffset))
return null;
entry.Compression = file.View.ReadInt32 (index_offset+0x2C);
entry.IsPacked = (entry.Compression & 0x90) != 0;
dir.Add (entry);
index_offset += 0x38;
}
return new ArcFile (file, this, dir);
}
public override Stream OpenEntry (ArcFile arc, Entry entry)
{
var vent = entry as VavEntry;
if (null == vent)
return base.OpenEntry (arc, entry);
var data = arc.File.View.ReadBytes (entry.Offset, entry.Size);
int data_length = data.Length;
if ((vent.Compression & 0x80) != 0)
{
var output = new byte[vent.UnpackedSize];
data_length = UnpackHuffman (data, data_length, output);
data = output;
}
if ((vent.Compression & 0x10) != 0)
{
var output = new byte[vent.UnpackedSize];
UnpackRle (data, data_length, output);
data = output;
}
DecryptEntry (data, vent.Compression & 0xF);
return new BinMemoryStream (data);
}
void DecryptEntry (byte[] data, int start)
{
if (0 == start)
{
for (int i = 0; i < data.Length; ++i)
data[i] ^= 0x55;
}
else
{
for (int i = start; i < data.Length; ++i)
data[i] ^= data[i-start];
}
}
int UnpackRle (byte[] input, int input_length, byte[] output)
{
int src = 0;
int dst = 0;
while (dst < output.Length)
{
byte rle = input[src++];
int count = Math.Min (rle & 0x7F, output.Length - dst);
if (0 != (rle & 0x80))
{
byte v = input[src++];
while (count --> 0)
output[dst++] = v;
}
else
{
Buffer.BlockCopy (input, src, output, dst, count);
src += count;
dst += count;
}
}
return dst;
}
int UnpackHuffman (byte[] input, int input_length, byte[] output)
{
using (var mem = new MemoryStream (input, 0, input_length))
{
var tree = new HuffmanNode[0x201];
ushort root = BuildHuffmanTree (tree, mem);
using (var bits = new MsbBitStream (mem))
{
int dst = 0;
for (;;)
{
ushort symbol = root;
while (symbol > 0x100)
{
int bit = bits.GetBits (1);
if (-1 == bit)
return dst;
if (bit != 0)
symbol = tree[symbol].RChild;
else
symbol = tree[symbol].LChild;
}
if (0x100 == symbol)
return dst;
output[dst++] = (byte)symbol;
}
}
}
}
internal struct HuffmanNode
{
public int Weight;
public ushort LChild;
public ushort RChild;
}
ushort BuildHuffmanTree (HuffmanNode[] tree, Stream input)
{
for (int i = 0; i < 0x100; ++i)
{
tree[i].Weight = input.ReadByte() ^ 0x55;
}
ushort root = 0x100;
tree[root].Weight = 1;
ushort lhs = 0x200;
ushort rhs = 0x200;
for (;;)
{
int lmin = 0x10000;
int rmin = 0x10000;
for (ushort i = 0; i < 0x201; ++i)
{
int w = tree[i].Weight;
if (w != 0 && w < rmin)
{
rmin = lmin;
lmin = w;
rhs = lhs;
lhs = i;
}
}
if (rmin == 0x10000 || lmin == 0x10000 || lmin == 0 || rmin == 0)
break;
++root;
tree[root].LChild = lhs;
tree[root].RChild = rhs;
tree[root].Weight = rmin + lmin;
tree[lhs].Weight = 0;
tree[rhs].Weight = 0;
}
return root;
}
}
}