diff --git a/Makefile b/Makefile
index 0418e292da..ebe3b6244a 100644
--- a/Makefile
+++ b/Makefile
@@ -5,41 +5,41 @@ PROGRAMS =fileformats gl game ra cnc aftermath server seqed
COMMON_LIBS = System.dll System.Core.dll System.Drawing.dll System.Xml.dll
-fileformats_SRCS = $(shell find OpenRa.FileFormats/ -iname '*.cs')
-fileformats_TARGET = OpenRa.FileFormats.dll
+fileformats_SRCS = $(shell find OpenRA.FileFormats/ -iname '*.cs')
+fileformats_TARGET = OpenRA.FileFormats.dll
fileformats_KIND = library
fileformats_LIBS = $(COMMON_LIBS) thirdparty/Tao/Tao.Sdl.dll
-gl_SRCS = $(shell find OpenRa.Gl/ -iname '*.cs')
-gl_TARGET = OpenRa.Gl.dll
+gl_SRCS = $(shell find OpenRA.Gl/ -iname '*.cs')
+gl_TARGET = OpenRA.Gl.dll
gl_KIND = library
gl_DEPS = $(fileformats_TARGET) $(game_TARGET)
gl_LIBS = $(COMMON_LIBS) System.Windows.Forms.dll \
thirdparty/Tao/Tao.Cg.dll thirdparty/Tao/Tao.OpenGl.dll thirdparty/Tao/Tao.Sdl.dll \
$(gl_DEPS) $(game_TARGET)
-game_SRCS = $(shell find OpenRa.Game/ -iname '*.cs')
-game_TARGET = OpenRa.Game.exe
+game_SRCS = $(shell find OpenRA.Game/ -iname '*.cs')
+game_TARGET = OpenRA.Game.exe
game_KIND = winexe
game_DEPS = $(fileformats_TARGET)
game_LIBS = $(COMMON_LIBS) System.Windows.Forms.dll $(game_DEPS) \
thirdparty/Tao/Tao.OpenAl.dll thirdparty/Tao/Tao.FreeType.dll
-game_FLAGS = -win32icon:OpenRa.Game/OpenRa.ico
+game_FLAGS = -win32icon:OpenRA.Game/OpenRA.ico
-ra_SRCS = $(shell find OpenRa.Mods.RA/ -iname '*.cs')
-ra_TARGET = mods/ra/OpenRa.Mods.RA.dll
+ra_SRCS = $(shell find OpenRA.Mods.RA/ -iname '*.cs')
+ra_TARGET = mods/ra/OpenRA.Mods.RA.dll
ra_KIND = library
ra_DEPS = $(fileformats_TARGET) $(game_TARGET)
ra_LIBS = $(COMMON_LIBS) $(ra_DEPS)
-cnc_SRCS = $(shell find OpenRa.Mods.Cnc/ -iname '*.cs')
-cnc_TARGET = mods/cnc/OpenRa.Mods.Cnc.dll
+cnc_SRCS = $(shell find OpenRA.Mods.Cnc/ -iname '*.cs')
+cnc_TARGET = mods/cnc/OpenRA.Mods.Cnc.dll
cnc_KIND = library
cnc_DEPS = $(fileformats_TARGET) $(game_TARGET)
cnc_LIBS = $(COMMON_LIBS) $(cnc_DEPS)
-aftermath_SRCS = $(shell find OpenRa.Mods.Aftermath/ -iname '*.cs')
-aftermath_TARGET = mods/aftermath/OpenRa.Mods.Aftermath.dll
+aftermath_SRCS = $(shell find OpenRA.Mods.Aftermath/ -iname '*.cs')
+aftermath_TARGET = mods/aftermath/OpenRA.Mods.Aftermath.dll
aftermath_KIND = library
aftermath_DEPS = $(fileformats_TARGET) $(game_TARGET)
aftermath_LIBS = $(COMMON_LIBS) $(aftermath_DEPS)
diff --git a/OpenRA.FileFormats/AudLoader.cs b/OpenRA.FileFormats/AudLoader.cs
new file mode 100644
index 0000000000..9bc8c84d10
--- /dev/null
+++ b/OpenRA.FileFormats/AudLoader.cs
@@ -0,0 +1,125 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.IO;
+
+namespace OpenRA.FileFormats
+{
+ [Flags]
+ enum SoundFlags
+ {
+ Stereo = 0x1,
+ _16Bit = 0x2,
+ }
+
+ enum SoundFormat
+ {
+ WestwoodCompressed = 1,
+ ImaAdpcm = 99,
+ }
+
+ struct Chunk
+ {
+ public int CompressedSize;
+ public int OutputSize;
+
+ public static Chunk Read(BinaryReader r)
+ {
+ Chunk c;
+ c.CompressedSize = r.ReadUInt16();
+ c.OutputSize = r.ReadUInt16();
+ if (0xdeaf != r.ReadUInt32())
+ throw new InvalidDataException("Chunk header is bogus");
+ return c;
+ }
+ }
+
+ public static class AudLoader
+ {
+ static int[] IndexAdjust = { -1, -1, -1, -1, 2, 4, 6, 8 };
+ static int[] StepTable = {
+ 7, 8, 9, 10, 11, 12, 13, 14, 16,
+ 17, 19, 21, 23, 25, 28, 31, 34, 37,
+ 41, 45, 50, 55, 60, 66, 73, 80, 88,
+ 97, 107, 118, 130, 143, 157, 173, 190, 209,
+ 230, 253, 279, 307, 337, 371, 408, 449, 494,
+ 544, 598, 658, 724, 796, 876, 963, 1060, 1166,
+ 1282, 1411, 1552, 1707, 1878, 2066, 2272, 2499, 2749,
+ 3024, 3327, 3660, 4026, 4428, 4871, 5358, 5894, 6484,
+ 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899, 15289,
+ 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767 };
+
+ static short DecodeSample(byte b, ref int index, ref int current)
+ {
+ var sb = (b & 8) != 0;
+ b &= 7;
+
+ var delta = (StepTable[index] * b) / 4 + StepTable[index] / 8;
+ if (sb) delta = -delta;
+
+ current += delta;
+ if (current > short.MaxValue) current = short.MaxValue;
+ if (current < short.MinValue) current = short.MinValue;
+
+ index += IndexAdjust[b];
+ if (index < 0) index = 0;
+ if (index > 88) index = 88;
+
+ return (short)current;
+ }
+
+ public static byte[] LoadSound(Stream s)
+ {
+ var br = new BinaryReader(s);
+ /*var sampleRate =*/ br.ReadUInt16();
+ var dataSize = br.ReadInt32();
+ var outputSize = br.ReadInt32();
+ /*var flags = (SoundFlags)*/ br.ReadByte();
+ /*var format = (SoundFormat)*/ br.ReadByte();
+
+ var output = new byte[outputSize];
+ var offset = 0;
+ var index = 0;
+ var currentSample = 0;
+
+ while (dataSize > 0)
+ {
+ var chunk = Chunk.Read(br);
+ for (int n = 0; n < chunk.CompressedSize; n++)
+ {
+ var b = br.ReadByte();
+
+ var t = DecodeSample(b, ref index, ref currentSample);
+ output[offset++] = (byte)t;
+ output[offset++] = (byte)(t >> 8);
+
+ t = DecodeSample((byte)(b >> 4), ref index, ref currentSample);
+ output[offset++] = (byte)t;
+ output[offset++] = (byte)(t >> 8);
+ }
+
+ dataSize -= 8 + chunk.CompressedSize;
+ }
+
+ return output;
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/Blowfish.cs b/OpenRA.FileFormats/Blowfish.cs
new file mode 100644
index 0000000000..72d6b62787
--- /dev/null
+++ b/OpenRA.FileFormats/Blowfish.cs
@@ -0,0 +1,416 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+namespace OpenRA.FileFormats
+{
+ class Blowfish
+ {
+ public Blowfish(byte[] key)
+ {
+ for (int i = 0, j = 0; i < 18; ++i)
+ {
+ uint a = key[j++ % key.Length];
+ uint b = key[j++ % key.Length];
+ uint c = key[j++ % key.Length];
+ uint d = key[j++ % key.Length];
+
+ m_p[i] ^= a << 24 | b << 16 | c << 8 | d;
+ }
+
+ uint l = 0, r = 0;
+
+ for (int i = 0; i < 18; )
+ {
+ Encrypt(ref l, ref r);
+ m_p[i++] = l;
+ m_p[i++] = r;
+ }
+
+ for (int i = 0; i < 4; ++i)
+ for (int j = 0; j < 256; )
+ {
+ Encrypt(ref l, ref r);
+ m_s[i, j++] = l;
+ m_s[i, j++] = r;
+ }
+ }
+
+ public uint[] Encrypt(uint[] data) { return RunCipher(data, Encrypt); }
+ public uint[] Decrypt(uint[] data) { return RunCipher(data, Decrypt); }
+
+ delegate void CipherFunc( ref uint a, ref uint b );
+
+ uint[] RunCipher(uint[] data, CipherFunc f)
+ {
+ uint[] result = new uint[data.Length];
+
+ int size = data.Length / 2;
+ int i = 0;
+ while (size-- > 0)
+ {
+ uint a = SwapBytes(data[i]);
+ uint b = SwapBytes(data[i+1]);
+
+ f(ref a, ref b);
+
+ result[i++] = SwapBytes(a);
+ result[i++] = SwapBytes(b);
+ }
+
+ return result;
+ }
+
+ void Encrypt(ref uint a, ref uint b)
+ {
+ uint _a = a, _b = b;
+ _a ^= m_p[0];
+
+ bool x = false;
+ for( int i = 1; i <= 16; i++, x ^= true)
+ {
+ if (x)
+ Round(ref _a, _b, i);
+ else
+ Round(ref _b, _a, i);
+ }
+ _b ^= m_p[17];
+
+ a = _b;
+ b = _a;
+ }
+
+ void Decrypt(ref uint a, ref uint b)
+ {
+ uint _a = a, _b = b;
+ _a ^= m_p[17];
+
+ bool x = false;
+ for (int i = 16; i >= 1; i--, x ^= true)
+ {
+ if (x)
+ Round(ref _a, _b, i);
+ else
+ Round(ref _b, _a, i);
+ }
+ _b ^= m_p[0];
+
+ a = _b;
+ b = _a;
+ }
+
+ uint S(uint x, int i)
+ {
+ return m_s[i, (x >> ((3 - i) << 3)) & 0xff];
+ }
+
+ uint bf_f(uint x)
+ {
+ return ((S(x, 0) + S(x, 1)) ^ S(x, 2)) + S(x, 3);
+ }
+
+ void Round(ref uint a, uint b, int n)
+ {
+ a ^= bf_f(b) ^ m_p[n];
+ }
+
+ uint SwapBytes(uint i)
+ {
+ i = (i << 16) | (i >> 16);
+ i = ((i << 8) & 0xff00ff00) | ((i >> 8) & 0x00ff00ff);
+ return i;
+ }
+
+ uint[] m_p = new uint[] {
+ 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344,
+ 0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89,
+ 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c,
+ 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917,
+ 0x9216d5d9, 0x8979fb1b
+ };
+
+ uint[,] m_s = new uint[,] {
+ {
+ 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7,
+ 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99,
+ 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16,
+ 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e,
+ 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee,
+ 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013,
+ 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef,
+ 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e,
+ 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60,
+ 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440,
+ 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce,
+ 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a,
+ 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e,
+ 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677,
+ 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193,
+ 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032,
+ 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88,
+ 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239,
+ 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e,
+ 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0,
+ 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3,
+ 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98,
+ 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88,
+ 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe,
+ 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6,
+ 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d,
+ 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b,
+ 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7,
+ 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba,
+ 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463,
+ 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f,
+ 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09,
+ 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3,
+ 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb,
+ 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279,
+ 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8,
+ 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab,
+ 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82,
+ 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db,
+ 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573,
+ 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0,
+ 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b,
+ 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790,
+ 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8,
+ 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4,
+ 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0,
+ 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7,
+ 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c,
+ 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad,
+ 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1,
+ 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299,
+ 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9,
+ 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477,
+ 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf,
+ 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49,
+ 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af,
+ 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa,
+ 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5,
+ 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41,
+ 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915,
+ 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400,
+ 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915,
+ 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664,
+ 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a
+ },
+ {
+ 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623,
+ 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266,
+ 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1,
+ 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e,
+ 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6,
+ 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1,
+ 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e,
+ 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1,
+ 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737,
+ 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8,
+ 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff,
+ 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd,
+ 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701,
+ 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7,
+ 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41,
+ 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331,
+ 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf,
+ 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af,
+ 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e,
+ 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87,
+ 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c,
+ 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2,
+ 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16,
+ 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd,
+ 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b,
+ 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509,
+ 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e,
+ 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3,
+ 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f,
+ 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a,
+ 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4,
+ 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960,
+ 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66,
+ 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28,
+ 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802,
+ 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84,
+ 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510,
+ 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf,
+ 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14,
+ 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e,
+ 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50,
+ 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7,
+ 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8,
+ 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281,
+ 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99,
+ 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696,
+ 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128,
+ 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73,
+ 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0,
+ 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0,
+ 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105,
+ 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250,
+ 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3,
+ 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285,
+ 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00,
+ 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061,
+ 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb,
+ 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e,
+ 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735,
+ 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc,
+ 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9,
+ 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340,
+ 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20,
+ 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7
+ },
+ {
+ 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934,
+ 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068,
+ 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af,
+ 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840,
+ 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45,
+ 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504,
+ 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a,
+ 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb,
+ 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee,
+ 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6,
+ 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42,
+ 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b,
+ 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2,
+ 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb,
+ 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527,
+ 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b,
+ 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33,
+ 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c,
+ 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3,
+ 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc,
+ 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17,
+ 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564,
+ 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b,
+ 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115,
+ 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922,
+ 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728,
+ 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0,
+ 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e,
+ 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37,
+ 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d,
+ 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804,
+ 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b,
+ 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3,
+ 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb,
+ 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d,
+ 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c,
+ 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350,
+ 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9,
+ 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a,
+ 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe,
+ 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d,
+ 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc,
+ 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f,
+ 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61,
+ 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2,
+ 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9,
+ 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2,
+ 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c,
+ 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e,
+ 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633,
+ 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10,
+ 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169,
+ 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52,
+ 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027,
+ 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5,
+ 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62,
+ 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634,
+ 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76,
+ 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24,
+ 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc,
+ 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4,
+ 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c,
+ 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837,
+ 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0
+ },
+ {
+ 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b,
+ 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe,
+ 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b,
+ 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4,
+ 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8,
+ 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6,
+ 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304,
+ 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22,
+ 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4,
+ 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6,
+ 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9,
+ 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59,
+ 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593,
+ 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51,
+ 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28,
+ 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c,
+ 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b,
+ 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28,
+ 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c,
+ 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd,
+ 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a,
+ 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319,
+ 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb,
+ 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f,
+ 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991,
+ 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32,
+ 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680,
+ 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166,
+ 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae,
+ 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb,
+ 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5,
+ 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47,
+ 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370,
+ 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d,
+ 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84,
+ 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048,
+ 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8,
+ 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd,
+ 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9,
+ 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7,
+ 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38,
+ 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f,
+ 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c,
+ 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525,
+ 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1,
+ 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442,
+ 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964,
+ 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e,
+ 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8,
+ 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d,
+ 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f,
+ 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299,
+ 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02,
+ 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc,
+ 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614,
+ 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a,
+ 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6,
+ 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b,
+ 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0,
+ 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060,
+ 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e,
+ 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9,
+ 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f,
+ 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6
+ }
+
+ };
+ }
+}
diff --git a/OpenRA.FileFormats/BlowfishKeyProvider.cs b/OpenRA.FileFormats/BlowfishKeyProvider.cs
new file mode 100644
index 0000000000..759af0a08a
--- /dev/null
+++ b/OpenRA.FileFormats/BlowfishKeyProvider.cs
@@ -0,0 +1,538 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.Linq;
+
+namespace OpenRA.FileFormats
+{
+ /* possibly the fugliest C# i've ever seen. */
+
+ class BlowfishKeyProvider
+ {
+ const string pubkeyStr = "AihRvNoIbTn85FZRYNZRcT+i6KpU+maCsEqr3Q5q+LDB5tH7Tz2qQ38V";
+
+ static sbyte[] char2num = {
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1,
+ -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
+ -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
+ 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1};
+
+ class PublicKey
+ {
+ public uint[] key1 = new uint[64];
+ public uint[] key2 = new uint[64];
+ public uint len;
+ }
+ PublicKey pubkey = new PublicKey();
+
+ uint[] glob1 = new uint[64];
+ uint glob1_bitlen, glob1_len_x2;
+ uint[] glob2 = new uint[130];
+ uint[] glob1_hi = new uint[4];
+ uint[] glob1_hi_inv = new uint[4];
+ uint glob1_hi_bitlen;
+ uint glob1_hi_inv_lo, glob1_hi_inv_hi;
+
+ void init_bignum(uint[] n, uint val, uint len)
+ {
+ for (int i = 0; i < len; i++) n[i] = 0;
+ n[0] = val;
+ }
+
+ void move_key_to_big(uint[] n, byte[] key, uint klen, uint blen)
+ {
+ byte sign;
+
+ if ((key[0] & 0x80) != 0) sign = 0xff;
+ else sign = 0;
+
+ unsafe
+ {
+ fixed (uint* _pn = &n[0])
+ {
+ byte* pn = (byte*)_pn;
+ uint i = blen * 4;
+ for (; i > klen; i--) pn[i - 1] = (byte)sign;
+ for (; i > 0; i--) pn[i - 1] = key[klen - i];
+ }
+ }
+ }
+
+ void key_to_bignum(uint[] n, byte[] key, uint len)
+ {
+ uint keylen;
+ int i;
+
+ int j = 0;
+
+ if (key[j] != 2) return;
+ j++;
+
+ if ((key[j] & 0x80) != 0)
+ {
+ keylen = 0;
+ for (i = 0; i < (key[j] & 0x7f); i++) keylen = (keylen << 8) | key[j + i + 1];
+ j += (key[j] & 0x7f) + 1;
+ }
+ else
+ {
+ keylen = key[j];
+ j++;
+ }
+ if (keylen <= len * 4)
+ move_key_to_big(n, key.Skip(j).ToArray(), keylen, len);
+ }
+
+ uint len_bignum(uint[] n, uint len)
+ {
+ uint i;
+ i = len - 1;
+ while ((i >= 0) && (n[i] == 0)) i--;
+ return i + 1;
+ }
+
+ uint bitlen_bignum(uint[] n, uint len)
+ {
+ uint ddlen, bitlen, mask;
+ ddlen = len_bignum(n, len);
+ if (ddlen == 0) return 0;
+ bitlen = ddlen * 32;
+ mask = 0x80000000;
+ while ((mask & n[ddlen - 1]) == 0)
+ {
+ mask >>= 1;
+ bitlen--;
+ }
+ return bitlen;
+ }
+
+ void init_pubkey()
+ {
+ int i = 0;
+ uint i2, tmp;
+ byte[] keytmp = new byte[256];
+
+ init_bignum(pubkey.key2, 0x10001, 64);
+
+ i2 = 0;
+ while (i < pubkeyStr.Length)
+ {
+ tmp = (uint)char2num[pubkeyStr[i++]];
+ tmp <<= 6; tmp |= (uint)(byte)char2num[pubkeyStr[i++]];
+ tmp <<= 6; tmp |= (uint)(byte)char2num[pubkeyStr[i++]];
+ tmp <<= 6; tmp |= (uint)(byte)char2num[pubkeyStr[i++]];
+ keytmp[i2++] = (byte)((tmp >> 16) & 0xff);
+ keytmp[i2++] = (byte)((tmp >> 8) & 0xff);
+ keytmp[i2++] = (byte)(tmp & 0xff);
+ }
+
+ key_to_bignum(pubkey.key1, keytmp, 64);
+ pubkey.len = bitlen_bignum(pubkey.key1, 64) - 1;
+ }
+
+ uint len_predata()
+ {
+ uint a = (pubkey.len - 1) / 8;
+ return (55 / a + 1) * (a + 1);
+ }
+
+ int cmp_bignum(uint[] n1, uint[] n2, uint len)
+ {
+
+ while (len > 0)
+ {
+ --len;
+ if (n1[len] < n2[len]) return -1;
+ if (n1[len] > n2[len]) return 1;
+ }
+ return 0;
+ }
+
+ void mov_bignum(uint[] dest, uint[] src, uint len)
+ {
+ Array.Copy(src, dest, len);
+ }
+
+ void shr_bignum(uint[] n, int bits, int len)
+ {
+ int i; int i2 = bits / 32;
+
+ if (i2 > 0)
+ {
+ for (i = 0; i < len - i2; i++) n[i] = n[i + i2];
+ for (; i < len; i++) n[i] = 0;
+ bits = bits % 32;
+ }
+ if (bits == 0) return;
+ for (i = 0; i < len - 1; i++) n[i] = (n[i] >> bits) | (n[i + 1] << (32 -
+ bits));
+ n[i] = n[i] >> bits;
+ }
+
+ void shl_bignum(uint[] n, int bits, int len)
+ {
+ int i, i2;
+
+ i2 = bits / 32;
+ if (i2 > 0)
+ {
+ for (i = len - 1; i > i2; i--) n[i] = n[i - i2];
+ for (; i > 0; i--) n[i] = 0;
+ bits = bits % 32;
+ }
+ if (bits == 0) return;
+ for (i = len - 1; i > 0; i--) n[i] = (n[i] << bits) | (n[i - 1] >> (32 -
+ bits));
+ n[0] <<= bits;
+ }
+
+ uint sub_bignum(uint[] dest, uint[] src1, uint[] src2, uint carry, int len)
+ {
+ uint i1, i2;
+
+ len += len;
+ unsafe
+ {
+ fixed (uint* _ps1 = &src1[0])
+ fixed (uint* _ps2 = &src2[0])
+ fixed (uint* _pd = &dest[0])
+ {
+ ushort* ps1 = (ushort*)_ps1;
+ ushort* ps2 = (ushort*)_ps2;
+ ushort* pd = (ushort*)_pd;
+
+ while (--len != -1)
+ {
+ i1 = *ps1++;
+ i2 = *ps2++;
+ *pd++ = (ushort)(i1 - i2 - carry);
+ if (((i1 - i2 - carry) & 0x10000) != 0) carry = 1; else carry = 0;
+ }
+ }
+ }
+ return carry;
+ }
+
+ unsafe uint sub_bignum(uint* dest, uint* src1, uint* src2, uint carry, int len)
+ {
+ uint i1, i2;
+
+ len += len;
+
+ ushort* ps1 = (ushort*)src1;
+ ushort* ps2 = (ushort*)src2;
+ ushort* pd = (ushort*)dest;
+
+ while (--len != -1)
+ {
+ i1 = *ps1++;
+ i2 = *ps2++;
+ *pd++ = (ushort)(i1 - i2 - carry);
+ if (((i1 - i2 - carry) & 0x10000) != 0) carry = 1; else carry = 0;
+
+ }
+ return carry;
+ }
+
+ void inv_bignum(uint[] n1, uint[] n2, uint len)
+ {
+ uint[] n_tmp = new uint[64];
+ uint n2_bytelen, bit;
+ int n2_bitlen;
+
+ int j = 0;
+
+ init_bignum(n_tmp, 0, len);
+ init_bignum(n1, 0, len);
+ n2_bitlen = (int)bitlen_bignum(n2, len);
+ bit = ((uint)1) << (n2_bitlen % 32);
+ j = ((n2_bitlen + 32) / 32) - 1;
+ n2_bytelen = (uint)((n2_bitlen - 1) / 32) * 4;
+ n_tmp[n2_bytelen / 4] |= ((uint)1) << ((n2_bitlen - 1) & 0x1f);
+
+ while (n2_bitlen > 0)
+ {
+ n2_bitlen--;
+ shl_bignum(n_tmp, 1, (int)len);
+ if (cmp_bignum(n_tmp, n2, len) != -1)
+ {
+ sub_bignum(n_tmp, n_tmp, n2, 0, (int)len);
+ n1[j] |= bit;
+ }
+ bit >>= 1;
+ if (bit == 0)
+ {
+ j--;
+ bit = 0x80000000;
+ }
+ }
+ init_bignum(n_tmp, 0, len);
+ }
+
+ void inc_bignum(uint[] n, uint len)
+ {
+ int i = 0;
+ while ((++n[i] == 0) && (--len > 0)) i++;
+ }
+
+ void init_two_dw(uint[] n, uint len)
+ {
+ mov_bignum(glob1, n, len);
+ glob1_bitlen = bitlen_bignum(glob1, len);
+ glob1_len_x2 = (glob1_bitlen + 15) / 16;
+ mov_bignum(glob1_hi, glob1.Skip((int)len_bignum(glob1, len) - 2).ToArray(), 2);
+ glob1_hi_bitlen = bitlen_bignum(glob1_hi, 2) - 32;
+ shr_bignum(glob1_hi, (int)glob1_hi_bitlen, 2);
+ inv_bignum(glob1_hi_inv, glob1_hi, 2);
+ shr_bignum(glob1_hi_inv, 1, 2);
+ glob1_hi_bitlen = (glob1_hi_bitlen + 15) % 16 + 1;
+ inc_bignum(glob1_hi_inv, 2);
+ if (bitlen_bignum(glob1_hi_inv, 2) > 32)
+ {
+ shr_bignum(glob1_hi_inv, 1, 2);
+ glob1_hi_bitlen--;
+ }
+ glob1_hi_inv_lo = (ushort)glob1_hi_inv[0];
+ glob1_hi_inv_hi = (ushort)(glob1_hi_inv[0] >> 16);
+ }
+
+ unsafe void mul_bignum_word(ushort *pn1, uint[] n2, uint mul, uint len)
+ {
+ uint i, tmp;
+ unsafe
+ {
+ fixed (uint* _pn2 = &n2[0])
+ {
+ ushort* pn2 = (ushort*)_pn2;
+
+ tmp = 0;
+ for (i = 0; i < len; i++)
+ {
+ tmp = mul * (*pn2) + (*pn1) + tmp;
+ *pn1 = (ushort)tmp;
+ pn1++;
+ pn2++;
+ tmp >>= 16;
+ }
+ *pn1 += (ushort)tmp;
+ }
+ }
+ }
+
+ void mul_bignum(uint[] dest, uint[] src1, uint[] src2, uint len)
+ {
+ uint i;
+
+ unsafe
+ {
+ fixed( uint * _psrc2 = &src2[0] )
+ fixed(uint* _pdest = &dest[0])
+ {
+ ushort* psrc2 = (ushort*)_psrc2;
+ ushort* pdest = (ushort*)_pdest;
+
+ init_bignum(dest, 0, len * 2);
+ for (i = 0; i < len * 2; i++)
+ mul_bignum_word(pdest++, src1, *psrc2++, len * 2);
+ }
+ }
+ }
+
+ void not_bignum(uint[] n, uint len)
+ {
+ uint i;
+ for (i = 0; i < len; i++) n[i] = ~n[i];
+ }
+
+ void neg_bignum(uint[] n, uint len)
+ {
+ not_bignum(n, len);
+ inc_bignum(n, len);
+ }
+
+ unsafe uint get_mulword(uint* n)
+ {
+ ushort* wn = (ushort*)n;
+ uint i = (uint)((((((((((*(wn - 1) ^ 0xffff) & 0xffff) * glob1_hi_inv_lo + 0x10000) >> 1)
+ + (((*(wn - 2) ^ 0xffff) * glob1_hi_inv_hi + glob1_hi_inv_hi) >> 1) + 1)
+ >> 16) + ((((*(wn - 1) ^ 0xffff) & 0xffff) * glob1_hi_inv_hi) >> 1) +
+ (((*wn ^ 0xffff) * glob1_hi_inv_lo) >> 1) + 1) >> 14) + glob1_hi_inv_hi
+ * (*wn ^ 0xffff) * 2) >> (int)glob1_hi_bitlen);
+ if (i > 0xffff) i = 0xffff;
+ return i & 0xffff;
+ }
+
+ void dec_bignum(uint[] n, uint len)
+ {
+ int i = 0;
+ while ((--n[i] == 0xffffffff) && (--len > 0))
+ i++;
+ }
+
+ void calc_a_bignum(uint[] n1, uint[] n2, uint[] n3, uint len)
+ {
+ uint g2_len_x2, len_diff;
+ unsafe
+ {
+ fixed( uint* g1 = &glob1[0])
+ fixed (uint* g2 = &glob2[0])
+ {
+ mul_bignum(glob2, n2, n3, len);
+ glob2[len * 2] = 0;
+ g2_len_x2 = len_bignum(glob2, len * 2 + 1) * 2;
+ if (g2_len_x2 >= glob1_len_x2)
+ {
+ inc_bignum(glob2, len * 2 + 1);
+ neg_bignum(glob2, len * 2 + 1);
+ len_diff = g2_len_x2 + 1 - glob1_len_x2;
+ ushort* esi = ((ushort*)g2) + (1 + g2_len_x2 - glob1_len_x2);
+ ushort* edi = ((ushort*)g2) + (g2_len_x2 + 1);
+ for (; len_diff != 0; len_diff--)
+ {
+ edi--;
+ uint tmp = get_mulword((uint*)edi);
+ esi--;
+ if (tmp > 0)
+ {
+ mul_bignum_word(esi, glob1, tmp, 2 * len);
+ if ((*edi & 0x8000) == 0)
+ {
+ if (0 != sub_bignum((uint*)esi, (uint*)esi, g1, 0, (int)len)) (*edi)--;
+ }
+ }
+ }
+ neg_bignum(glob2, len);
+ dec_bignum(glob2, len);
+ }
+ mov_bignum(n1, glob2, len);
+ }
+ }
+ }
+
+ void clear_tmp_vars(uint len)
+ {
+ init_bignum(glob1, 0, len);
+ init_bignum(glob2, 0, len);
+ init_bignum(glob1_hi_inv, 0, 4);
+ init_bignum(glob1_hi, 0, 4);
+ glob1_bitlen = 0;
+ glob1_hi_bitlen = 0;
+ glob1_len_x2 = 0;
+ glob1_hi_inv_lo = 0;
+ glob1_hi_inv_hi = 0;
+ }
+
+ void calc_a_key(uint[] n1, uint[] n2, uint[] n3, uint[] n4, uint len)
+ {
+ uint[] n_tmp = new uint[64];
+ uint n3_len, n4_len;
+ int n3_bitlen;
+ uint bit_mask;
+
+ unsafe
+ {
+ fixed (uint* _pn3 = &n3[0])
+ {
+ uint* pn3 = _pn3;
+
+ init_bignum(n1, 1, len);
+ n4_len = len_bignum(n4, len);
+ init_two_dw(n4, n4_len);
+ n3_bitlen = (int)bitlen_bignum(n3, n4_len);
+ n3_len = (uint)((n3_bitlen + 31) / 32);
+ bit_mask = (((uint)1) << ((n3_bitlen - 1) % 32)) >> 1;
+ pn3 += n3_len - 1;
+ n3_bitlen--;
+ mov_bignum(n1, n2, n4_len);
+ while (--n3_bitlen != -1)
+ {
+ if (bit_mask == 0)
+ {
+ bit_mask = 0x80000000;
+ pn3--;
+ }
+ calc_a_bignum(n_tmp, n1, n1, n4_len);
+ if ((*pn3 & bit_mask) != 0)
+ calc_a_bignum(n1, n_tmp, n2, n4_len);
+ else
+ mov_bignum(n1, n_tmp, n4_len);
+ bit_mask >>= 1;
+ }
+ init_bignum(n_tmp, 0, n4_len);
+ clear_tmp_vars(len);
+ }
+ }
+ }
+
+ unsafe void memcpy(byte* dest, byte* src, int len)
+ {
+ while (len-- != 0) *dest++ = *src++;
+ }
+
+ unsafe void process_predata(byte* pre, uint pre_len, byte *buf)
+ {
+ uint[] n2 = new uint[64];
+ uint[] n3 = new uint[64];
+
+ uint a = (pubkey.len - 1) / 8;
+ while (a + 1 <= pre_len)
+ {
+ init_bignum(n2, 0, 64);
+ fixed( uint * pn2 = &n2[0] )
+ memcpy((byte *)pn2, pre, (int)a + 1);
+ calc_a_key(n3, n2, pubkey.key2, pubkey.key1, 64);
+
+ fixed( uint * pn3 = &n3[0] )
+ memcpy(buf, (byte *)pn3, (int)a);
+
+ pre_len -= a + 1;
+ pre += a + 1;
+ buf += a;
+ }
+ }
+
+ public byte[] DecryptKey(byte[] src)
+ {
+ init_pubkey();
+ byte[] dest = new byte[256];
+
+ unsafe
+ {
+ fixed (byte* pdest = &dest[0])
+ fixed (byte* psrc = &src[0])
+ process_predata(psrc, len_predata(), pdest);
+ }
+ return dest.Take(56).ToArray();
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/Cache.cs b/OpenRA.FileFormats/Cache.cs
new file mode 100644
index 0000000000..92f0e0fa72
--- /dev/null
+++ b/OpenRA.FileFormats/Cache.cs
@@ -0,0 +1,59 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.Collections;
+using System.Collections.Generic;
+
+namespace OpenRA.FileFormats
+{
+ public class Cache : IEnumerable>
+ {
+ Dictionary hax = new Dictionary();
+ Func loader;
+
+ public Cache(Func loader)
+ {
+ if (loader == null)
+ throw new ArgumentNullException();
+
+ this.loader = loader;
+ }
+
+ public U this[T key]
+ {
+ get
+ {
+ U result;
+ if (!hax.TryGetValue(key, out result))
+ hax.Add(key, result = loader(key));
+
+ return result;
+ }
+ }
+
+ public IEnumerator> GetEnumerator() { return hax.GetEnumerator(); }
+
+ IEnumerator IEnumerable.GetEnumerator() { return GetEnumerator(); }
+
+ public IEnumerable Keys { get { return hax.Keys; } }
+ public IEnumerable Values { get { return hax.Values; } }
+ }
+}
diff --git a/OpenRA.FileFormats/Collections/Set.cs b/OpenRA.FileFormats/Collections/Set.cs
new file mode 100755
index 0000000000..3738562091
--- /dev/null
+++ b/OpenRA.FileFormats/Collections/Set.cs
@@ -0,0 +1,76 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.Collections;
+using System.Collections.Generic;
+
+namespace OpenRA.Collections
+{
+ public class Set : IEnumerable
+ {
+ Dictionary data = new Dictionary();
+
+ public void Add( T obj )
+ {
+ data.Add( obj, false );
+ if( OnAdd != null )
+ OnAdd( obj );
+ }
+
+ public void Remove( T obj )
+ {
+ data.Remove( obj );
+ if( OnRemove != null )
+ OnRemove( obj );
+ }
+
+ public event Action OnAdd;
+ public event Action OnRemove;
+
+ public IEnumerator GetEnumerator()
+ {
+ return data.Keys.GetEnumerator();
+ }
+
+ IEnumerator IEnumerable.GetEnumerator()
+ {
+ return GetEnumerator();
+ }
+ }
+
+ public class CachedView : Set
+ {
+ public CachedView( Set set, Func include, Func store )
+ : this( set, include, x => new[] { store( x ) } )
+ {
+ }
+
+ public CachedView( Set set, Func include, Func> store )
+ {
+ foreach( var t in set )
+ if( include( t ) )
+ store( t ).Do( x => Add( x ) );
+
+ set.OnAdd += obj => { if( include( obj ) ) store( obj ).Do( x => Add( x ) ); };
+ set.OnRemove += obj => { if( include( obj ) ) store( obj ).Do( x => Remove( x ) ); };
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/DisposableAction.cs b/OpenRA.FileFormats/DisposableAction.cs
new file mode 100644
index 0000000000..ae1836e321
--- /dev/null
+++ b/OpenRA.FileFormats/DisposableAction.cs
@@ -0,0 +1,45 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+
+namespace OpenRA
+{
+ public class DisposableAction : IDisposable
+ {
+ public DisposableAction(Action a) { this.a = a; }
+
+ Action a;
+ bool disposed;
+
+ public void Dispose()
+ {
+ if (disposed) return;
+ disposed = true;
+ a();
+ GC.SuppressFinalize(this);
+ }
+
+ ~DisposableAction()
+ {
+ Dispose();
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/Dune2ShpReader.cs b/OpenRA.FileFormats/Dune2ShpReader.cs
new file mode 100644
index 0000000000..53060bbdfe
--- /dev/null
+++ b/OpenRA.FileFormats/Dune2ShpReader.cs
@@ -0,0 +1,156 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System.Collections;
+using System.Collections.Generic;
+using System.Drawing;
+using System.IO;
+
+namespace OpenRA.FileFormats
+{
+ public enum Dune2ImageFlags : int
+ {
+ F80_F2 = 0,
+ F2 = 2,
+ L16_F80_F2_1 = 1,
+ L16_F80_F2_2 = 3,
+ Ln_F80_F2 = 5
+ }
+
+ public class Dune2ImageHeader
+ {
+ public readonly Dune2ImageFlags Flags;
+ public readonly int Width;
+ public readonly int Height;
+ public readonly int Slices;
+ public readonly int FileSize;
+ public readonly int DataSize;
+
+ public readonly byte[] LookupTable;
+ public byte[] Image;
+
+ public Dune2ImageHeader(BinaryReader reader)
+ {
+ Flags = (Dune2ImageFlags)reader.ReadUInt16();
+ Slices = reader.ReadByte();
+ Width = reader.ReadUInt16();
+ Height = reader.ReadByte();
+ FileSize = reader.ReadUInt16();
+ DataSize = reader.ReadUInt16();
+
+ if (Flags == Dune2ImageFlags.L16_F80_F2_1 ||
+ Flags == Dune2ImageFlags.L16_F80_F2_2 ||
+ Flags == Dune2ImageFlags.Ln_F80_F2)
+ {
+ int n = Flags == Dune2ImageFlags.Ln_F80_F2 ? reader.ReadByte() : (byte)16;
+ LookupTable = new byte[n];
+ for (int i = 0; i < n; i++)
+ LookupTable[i] = reader.ReadByte();
+ }
+ else
+ {
+ LookupTable = new byte[256];
+ for (int i = 0; i < 256; i++)
+ LookupTable[i] = (byte)i;
+ LookupTable[1] = 0x7f;
+ LookupTable[2] = 0x7e;
+ LookupTable[3] = 0x7d;
+ LookupTable[4] = 0x7c;
+ }
+ }
+
+ public Size Size
+ {
+ get { return new Size(Width, Height); }
+ }
+ }
+
+ public class Dune2ShpReader : IEnumerable
+ {
+ public readonly int ImageCount;
+
+ List headers = new List();
+
+ public Dune2ShpReader(Stream stream)
+ {
+ BinaryReader reader = new BinaryReader(stream);
+
+ ImageCount = reader.ReadUInt16();
+
+ //Last offset is pointer to end of file.
+ uint[] offsets = new uint[ImageCount + 1];
+
+ uint temp = reader.ReadUInt32();
+
+ //If fourth byte in file is non-zero, the offsets are two bytes each.
+ bool twoByteOffsets = (temp & 0xFF0000) > 0;
+ if (twoByteOffsets)
+ {
+ offsets[0] = ((temp & 0xFFFF0000) >> 16) + 2; //Offset does not account for image count bytes
+ offsets[1] = (temp & 0xFFFF) + 2;
+ }
+ else
+ offsets[0] = temp + 2;
+
+ for (int i = twoByteOffsets ? 2 : 1; i < ImageCount + 1; i++)
+ offsets[i] = (twoByteOffsets ? reader.ReadUInt16() : reader.ReadUInt32()) + 2;
+
+ for (int i = 0; i < ImageCount; i++)
+ {
+ reader.BaseStream.Seek(offsets[i], SeekOrigin.Begin);
+ Dune2ImageHeader header = new Dune2ImageHeader(reader);
+ byte[] imgData = reader.ReadBytes(header.FileSize);
+ header.Image = new byte[header.Height * header.Width];
+
+ //Decode image data
+ if (header.Flags != Dune2ImageFlags.F2)
+ {
+ byte[] tempData = new byte[header.DataSize];
+ Format80.DecodeInto(imgData, tempData);
+ Format2.DecodeInto(tempData, header.Image);
+ }
+ else
+ Format2.DecodeInto(imgData, header.Image);
+
+ //Lookup values in lookup table
+ if (header.LookupTable != null)
+ for (int j = 0; j < header.Image.Length; j++)
+ header.Image[j] = header.LookupTable[header.Image[j]];
+
+ headers.Add(header);
+ }
+ }
+
+ public Dune2ImageHeader this[int index]
+ {
+ get { return headers[index]; }
+ }
+
+ public IEnumerator GetEnumerator()
+ {
+ return headers.GetEnumerator();
+ }
+
+ IEnumerator IEnumerable.GetEnumerator()
+ {
+ return GetEnumerator();
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/Exts.cs b/OpenRA.FileFormats/Exts.cs
new file mode 100644
index 0000000000..992cce920a
--- /dev/null
+++ b/OpenRA.FileFormats/Exts.cs
@@ -0,0 +1,39 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+
+namespace OpenRA
+{
+ public static class Exts
+ {
+ public static string F(this string fmt, params object[] args)
+ {
+ return string.Format(fmt, args);
+ }
+
+ public static void Do( this IEnumerable e, Action fn )
+ {
+ foreach( var ee in e )
+ fn( ee );
+ }
+ }
+}
diff --git a/OpenRA.FileFormats/FieldLoader.cs b/OpenRA.FileFormats/FieldLoader.cs
new file mode 100644
index 0000000000..a1db3f89dc
--- /dev/null
+++ b/OpenRA.FileFormats/FieldLoader.cs
@@ -0,0 +1,119 @@
+#region Copyright & License Information
+/*
+ * Copyright 2007,2009,2010 Chris Forbes, Robert Pepperell, Matthew Bowra-Dean, Paul Chote, Alli Witheford.
+ * This file is part of OpenRA.
+ *
+ * OpenRA is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * OpenRA is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with OpenRA. If not, see .
+ */
+#endregion
+
+using System;
+using System.Linq;
+using System.Reflection;
+
+namespace OpenRA.FileFormats
+{
+ public static class FieldLoader
+ {
+ public static void Load(object self, IniSection ini)
+ {
+ foreach (var x in ini)
+ {
+ var field = self.GetType().GetField(x.Key.Trim());
+ if (field == null)
+ throw new NotImplementedException("Missing field `{0}` on `{1}`".F(x.Key.Trim(), self.GetType().Name));
+ field.SetValue(self, GetValue(field.FieldType, x.Value.Trim()));
+ }
+ }
+
+ public static void Load(object self, MiniYaml my)
+ {
+ foreach (var x in my.Nodes)
+ {
+ var field = self.GetType().GetField(x.Key.Trim());
+ if (field == null)
+ throw new NotImplementedException("Missing field `{0}` on `{1}`".F(x.Key.Trim(), self.GetType().Name));
+ field.SetValue(self, GetValue(field.FieldType, x.Value.Value));
+ }
+ }
+
+ public static object GetValue( Type fieldType, string x )
+ {
+ if (x != null) x = x.Trim();
+ if( fieldType == typeof( int ) )
+ return int.Parse( x );
+
+ else if (fieldType == typeof(float))
+ return float.Parse(x.Replace("%","")) * (x.Contains( '%' ) ? 0.01f : 1f);
+
+ else if (fieldType == typeof(string))
+ return x;
+
+ else if (fieldType.IsEnum)
+ return Enum.Parse(fieldType, x, true);
+
+ else if (fieldType == typeof(bool))
+ return ParseYesNo(x);
+
+ else if (fieldType.IsArray)
+ {
+ if (x == null)
+ return Array.CreateInstance(fieldType.GetElementType(), 0);
+
+ var parts = x.Split(new char[] { ',' }, StringSplitOptions.RemoveEmptyEntries);
+
+ var ret = Array.CreateInstance(fieldType.GetElementType(), parts.Length);
+ for (int i = 0; i < parts.Length; i++)
+ ret.SetValue(GetValue(fieldType.GetElementType(), parts[i].Trim()), i);
+ return ret;
+ }
+ else if (fieldType == typeof(int2))
+ {
+ var parts = x.Split(new char[] { ',' }, StringSplitOptions.RemoveEmptyEntries);
+ return new int2(int.Parse(parts[0]), int.Parse(parts[1]));
+ }
+ else
+ throw new InvalidOperationException("FieldLoader: don't know how to load field of type " + fieldType.ToString());
+ }
+
+ static bool ParseYesNo( string p )
+ {
+ p = p.ToLowerInvariant();
+ if( p == "yes" ) return true;
+ if( p == "true" ) return true;
+ if( p == "no" ) return false;
+ if( p == "false" ) return false;
+ throw new InvalidOperationException();
+ }
+ }
+
+ public static class FieldSaver
+ {
+ public static MiniYaml Save(object o)
+ {
+ return new MiniYaml(null, o.GetType().GetFields(BindingFlags.Public | BindingFlags.Instance)
+ .ToDictionary(
+ f => f.Name,
+ f => new MiniYaml(FormatValue(o, f))));
+ }
+
+ static string FormatValue(object o, FieldInfo f)
+ {
+ var v = f.GetValue(o);
+ return f.FieldType.IsArray
+ ? string.Join(",", ((Array)v).OfType