Change Apple RLE algorithm for a faster version.

Aaru6.Compression/AppleRle.cs

@@ -31,8 +31,6 @@
 // Copyright © 2018-2019 David Ryskalczyk
 // ****************************************************************************/
 
-using System.IO;
-
 namespace Aaru6.Compression
 {
     /// <summary>Implements the Apple version of RLE</summary>
@@ -40,89 +38,87 @@ namespace Aaru6.Compression
     {
         const uint DART_CHUNK = 20960;
 
-        readonly Stream _inStream;
+        /// <summary>Decodes a buffer compressed with Apple RLE</summary>
-        int             _count;
+        /// <param name="source">Encoded buffer</param>
-        bool            _nextA; // true if A, false if B
+        /// <param name="destination">Buffer where to write the decoded data</param>
-        byte            _repeatedByteA, _repeatedByteB;
+        /// <returns>The number of decoded bytes</returns>
-        bool            _repeatMode; // true if we're repeating, false if we're just copying
+        public static int DecodeBuffer(byte[] source, byte[] destination)
-
-        /// <summary>Initializes a decompressor for the specified stream</summary>
-        /// <param name="stream">Stream containing the compressed data</param>
-        public AppleRle(Stream stream)
         {
-            _inStream = stream;
+            int  count         = 0;
-            Reset();
+            bool nextA         = true; // true if A, false if B
-        }
+            byte repeatedByteA = 0, repeatedByteB = 0;
+            bool repeatMode    = false; // true if we're repeating, false if we're just copying
+            int  inPosition    = 0, outPosition = 0;
 
-        void Reset()
+            while(inPosition  <= source.Length &&
-        {
+                  outPosition <= destination.Length)
-            _repeatedByteA = _repeatedByteB = 0;
-            _count         = 0;
-            _nextA         = true;
-            _repeatMode    = false;
-        }
-
-        /// <summary>Decompresses a byte</summary>
-        /// <returns>Decompressed byte</returns>
-        public int ProduceByte()
-        {
-            if(_repeatMode && _count > 0)
             {
-                _count--;
+                switch(repeatMode)
-
-                if(_nextA)
                 {
-                    _nextA = false;
+                    case true when count > 0:
+                    {
+                        count--;
 
-                    return _repeatedByteA;
+                        if(nextA)
+                        {
+                            nextA = false;
+
+                            destination[outPosition++] = repeatedByteA;
+
+                            continue;
+                        }
+
+                        nextA = true;
+
+                        destination[outPosition++] = repeatedByteB;
+
+                        continue;
+                    }
+                    case false when count > 0:
+                        count--;
+
+                        destination[outPosition++] = source[inPosition++];
+
+                        continue;
                 }
 
-                _nextA = true;
+                if(inPosition == source.Length)
+                    break;
 
-                return _repeatedByteB;
+                while(true)
-            }
-
-            if(!_repeatMode &&
-               _count > 0)
-            {
-                _count--;
-
-                return _inStream.ReadByte();
-            }
-
-            if(_inStream.Position == _inStream.Length)
-                return -1;
-
-            while(true)
-            {
-                byte  b1 = (byte)_inStream.ReadByte();
-                byte  b2 = (byte)_inStream.ReadByte();
-                short s  = (short)((b1 << 8) | b2);
-
-                if(s == 0          ||
-                   s >= DART_CHUNK ||
-                   s <= -DART_CHUNK)
-                    continue;
-
-                if(s < 0)
                 {
-                    _repeatMode    = true;
+                    byte  b1 = source[inPosition++];
-                    _repeatedByteA = (byte)_inStream.ReadByte();
+                    byte  b2 = source[inPosition++];
-                    _repeatedByteB = (byte)_inStream.ReadByte();
+                    short s  = (short)((b1 << 8) | b2);
-                    _count         = (-s * 2) - 1;
-                    _nextA         = false;
 
-                    return _repeatedByteA;
+                    if(s == 0          ||
+                       s >= DART_CHUNK ||
+                       s <= -DART_CHUNK)
+                        continue;
+
+                    if(s < 0)
+                    {
+                        repeatMode    = true;
+                        repeatedByteA = source[inPosition++];
+                        repeatedByteB = source[inPosition++];
+                        count         = (-s * 2) - 1;
+                        nextA         = false;
+
+                        destination[outPosition++] = repeatedByteA;
+
+                        break;
+                    }
+
+                    repeatMode = false;
+                    count      = (s * 2) - 1;
+
+                    destination[outPosition++] = source[inPosition++];
+
+                    break;
                 }
-
-                if(s <= 0)
-                    continue;
-
-                _repeatMode = false;
-                _count      = (s * 2) - 1;
-
-                return _inStream.ReadByte();
             }
+
+            return outPosition;
         }
     }
 }

AaruBenchmark/Benchs.cs

@@ -12,7 +12,7 @@ namespace AaruBenchmark
         public void Aaru() => Compression.Aaru.AppleRle();
 
         [Benchmark]
-        public void Aaru6() => Compression.Aaru6.AppleRle();
+        public void Aaru6() => Aaru6Compressions.AppleRle();
     }
 
     [SimpleJob(RuntimeMoniker.Net60)]
@@ -22,7 +22,7 @@ namespace AaruBenchmark
         public void Aaru() => Compression.Aaru.TeleDiskLzh();
 
         [Benchmark]
-        public void Aaru6() => Compression.Aaru6.TeleDiskLzh();
+        public void Aaru6() => Aaru6Compressions.TeleDiskLzh();
     }
 
     [SimpleJob(RuntimeMoniker.Net60)]

AaruBenchmark/Compression/Aaru6Compressions.cs

@@ -4,11 +4,11 @@ using Aaru6.Compression;
 
 namespace AaruBenchmark.Compression
 {
-    public class Aaru6
+    public class Aaru6Compressions
     {
         public static void AppleRle()
         {
-            const int bufferSize = 20960;
+            const int bufferSize = 32768;
             byte[]    input      = new byte[1102];
 
             var fs = new FileStream(Path.Combine(Program.Folder, "apple_rle.bin"), FileMode.Open, FileAccess.Read);
@@ -19,12 +19,12 @@ namespace AaruBenchmark.Compression
 
             byte[] output = new byte[bufferSize];
 
-            var rle = new AppleRle(new MemoryStream(input));
+            int realSize = Aaru6.Compression.AppleRle.DecodeBuffer(input, output);
 
-            for(int i = 0; i < bufferSize; i++)
+            if(realSize != 20960)
-                output[i] = (byte)rle.ProduceByte();
+                throw new InvalidDataException("Incorrect decompressed size");
 
-            string crc = Crc32Context.Data(output, out _);
+            string crc = Crc32Context.Data(output, (uint)realSize, out _);
 
             if(crc != "3525ef06")
                 throw new InvalidDataException("Incorrect decompressed checksum");