Public-Mirror/GARbro-mirror
1
0
Fork 0
mirror of https://github.com/crskycode/GARbro.git synced 2024-11-23 21:55:34 +08:00
Code Issues Projects Releases Wiki Activity

(Adler32): use "unsafe" implementation. added appropriate methods.

Browse Source
This commit is contained in:
morkt 2014-07-26 23:20:08 +04:00
parent 4cf46ed91c
commit 2446927e83
1 changed files with 65 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

106
GameRes/Utility.cs
View File

@ -140,10 +140,21 @@ namespace GameRes.Utility
public static uint Compute (byte[] buf, int pos, int len) public static uint Compute (byte[] buf, int pos, int len)
{ {
return Update (1, buf, pos, len); unsafe
{
fixed (byte* ptr = &buf[pos])
{
return Update (1, ptr, len);
}
}
} }
private static uint Update (uint adler, byte[] buf, int pos, int len) public unsafe static uint Compute (byte* buf, int len)
{
return Update (1, buf, len);
}
private unsafe static uint Update (uint adler, byte* buf, int len)
{ {
/* split Adler-32 into component sums */ /* split Adler-32 into component sums */
uint sum2 = (adler >> 16) & 0xffff; uint sum2 = (adler >> 16) & 0xffff;
@ -151,7 +162,7 @@ namespace GameRes.Utility
/* in case user likes doing a byte at a time, keep it fast */ /* in case user likes doing a byte at a time, keep it fast */
if (1 == len) { if (1 == len) {
adler += buf[pos]; adler += *buf;
if (adler >= BASE) if (adler >= BASE)
adler -= BASE; adler -= BASE;
sum2 += adler; sum2 += adler;
@ -163,7 +174,7 @@ namespace GameRes.Utility
/* in case short lengths are provided, keep it somewhat fast */ /* in case short lengths are provided, keep it somewhat fast */
if (len < 16) { if (len < 16) {
while (0 != len--) { while (0 != len--) {
adler += buf[pos++]; adler += *buf++;
sum2 += adler; sum2 += adler;
} }
if (adler >= BASE) if (adler >= BASE)
@ -178,23 +189,23 @@ namespace GameRes.Utility
int n = NMAX / 16; /* NMAX is divisible by 16 */ int n = NMAX / 16; /* NMAX is divisible by 16 */
do { do {
/* 16 sums unrolled */ /* 16 sums unrolled */
adler += buf[pos]; sum2 += adler; adler += buf[0]; sum2 += adler;
adler += buf[pos+1]; sum2 += adler; adler += buf[1]; sum2 += adler;
adler += buf[pos+2]; sum2 += adler; adler += buf[2]; sum2 += adler;
adler += buf[pos+3]; sum2 += adler; adler += buf[3]; sum2 += adler;
adler += buf[pos+4]; sum2 += adler; adler += buf[4]; sum2 += adler;
adler += buf[pos+5]; sum2 += adler; adler += buf[5]; sum2 += adler;
adler += buf[pos+6]; sum2 += adler; adler += buf[6]; sum2 += adler;
adler += buf[pos+7]; sum2 += adler; adler += buf[7]; sum2 += adler;
adler += buf[pos+8]; sum2 += adler; adler += buf[8]; sum2 += adler;
adler += buf[pos+9]; sum2 += adler; adler += buf[9]; sum2 += adler;
adler += buf[pos+10]; sum2 += adler; adler += buf[10]; sum2 += adler;
adler += buf[pos+11]; sum2 += adler; adler += buf[11]; sum2 += adler;
adler += buf[pos+12]; sum2 += adler; adler += buf[12]; sum2 += adler;
adler += buf[pos+13]; sum2 += adler; adler += buf[13]; sum2 += adler;
adler += buf[pos+14]; sum2 += adler; adler += buf[14]; sum2 += adler;
adler += buf[pos+15]; sum2 += adler; adler += buf[15]; sum2 += adler;
pos += 16; buf += 16;
} while (0 != --n); } while (0 != --n);
adler %= BASE; adler %= BASE;
sum2 %= BASE; sum2 %= BASE;
@ -204,26 +215,26 @@ namespace GameRes.Utility
if (0 != len) { /* avoid modulos if none remaining */ if (0 != len) { /* avoid modulos if none remaining */
while (len >= 16) { while (len >= 16) {
len -= 16; len -= 16;
adler += buf[pos]; sum2 += adler; adler += buf[0]; sum2 += adler;
adler += buf[pos+1]; sum2 += adler; adler += buf[1]; sum2 += adler;
adler += buf[pos+2]; sum2 += adler; adler += buf[2]; sum2 += adler;
adler += buf[pos+3]; sum2 += adler; adler += buf[3]; sum2 += adler;
adler += buf[pos+4]; sum2 += adler; adler += buf[4]; sum2 += adler;
adler += buf[pos+5]; sum2 += adler; adler += buf[5]; sum2 += adler;
adler += buf[pos+6]; sum2 += adler; adler += buf[6]; sum2 += adler;
adler += buf[pos+7]; sum2 += adler; adler += buf[7]; sum2 += adler;
adler += buf[pos+8]; sum2 += adler; adler += buf[8]; sum2 += adler;
adler += buf[pos+9]; sum2 += adler; adler += buf[9]; sum2 += adler;
adler += buf[pos+10]; sum2 += adler; adler += buf[10]; sum2 += adler;
adler += buf[pos+11]; sum2 += adler; adler += buf[11]; sum2 += adler;
adler += buf[pos+12]; sum2 += adler; adler += buf[12]; sum2 += adler;
adler += buf[pos+13]; sum2 += adler; adler += buf[13]; sum2 += adler;
adler += buf[pos+14]; sum2 += adler; adler += buf[14]; sum2 += adler;
adler += buf[pos+15]; sum2 += adler; adler += buf[15]; sum2 += adler;
pos += 16; buf += 16;
} }
while (0 != len--) { while (0 != len--) {
adler += buf[pos++]; adler += *buf++;
sum2 += adler; sum2 += adler;
} }
adler %= BASE; adler %= BASE;
@ -237,9 +248,22 @@ namespace GameRes.Utility
private uint m_adler = 1; private uint m_adler = 1;
public uint Value { get { return m_adler; } } public uint Value { get { return m_adler; } }
public void Update (byte[] buf, int pos, int len) public uint Update (byte[] buf, int pos, int len)
{ {
m_adler = Update (m_adler, buf, pos, len); unsafe
{
fixed (byte* ptr = &buf[pos])
{
m_adler = Update (m_adler, ptr, len);
return m_adler;
}
}
}
public unsafe uint Update (byte* buf, int len)
{
m_adler = Update (m_adler, buf, len);
return m_adler;
} }
} }
} }