diff --git a/ArcFormats/ArcFormats.csproj b/ArcFormats/ArcFormats.csproj
index 2a28fc93..e294ef7a 100644
--- a/ArcFormats/ArcFormats.csproj
+++ b/ArcFormats/ArcFormats.csproj
@@ -256,6 +256,7 @@
+
diff --git a/ArcFormats/Leaf/ArcLAC.cs b/ArcFormats/Leaf/ArcLAC.cs
index 11447701..a7a5257b 100644
--- a/ArcFormats/Leaf/ArcLAC.cs
+++ b/ArcFormats/Leaf/ArcLAC.cs
@@ -23,9 +23,12 @@
// IN THE SOFTWARE.
//
+using System;
using System.Collections.Generic;
using System.ComponentModel.Composition;
using System.IO;
+using System.Linq;
+using System.Text;
using GameRes.Compression;
namespace GameRes.Formats.Leaf
@@ -86,7 +89,7 @@ public class PakOpener : ArchiveFormat
public override string Description { get { return "Leaf resource archive"; } }
public override uint Signature { get { return 0x43414C; } } // 'LAC'
public override bool IsHierarchic { get { return false; } }
- public override bool CanWrite { get { return false; } }
+ public override bool CanWrite { get { return true; } }
public PakOpener ()
{
@@ -148,5 +151,102 @@ public override Stream OpenEntry (ArcFile arc, Entry entry)
Stream input = arc.File.CreateStream (entry.Offset, entry.Size);
return new LzssStream (input);
}
+
+ // --- REPACK IMPLEMENTATION ---
+ // Note: This implementation was made for the Leaf game "Kimi ga Yobu, Megiddo no Oka de".
+ // Other games may or may not be supported.
+
+ public override void Create (Stream output, IEnumerable entries, ResourceOptions options, EntryCallback callback)
+ {
+ // Order entries using the same order as the original PAK/LAC archive.
+ entries = entries.OrderBy (x => x.Name.ToLowerAscii(), StringComparer.Ordinal).ToList();
+
+ int count = entries.Count();
+ using (var writer = new BinaryWriter (output, Encoding.ASCII, true))
+ {
+ // Write Header (LAC)
+ writer.Write (Signature);
+ writer.Write (count);
+
+ long tableOffset = 8;
+ long dataOffset = tableOffset + (count * 0x28);
+
+ writer.BaseStream.Position = dataOffset;
+
+ var entryInfos = new List();
+ int i = 0;
+
+ foreach (var entry in entries)
+ {
+ if (callback != null)
+ callback (i + 1, entry, null);
+
+ long currentOffset = writer.BaseStream.Position;
+
+ using (var input = File.OpenRead(entry.Name))
+ {
+ byte[] rawData = new byte[input.Length];
+ input.Read (rawData, 0, (int)input.Length);
+
+ // Compress
+ byte[] compressedData = LeafLzss.Compress (rawData, 0);
+
+ uint totalSize;
+ bool isPacked;
+
+ // Write Data
+ if (rawData.Length > 32 // Skip small uncompressed data that should not be compressed.
+ && compressedData.Length < rawData.Length)
+ {
+ isPacked = true;
+ totalSize = (uint)(compressedData.Length + 4);
+ writer.Write ((uint)rawData.Length);
+ writer.Write (compressedData);
+ }
+ else
+ {
+ isPacked = false;
+ totalSize = (uint)rawData.Length;
+ writer.Write (rawData);
+ }
+
+ entryInfos.Add (new EntryInfo
+ {
+ Name = Path.GetFileName (entry.Name),
+ Offset = (uint)currentOffset,
+ Size = totalSize,
+ IsPacked = isPacked
+ });
+ }
+ i++;
+ }
+
+ // Write File Table
+ writer.BaseStream.Position = tableOffset;
+ foreach (var info in entryInfos)
+ {
+ byte[] nameBuf = new byte[0x20];
+
+ byte[] nameBytes = Encodings.cp932.GetBytes (info.Name);
+ int len = Math.Min (nameBytes.Length, 0x1F);
+ for (int j = 0; j < len; ++j)
+ nameBuf[j] = (byte)(nameBytes[j] ^ 0xFF);
+ if (info.IsPacked)
+ nameBuf[0x1F] = 1;
+
+ writer.Write (nameBuf);
+ writer.Write (info.Size);
+ writer.Write (info.Offset);
+ }
+ }
+ }
+
+ struct EntryInfo
+ {
+ public string Name;
+ public uint Offset;
+ public uint Size;
+ public bool IsPacked;
+ }
}
}
diff --git a/ArcFormats/Leaf/ArcPAK.cs b/ArcFormats/Leaf/ArcPAK.cs
index 2ca92fa4..893bcf5d 100644
--- a/ArcFormats/Leaf/ArcPAK.cs
+++ b/ArcFormats/Leaf/ArcPAK.cs
@@ -199,7 +199,7 @@ public override void Create (Stream output, IEnumerable entries, Resource
input.Read (rawData, 0, (int)input.Length);
// Compress
- byte[] compressedData = LeafLzss.Compress (rawData);
+ byte[] compressedData = LeafLzss.Compress (rawData, 0x20);
// Write Data (Prefix + LZSS)
writer.Write ((uint)compressedData.Length);
@@ -313,168 +313,4 @@ internal struct EntryDefV2 : IEntryDefinition
public bool IsPacked { get { return _is_packed != 0; } }
}
#pragma warning restore 649,169
-
- // --- LEAF LZSS COMPRESSION ---
- internal static class LeafLzss
- {
- const int N = 4096;
- const int F = 18;
- const int THR = 2;
- const int NIL = N;
-
- public static byte[] Compress (byte[] input)
- {
- if (input.Length == 0) return new byte[0];
-
- using (var outStream = new MemoryStream (input.Length))
- {
- // Arrays size = N + 257 to handle Root Nodes (N+1..N+256) safely
- int[] lson = new int[N + 257];
- int[] rson = new int[N + 257];
- int[] dad = new int[N + 257];
- byte[] text_buf = new byte[N + F - 1];
-
- for (int j = N + 1; j <= N + 256; j++) rson[j] = NIL;
- for (int j = 0; j < N; j++) dad[j] = NIL;
-
- int match_position = 0, match_length = 0;
-
- void InsertNode (int r_node)
- {
- int i, p, cmp;
- int key_pos = r_node;
-
- // Root for this character
- p = N + 1 + text_buf[key_pos];
-
- rson[r_node] = lson[r_node] = NIL;
- match_length = 0;
-
- cmp = 1; // Initial state
-
- for (; ; )
- {
- if (cmp >= 0)
- {
- if (rson[p] != NIL) p = rson[p];
- else { rson[p] = r_node; dad[r_node] = p; return; }
- }
- else
- {
- if (lson[p] != NIL) p = lson[p];
- else { lson[p] = r_node; dad[r_node] = p; return; }
- }
-
- // Compare bytes only after finding a valid child node 'p' (buffer index)
- for (i = 1; i < F; i++)
- if ((cmp = text_buf[key_pos + i] - text_buf[p + i]) != 0) break;
-
- if (i > match_length)
- {
- match_position = p;
- match_length = i;
- if (match_length >= F) break;
- }
- }
-
- // Replace node logic
- dad[r_node] = dad[p]; lson[r_node] = lson[p]; rson[r_node] = rson[p];
- dad[lson[p]] = r_node; dad[rson[p]] = r_node;
- if (rson[dad[p]] == p) rson[dad[p]] = r_node;
- else lson[dad[p]] = r_node;
- dad[p] = NIL;
- }
-
- void DeleteNode (int p)
- {
- int q;
- if (dad[p] == NIL) return;
- if (rson[p] == NIL) q = lson[p];
- else if (lson[p] == NIL) q = rson[p];
- else
- {
- q = lson[p];
- if (rson[q] != NIL)
- {
- do { q = rson[q]; } while (rson[q] != NIL);
- rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q];
- lson[q] = lson[p]; dad[lson[p]] = q;
- }
- rson[q] = rson[p]; dad[rson[p]] = q;
- }
- dad[q] = dad[p];
- if (rson[dad[p]] == p) rson[dad[p]] = q;
- else lson[dad[p]] = q;
- dad[p] = NIL;
- }
-
- int code_buf_ptr = 1;
- byte[] code_buf = new byte[17];
- byte mask = 1;
- int s = 0, r = N - F;
- int len = 0;
-
- for (int j = 0; j < r; j++) text_buf[j] = 0x20;
-
- int bytes_read = 0;
- for (len = 0; len < F && bytes_read < input.Length; len++)
- text_buf[r + len] = input[bytes_read++];
-
- if (len == 0) return new byte[0];
-
- for (int j = 1; j <= F; j++) InsertNode (r - j);
- InsertNode (r);
-
- do
- {
- if (match_length > len) match_length = len;
- if (match_length <= THR)
- {
- match_length = 1;
- code_buf[0] |= mask;
- code_buf[code_buf_ptr++] = text_buf[r];
- }
- else
- {
- code_buf[code_buf_ptr++] = (byte)(match_position & 0xFF);
- code_buf[code_buf_ptr++] = (byte)(((match_position >> 4) & 0xF0) | (match_length - (THR + 1)));
- }
-
- if ((mask <<= 1) == 0)
- {
- outStream.Write (code_buf, 0, code_buf_ptr);
- code_buf[0] = 0; code_buf_ptr = 1; mask = 1;
- }
-
- int last_match_length = match_length;
-
- int i;
- for (i = 0; i < last_match_length && bytes_read < input.Length; i++)
- {
- DeleteNode (s);
- byte c = input[bytes_read++];
- text_buf[s] = c;
- if (s < F - 1) text_buf[s + N] = c;
- s = (s + 1) & (N - 1);
- r = (r + 1) & (N - 1);
- InsertNode (r);
- }
-
- while (bytes_read == input.Length && i++ < last_match_length)
- {
- DeleteNode (s);
- s = (s + 1) & (N - 1);
- r = (r + 1) & (N - 1);
- if (--len != 0) InsertNode (r);
- }
-
- } while (len > 0);
-
- if (code_buf_ptr > 1)
- outStream.Write (code_buf, 0, code_buf_ptr);
-
- return outStream.ToArray();
- }
- }
- }
}
\ No newline at end of file
diff --git a/ArcFormats/Leaf/LeafCompression.cs b/ArcFormats/Leaf/LeafCompression.cs
new file mode 100644
index 00000000..7c2e4cab
--- /dev/null
+++ b/ArcFormats/Leaf/LeafCompression.cs
@@ -0,0 +1,193 @@
+//! \file LeafCompression.cs
+//! \date 2026 Jul 25
+//! \brief Leaf LZSS compression implementation (by gopicolo).
+//
+// Copyright (C) 2018-2019 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.IO;
+
+namespace GameRes.Formats.Leaf
+{
+ // --- LEAF LZSS COMPRESSION ---
+ internal static class LeafLzss
+ {
+ const int N = 4096;
+ const int F = 18;
+ const int THR = 2;
+ const int NIL = N;
+
+ public static byte[] Compress (byte[] input, byte frameFill)
+ {
+ if (input.Length == 0) return new byte[0];
+
+ using (var outStream = new MemoryStream (input.Length))
+ {
+ // Arrays size = N + 257 to handle Root Nodes (N+1..N+256) safely
+ int[] lson = new int[N + 257];
+ int[] rson = new int[N + 257];
+ int[] dad = new int[N + 257];
+ byte[] text_buf = new byte[N + F - 1];
+
+ for (int j = N + 1; j <= N + 256; j++) rson[j] = NIL;
+ for (int j = 0; j < N; j++) dad[j] = NIL;
+
+ int match_position = 0, match_length = 0;
+
+ void InsertNode (int r_node)
+ {
+ int i, p, cmp;
+ int key_pos = r_node;
+
+ // Root for this character
+ p = N + 1 + text_buf[key_pos];
+
+ rson[r_node] = lson[r_node] = NIL;
+ match_length = 0;
+
+ cmp = 1; // Initial state
+
+ for (; ; )
+ {
+ if (cmp >= 0)
+ {
+ if (rson[p] != NIL) p = rson[p];
+ else { rson[p] = r_node; dad[r_node] = p; return; }
+ }
+ else
+ {
+ if (lson[p] != NIL) p = lson[p];
+ else { lson[p] = r_node; dad[r_node] = p; return; }
+ }
+
+ // Compare bytes only after finding a valid child node 'p' (buffer index)
+ for (i = 1; i < F; i++)
+ if ((cmp = text_buf[key_pos + i] - text_buf[p + i]) != 0) break;
+
+ if (i > match_length)
+ {
+ match_position = p;
+ match_length = i;
+ if (match_length >= F) break;
+ }
+ }
+
+ // Replace node logic
+ dad[r_node] = dad[p]; lson[r_node] = lson[p]; rson[r_node] = rson[p];
+ dad[lson[p]] = r_node; dad[rson[p]] = r_node;
+ if (rson[dad[p]] == p) rson[dad[p]] = r_node;
+ else lson[dad[p]] = r_node;
+ dad[p] = NIL;
+ }
+
+ void DeleteNode (int p)
+ {
+ int q;
+ if (dad[p] == NIL) return;
+ if (rson[p] == NIL) q = lson[p];
+ else if (lson[p] == NIL) q = rson[p];
+ else
+ {
+ q = lson[p];
+ if (rson[q] != NIL)
+ {
+ do { q = rson[q]; } while (rson[q] != NIL);
+ rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q];
+ lson[q] = lson[p]; dad[lson[p]] = q;
+ }
+ rson[q] = rson[p]; dad[rson[p]] = q;
+ }
+ dad[q] = dad[p];
+ if (rson[dad[p]] == p) rson[dad[p]] = q;
+ else lson[dad[p]] = q;
+ dad[p] = NIL;
+ }
+
+ int code_buf_ptr = 1;
+ byte[] code_buf = new byte[17];
+ byte mask = 1;
+ int s = 0, r = N - F;
+ int len = 0;
+
+ for (int j = 0; j < r; j++) text_buf[j] = frameFill;
+
+ int bytes_read = 0;
+ for (len = 0; len < F && bytes_read < input.Length; len++)
+ text_buf[r + len] = input[bytes_read++];
+
+ if (len == 0) return new byte[0];
+
+ for (int j = 1; j <= F; j++) InsertNode (r - j);
+ InsertNode (r);
+
+ do
+ {
+ if (match_length > len) match_length = len;
+ if (match_length <= THR)
+ {
+ match_length = 1;
+ code_buf[0] |= mask;
+ code_buf[code_buf_ptr++] = text_buf[r];
+ }
+ else
+ {
+ code_buf[code_buf_ptr++] = (byte)(match_position & 0xFF);
+ code_buf[code_buf_ptr++] = (byte)(((match_position >> 4) & 0xF0) | (match_length - (THR + 1)));
+ }
+
+ if ((mask <<= 1) == 0)
+ {
+ outStream.Write (code_buf, 0, code_buf_ptr);
+ code_buf[0] = 0; code_buf_ptr = 1; mask = 1;
+ }
+
+ int last_match_length = match_length;
+
+ int i;
+ for (i = 0; i < last_match_length && bytes_read < input.Length; i++)
+ {
+ DeleteNode (s);
+ byte c = input[bytes_read++];
+ text_buf[s] = c;
+ if (s < F - 1) text_buf[s + N] = c;
+ s = (s + 1) & (N - 1);
+ r = (r + 1) & (N - 1);
+ InsertNode (r);
+ }
+
+ while (bytes_read == input.Length && i++ < last_match_length)
+ {
+ DeleteNode (s);
+ s = (s + 1) & (N - 1);
+ r = (r + 1) & (N - 1);
+ if (--len != 0) InsertNode (r);
+ }
+
+ } while (len > 0);
+
+ if (code_buf_ptr > 1)
+ outStream.Write (code_buf, 0, code_buf_ptr);
+
+ return outStream.ToArray();
+ }
+ }
+ }
+}