Name:
Anonymous
2011-10-25 23:49
int __cdecl sub_5FB5E0(_BYTE *In, int Len, BYTE *Out, _DWORD *OutLen)
{
_BYTE *P; // esi@1
_BYTE *InEnd; // ebp@1
BYTE *O; // eax@1
unsigned int C; // ecx@2
unsigned int U; // ecx@5
_BYTE *NextP; // esi@5
char Done; // dl@8
int v11; // edx@9
unsigned int T; // edx@10
unsigned int L; // ecx@10
_BYTE *B; // edx@18
_BYTE *BB; // edx@18
_BYTE *v16; // eax@19
_BYTE *v17; // edi@24
int UU; // ecx@24
BYTE *v19; // eax@25
_BYTE *v20; // edi@25
char v21; // dl@31
int v22; // edx@32
_BYTE *BBB; // edi@35
char v24; // dl@37
int v25; // edx@38
unsigned int v26; // edx@39
_BYTE *BBBB; // edi@39
int v28; // edx@43
_BYTE *v29; // edi@43
int v30; // ecx@43
int result; // eax@50
int v32; // eax@51
P = In;
*OutLen = 0;
InEnd = &In[Len];
O = Out;
if ( *In > 17u )
{
C = *In - 17;
P = In + 1;
if ( C < 4 )
goto backredCopyLoop;
do
{
*O++ = *P++;
--C;
}
while ( C );
goto backref;
}
aligned:
U = *P;
NextP = P + 1;
if ( U < 0x10 )
{
if ( !U )
{
if ( !*NextP )
{
do
{
Done = NextP[1];
U += 255;
++NextP;
}
while ( !Done );
}
v11 = *NextP++;
U += v11 + 15;
}
T = *(_DWORD *)NextP;
P = NextP + 4;
*(_DWORD *)O = T;
O += 4;
L = U - 1;
if ( L )
{
if ( L < 4 )
{
do
{
*O++ = *P++;
--L;
}
while ( L );
}
else
{
do
{
L -= 4;
*(_DWORD *)O = *(_DWORD *)P;
O += 4;
P += 4;
}
while ( L >= 4 );
for ( ; L; --L )
*O++ = *P++;
}
}
backref:
U = *P;
NextP = P + 1;
if ( U < 0x10 )
{
B = &O[-(U >> 2)] - 4 * *NextP;
P = NextP + 1;
*O++ = *(B - 2049);
BB = B - 2048;
LABEL_19:
*O = *BB;
v16 = O + 1;
*v16 = BB[1];
O = v16 + 1;
goto backrefCopyHead;
}
}
while ( 1 )
{
if ( U >= 0x40 )
{
v17 = &O[-((U >> 2) & 7) - 1] - 8 * *NextP;
P = NextP + 1;
UU = (U >> 5) - 1;
LABEL_25:
*O = *v17;
v19 = O + 1;
*v19 = v17[1];
O = v19 + 1;
v20 = v17 + 2;
do
{
*O++ = *v20++;
--UU;
}
while ( UU );
goto backrefCopyHead;
}
if ( U < 0x20 )
break;
UU = U & 0x1F;
if ( !UU )
{
if ( !*NextP )
{
do
{
v21 = NextP[1];
UU += 255;
++NextP;
}
while ( !v21 );
}
v22 = *NextP++;
UU += v22 + 31;
}
v17 = &O[-((unsigned int)*(_WORD *)NextP >> 2) - 1];
P = NextP + 2;
LABEL_41:
if ( (unsigned int)UU < 6 || (signed int)(O - v17) < 4 )
goto LABEL_25;
v28 = *(_DWORD *)v17;
v29 = v17 + 4;
*(_DWORD *)O = v28;
O += 4;
v30 = UU - 2;
do
{
v30 -= 4;
*(_DWORD *)O = *(_DWORD *)v29;
O += 4;
v29 += 4;
}
while ( (unsigned int)v30 >= 4 );
for ( ; v30; --v30 )
*O++ = *v29++;
backrefCopyHead:
C = *(P - 2) & 3;
if ( !(*(P - 2) & 3) )
goto aligned;
do
{
backredCopyLoop:
*O++ = *P++;
--C;
}
while ( C );
U = *P;
NextP = P + 1;
}
if ( U < 0x10 )
{
BB = &O[-(U >> 2) - 1] - 4 * *NextP;
P = NextP + 1;
goto LABEL_19;
}
BBB = &O[-2048 * (U & 8)];
UU = U & 7;
if ( !UU )
{
if ( !*NextP )
{
do
{
v24 = NextP[1];
UU += 255;
++NextP;
}
while ( !v24 );
}
v25 = *NextP++;
UU += v25 + 7;
}
v26 = *(_WORD *)NextP;
P = NextP + 2;
BBBB = &BBB[-(v26 >> 2)];
if ( BBBB != O )
{
v17 = BBBB - 0x4000;
goto LABEL_41;
}
*OutLen = O - Out;
if ( P == InEnd )
{
result = 0;
}
else
{
v32 = -(P < InEnd);
LOBYTE(v32) = v32 & 0xFC;
result = v32 - 4;
}
return result;
}
Name:
Anonymous
2011-10-26 7:42
>>11
Looks like output of a popular, but reasonably decent commercial x86 assembly to C decompiler.