Ported .Net Core commits:
hondacrx: - Initial commit: Switch to .Net Core 2.0 - Fix build and removed not needed files Fabi: - Updated solution platforms. - Changed folder structure. - Change library target framework to netstandard2.0. - Updated solution platforms again... - Removed windows specific kernel32 function usage (Ctrl-C handler).
This commit is contained in:
Fabian
@@ -0,0 +1,480 @@
|
||||
/*
|
||||
* Copyright (C) 2012-2017 CypherCore <http://github.com/CypherCore>
|
||||
*
|
||||
* This program 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.
|
||||
*
|
||||
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
using Framework.GameMath;
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Text;
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public class ByteBuffer : IDisposable
|
||||
{
|
||||
public ByteBuffer()
|
||||
{
|
||||
writeStream = new BinaryWriter(new MemoryStream());
|
||||
}
|
||||
|
||||
public ByteBuffer(byte[] data)
|
||||
{
|
||||
readStream = new BinaryReader(new MemoryStream(data));
|
||||
}
|
||||
|
||||
public void Dispose()
|
||||
{
|
||||
if (writeStream != null)
|
||||
writeStream.Dispose();
|
||||
|
||||
if (readStream != null)
|
||||
readStream.Dispose();
|
||||
}
|
||||
|
||||
#region Read Methods
|
||||
public sbyte ReadInt8()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadSByte();
|
||||
}
|
||||
|
||||
public short ReadInt16()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadInt16();
|
||||
}
|
||||
|
||||
public int ReadInt32()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadInt32();
|
||||
}
|
||||
|
||||
public long ReadInt64()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadInt64();
|
||||
}
|
||||
|
||||
public byte ReadUInt8()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadByte();
|
||||
}
|
||||
|
||||
public ushort ReadUInt16()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadUInt16();
|
||||
}
|
||||
|
||||
public uint ReadUInt32()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadUInt32();
|
||||
}
|
||||
|
||||
public ulong ReadUInt64()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadUInt64();
|
||||
}
|
||||
|
||||
public float ReadFloat()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadSingle();
|
||||
}
|
||||
|
||||
public double ReadDouble()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadDouble();
|
||||
}
|
||||
|
||||
public string ReadCString()
|
||||
{
|
||||
ResetBitPos();
|
||||
StringBuilder tmpString = new StringBuilder();
|
||||
char tmpChar = readStream.ReadChar();
|
||||
char tmpEndChar = Convert.ToChar(Encoding.UTF8.GetString(new byte[] { 0 }));
|
||||
|
||||
while (tmpChar != tmpEndChar)
|
||||
{
|
||||
tmpString.Append(tmpChar);
|
||||
tmpChar = readStream.ReadChar();
|
||||
}
|
||||
|
||||
return tmpString.ToString();
|
||||
}
|
||||
|
||||
public string ReadString(uint length)
|
||||
{
|
||||
if (length == 0)
|
||||
return "";
|
||||
|
||||
ResetBitPos();
|
||||
return Encoding.UTF8.GetString(ReadBytes(length));
|
||||
}
|
||||
|
||||
public bool ReadBool()
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadBoolean();
|
||||
}
|
||||
|
||||
public byte[] ReadBytes(uint count)
|
||||
{
|
||||
ResetBitPos();
|
||||
return readStream.ReadBytes((int)count);
|
||||
}
|
||||
|
||||
public void Skip(int count)
|
||||
{
|
||||
ResetBitPos();
|
||||
readStream.BaseStream.Position += count;
|
||||
}
|
||||
|
||||
public uint ReadPackedTime()
|
||||
{
|
||||
uint packedDate = ReadUInt32();
|
||||
var time = new DateTime((int)((packedDate >> 24) & 0x1F) + 2000, (int)((packedDate >> 20) & 0xF) + 1, (int)((packedDate >> 14) & 0x3F) + 1, (int)(packedDate >> 6) & 0x1F, (int)(packedDate & 0x3F), 0);
|
||||
return (uint)Time.DateTimeToUnixTime(time);
|
||||
}
|
||||
|
||||
public Vector3 ReadVector3()
|
||||
{
|
||||
return new Vector3(ReadFloat(), ReadFloat(), ReadFloat());
|
||||
}
|
||||
|
||||
//BitPacking
|
||||
public byte ReadBit()
|
||||
{
|
||||
if (BitPosition == 8)
|
||||
{
|
||||
BitValue = ReadUInt8();
|
||||
BitPosition = 0;
|
||||
}
|
||||
|
||||
int returnValue = BitValue;
|
||||
BitValue = (byte)(2 * returnValue);
|
||||
++BitPosition;
|
||||
|
||||
return (byte)(returnValue >> 7);
|
||||
}
|
||||
|
||||
public bool HasBit()
|
||||
{
|
||||
if (BitPosition == 8)
|
||||
{
|
||||
BitValue = ReadUInt8();
|
||||
BitPosition = 0;
|
||||
}
|
||||
|
||||
int returnValue = BitValue;
|
||||
BitValue = (byte)(2 * returnValue);
|
||||
++BitPosition;
|
||||
|
||||
return Convert.ToBoolean(returnValue >> 7);
|
||||
}
|
||||
|
||||
public T ReadBits<T>(int bitCount)
|
||||
{
|
||||
int value = 0;
|
||||
|
||||
for (var i = bitCount - 1; i >= 0; --i)
|
||||
if (HasBit())
|
||||
value |= (1 << i);
|
||||
|
||||
return (T)Convert.ChangeType(value, typeof(T));
|
||||
}
|
||||
#endregion
|
||||
|
||||
#region Write Methods
|
||||
public void WriteInt8<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToSByte(data));
|
||||
}
|
||||
|
||||
public void WriteInt16<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToInt16(data));
|
||||
}
|
||||
|
||||
public void WriteInt32<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToInt32(data));
|
||||
}
|
||||
|
||||
public void WriteInt64<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToInt64(data));
|
||||
}
|
||||
|
||||
public void WriteUInt8<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToByte(data));
|
||||
}
|
||||
|
||||
public void WriteUInt16<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToUInt16(data));
|
||||
}
|
||||
|
||||
public void WriteUInt32<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToUInt32(data));
|
||||
}
|
||||
|
||||
public void WriteUInt64<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToUInt64(data));
|
||||
}
|
||||
|
||||
public void WriteFloat<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToSingle(data));
|
||||
}
|
||||
|
||||
public void WriteDouble<T>(T data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(Convert.ToDouble(data));
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Writes a string to the packet with a null terminated (0)
|
||||
/// </summary>
|
||||
/// <param name="data"></param>
|
||||
public void WriteCString(string str)
|
||||
{
|
||||
if (string.IsNullOrEmpty(str))
|
||||
{
|
||||
WriteUInt8(0);
|
||||
return;
|
||||
}
|
||||
|
||||
WriteString(str);
|
||||
WriteUInt8(0);
|
||||
}
|
||||
|
||||
public void WriteString(string str)
|
||||
{
|
||||
byte[] sBytes = Encoding.UTF8.GetBytes(str);
|
||||
WriteBytes(sBytes);
|
||||
}
|
||||
|
||||
public void WriteBytes(byte[] data)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(data, 0, data.Length);
|
||||
}
|
||||
|
||||
public void WriteBytes(byte[] data, uint count)
|
||||
{
|
||||
FlushBits();
|
||||
writeStream.Write(data, 0, (int)count);
|
||||
}
|
||||
|
||||
public void WriteBytes(ByteBuffer buffer)
|
||||
{
|
||||
WriteBytes(buffer.GetData());
|
||||
}
|
||||
|
||||
public void Replace<T>(int pos, T value)
|
||||
{
|
||||
int retpos = (int)writeStream.BaseStream.Position;
|
||||
|
||||
writeStream.Seek(pos, SeekOrigin.Begin);
|
||||
switch (typeof(T).Name)
|
||||
{
|
||||
case "Byte":
|
||||
WriteUInt8(Convert.ToByte(value));
|
||||
break;
|
||||
case "SByte":
|
||||
WriteInt8(Convert.ToSByte(value));
|
||||
break;
|
||||
case "Float":
|
||||
WriteFloat(Convert.ToSingle(value));
|
||||
break;
|
||||
case "Int16":
|
||||
WriteInt16(Convert.ToInt16(value));
|
||||
break;
|
||||
case "UInt16":
|
||||
WriteUInt16(Convert.ToUInt16(value));
|
||||
break;
|
||||
case "Int32":
|
||||
WriteInt32(Convert.ToInt32(value));
|
||||
break;
|
||||
case "UInt32":
|
||||
WriteUInt32(Convert.ToUInt32(value));
|
||||
break;
|
||||
case "Int64":
|
||||
WriteInt64(Convert.ToInt64(value));
|
||||
break;
|
||||
case "UInt64":
|
||||
WriteUInt64(Convert.ToUInt64(value));
|
||||
break;
|
||||
}
|
||||
writeStream.Seek(retpos, SeekOrigin.Begin);
|
||||
}
|
||||
|
||||
public void WriteVector3(Vector3 pos)
|
||||
{
|
||||
WriteFloat(pos.X);
|
||||
WriteFloat(pos.Y);
|
||||
WriteFloat(pos.Z);
|
||||
}
|
||||
|
||||
public void WriteVector2(Vector2 pos)
|
||||
{
|
||||
WriteFloat(pos.X);
|
||||
WriteFloat(pos.Y);
|
||||
}
|
||||
|
||||
public void WritePackXYZ(Vector3 pos)
|
||||
{
|
||||
uint packed = 0;
|
||||
packed |= ((uint)(pos.X / 0.25f) & 0x7FF);
|
||||
packed |= ((uint)(pos.Y / 0.25f) & 0x7FF) << 11;
|
||||
packed |= ((uint)(pos.Z / 0.25f) & 0x3FF) << 22;
|
||||
WriteUInt32(packed);
|
||||
}
|
||||
|
||||
public bool WriteBit(object bit)
|
||||
{
|
||||
--BitPosition;
|
||||
|
||||
if (Convert.ToBoolean(bit))
|
||||
BitValue |= (byte)(1 << BitPosition);
|
||||
|
||||
if (BitPosition == 0)
|
||||
{
|
||||
writeStream.Write(BitValue);
|
||||
|
||||
BitPosition = 8;
|
||||
BitValue = 0;
|
||||
}
|
||||
return Convert.ToBoolean(bit);
|
||||
}
|
||||
|
||||
public void WriteBits(object bit, int count)
|
||||
{
|
||||
for (int i = count - 1; i >= 0; --i)
|
||||
WriteBit((Convert.ToInt32(bit) >> i) & 1);
|
||||
}
|
||||
|
||||
public void WritePackedTime(long time)
|
||||
{
|
||||
var now = Time.UnixTimeToDateTime(time);
|
||||
WriteUInt32(Convert.ToUInt32((now.Year - 2000) << 24 | (now.Month - 1) << 20 | (now.Day - 1) << 14 | (int)now.DayOfWeek << 11 | now.Hour << 6 | now.Minute));
|
||||
}
|
||||
|
||||
public void WritePackedTime()
|
||||
{
|
||||
DateTime now = DateTime.Now;
|
||||
WriteUInt32(Convert.ToUInt32((now.Year - 2000) << 24 | (now.Month - 1) << 20 | (now.Day - 1) << 14 | (int)now.DayOfWeek << 11 | now.Hour << 6 | now.Minute));
|
||||
}
|
||||
#endregion
|
||||
|
||||
public int GetPosition()
|
||||
{
|
||||
long pos = 0;
|
||||
if (writeStream != null)
|
||||
pos = writeStream.BaseStream.Position;
|
||||
else if (readStream != null)
|
||||
pos = readStream.BaseStream.Position;
|
||||
|
||||
return (int)pos;
|
||||
}
|
||||
|
||||
public void SetPosition(long pos)
|
||||
{
|
||||
if (writeStream != null)
|
||||
writeStream.BaseStream.Position = pos;
|
||||
else if (readStream != null)
|
||||
readStream.BaseStream.Position = pos;
|
||||
}
|
||||
|
||||
public void FlushBits()
|
||||
{
|
||||
if (BitPosition == 8)
|
||||
return;
|
||||
|
||||
writeStream.Write(BitValue);
|
||||
BitValue = 0;
|
||||
BitPosition = 8;
|
||||
}
|
||||
|
||||
public void ResetBitPos()
|
||||
{
|
||||
if (BitPosition > 7)
|
||||
return;
|
||||
|
||||
BitPosition = 8;
|
||||
BitValue = 0;
|
||||
}
|
||||
|
||||
public byte[] GetData()
|
||||
{
|
||||
long pos;
|
||||
Stream stream = GetCurrentStream();
|
||||
|
||||
var data = new byte[stream.Length];
|
||||
|
||||
pos = stream.Position;
|
||||
stream.Seek(0, SeekOrigin.Begin);
|
||||
for (int i = 0; i < data.Length; i++)
|
||||
data[i] = (byte)stream.ReadByte();
|
||||
|
||||
stream.Seek(pos, SeekOrigin.Begin);
|
||||
return data;
|
||||
}
|
||||
|
||||
public uint GetSize()
|
||||
{
|
||||
return (uint)GetCurrentStream().Length;
|
||||
}
|
||||
|
||||
public Stream GetCurrentStream()
|
||||
{
|
||||
if (writeStream != null)
|
||||
return writeStream.BaseStream;
|
||||
else
|
||||
return readStream.BaseStream;
|
||||
}
|
||||
|
||||
public void Clear()
|
||||
{
|
||||
BitPosition = 8;
|
||||
BitValue = 0;
|
||||
writeStream = new BinaryWriter(new MemoryStream());
|
||||
}
|
||||
|
||||
byte BitPosition = 8;
|
||||
byte BitValue;
|
||||
BinaryWriter writeStream;
|
||||
BinaryReader readStream;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,277 @@
|
||||
/*
|
||||
* Copyright (C) 2012-2017 CypherCore <http://github.com/CypherCore>
|
||||
*
|
||||
* This program 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.
|
||||
*
|
||||
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Diagnostics.Contracts;
|
||||
using System.Text.RegularExpressions;
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public sealed class StringArguments
|
||||
{
|
||||
public StringArguments(string args)
|
||||
{
|
||||
if (!args.IsEmpty())
|
||||
activestring = args.TrimStart(' ');
|
||||
activeposition = -1;
|
||||
}
|
||||
|
||||
public bool Empty()
|
||||
{
|
||||
return activestring.IsEmpty();
|
||||
}
|
||||
|
||||
public void MoveToNextChar(char c)
|
||||
{
|
||||
for (var i = activeposition; i < activestring.Length; ++i)
|
||||
if (activestring[i] == c)
|
||||
break;
|
||||
}
|
||||
|
||||
public string NextString(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return "";
|
||||
|
||||
Contract.Assume(Current != null);
|
||||
return Current;
|
||||
}
|
||||
|
||||
public bool NextBoolean(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return false;
|
||||
|
||||
bool value;
|
||||
if (bool.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
public char NextChar(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(char);
|
||||
|
||||
char value;
|
||||
if (char.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(char);
|
||||
}
|
||||
|
||||
public byte NextByte(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(byte);
|
||||
|
||||
byte value;
|
||||
if (byte.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(byte);
|
||||
}
|
||||
|
||||
public sbyte NextSByte(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(sbyte);
|
||||
|
||||
sbyte value;
|
||||
if (sbyte.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(sbyte);
|
||||
}
|
||||
|
||||
public ushort NextUInt16(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(ushort);
|
||||
|
||||
ushort value;
|
||||
if (ushort.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(ushort);
|
||||
}
|
||||
|
||||
public short NextInt16(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(short);
|
||||
|
||||
short value;
|
||||
if (short.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(short);
|
||||
}
|
||||
|
||||
public uint NextUInt32(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(uint);
|
||||
|
||||
uint value;
|
||||
if (uint.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(uint);
|
||||
}
|
||||
|
||||
public int NextInt32(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(int);
|
||||
|
||||
int value;
|
||||
if (int.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(int);
|
||||
}
|
||||
|
||||
public ulong NextUInt64(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(ulong);
|
||||
|
||||
ulong value;
|
||||
if (ulong.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(ulong);
|
||||
}
|
||||
|
||||
public long NextInt64(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(long);
|
||||
|
||||
long value;
|
||||
if (long.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(long);
|
||||
}
|
||||
|
||||
public float NextSingle(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(float);
|
||||
|
||||
float value;
|
||||
if (float.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(float);
|
||||
}
|
||||
|
||||
public double NextDouble(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(double);
|
||||
|
||||
double value;
|
||||
if (double.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(double);
|
||||
}
|
||||
|
||||
public decimal NextDecimal(string delimiters = " ")
|
||||
{
|
||||
if (!MoveNext(delimiters))
|
||||
return default(decimal);
|
||||
|
||||
decimal value;
|
||||
if (decimal.TryParse(Current, out value))
|
||||
return value;
|
||||
|
||||
return default(decimal);
|
||||
}
|
||||
|
||||
public void AlignToNextChar()
|
||||
{
|
||||
while (activeposition < activestring.Length && activestring[activeposition] != ' ')
|
||||
activeposition++;
|
||||
}
|
||||
|
||||
public char this[int index]
|
||||
{
|
||||
get { return activestring[index]; }
|
||||
}
|
||||
|
||||
public string GetString()
|
||||
{
|
||||
return activestring;
|
||||
}
|
||||
|
||||
public void Reset()
|
||||
{
|
||||
activeposition = -1;
|
||||
Current = null;
|
||||
}
|
||||
|
||||
bool MoveNext(string delimiters)
|
||||
{
|
||||
//the stringtotokenize was never set:
|
||||
if (activestring == null)
|
||||
return false;
|
||||
|
||||
//all tokens have already been extracted:
|
||||
if (activeposition == activestring.Length)
|
||||
return false;
|
||||
|
||||
//bypass delimiters:
|
||||
activeposition++;
|
||||
while (activeposition < activestring.Length && delimiters.IndexOf(activestring[activeposition]) > -1)
|
||||
{
|
||||
activeposition++;
|
||||
}
|
||||
|
||||
//only delimiters were left, so return null:
|
||||
if (activeposition == activestring.Length)
|
||||
return false;
|
||||
|
||||
//get starting position of string to return:
|
||||
int startingposition = activeposition;
|
||||
|
||||
//read until next delimiter:
|
||||
do
|
||||
{
|
||||
activeposition++;
|
||||
} while (activeposition < activestring.Length && delimiters.IndexOf(activestring[activeposition]) == -1);
|
||||
|
||||
Current = activestring.Substring(startingposition, activeposition - startingposition);
|
||||
return true;
|
||||
}
|
||||
|
||||
bool Match(string pattern, out Match m)
|
||||
{
|
||||
Regex r = new Regex(pattern);
|
||||
m = r.Match(activestring);
|
||||
return m.Success;
|
||||
}
|
||||
|
||||
private string activestring;
|
||||
private int activeposition;
|
||||
private string Current;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,167 @@
|
||||
// adler32.cs -- compute the Adler-32 checksum of a data stream
|
||||
// Copyright (C) 1995-2007 Mark Adler
|
||||
// Copyright (C) 2007-2011 by the Authors
|
||||
// For conditions of distribution and use, see copyright notice in License.txt
|
||||
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public static partial class ZLib
|
||||
{
|
||||
private const uint BASE=65521; // largest prime smaller than 65536
|
||||
private const uint NMAX=5552; // NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// Update a running Adler-32 checksum with the bytes buf[0..len-1] and return the updated checksum.
|
||||
// If buf is NULL, this function returns the required initial value for the checksum.
|
||||
// An Adler-32 checksum is almost as reliable as a CRC32 but can be computed much faster.
|
||||
//
|
||||
// Usage example:
|
||||
// uint adler=adler32(0, null, 0);
|
||||
// while(read_buffer(buffer, length)!=EOF)
|
||||
// {
|
||||
// adler=adler32(adler, buffer, length);
|
||||
// }
|
||||
// if(adler!=original_adler) error();
|
||||
|
||||
public static uint adler32(uint adler, byte[] buf, uint len)
|
||||
{
|
||||
return adler32(adler, buf, 0, len);
|
||||
}
|
||||
|
||||
public static uint adler32(uint adler, byte[] buf, uint ind, uint len)
|
||||
{
|
||||
// initial Adler-32 value (deferred check for len==1 speed)
|
||||
if(buf==null) return 1;
|
||||
|
||||
// split Adler-32 into component sums
|
||||
uint sum2=(adler>>16)&0xffff;
|
||||
adler&=0xffff;
|
||||
|
||||
//uint ind=0; // index in buf
|
||||
|
||||
// in case user likes doing a byte at a time, keep it fast
|
||||
if(len==1)
|
||||
{
|
||||
adler+=buf[ind];
|
||||
if(adler>=BASE) adler-=BASE;
|
||||
sum2+=adler;
|
||||
if(sum2>=BASE) sum2-=BASE;
|
||||
return adler|(sum2<<16);
|
||||
}
|
||||
|
||||
// in case short lengths are provided, keep it somewhat fast
|
||||
if(len<16)
|
||||
{
|
||||
while(len--!=0)
|
||||
{
|
||||
adler+=buf[ind++];
|
||||
sum2+=adler;
|
||||
}
|
||||
if(adler>=BASE) adler-=BASE;
|
||||
sum2%=BASE; // only added so many BASE's
|
||||
return adler|(sum2<<16);
|
||||
}
|
||||
|
||||
// do length NMAX blocks -- requires just one modulo operation
|
||||
while(len>=NMAX)
|
||||
{
|
||||
len-=NMAX;
|
||||
uint n=NMAX/16; // NMAX is divisible by 16
|
||||
do
|
||||
{
|
||||
// 16 sums unrolled
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
} while(--n!=0);
|
||||
|
||||
adler%=BASE;
|
||||
sum2%=BASE;
|
||||
}
|
||||
|
||||
// do remaining bytes (less than NMAX, still just one modulo)
|
||||
if(len!=0)
|
||||
{ // avoid modulos if none remaining
|
||||
while(len>=16)
|
||||
{
|
||||
len-=16;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
adler+=buf[ind++]; sum2+=adler;
|
||||
}
|
||||
|
||||
while(len--!=0)
|
||||
{
|
||||
adler+=buf[ind++];
|
||||
sum2+=adler;
|
||||
}
|
||||
|
||||
adler%=BASE;
|
||||
sum2%=BASE;
|
||||
}
|
||||
|
||||
// return recombined sums
|
||||
return adler|(sum2<<16);
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// Combine two Adler-32 checksums into one. For two sequences of bytes, seq1
|
||||
// and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
|
||||
// each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of
|
||||
// seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.
|
||||
|
||||
public static uint adler32_combine_(uint adler1, uint adler2, uint len2)
|
||||
{ // the derivation of this formula is left as an exercise for the reader
|
||||
uint rem=len2%BASE;
|
||||
uint sum1=adler1&0xffff;
|
||||
uint sum2=(rem*sum1)%BASE;
|
||||
sum1+=(adler2&0xffff)+BASE-1;
|
||||
sum2+=((adler1>>16)&0xffff)+((adler2>>16)&0xffff)+BASE-rem;
|
||||
if(sum1>=BASE) sum1-=BASE;
|
||||
if(sum1>=BASE) sum1-=BASE;
|
||||
if(sum2>=(BASE<<1)) sum2-=(BASE<<1);
|
||||
if(sum2>=BASE) sum2-=BASE;
|
||||
return sum1|(sum2<<16);
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
public static uint adler32_combine(uint adler1, uint adler2, uint len2)
|
||||
{
|
||||
return adler32_combine_(adler1, adler2, len2);
|
||||
}
|
||||
|
||||
public static uint adler32_combine64(uint adler1, uint adler2, uint len2)
|
||||
{
|
||||
return adler32_combine_(adler1, adler2, len2);
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,368 @@
|
||||
// CRC32.cs -- compute the CRC-32 of a data stream
|
||||
// Copyright (C) 1995-2006, 2010 Mark Adler
|
||||
// Copyright (C) 2007-2011 by the Authors
|
||||
// For conditions of distribution and use, see copyright notice in License.txt
|
||||
|
||||
// Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster
|
||||
// CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
|
||||
// tables for updating the shift register in one step with three exclusive-ors
|
||||
// instead of four steps with four exclusive-ors.
|
||||
|
||||
// Note on DYNAMIC_CRC_TABLE: Dynamic generation of CRC table has been removed
|
||||
// in this port. The original source contained a compiler switch to use either
|
||||
// the dynamic generation of the CRC table or a pregenerated source code version
|
||||
// of the table. This port uses the pregenerated source code version.
|
||||
|
||||
#define SAFE_VERSION
|
||||
|
||||
using System;
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public static partial class ZLib
|
||||
{
|
||||
#region crc_table
|
||||
private static readonly uint[,] crc_table=new uint[,]
|
||||
{
|
||||
{
|
||||
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,
|
||||
0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,
|
||||
0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
|
||||
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,
|
||||
0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
|
||||
0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
|
||||
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,
|
||||
0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924, 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,
|
||||
0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
|
||||
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
|
||||
0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,
|
||||
0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
|
||||
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,
|
||||
0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,
|
||||
0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
|
||||
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,
|
||||
0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,
|
||||
0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
|
||||
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,
|
||||
0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
|
||||
0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
|
||||
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,
|
||||
0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236, 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,
|
||||
0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
|
||||
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
|
||||
0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,
|
||||
0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
|
||||
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,
|
||||
0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,
|
||||
0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
|
||||
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,
|
||||
0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
|
||||
#if !SAFE_VERSION
|
||||
},
|
||||
{
|
||||
0x00000000, 0x191b3141, 0x32366282, 0x2b2d53c3, 0x646cc504, 0x7d77f445, 0x565aa786, 0x4f4196c7,
|
||||
0xc8d98a08, 0xd1c2bb49, 0xfaefe88a, 0xe3f4d9cb, 0xacb54f0c, 0xb5ae7e4d, 0x9e832d8e, 0x87981ccf,
|
||||
0x4ac21251, 0x53d92310, 0x78f470d3, 0x61ef4192, 0x2eaed755, 0x37b5e614, 0x1c98b5d7, 0x05838496,
|
||||
0x821b9859, 0x9b00a918, 0xb02dfadb, 0xa936cb9a, 0xe6775d5d, 0xff6c6c1c, 0xd4413fdf, 0xcd5a0e9e,
|
||||
0x958424a2, 0x8c9f15e3, 0xa7b24620, 0xbea97761, 0xf1e8e1a6, 0xe8f3d0e7, 0xc3de8324, 0xdac5b265,
|
||||
0x5d5daeaa, 0x44469feb, 0x6f6bcc28, 0x7670fd69, 0x39316bae, 0x202a5aef, 0x0b07092c, 0x121c386d,
|
||||
0xdf4636f3, 0xc65d07b2, 0xed705471, 0xf46b6530, 0xbb2af3f7, 0xa231c2b6, 0x891c9175, 0x9007a034,
|
||||
0x179fbcfb, 0x0e848dba, 0x25a9de79, 0x3cb2ef38, 0x73f379ff, 0x6ae848be, 0x41c51b7d, 0x58de2a3c,
|
||||
0xf0794f05, 0xe9627e44, 0xc24f2d87, 0xdb541cc6, 0x94158a01, 0x8d0ebb40, 0xa623e883, 0xbf38d9c2,
|
||||
0x38a0c50d, 0x21bbf44c, 0x0a96a78f, 0x138d96ce, 0x5ccc0009, 0x45d73148, 0x6efa628b, 0x77e153ca,
|
||||
0xbabb5d54, 0xa3a06c15, 0x888d3fd6, 0x91960e97, 0xded79850, 0xc7cca911, 0xece1fad2, 0xf5facb93,
|
||||
0x7262d75c, 0x6b79e61d, 0x4054b5de, 0x594f849f, 0x160e1258, 0x0f152319, 0x243870da, 0x3d23419b,
|
||||
0x65fd6ba7, 0x7ce65ae6, 0x57cb0925, 0x4ed03864, 0x0191aea3, 0x188a9fe2, 0x33a7cc21, 0x2abcfd60,
|
||||
0xad24e1af, 0xb43fd0ee, 0x9f12832d, 0x8609b26c, 0xc94824ab, 0xd05315ea, 0xfb7e4629, 0xe2657768,
|
||||
0x2f3f79f6, 0x362448b7, 0x1d091b74, 0x04122a35, 0x4b53bcf2, 0x52488db3, 0x7965de70, 0x607eef31,
|
||||
0xe7e6f3fe, 0xfefdc2bf, 0xd5d0917c, 0xcccba03d, 0x838a36fa, 0x9a9107bb, 0xb1bc5478, 0xa8a76539,
|
||||
0x3b83984b, 0x2298a90a, 0x09b5fac9, 0x10aecb88, 0x5fef5d4f, 0x46f46c0e, 0x6dd93fcd, 0x74c20e8c,
|
||||
0xf35a1243, 0xea412302, 0xc16c70c1, 0xd8774180, 0x9736d747, 0x8e2de606, 0xa500b5c5, 0xbc1b8484,
|
||||
0x71418a1a, 0x685abb5b, 0x4377e898, 0x5a6cd9d9, 0x152d4f1e, 0x0c367e5f, 0x271b2d9c, 0x3e001cdd,
|
||||
0xb9980012, 0xa0833153, 0x8bae6290, 0x92b553d1, 0xddf4c516, 0xc4eff457, 0xefc2a794, 0xf6d996d5,
|
||||
0xae07bce9, 0xb71c8da8, 0x9c31de6b, 0x852aef2a, 0xca6b79ed, 0xd37048ac, 0xf85d1b6f, 0xe1462a2e,
|
||||
0x66de36e1, 0x7fc507a0, 0x54e85463, 0x4df36522, 0x02b2f3e5, 0x1ba9c2a4, 0x30849167, 0x299fa026,
|
||||
0xe4c5aeb8, 0xfdde9ff9, 0xd6f3cc3a, 0xcfe8fd7b, 0x80a96bbc, 0x99b25afd, 0xb29f093e, 0xab84387f,
|
||||
0x2c1c24b0, 0x350715f1, 0x1e2a4632, 0x07317773, 0x4870e1b4, 0x516bd0f5, 0x7a468336, 0x635db277,
|
||||
0xcbfad74e, 0xd2e1e60f, 0xf9ccb5cc, 0xe0d7848d, 0xaf96124a, 0xb68d230b, 0x9da070c8, 0x84bb4189,
|
||||
0x03235d46, 0x1a386c07, 0x31153fc4, 0x280e0e85, 0x674f9842, 0x7e54a903, 0x5579fac0, 0x4c62cb81,
|
||||
0x8138c51f, 0x9823f45e, 0xb30ea79d, 0xaa1596dc, 0xe554001b, 0xfc4f315a, 0xd7626299, 0xce7953d8,
|
||||
0x49e14f17, 0x50fa7e56, 0x7bd72d95, 0x62cc1cd4, 0x2d8d8a13, 0x3496bb52, 0x1fbbe891, 0x06a0d9d0,
|
||||
0x5e7ef3ec, 0x4765c2ad, 0x6c48916e, 0x7553a02f, 0x3a1236e8, 0x230907a9, 0x0824546a, 0x113f652b,
|
||||
0x96a779e4, 0x8fbc48a5, 0xa4911b66, 0xbd8a2a27, 0xf2cbbce0, 0xebd08da1, 0xc0fdde62, 0xd9e6ef23,
|
||||
0x14bce1bd, 0x0da7d0fc, 0x268a833f, 0x3f91b27e, 0x70d024b9, 0x69cb15f8, 0x42e6463b, 0x5bfd777a,
|
||||
0xdc656bb5, 0xc57e5af4, 0xee530937, 0xf7483876, 0xb809aeb1, 0xa1129ff0, 0x8a3fcc33, 0x9324fd72
|
||||
},
|
||||
{
|
||||
0x00000000, 0x01c26a37, 0x0384d46e, 0x0246be59, 0x0709a8dc, 0x06cbc2eb, 0x048d7cb2, 0x054f1685,
|
||||
0x0e1351b8, 0x0fd13b8f, 0x0d9785d6, 0x0c55efe1, 0x091af964, 0x08d89353, 0x0a9e2d0a, 0x0b5c473d,
|
||||
0x1c26a370, 0x1de4c947, 0x1fa2771e, 0x1e601d29, 0x1b2f0bac, 0x1aed619b, 0x18abdfc2, 0x1969b5f5,
|
||||
0x1235f2c8, 0x13f798ff, 0x11b126a6, 0x10734c91, 0x153c5a14, 0x14fe3023, 0x16b88e7a, 0x177ae44d,
|
||||
0x384d46e0, 0x398f2cd7, 0x3bc9928e, 0x3a0bf8b9, 0x3f44ee3c, 0x3e86840b, 0x3cc03a52, 0x3d025065,
|
||||
0x365e1758, 0x379c7d6f, 0x35dac336, 0x3418a901, 0x3157bf84, 0x3095d5b3, 0x32d36bea, 0x331101dd,
|
||||
0x246be590, 0x25a98fa7, 0x27ef31fe, 0x262d5bc9, 0x23624d4c, 0x22a0277b, 0x20e69922, 0x2124f315,
|
||||
0x2a78b428, 0x2bbade1f, 0x29fc6046, 0x283e0a71, 0x2d711cf4, 0x2cb376c3, 0x2ef5c89a, 0x2f37a2ad,
|
||||
0x709a8dc0, 0x7158e7f7, 0x731e59ae, 0x72dc3399, 0x7793251c, 0x76514f2b, 0x7417f172, 0x75d59b45,
|
||||
0x7e89dc78, 0x7f4bb64f, 0x7d0d0816, 0x7ccf6221, 0x798074a4, 0x78421e93, 0x7a04a0ca, 0x7bc6cafd,
|
||||
0x6cbc2eb0, 0x6d7e4487, 0x6f38fade, 0x6efa90e9, 0x6bb5866c, 0x6a77ec5b, 0x68315202, 0x69f33835,
|
||||
0x62af7f08, 0x636d153f, 0x612bab66, 0x60e9c151, 0x65a6d7d4, 0x6464bde3, 0x662203ba, 0x67e0698d,
|
||||
0x48d7cb20, 0x4915a117, 0x4b531f4e, 0x4a917579, 0x4fde63fc, 0x4e1c09cb, 0x4c5ab792, 0x4d98dda5,
|
||||
0x46c49a98, 0x4706f0af, 0x45404ef6, 0x448224c1, 0x41cd3244, 0x400f5873, 0x4249e62a, 0x438b8c1d,
|
||||
0x54f16850, 0x55330267, 0x5775bc3e, 0x56b7d609, 0x53f8c08c, 0x523aaabb, 0x507c14e2, 0x51be7ed5,
|
||||
0x5ae239e8, 0x5b2053df, 0x5966ed86, 0x58a487b1, 0x5deb9134, 0x5c29fb03, 0x5e6f455a, 0x5fad2f6d,
|
||||
0xe1351b80, 0xe0f771b7, 0xe2b1cfee, 0xe373a5d9, 0xe63cb35c, 0xe7fed96b, 0xe5b86732, 0xe47a0d05,
|
||||
0xef264a38, 0xeee4200f, 0xeca29e56, 0xed60f461, 0xe82fe2e4, 0xe9ed88d3, 0xebab368a, 0xea695cbd,
|
||||
0xfd13b8f0, 0xfcd1d2c7, 0xfe976c9e, 0xff5506a9, 0xfa1a102c, 0xfbd87a1b, 0xf99ec442, 0xf85cae75,
|
||||
0xf300e948, 0xf2c2837f, 0xf0843d26, 0xf1465711, 0xf4094194, 0xf5cb2ba3, 0xf78d95fa, 0xf64fffcd,
|
||||
0xd9785d60, 0xd8ba3757, 0xdafc890e, 0xdb3ee339, 0xde71f5bc, 0xdfb39f8b, 0xddf521d2, 0xdc374be5,
|
||||
0xd76b0cd8, 0xd6a966ef, 0xd4efd8b6, 0xd52db281, 0xd062a404, 0xd1a0ce33, 0xd3e6706a, 0xd2241a5d,
|
||||
0xc55efe10, 0xc49c9427, 0xc6da2a7e, 0xc7184049, 0xc25756cc, 0xc3953cfb, 0xc1d382a2, 0xc011e895,
|
||||
0xcb4dafa8, 0xca8fc59f, 0xc8c97bc6, 0xc90b11f1, 0xcc440774, 0xcd866d43, 0xcfc0d31a, 0xce02b92d,
|
||||
0x91af9640, 0x906dfc77, 0x922b422e, 0x93e92819, 0x96a63e9c, 0x976454ab, 0x9522eaf2, 0x94e080c5,
|
||||
0x9fbcc7f8, 0x9e7eadcf, 0x9c381396, 0x9dfa79a1, 0x98b56f24, 0x99770513, 0x9b31bb4a, 0x9af3d17d,
|
||||
0x8d893530, 0x8c4b5f07, 0x8e0de15e, 0x8fcf8b69, 0x8a809dec, 0x8b42f7db, 0x89044982, 0x88c623b5,
|
||||
0x839a6488, 0x82580ebf, 0x801eb0e6, 0x81dcdad1, 0x8493cc54, 0x8551a663, 0x8717183a, 0x86d5720d,
|
||||
0xa9e2d0a0, 0xa820ba97, 0xaa6604ce, 0xaba46ef9, 0xaeeb787c, 0xaf29124b, 0xad6fac12, 0xacadc625,
|
||||
0xa7f18118, 0xa633eb2f, 0xa4755576, 0xa5b73f41, 0xa0f829c4, 0xa13a43f3, 0xa37cfdaa, 0xa2be979d,
|
||||
0xb5c473d0, 0xb40619e7, 0xb640a7be, 0xb782cd89, 0xb2cddb0c, 0xb30fb13b, 0xb1490f62, 0xb08b6555,
|
||||
0xbbd72268, 0xba15485f, 0xb853f606, 0xb9919c31, 0xbcde8ab4, 0xbd1ce083, 0xbf5a5eda, 0xbe9834ed
|
||||
},
|
||||
{
|
||||
0x00000000, 0xb8bc6765, 0xaa09c88b, 0x12b5afee, 0x8f629757, 0x37def032, 0x256b5fdc, 0x9dd738b9,
|
||||
0xc5b428ef, 0x7d084f8a, 0x6fbde064, 0xd7018701, 0x4ad6bfb8, 0xf26ad8dd, 0xe0df7733, 0x58631056,
|
||||
0x5019579f, 0xe8a530fa, 0xfa109f14, 0x42acf871, 0xdf7bc0c8, 0x67c7a7ad, 0x75720843, 0xcdce6f26,
|
||||
0x95ad7f70, 0x2d111815, 0x3fa4b7fb, 0x8718d09e, 0x1acfe827, 0xa2738f42, 0xb0c620ac, 0x087a47c9,
|
||||
0xa032af3e, 0x188ec85b, 0x0a3b67b5, 0xb28700d0, 0x2f503869, 0x97ec5f0c, 0x8559f0e2, 0x3de59787,
|
||||
0x658687d1, 0xdd3ae0b4, 0xcf8f4f5a, 0x7733283f, 0xeae41086, 0x525877e3, 0x40edd80d, 0xf851bf68,
|
||||
0xf02bf8a1, 0x48979fc4, 0x5a22302a, 0xe29e574f, 0x7f496ff6, 0xc7f50893, 0xd540a77d, 0x6dfcc018,
|
||||
0x359fd04e, 0x8d23b72b, 0x9f9618c5, 0x272a7fa0, 0xbafd4719, 0x0241207c, 0x10f48f92, 0xa848e8f7,
|
||||
0x9b14583d, 0x23a83f58, 0x311d90b6, 0x89a1f7d3, 0x1476cf6a, 0xaccaa80f, 0xbe7f07e1, 0x06c36084,
|
||||
0x5ea070d2, 0xe61c17b7, 0xf4a9b859, 0x4c15df3c, 0xd1c2e785, 0x697e80e0, 0x7bcb2f0e, 0xc377486b,
|
||||
0xcb0d0fa2, 0x73b168c7, 0x6104c729, 0xd9b8a04c, 0x446f98f5, 0xfcd3ff90, 0xee66507e, 0x56da371b,
|
||||
0x0eb9274d, 0xb6054028, 0xa4b0efc6, 0x1c0c88a3, 0x81dbb01a, 0x3967d77f, 0x2bd27891, 0x936e1ff4,
|
||||
0x3b26f703, 0x839a9066, 0x912f3f88, 0x299358ed, 0xb4446054, 0x0cf80731, 0x1e4da8df, 0xa6f1cfba,
|
||||
0xfe92dfec, 0x462eb889, 0x549b1767, 0xec277002, 0x71f048bb, 0xc94c2fde, 0xdbf98030, 0x6345e755,
|
||||
0x6b3fa09c, 0xd383c7f9, 0xc1366817, 0x798a0f72, 0xe45d37cb, 0x5ce150ae, 0x4e54ff40, 0xf6e89825,
|
||||
0xae8b8873, 0x1637ef16, 0x048240f8, 0xbc3e279d, 0x21e91f24, 0x99557841, 0x8be0d7af, 0x335cb0ca,
|
||||
0xed59b63b, 0x55e5d15e, 0x47507eb0, 0xffec19d5, 0x623b216c, 0xda874609, 0xc832e9e7, 0x708e8e82,
|
||||
0x28ed9ed4, 0x9051f9b1, 0x82e4565f, 0x3a58313a, 0xa78f0983, 0x1f336ee6, 0x0d86c108, 0xb53aa66d,
|
||||
0xbd40e1a4, 0x05fc86c1, 0x1749292f, 0xaff54e4a, 0x322276f3, 0x8a9e1196, 0x982bbe78, 0x2097d91d,
|
||||
0x78f4c94b, 0xc048ae2e, 0xd2fd01c0, 0x6a4166a5, 0xf7965e1c, 0x4f2a3979, 0x5d9f9697, 0xe523f1f2,
|
||||
0x4d6b1905, 0xf5d77e60, 0xe762d18e, 0x5fdeb6eb, 0xc2098e52, 0x7ab5e937, 0x680046d9, 0xd0bc21bc,
|
||||
0x88df31ea, 0x3063568f, 0x22d6f961, 0x9a6a9e04, 0x07bda6bd, 0xbf01c1d8, 0xadb46e36, 0x15080953,
|
||||
0x1d724e9a, 0xa5ce29ff, 0xb77b8611, 0x0fc7e174, 0x9210d9cd, 0x2aacbea8, 0x38191146, 0x80a57623,
|
||||
0xd8c66675, 0x607a0110, 0x72cfaefe, 0xca73c99b, 0x57a4f122, 0xef189647, 0xfdad39a9, 0x45115ecc,
|
||||
0x764dee06, 0xcef18963, 0xdc44268d, 0x64f841e8, 0xf92f7951, 0x41931e34, 0x5326b1da, 0xeb9ad6bf,
|
||||
0xb3f9c6e9, 0x0b45a18c, 0x19f00e62, 0xa14c6907, 0x3c9b51be, 0x842736db, 0x96929935, 0x2e2efe50,
|
||||
0x2654b999, 0x9ee8defc, 0x8c5d7112, 0x34e11677, 0xa9362ece, 0x118a49ab, 0x033fe645, 0xbb838120,
|
||||
0xe3e09176, 0x5b5cf613, 0x49e959fd, 0xf1553e98, 0x6c820621, 0xd43e6144, 0xc68bceaa, 0x7e37a9cf,
|
||||
0xd67f4138, 0x6ec3265d, 0x7c7689b3, 0xc4caeed6, 0x591dd66f, 0xe1a1b10a, 0xf3141ee4, 0x4ba87981,
|
||||
0x13cb69d7, 0xab770eb2, 0xb9c2a15c, 0x017ec639, 0x9ca9fe80, 0x241599e5, 0x36a0360b, 0x8e1c516e,
|
||||
0x866616a7, 0x3eda71c2, 0x2c6fde2c, 0x94d3b949, 0x090481f0, 0xb1b8e695, 0xa30d497b, 0x1bb12e1e,
|
||||
0x43d23e48, 0xfb6e592d, 0xe9dbf6c3, 0x516791a6, 0xccb0a91f, 0x740cce7a, 0x66b96194, 0xde0506f1
|
||||
#endif
|
||||
}
|
||||
};
|
||||
#endregion
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// Update a running CRC-32 with the bytes buf[0..len-1] and return the
|
||||
// updated CRC-32. If buf is NULL, this function returns the required initial
|
||||
// value for the for the crc. Pre- and post-conditioning (one's complement) is
|
||||
// performed within this function so it shouldn't be done by the application.
|
||||
// Usage example:
|
||||
//
|
||||
// ulong crc = 0;
|
||||
// while(read_buffer(buffer, length)!=EOF) crc=crc32(crc, buffer);
|
||||
// if(crc!=original_crc) error();
|
||||
|
||||
public static uint crc32(uint crc, byte[] bytes, long count)
|
||||
{
|
||||
return crc32(crc, bytes, 0, count);
|
||||
}
|
||||
|
||||
#if SAFE_VERSION
|
||||
public static uint crc32(uint crc, byte[] bytes, long startIndex, long count)
|
||||
{
|
||||
if(bytes==null) return 0;
|
||||
if(startIndex<0) throw new ArgumentOutOfRangeException("startIndex", "<0");
|
||||
if(count<0) throw new ArgumentOutOfRangeException("count", "<0");
|
||||
|
||||
long len=startIndex+count;
|
||||
if(len>bytes.LongLength) throw new ArgumentOutOfRangeException("startIndex+count", ">bytes.Length");
|
||||
|
||||
long ind=startIndex;
|
||||
|
||||
crc=~crc;
|
||||
while(len>=8)
|
||||
{
|
||||
// 8 calculations unrolled
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
len-=8;
|
||||
}
|
||||
|
||||
if(len!=0)
|
||||
{
|
||||
do
|
||||
{
|
||||
crc=crc_table[0, (crc^bytes[ind++])&0xff]^(crc>>8);
|
||||
} while(--len!=0);
|
||||
}
|
||||
return ~crc;
|
||||
}
|
||||
#else
|
||||
public static uint crc32(uint crc, byte[] bytes, long startIndex, long count)
|
||||
{
|
||||
if(bytes==null) return 0;
|
||||
if(startIndex<0) throw new ArgumentOutOfRangeException("startIndex", "<0");
|
||||
if(count<0) throw new ArgumentOutOfRangeException("count", "<0");
|
||||
|
||||
long len=startIndex+count;
|
||||
if(len>bytes.LongLength) throw new ArgumentOutOfRangeException("startIndex+count", ">bytes.Length");
|
||||
|
||||
long ind=startIndex;
|
||||
|
||||
uint c=~crc;
|
||||
|
||||
if(len>=4)
|
||||
{
|
||||
unsafe
|
||||
{
|
||||
fixed(byte* buf_=bytes)
|
||||
{
|
||||
uint* buf4=(uint*)buf_;
|
||||
|
||||
while(len>=32)
|
||||
{
|
||||
// 8 calculations unrolled
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
ind+=32;
|
||||
len-=32;
|
||||
}
|
||||
|
||||
while(len>=4)
|
||||
{
|
||||
c^=*buf4++; c=crc_table[3, c&0xff]^crc_table[2, (c>>8)&0xff]^crc_table[1, (c>>16)&0xff]^crc_table[0, c>>24];
|
||||
ind+=4;
|
||||
len-=4;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if(len!=0)
|
||||
{
|
||||
do
|
||||
{
|
||||
c=crc_table[0, (c^bytes[ind++])&0xff]^(c>>8);
|
||||
} while(--len!=0);
|
||||
}
|
||||
|
||||
return ~c;
|
||||
}
|
||||
#endif
|
||||
|
||||
// =========================================================================
|
||||
|
||||
private const uint GF2_DIM=32; // dimension of GF(2) vectors (length of CRC)
|
||||
|
||||
// =========================================================================
|
||||
|
||||
static uint gf2_matrix_times(uint[] mat, uint vec)
|
||||
{
|
||||
uint sum=0;
|
||||
int ind=0;
|
||||
while(vec!=0)
|
||||
{
|
||||
if((vec&1)!=0) sum^=mat[ind];
|
||||
vec>>=1;
|
||||
ind++;
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
|
||||
static void gf2_matrix_square(uint[] square, uint[] mat)
|
||||
{
|
||||
for(int n=0; n<GF2_DIM; n++) square[n]=gf2_matrix_times(mat, mat[n]);
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// Combine two CRC-32 check values into one. For two sequences of bytes,
|
||||
// seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
|
||||
// calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32
|
||||
// check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and
|
||||
// len2.
|
||||
|
||||
public static uint crc32_combine_(uint crc1, uint crc2, long count)
|
||||
{
|
||||
if(count<0) throw new ArgumentOutOfRangeException("count", "<0");
|
||||
|
||||
// degenerate case (also disallow negative lengths)
|
||||
if(count<=0) return crc1;
|
||||
|
||||
uint[] even=new uint[GF2_DIM]; // even-power-of-two zeros operator
|
||||
uint[] odd=new uint[GF2_DIM]; // odd-power-of-two zeros operator
|
||||
|
||||
// put operator for one zero bit in odd
|
||||
odd[0]=0xedb88320; // CRC-32 polynomial
|
||||
|
||||
for(uint n=1, row=1; n<GF2_DIM; n++, row<<=1) odd[n]=row;
|
||||
|
||||
// put operator for two zero bits in even
|
||||
gf2_matrix_square(even, odd);
|
||||
|
||||
// put operator for four zero bits in odd
|
||||
gf2_matrix_square(odd, even);
|
||||
|
||||
// apply len2 zeros to crc1 (first square will put the operator for one
|
||||
// zero byte, eight zero bits, in even)
|
||||
do
|
||||
{
|
||||
// apply zeros operator for this bit of len2
|
||||
gf2_matrix_square(even, odd);
|
||||
if((count&1)!=0) crc1=gf2_matrix_times(even, crc1);
|
||||
count>>=1;
|
||||
|
||||
// if no more bits set, then done
|
||||
if(count==0) break;
|
||||
|
||||
// another iteration of the loop with odd and even swapped
|
||||
gf2_matrix_square(odd, even);
|
||||
if((count&1)!=0) crc1=gf2_matrix_times(odd, crc1);
|
||||
count>>=1;
|
||||
} while(count!=0); // if no more bits set, then done
|
||||
|
||||
// return combined crc
|
||||
return crc1^crc2;
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
public static uint crc32_combine(uint crc1, uint crc2, long count)
|
||||
{
|
||||
return crc32_combine_(crc1, crc2, count);
|
||||
}
|
||||
|
||||
public static uint crc32_combine64(uint crc1, uint crc2, long count)
|
||||
{
|
||||
return crc32_combine_(crc1, crc2, count);
|
||||
}
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,170 @@
|
||||
// zlib.cs -- interface of the 'zlib' general purpose compression library
|
||||
// Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler
|
||||
// Copyright (C) 2007-2011 by the Authors
|
||||
// For conditions of distribution and use, see copyright notice in License.txt
|
||||
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public static partial class ZLib
|
||||
{
|
||||
// Maximum value for memLevel in deflateInit2
|
||||
private const int MAX_MEM_LEVEL=9;
|
||||
|
||||
// Maximum value for windowBits in deflateInit2 and inflateInit2.
|
||||
private const int MAX_WBITS=15; // 32K LZ77 window
|
||||
private const int DEF_WBITS=MAX_WBITS; // default windowBits for decompression. MAX_WBITS is for compression only
|
||||
|
||||
// The memory requirements for deflate are (in bytes):
|
||||
// (1 << (windowBits+2)) + (1 << (memLevel+9))
|
||||
// that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)
|
||||
// plus a few kilobytes for small objects. For example, if you want to reduce
|
||||
// the default memory requirements from 256K to 128K, compile with
|
||||
// make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
|
||||
// Of course this will generally degrade compression (there's no free lunch).
|
||||
|
||||
// The memory requirements for inflate are (in bytes) 1 << windowBits
|
||||
// that is, 32K for windowBits=15 (default value) plus a few kilobytes
|
||||
// for small objects.
|
||||
|
||||
private const int DEF_MEM_LEVEL=8; // default memLevel
|
||||
|
||||
// The three kinds of block type
|
||||
private const int STORED_BLOCK=0;
|
||||
private const int STATIC_TREES=1;
|
||||
private const int DYN_TREES=2;
|
||||
|
||||
// The minimum and maximum match lengths
|
||||
private const int MIN_MATCH=3;
|
||||
private const int MAX_MATCH=258;
|
||||
|
||||
public const string ZLIB_VERSION="1.2.5";
|
||||
public const uint ZLIB_VERNUM=0x1250;
|
||||
|
||||
// The 'zlib' compression library provides in-memory compression and
|
||||
// decompression functions, including integrity checks of the uncompressed
|
||||
// data. This version of the library supports only one compression method
|
||||
// (deflation) but other algorithms will be added later and will have the same
|
||||
// stream interface.
|
||||
//
|
||||
// Compression can be done in a single step if the buffers are large enough,
|
||||
// or can be done by repeated calls of the compression function. In the latter
|
||||
// case, the application must provide more input and/or consume the output
|
||||
// (providing more output space) before each call.
|
||||
//
|
||||
// The compressed data format used by default by the in-memory functions is
|
||||
// the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped
|
||||
// around a deflate stream, which is itself documented in RFC 1951.
|
||||
//
|
||||
// The zlib format was designed to be compact and fast for use in memory
|
||||
// and on communications channels.
|
||||
//
|
||||
// The library does not install any signal handler. The decoder checks
|
||||
// the consistency of the compressed data, so the library should never crash
|
||||
// even in case of corrupted input.
|
||||
|
||||
public class z_stream
|
||||
{
|
||||
public byte[] in_buf; // input buffer
|
||||
public uint next_in; // next input byte index
|
||||
public uint avail_in; // number of bytes available at next_in
|
||||
public uint total_in; // total nb of input bytes read so far
|
||||
|
||||
public byte[] out_buf; // output buffer
|
||||
public int next_out; // next output byte should be put there
|
||||
public uint avail_out; // remaining free space at next_out
|
||||
public uint total_out; // total nb of bytes output so far
|
||||
|
||||
public string msg; // last error message, NULL if no error
|
||||
public object state; // not visible by applications
|
||||
|
||||
public uint adler; // adler32 value of the uncompressed data
|
||||
|
||||
public void CopyTo(z_stream s)
|
||||
{
|
||||
s.adler=adler;
|
||||
s.avail_in=avail_in;
|
||||
s.avail_out=avail_out;
|
||||
s.in_buf=in_buf;
|
||||
s.msg=msg;
|
||||
s.next_in=next_in;
|
||||
s.next_out=next_out;
|
||||
s.out_buf=out_buf;
|
||||
s.state=state;
|
||||
s.total_in=total_in;
|
||||
s.total_out=total_out;
|
||||
}
|
||||
}
|
||||
|
||||
// gzip header information passed to and from zlib routines. See RFC 1952
|
||||
// for more details on the meanings of these fields.
|
||||
public class gz_header
|
||||
{
|
||||
public int text; // true if compressed data believed to be text
|
||||
public uint time; // modification time
|
||||
public int xflags; // extra flags (not used when writing a gzip file)
|
||||
public int os; // operating system
|
||||
public byte[] extra; // pointer to extra field or Z_NULL if none
|
||||
public uint extra_len; // extra field length (valid if extra != Z_NULL)
|
||||
public uint extra_max; // space at extra (only when reading header)
|
||||
public byte[] name; // pointer to zero-terminated file name or Z_NULL
|
||||
public uint name_max; // space at name (only when reading header)
|
||||
public byte[] comment; // pointer to zero-terminated comment or Z_NULL
|
||||
public uint comm_max; // space at comment (only when reading header)
|
||||
public int hcrc; // true if there was or will be a header crc
|
||||
public int done; // true when done reading gzip header (not used when writing a gzip file)
|
||||
}
|
||||
|
||||
// The application must update next_in and avail_in when avail_in has
|
||||
// dropped to zero. It must update next_out and avail_out when avail_out
|
||||
// has dropped to zero. All other fields are set by the
|
||||
// compression library and must not be updated by the application.
|
||||
//
|
||||
// The fields total_in and total_out can be used for statistics or
|
||||
// progress reports. After compression, total_in holds the total size of
|
||||
// the uncompressed data and may be saved for use in the decompressor
|
||||
// (particularly if the decompressor wants to decompress everything in
|
||||
// a single step).
|
||||
|
||||
// constants
|
||||
|
||||
// Allowed flush values; see deflate() and inflate() below for details
|
||||
public const int Z_NO_FLUSH=0;
|
||||
public const int Z_PARTIAL_FLUSH=1;
|
||||
public const int Z_SYNC_FLUSH=2;
|
||||
public const int Z_FULL_FLUSH=3;
|
||||
public const int Z_FINISH=4;
|
||||
public const int Z_BLOCK=5;
|
||||
public const int Z_TREES=6;
|
||||
|
||||
// Return codes for the compression/decompression functions. Negative
|
||||
// values are errors, positive values are used for special but normal events.
|
||||
public const int Z_OK=0;
|
||||
public const int Z_STREAM_END=1;
|
||||
public const int Z_NEED_DICT=2;
|
||||
public const int Z_ERRNO=-1;
|
||||
public const int Z_STREAM_ERROR=-2;
|
||||
public const int Z_DATA_ERROR=-3;
|
||||
public const int Z_MEM_ERROR=-4;
|
||||
public const int Z_BUF_ERROR=-5;
|
||||
public const int Z_VERSION_ERROR=-6;
|
||||
|
||||
// compression levels
|
||||
public const int Z_NO_COMPRESSION=0;
|
||||
public const int Z_BEST_SPEED=1;
|
||||
public const int Z_BEST_COMPRESSION=9;
|
||||
public const int Z_DEFAULT_COMPRESSION=(-1);
|
||||
|
||||
// compression strategy; see deflateInit2() below for details
|
||||
public const int Z_FILTERED=1;
|
||||
public const int Z_HUFFMAN_ONLY=2;
|
||||
public const int Z_RLE=3;
|
||||
public const int Z_FIXED=4;
|
||||
public const int Z_DEFAULT_STRATEGY=0;
|
||||
|
||||
// The deflate compression method (the only one supported in this version)
|
||||
public const int Z_DEFLATED=8;
|
||||
|
||||
public const string zlib_version=ZLIB_VERSION; // for compatibility with versions < 1.0.2
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,105 @@
|
||||
// zutil.cs -- target dependent utility functions for the compression library
|
||||
// Copyright (C) 1995-2005, 2010 Jean-loup Gailly.
|
||||
// Copyright (C) 2007-2011 by the Authors
|
||||
// For conditions of distribution and use, see copyright notice in License.txt
|
||||
|
||||
using System;
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public static partial class ZLib
|
||||
{
|
||||
private const int OS_CODE=0x0b;
|
||||
|
||||
static readonly string[] z_errmsg=new string[9]
|
||||
{
|
||||
"need dictionary", // Z_NEED_DICT 2
|
||||
"stream end", // Z_STREAM_END 1
|
||||
"", // Z_OK 0
|
||||
"file error", // Z_ERRNO -1
|
||||
"stream error", // Z_STREAM_ERROR -2
|
||||
"data error", // Z_DATA_ERROR -3
|
||||
"insufficient memory", // Z_MEM_ERROR -4
|
||||
"buffer error", // Z_BUF_ERROR -5
|
||||
"incompatible version" // Z_VERSION_ERROR -6
|
||||
};
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// The application can compare zlibVersion and ZLIB_VERSION for consistency.
|
||||
// If the first character differs, the library code actually used is
|
||||
// not compatible with the zlib.h header file used by the application.
|
||||
// This check is automatically made by deflateInit and inflateInit.
|
||||
|
||||
public static string zlibVersion()
|
||||
{
|
||||
return ZLIB_VERSION;
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// Return flags indicating compile-time options.
|
||||
//
|
||||
// Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
|
||||
// 1.0: size of ulong
|
||||
// 3.2: size of uint
|
||||
// 5.4: size of void* (pointer)
|
||||
// 7.6: size of int
|
||||
//
|
||||
//Compiler, assembler, and debug options:
|
||||
// (8: DEBUG)
|
||||
// (9: ASMV or ASMINF -- use ASM code [not used in this port])
|
||||
// (10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention [not used in this port])
|
||||
// 11: 0 (reserved)
|
||||
//
|
||||
//One-time table building (smaller code, but not thread-safe if true):
|
||||
// (12: BUILDFIXED -- build static block decoding tables when needed [not used in this port])
|
||||
// (13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed [not used in this port])
|
||||
// 14,15: 0 (reserved)
|
||||
//
|
||||
//Library content (indicates missing functionality):
|
||||
// 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking deflate code when not needed)
|
||||
// 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect and decode gzip streams (to avoid linking crc code)
|
||||
// 18-19: 0 (reserved)
|
||||
//
|
||||
//Operation variations (changes in library functionality):
|
||||
// (20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate [not used in this port])
|
||||
// (21: FASTEST -- deflate algorithm with only one, lowest compression level [not used in this port])
|
||||
// 22,23: 0 (reserved)
|
||||
//
|
||||
//The sprintf variant used by gzprintf (zero is best):
|
||||
// (24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format [not used in this port])
|
||||
// (25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure! [not used in this port])
|
||||
// (26: 0 = returns value, 1 = void -- 1 means inferred string length returned [not used in this port])
|
||||
//
|
||||
//Remainder:
|
||||
// 27-31: 0 (reserved)
|
||||
|
||||
public static uint zlibCompileFlags()
|
||||
{
|
||||
uint flags=2;
|
||||
flags+=1<<2;
|
||||
|
||||
switch(IntPtr.Size)
|
||||
{
|
||||
case 4: flags+=1<<4; break;
|
||||
case 8: flags+=2<<4; break;
|
||||
default: flags+=3<<4; break;
|
||||
}
|
||||
|
||||
flags+=1<<6;
|
||||
|
||||
return flags;
|
||||
}
|
||||
|
||||
// =========================================================================
|
||||
|
||||
// exported to allow conversion of error code to string for compress() and uncompress()
|
||||
public static string zError(int err)
|
||||
{
|
||||
if(err<-6||err>2) throw new ArgumentOutOfRangeException("err", "must be -6<=err<=2");
|
||||
|
||||
return z_errmsg[2-err];
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,62 @@
|
||||
/*
|
||||
* Copyright (C) 2012-2017 CypherCore <http://github.com/CypherCore>
|
||||
*
|
||||
* This program 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.
|
||||
*
|
||||
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.IO.Compression;
|
||||
using System.Linq;
|
||||
|
||||
namespace Framework.IO
|
||||
{
|
||||
public static partial class ZLib
|
||||
{
|
||||
public static byte[] Compress(byte[] data)
|
||||
{
|
||||
ByteBuffer buffer = new ByteBuffer();
|
||||
buffer.WriteUInt8(0x78);
|
||||
buffer.WriteUInt8(0x9c);
|
||||
|
||||
uint adler32 = ZLib.adler32(1, data, (uint)data.Length);// Adler32(1, data, (uint)data.Length);
|
||||
var ms = new MemoryStream();
|
||||
using (var deflateStream = new DeflateStream(ms, CompressionMode.Compress))
|
||||
{
|
||||
deflateStream.Write(data, 0, data.Length);
|
||||
deflateStream.Flush();
|
||||
}
|
||||
buffer.WriteBytes(ms.ToArray());
|
||||
buffer.WriteBytes(BitConverter.GetBytes(adler32).Reverse().ToArray());
|
||||
|
||||
return buffer.GetData();
|
||||
}
|
||||
|
||||
public static byte[] Decompress(byte[] data, uint unpackedSize)
|
||||
{
|
||||
byte[] decompressData = new byte[unpackedSize];
|
||||
using (var deflateStream = new DeflateStream(new MemoryStream(data, 2, data.Length - 6), CompressionMode.Decompress))
|
||||
{
|
||||
var decompressed = new MemoryStream();
|
||||
deflateStream.CopyTo(decompressed);
|
||||
|
||||
decompressed.Seek(0, SeekOrigin.Begin);
|
||||
for (int i = 0; i < unpackedSize; i++)
|
||||
decompressData[i] = (byte)decompressed.ReadByte();
|
||||
}
|
||||
|
||||
return decompressData;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user