claunia/cuetools.net
1
0
Fork 0
mirror of https://github.com/claunia/cuetools.net.git synced 2025-12-16 18:14:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

reorganizing a bit

Browse Source
This commit is contained in:
chudov
2010-02-06 23:17:07 +00:00
parent 492f5b845a
commit 1f844b44e1
82 changed files with 5239 additions and 3946 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
CUETools.Codecs/CRCs/CRC32.cs
View File

@@ -6,29 +6,36 @@ namespace CUETools.Codecs
{
public class Crc32
{
uint[] table = new uint[256];
public uint[] table = new uint[256];
public uint ComputeChecksum(uint crc, byte val)
{
return (crc >> 8) ^ table[(crc & 0xff) ^ val];
}
public uint ComputeChecksum(uint crc, byte[] bytes, int pos, int count)
public unsafe uint ComputeChecksum(uint crc, byte* bytes, int count)
{
for (int i = pos; i < pos + count; i++)
crc = ComputeChecksum(crc, bytes[i]);
fixed (uint *t = table)
for (int i = 0; i < count; i++)
crc = (crc >> 8) ^ t[(crc ^ bytes[i]) & 0xff];
return crc;
}
public unsafe uint ComputeChecksum(uint crc, byte[] bytes, int pos, int count)
{
fixed (byte* pbytes = &bytes[pos])
return ComputeChecksum(crc, pbytes, count);
}
public uint ComputeChecksum(uint crc, uint s)
{
return ComputeChecksum(ComputeChecksum(ComputeChecksum(ComputeChecksum(
crc, (byte)s), (byte)(s >> 8)), (byte)(s >> 16)), (byte)(s >> 24));
}
public unsafe uint ComputeChecksum(uint crc, int * samples, uint count)
public unsafe uint ComputeChecksum(uint crc, int * samples, int count)
{
for (uint i = 0; i < count; i++)
for (int i = 0; i < count; i++)
{
int s1 = samples[2 * i], s2 = samples[2 * i + 1];
crc = ComputeChecksum(ComputeChecksum(ComputeChecksum(ComputeChecksum(
@@ -37,9 +44,24 @@ namespace CUETools.Codecs
return crc;
}
public unsafe uint ComputeChecksumWONULL(uint crc, int* samples, uint count)
public unsafe uint ComputeChecksumWONULL(uint crc, short* samples, int count)
{
for (uint i = 0; i < count; i++)
fixed (uint* t = table)
for (int i = 0; i < count; i++)
{
short s1 = samples[i];
if (s1 != 0)
{
crc = (crc >> 8) ^ t[(crc ^ s1) & 0xff];
crc = (crc >> 8) ^ t[(crc ^ (s1 >> 8)) & 0xff];
}
}
return crc;
}
public unsafe uint ComputeChecksumWONULL(uint crc, int* samples, int count)
{
for (int i = 0; i < count; i++)
{
int s1 = samples[2 * i], s2 = samples[2 * i + 1];
if (s1 != 0)