Same SBoT.jar, decompiled with jad instead of CFR for comparison -- jad is the same decompiler the community used on RSC client dumps back in 2004 (see DeobedMC201.rar). A few methods didn't fully resolve (jad is much less capable than CFR on complex control flow); those are marked inline where jad gave up.
2524 lines
51 KiB
Java
2524 lines
51 KiB
Java
// Decompiled by Jad v1.5.8e. Copyright 2001 Pavel Kouznetsov.
|
|
// Jad home page: http://www.geocities.com/kpdus/jad.html
|
|
// Decompiler options: packimports(3)
|
|
// Source File Name: l.java
|
|
|
|
import java.io.DataInputStream;
|
|
import java.io.IOException;
|
|
|
|
public class l
|
|
{
|
|
|
|
public l(int i1, int j1)
|
|
{
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
a(i1, j1);
|
|
bb = new int[j1][1];
|
|
int k1 = 0;
|
|
do
|
|
{
|
|
if(k1 >= j1)
|
|
break;
|
|
bb[k1][0] = k1;
|
|
k1++;
|
|
} while(!q.d);
|
|
}
|
|
|
|
public l(int i1, int j1, boolean flag, boolean flag1, boolean flag2, boolean flag3, boolean flag4)
|
|
{
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
I = flag;
|
|
J = flag1;
|
|
K = flag2;
|
|
L = flag3;
|
|
M = flag4;
|
|
a(i1, j1);
|
|
}
|
|
|
|
private void a(int i1, int j1)
|
|
{
|
|
boolean flag;
|
|
flag = q.d;
|
|
U = new int[i1];
|
|
V = new int[i1];
|
|
W = new int[i1];
|
|
g = new int[i1];
|
|
h = new byte[i1];
|
|
j = new int[j1];
|
|
k = new int[j1][];
|
|
l = new int[j1];
|
|
m = new int[j1];
|
|
p = new int[j1];
|
|
o = new int[j1];
|
|
n = new int[j1];
|
|
M;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
if(!M)
|
|
{
|
|
b = new int[i1];
|
|
c = new int[i1];
|
|
d = new int[i1];
|
|
e = new int[i1];
|
|
f = new int[i1];
|
|
}
|
|
L;
|
|
_L2:
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR ifne 160;
|
|
goto _L5 _L6
|
|
_L5:
|
|
break MISSING_BLOCK_LABEL_146;
|
|
_L6:
|
|
break MISSING_BLOCK_LABEL_160;
|
|
H = new byte[j1];
|
|
G = new int[j1];
|
|
this;
|
|
if(flag) goto _L8; else goto _L7
|
|
_L7:
|
|
I;
|
|
_L4:
|
|
JVM INSTR ifeq 199;
|
|
goto _L9 _L10
|
|
_L9:
|
|
X = U;
|
|
Y = V;
|
|
Z = W;
|
|
if(!flag) goto _L11; else goto _L10
|
|
_L10:
|
|
X = new int[i1];
|
|
Y = new int[i1];
|
|
this;
|
|
_L8:
|
|
new int[i1];
|
|
Z;
|
|
_L11:
|
|
this;
|
|
if(flag) goto _L13; else goto _L12
|
|
_L12:
|
|
K;
|
|
JVM INSTR ifeq 242;
|
|
goto _L14 _L15
|
|
_L14:
|
|
J;
|
|
if(flag) goto _L17; else goto _L16
|
|
_L16:
|
|
if(J) goto _L18; else goto _L15
|
|
_L15:
|
|
q = new int[j1];
|
|
r = new int[j1];
|
|
this;
|
|
_L13:
|
|
new int[j1];
|
|
s;
|
|
_L18:
|
|
this;
|
|
if(flag) goto _L20; else goto _L19
|
|
_L19:
|
|
J;
|
|
_L17:
|
|
JVM INSTR ifne 316;
|
|
goto _L21 _L22
|
|
_L21:
|
|
break MISSING_BLOCK_LABEL_274;
|
|
_L22:
|
|
break MISSING_BLOCK_LABEL_316;
|
|
cb = new int[j1];
|
|
db = new int[j1];
|
|
eb = new int[j1];
|
|
fb = new int[j1];
|
|
gb = new int[j1];
|
|
hb = new int[j1];
|
|
i = 0;
|
|
a = 0;
|
|
T = i1;
|
|
ab = j1;
|
|
ib = jb = kb = 0;
|
|
lb = mb = nb = 0;
|
|
ob = pb = qb = 256;
|
|
rb = sb = tb = ub = vb = wb = 256;
|
|
this;
|
|
_L20:
|
|
0;
|
|
xb;
|
|
}
|
|
|
|
public void a()
|
|
{
|
|
b = new int[a];
|
|
c = new int[a];
|
|
d = new int[a];
|
|
e = new int[a];
|
|
f = new int[a];
|
|
}
|
|
|
|
public void b()
|
|
{
|
|
i = 0;
|
|
a = 0;
|
|
}
|
|
|
|
public void b(int i1, int j1)
|
|
{
|
|
boolean flag;
|
|
flag = q.d;
|
|
i -= i1;
|
|
i;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
if(i < 0)
|
|
i = 0;
|
|
a -= j1;
|
|
this;
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
a;
|
|
_L2:
|
|
JVM INSTR ifge 56;
|
|
goto _L5 _L6
|
|
_L5:
|
|
this;
|
|
_L4:
|
|
0;
|
|
a;
|
|
_L6:
|
|
}
|
|
|
|
public l(byte abyte0[], int i1, boolean flag)
|
|
{
|
|
int j1;
|
|
int k1;
|
|
int l1;
|
|
boolean flag2;
|
|
label0:
|
|
{
|
|
flag2 = q.d;
|
|
super();
|
|
boolean flag1 = false;
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
j1 = q.a(abyte0, i1);
|
|
i1 += 2;
|
|
k1 = q.a(abyte0, i1);
|
|
i1 += 2;
|
|
a(j1, k1);
|
|
bb = new int[k1][1];
|
|
l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= j1)
|
|
break;
|
|
U[l1] = q.d(abyte0, i1);
|
|
i1 += 2;
|
|
l1++;
|
|
if(flag2)
|
|
break label0;
|
|
} while(!flag2);
|
|
l1 = 0;
|
|
}
|
|
label1:
|
|
{
|
|
do
|
|
{
|
|
if(l1 >= j1)
|
|
break;
|
|
V[l1] = q.d(abyte0, i1);
|
|
i1 += 2;
|
|
l1++;
|
|
if(flag2)
|
|
break label1;
|
|
} while(!flag2);
|
|
l1 = 0;
|
|
}
|
|
label2:
|
|
{
|
|
do
|
|
{
|
|
if(l1 >= j1)
|
|
break;
|
|
W[l1] = q.d(abyte0, i1);
|
|
i1 += 2;
|
|
l1++;
|
|
if(flag2)
|
|
break label2;
|
|
} while(!flag2);
|
|
a = j1;
|
|
}
|
|
label3:
|
|
{
|
|
l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= k1)
|
|
break;
|
|
j[l1] = abyte0[i1++] & 0xff;
|
|
l1++;
|
|
if(flag2)
|
|
break label3;
|
|
} while(!flag2);
|
|
l1 = 0;
|
|
}
|
|
_L6:
|
|
if(l1 >= k1)
|
|
break; /* Loop/switch isn't completed */
|
|
l[l1] = q.d(abyte0, i1);
|
|
i1 += 2;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
l[l1];
|
|
32767;
|
|
if(flag2) goto _L2; else goto _L1
|
|
_L1:
|
|
JVM INSTR icmpne 382;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_371;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_382;
|
|
l[l1] = S;
|
|
l1++;
|
|
if(!flag2) goto _L6; else goto _L5
|
|
_L5:
|
|
l1 = 0;
|
|
_L14:
|
|
l1;
|
|
k1;
|
|
_L2:
|
|
JVM INSTR icmpge 457;
|
|
goto _L7 _L8
|
|
_L7:
|
|
break MISSING_BLOCK_LABEL_400;
|
|
_L8:
|
|
break; /* Loop/switch isn't completed */
|
|
m[l1] = q.d(abyte0, i1);
|
|
i1 += 2;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
m[l1];
|
|
32767;
|
|
if(flag2) goto _L10; else goto _L9
|
|
_L9:
|
|
JVM INSTR icmpne 449;
|
|
goto _L11 _L12
|
|
_L11:
|
|
break MISSING_BLOCK_LABEL_438;
|
|
_L12:
|
|
break MISSING_BLOCK_LABEL_449;
|
|
m[l1] = S;
|
|
l1++;
|
|
if(!flag2) goto _L14; else goto _L13
|
|
_L13:
|
|
l1 = 0;
|
|
_L25:
|
|
l1;
|
|
k1;
|
|
_L10:
|
|
JVM INSTR icmpge 526;
|
|
goto _L15 _L16
|
|
_L15:
|
|
break MISSING_BLOCK_LABEL_467;
|
|
_L16:
|
|
break; /* Loop/switch isn't completed */
|
|
int i2 = abyte0[i1++] & 0xff;
|
|
if(flag2) goto _L18; else goto _L17
|
|
_L17:
|
|
i2;
|
|
if(flag2) goto _L20; else goto _L19
|
|
_L19:
|
|
if(i2 != 0) goto _L22; else goto _L21
|
|
_L21:
|
|
p[l1] = 0;
|
|
_L18:
|
|
if(!flag2) goto _L23; else goto _L22
|
|
_L22:
|
|
p[l1] = S;
|
|
_L23:
|
|
l1++;
|
|
if(!flag2) goto _L25; else goto _L24
|
|
_L24:
|
|
false;
|
|
_L20:
|
|
l1;
|
|
_L35:
|
|
l1;
|
|
k1;
|
|
_L29:
|
|
JVM INSTR icmpge 644;
|
|
goto _L26 _L27
|
|
_L26:
|
|
break MISSING_BLOCK_LABEL_536;
|
|
_L27:
|
|
break; /* Loop/switch isn't completed */
|
|
k[l1] = new int[j[l1]];
|
|
if(flag2)
|
|
break MISSING_BLOCK_LABEL_655;
|
|
i2 = 0;
|
|
_L33:
|
|
if(i2 >= j[l1])
|
|
break; /* Loop/switch isn't completed */
|
|
j1;
|
|
256;
|
|
if(flag2) goto _L29; else goto _L28
|
|
_L28:
|
|
JVM INSTR icmpge 610;
|
|
goto _L30 _L31
|
|
_L30:
|
|
break MISSING_BLOCK_LABEL_585;
|
|
_L31:
|
|
break MISSING_BLOCK_LABEL_610;
|
|
k[l1][i2] = abyte0[i1++] & 0xff;
|
|
if(!flag2)
|
|
break MISSING_BLOCK_LABEL_628;
|
|
k[l1][i2] = q.a(abyte0, i1);
|
|
i1 += 2;
|
|
i2++;
|
|
if(!flag2) goto _L33; else goto _L32
|
|
_L32:
|
|
l1++;
|
|
if(!flag2) goto _L35; else goto _L34
|
|
_L34:
|
|
i = k1;
|
|
u = 1;
|
|
}
|
|
|
|
public l(String s1)
|
|
{
|
|
byte abyte0[];
|
|
int j1;
|
|
int i2;
|
|
boolean flag4;
|
|
label0:
|
|
{
|
|
flag4 = q.d;
|
|
super();
|
|
boolean flag = false;
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
boolean flag1 = false;
|
|
boolean flag2 = false;
|
|
abyte0 = null;
|
|
try
|
|
{
|
|
DataInputStream datainputstream;
|
|
int k1;
|
|
label1:
|
|
{
|
|
java.io.InputStream inputstream = q.a(s1);
|
|
datainputstream = new DataInputStream(inputstream);
|
|
abyte0 = new byte[3];
|
|
Fb = 0;
|
|
Gb = 0;
|
|
k1 = 0;
|
|
do
|
|
{
|
|
if(k1 >= 3)
|
|
break;
|
|
k1 += datainputstream.read(abyte0, k1, 3 - k1);
|
|
if(flag4)
|
|
break label1;
|
|
} while(!flag4);
|
|
k1 = a(abyte0);
|
|
abyte0 = new byte[k1];
|
|
Fb = 0;
|
|
Gb = 0;
|
|
}
|
|
int l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= k1)
|
|
break;
|
|
l1 += datainputstream.read(abyte0, l1, k1 - l1);
|
|
if(flag4)
|
|
break label0;
|
|
} while(!flag4);
|
|
datainputstream.close();
|
|
break label0;
|
|
}
|
|
catch(IOException ioexception)
|
|
{
|
|
a = 0;
|
|
i = 0;
|
|
return;
|
|
}
|
|
}
|
|
label2:
|
|
{
|
|
int i1 = a(abyte0);
|
|
j1 = a(abyte0);
|
|
boolean flag3 = false;
|
|
a(i1, j1);
|
|
bb = new int[j1][];
|
|
i2 = 0;
|
|
do
|
|
{
|
|
if(i2 >= i1)
|
|
break;
|
|
int j2 = a(abyte0);
|
|
int l2 = a(abyte0);
|
|
int j3 = a(abyte0);
|
|
a(j2, l2, j3);
|
|
i2++;
|
|
if(flag4)
|
|
break label2;
|
|
} while(!flag4);
|
|
i2 = 0;
|
|
}
|
|
_L2:
|
|
int k2;
|
|
int i3;
|
|
int k3;
|
|
int l3;
|
|
int i4;
|
|
int ai[];
|
|
int j4;
|
|
if(i2 >= j1)
|
|
break; /* Loop/switch isn't completed */
|
|
k2 = a(abyte0);
|
|
i3 = a(abyte0);
|
|
k3 = a(abyte0);
|
|
l3 = a(abyte0);
|
|
Db = a(abyte0);
|
|
Eb = a(abyte0);
|
|
i4 = a(abyte0);
|
|
ai = new int[k2];
|
|
if(flag4)
|
|
break MISSING_BLOCK_LABEL_603;
|
|
j4 = 0;
|
|
_L4:
|
|
if(j4 >= k2)
|
|
break; /* Loop/switch isn't completed */
|
|
ai[j4] = a(abyte0);
|
|
j4++;
|
|
if(flag4) goto _L2; else goto _L1
|
|
_L1:
|
|
if(!flag4) goto _L4; else goto _L3
|
|
_L3:
|
|
int ai1[];
|
|
int k4;
|
|
ai1 = new int[l3];
|
|
k4 = 0;
|
|
_L8:
|
|
if(k4 >= l3)
|
|
break; /* Loop/switch isn't completed */
|
|
ai1[k4] = a(abyte0);
|
|
k4++;
|
|
if(flag4) goto _L6; else goto _L5
|
|
_L5:
|
|
if(!flag4) goto _L8; else goto _L7
|
|
_L7:
|
|
k4 = a(k2, ai, i3, k3);
|
|
this;
|
|
if(flag4) goto _L10; else goto _L9
|
|
_L9:
|
|
bb;
|
|
i2;
|
|
ai1;
|
|
JVM INSTR aastore ;
|
|
_L6:
|
|
if(i4 != 0) goto _L12; else goto _L11
|
|
_L11:
|
|
p[k4] = 0;
|
|
if(!flag4) goto _L13; else goto _L12
|
|
_L12:
|
|
this;
|
|
_L10:
|
|
p;
|
|
k4;
|
|
S;
|
|
JVM INSTR iastore ;
|
|
_L13:
|
|
i2++;
|
|
if(!flag4) goto _L2; else goto _L14
|
|
_L14:
|
|
u = 1;
|
|
}
|
|
|
|
public l(l al[], int i1, boolean flag, boolean flag1, boolean flag2, boolean flag3)
|
|
{
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
I = flag;
|
|
J = flag1;
|
|
K = flag2;
|
|
L = flag3;
|
|
a(al, i1, false);
|
|
}
|
|
|
|
public l(l al[], int i1)
|
|
{
|
|
u = 1;
|
|
v = true;
|
|
C = true;
|
|
D = false;
|
|
E = false;
|
|
F = -1;
|
|
I = false;
|
|
J = false;
|
|
K = false;
|
|
L = false;
|
|
M = false;
|
|
R = 4;
|
|
S = 0xbc614e;
|
|
yb = 0xbc614e;
|
|
zb = 180;
|
|
Ab = 155;
|
|
Bb = 95;
|
|
Cb = 256;
|
|
Db = 512;
|
|
Eb = 32;
|
|
a(al, i1, true);
|
|
}
|
|
|
|
public void a(l al[], int i1, boolean flag)
|
|
{
|
|
int j1;
|
|
boolean flag2;
|
|
label0:
|
|
{
|
|
flag2 = q.d;
|
|
boolean flag1 = false;
|
|
j1 = 0;
|
|
int k1 = 0;
|
|
int l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= i1)
|
|
break;
|
|
j1 += al[l1].i;
|
|
k1 += al[l1].a;
|
|
l1++;
|
|
if(flag2)
|
|
break label0;
|
|
} while(!flag2);
|
|
a(k1, j1);
|
|
}
|
|
flag;
|
|
if(flag2) goto _L2; else goto _L1
|
|
_L1:
|
|
if(flag)
|
|
bb = new int[j1][];
|
|
false;
|
|
_L2:
|
|
int i2;
|
|
i2;
|
|
_L14:
|
|
i2;
|
|
_L6:
|
|
i1;
|
|
JVM INSTR icmpge 541;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_95;
|
|
_L4:
|
|
break; /* Loop/switch isn't completed */
|
|
l l2;
|
|
int j2;
|
|
l2 = al[i2];
|
|
l2.h();
|
|
Eb = l2.Eb;
|
|
Db = l2.Db;
|
|
zb = l2.zb;
|
|
Ab = l2.Ab;
|
|
Bb = l2.Bb;
|
|
Cb = l2.Cb;
|
|
if(flag2)
|
|
break MISSING_BLOCK_LABEL_546;
|
|
j2 = 0;
|
|
_L12:
|
|
int ai[];
|
|
int ai1[];
|
|
if(j2 >= l2.i)
|
|
break; /* Loop/switch isn't completed */
|
|
ai = new int[l2.j[j2]];
|
|
ai1 = l2.k[j2];
|
|
false;
|
|
if(flag2) goto _L6; else goto _L5
|
|
_L5:
|
|
int k2;
|
|
k2;
|
|
label1:
|
|
{
|
|
do
|
|
{
|
|
if(k2 >= l2.j[j2])
|
|
break;
|
|
ai[k2] = a(l2.U[ai1[k2]], l2.V[ai1[k2]], l2.W[ai1[k2]]);
|
|
k2++;
|
|
if(flag2)
|
|
break label1;
|
|
} while(!flag2);
|
|
k2 = a(l2.j[j2], ai, l2.l[j2], l2.m[j2]);
|
|
p[k2] = l2.p[j2];
|
|
o[k2] = l2.o[j2];
|
|
n[k2] = l2.n[j2];
|
|
}
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
if(!flag)
|
|
break MISSING_BLOCK_LABEL_525;
|
|
i1;
|
|
if(flag2) goto _L8; else goto _L7
|
|
_L7:
|
|
1;
|
|
JVM INSTR icmple 456;
|
|
goto _L9 _L10
|
|
_L9:
|
|
break MISSING_BLOCK_LABEL_372;
|
|
_L10:
|
|
break MISSING_BLOCK_LABEL_456;
|
|
bb[k2] = new int[l2.bb[j2].length + 1];
|
|
bb[k2][0] = i2;
|
|
int i3 = 0;
|
|
do
|
|
{
|
|
if(i3 >= l2.bb[j2].length)
|
|
break MISSING_BLOCK_LABEL_525;
|
|
bb[k2][i3 + 1] = l2.bb[j2][i3];
|
|
i3++;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
} while(!flag2);
|
|
bb[k2] = new int[l2.bb[j2].length];
|
|
false;
|
|
_L8:
|
|
int j3;
|
|
j3;
|
|
do
|
|
{
|
|
if(j3 >= l2.bb[j2].length)
|
|
break;
|
|
bb[k2][j3] = l2.bb[j2][j3];
|
|
j3++;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
} while(!flag2);
|
|
j2++;
|
|
if(!flag2) goto _L12; else goto _L11
|
|
_L11:
|
|
i2++;
|
|
if(!flag2) goto _L14; else goto _L13
|
|
_L13:
|
|
u = 1;
|
|
}
|
|
|
|
public int a(int i1, int j1, int k1)
|
|
{
|
|
int l1;
|
|
boolean flag;
|
|
flag = q.d;
|
|
l1 = 0;
|
|
_L14:
|
|
if(l1 >= a)
|
|
break; /* Loop/switch isn't completed */
|
|
U[l1];
|
|
i1;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR icmpne 73;
|
|
goto _L5 _L6
|
|
_L5:
|
|
V[l1];
|
|
j1;
|
|
_L4:
|
|
if(flag) goto _L8; else goto _L7
|
|
_L7:
|
|
JVM INSTR icmpne 73;
|
|
goto _L9 _L6
|
|
_L9:
|
|
W[l1];
|
|
if(flag) goto _L11; else goto _L10
|
|
_L10:
|
|
k1;
|
|
_L8:
|
|
JVM INSTR icmpne 73;
|
|
goto _L12 _L6
|
|
_L12:
|
|
l1;
|
|
_L11:
|
|
return;
|
|
_L6:
|
|
l1++;
|
|
if(!flag) goto _L14; else goto _L13
|
|
_L13:
|
|
a;
|
|
if(flag) goto _L16; else goto _L15
|
|
_L15:
|
|
T;
|
|
_L2:
|
|
JVM INSTR icmplt 99;
|
|
goto _L17 _L18
|
|
_L17:
|
|
break MISSING_BLOCK_LABEL_97;
|
|
_L18:
|
|
break MISSING_BLOCK_LABEL_99;
|
|
return -1;
|
|
U[a] = i1;
|
|
V[a] = j1;
|
|
W[a] = k1;
|
|
a++;
|
|
_L16:
|
|
return;
|
|
}
|
|
|
|
public int b(int i1, int j1, int k1)
|
|
{
|
|
a;
|
|
if(q.d) goto _L2; else goto _L1
|
|
_L1:
|
|
T;
|
|
JVM INSTR icmplt 19;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_17;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_19;
|
|
return -1;
|
|
U[a] = i1;
|
|
V[a] = j1;
|
|
W[a] = k1;
|
|
a++;
|
|
_L2:
|
|
return;
|
|
}
|
|
|
|
public int a(int i1, int ai[], int j1, int k1)
|
|
{
|
|
i;
|
|
if(q.d) goto _L2; else goto _L1
|
|
_L1:
|
|
ab;
|
|
JVM INSTR icmplt 19;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_17;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_19;
|
|
return -1;
|
|
j[i] = i1;
|
|
k[i] = ai;
|
|
l[i] = j1;
|
|
m[i] = k1;
|
|
u = 1;
|
|
i++;
|
|
_L2:
|
|
return;
|
|
}
|
|
|
|
public l[] a(int i1, int j1, int k1, int l1, int i2, int j2, int k2,
|
|
boolean flag)
|
|
{
|
|
int ai[];
|
|
int ai1[];
|
|
int l2;
|
|
boolean flag2;
|
|
label0:
|
|
{
|
|
flag2 = q.d;
|
|
boolean flag1 = false;
|
|
h();
|
|
ai = new int[j2];
|
|
ai1 = new int[j2];
|
|
l2 = 0;
|
|
do
|
|
{
|
|
if(l2 >= j2)
|
|
break;
|
|
ai[l2] = 0;
|
|
ai1[l2] = 0;
|
|
l2++;
|
|
if(flag2)
|
|
break label0;
|
|
} while(!flag2);
|
|
l2 = 0;
|
|
}
|
|
_L4:
|
|
int i3;
|
|
int j3;
|
|
int k3;
|
|
int ai2[];
|
|
if(l2 >= i)
|
|
break; /* Loop/switch isn't completed */
|
|
i3 = 0;
|
|
j3 = 0;
|
|
k3 = j[l2];
|
|
ai2 = k[l2];
|
|
0;
|
|
if(flag2) goto _L2; else goto _L1
|
|
_L1:
|
|
int i4;
|
|
i4;
|
|
do
|
|
{
|
|
if(i4 >= k3)
|
|
break;
|
|
i3 += U[ai2[i4]];
|
|
j3 += W[ai2[i4]];
|
|
i4++;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
} while(!flag2);
|
|
i4 = i3 / (k3 * k1) + (j3 / (k3 * l1)) * i2;
|
|
ai[i4] += k3;
|
|
ai1[i4]++;
|
|
l2++;
|
|
if(!flag2) goto _L4; else goto _L3
|
|
_L3:
|
|
j2;
|
|
_L2:
|
|
new l[];
|
|
l al[];
|
|
al;
|
|
i3 = 0;
|
|
_L12:
|
|
if(i3 >= j2)
|
|
break; /* Loop/switch isn't completed */
|
|
ai;
|
|
i3;
|
|
if(flag2) goto _L6; else goto _L5
|
|
_L5:
|
|
JVM INSTR iaload ;
|
|
k2;
|
|
if(flag2) goto _L8; else goto _L7
|
|
_L7:
|
|
JVM INSTR icmple 245;
|
|
goto _L9 _L10
|
|
_L9:
|
|
ai;
|
|
i3;
|
|
_L6:
|
|
k2;
|
|
JVM INSTR iastore ;
|
|
_L10:
|
|
al[i3] = new l(ai[i3], ai1[i3], true, true, true, flag, true);
|
|
al[i3].Db = Db;
|
|
al[i3].Eb = Eb;
|
|
i3++;
|
|
if(!flag2) goto _L12; else goto _L11
|
|
_L11:
|
|
i3 = 0;
|
|
_L18:
|
|
i3;
|
|
i;
|
|
_L8:
|
|
JVM INSTR icmpge 443;
|
|
goto _L13 _L14
|
|
_L13:
|
|
break MISSING_BLOCK_LABEL_317;
|
|
_L14:
|
|
break; /* Loop/switch isn't completed */
|
|
int l3;
|
|
int ai3[];
|
|
j3 = 0;
|
|
k3 = 0;
|
|
l3 = j[i3];
|
|
ai3 = k[i3];
|
|
false;
|
|
if(flag2) goto _L16; else goto _L15
|
|
_L15:
|
|
int j4;
|
|
j4;
|
|
do
|
|
{
|
|
if(j4 >= l3)
|
|
break;
|
|
j3 += U[ai3[j4]];
|
|
k3 += W[ai3[j4]];
|
|
j4++;
|
|
if(flag2)
|
|
continue; /* Loop/switch isn't completed */
|
|
} while(!flag2);
|
|
j4 = j3 / (l3 * k1) + (k3 / (l3 * l1)) * i2;
|
|
a(al[j4], ai3, l3, i3);
|
|
i3++;
|
|
if(!flag2) goto _L18; else goto _L17
|
|
_L17:
|
|
false;
|
|
_L16:
|
|
i3;
|
|
_L22:
|
|
if(i3 >= j2)
|
|
break; /* Loop/switch isn't completed */
|
|
al;
|
|
if(flag2) goto _L20; else goto _L19
|
|
_L19:
|
|
i3;
|
|
JVM INSTR aaload ;
|
|
a();
|
|
i3++;
|
|
if(!flag2) goto _L22; else goto _L21
|
|
_L21:
|
|
al;
|
|
_L20:
|
|
return;
|
|
}
|
|
|
|
public void a(l l1, int ai[], int i1, int j1)
|
|
{
|
|
int k1;
|
|
boolean flag;
|
|
label0:
|
|
{
|
|
flag = q.d;
|
|
int ai1[] = new int[i1];
|
|
k1 = 0;
|
|
do
|
|
{
|
|
if(k1 >= i1)
|
|
break;
|
|
int i2 = ai1[k1] = l1.a(U[ai[k1]], V[ai[k1]], W[ai[k1]]);
|
|
l1.g[i2] = g[ai[k1]];
|
|
l1.h[i2] = h[ai[k1]];
|
|
k1++;
|
|
if(flag)
|
|
break label0;
|
|
} while(!flag);
|
|
k1 = l1.a(i1, ai1, l[j1], m[j1]);
|
|
}
|
|
l1;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
L;
|
|
JVM INSTR ifne 164;
|
|
goto _L3 _L4
|
|
_L3:
|
|
this;
|
|
if(flag) goto _L2; else goto _L5
|
|
_L5:
|
|
L;
|
|
JVM INSTR ifne 164;
|
|
goto _L6 _L4
|
|
_L6:
|
|
l1.G[k1] = G[j1];
|
|
_L4:
|
|
l1.p[k1] = p[j1];
|
|
l1.o[k1] = o[j1];
|
|
l1;
|
|
_L2:
|
|
n;
|
|
k1;
|
|
n[j1];
|
|
JVM INSTR iastore ;
|
|
}
|
|
|
|
public void a(boolean flag, int i1, int j1, int k1, int l1, int i2)
|
|
{
|
|
boolean flag2;
|
|
flag2 = q.d;
|
|
boolean flag1 = false;
|
|
Eb = 256 - i1 * 4;
|
|
Db = (64 - j1) * 16 + 128;
|
|
K;
|
|
if(flag2) goto _L2; else goto _L1
|
|
_L1:
|
|
if(K)
|
|
return;
|
|
false;
|
|
_L2:
|
|
int j2;
|
|
j2;
|
|
label0:
|
|
{
|
|
label1:
|
|
do
|
|
{
|
|
label2:
|
|
{
|
|
if(j2 >= i)
|
|
break label1;
|
|
if(flag2)
|
|
break label0;
|
|
if(flag)
|
|
{
|
|
p[j2] = S;
|
|
if(!flag2)
|
|
break label2;
|
|
}
|
|
p[j2] = 0;
|
|
}
|
|
j2++;
|
|
} while(!flag2);
|
|
zb = k1;
|
|
Ab = l1;
|
|
Bb = i2;
|
|
Cb = (int)Math.sqrt(k1 * k1 + l1 * l1 + i2 * i2);
|
|
e();
|
|
}
|
|
return;
|
|
}
|
|
|
|
public void a(int i1, int j1, int k1, int l1, int i2)
|
|
{
|
|
Eb = 256 - i1 * 4;
|
|
Db = (64 - j1) * 16 + 128;
|
|
this;
|
|
if(q.d) goto _L2; else goto _L1
|
|
_L1:
|
|
K;
|
|
JVM INSTR ifeq 40;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_39;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_40;
|
|
return;
|
|
zb = k1;
|
|
Ab = l1;
|
|
Bb = i2;
|
|
Cb = (int)Math.sqrt(k1 * k1 + l1 * l1 + i2 * i2);
|
|
this;
|
|
_L2:
|
|
e();
|
|
}
|
|
|
|
public void c(int i1, int j1, int k1)
|
|
{
|
|
this;
|
|
if(q.d) goto _L2; else goto _L1
|
|
_L1:
|
|
K;
|
|
JVM INSTR ifeq 14;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_13;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_14;
|
|
return;
|
|
zb = i1;
|
|
Ab = j1;
|
|
Bb = k1;
|
|
Cb = (int)Math.sqrt(i1 * i1 + j1 * j1 + k1 * k1);
|
|
this;
|
|
_L2:
|
|
e();
|
|
}
|
|
|
|
public void c(int i1, int j1)
|
|
{
|
|
h[i1] = (byte)j1;
|
|
}
|
|
|
|
public void d(int i1, int j1, int k1)
|
|
{
|
|
lb = lb + i1 & 0xff;
|
|
mb = mb + j1 & 0xff;
|
|
nb = nb + k1 & 0xff;
|
|
c();
|
|
u = 1;
|
|
}
|
|
|
|
public void e(int i1, int j1, int k1)
|
|
{
|
|
lb = i1 & 0xff;
|
|
mb = j1 & 0xff;
|
|
nb = k1 & 0xff;
|
|
c();
|
|
u = 1;
|
|
}
|
|
|
|
public void f(int i1, int j1, int k1)
|
|
{
|
|
ib += i1;
|
|
jb += j1;
|
|
kb += k1;
|
|
c();
|
|
u = 1;
|
|
}
|
|
|
|
public void g(int i1, int j1, int k1)
|
|
{
|
|
ib = i1;
|
|
jb = j1;
|
|
kb = k1;
|
|
c();
|
|
u = 1;
|
|
}
|
|
|
|
private void c()
|
|
{
|
|
boolean flag = q.d;
|
|
this;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
rb;
|
|
256;
|
|
JVM INSTR icmpne 88;
|
|
goto _L3 _L4
|
|
_L3:
|
|
this;
|
|
if(flag) goto _L2; else goto _L5
|
|
_L5:
|
|
sb;
|
|
256;
|
|
JVM INSTR icmpne 88;
|
|
goto _L6 _L4
|
|
_L6:
|
|
this;
|
|
if(flag) goto _L2; else goto _L7
|
|
_L7:
|
|
tb;
|
|
256;
|
|
JVM INSTR icmpne 88;
|
|
goto _L8 _L4
|
|
_L8:
|
|
this;
|
|
if(flag) goto _L2; else goto _L9
|
|
_L9:
|
|
ub;
|
|
256;
|
|
JVM INSTR icmpne 88;
|
|
goto _L10 _L4
|
|
_L10:
|
|
this;
|
|
if(flag) goto _L2; else goto _L11
|
|
_L11:
|
|
vb;
|
|
256;
|
|
JVM INSTR icmpne 88;
|
|
goto _L12 _L4
|
|
_L12:
|
|
wb;
|
|
256;
|
|
if(flag) goto _L14; else goto _L13
|
|
_L13:
|
|
JVM INSTR icmpeq 94;
|
|
goto _L4 _L15
|
|
_L4:
|
|
this;
|
|
_L2:
|
|
4;
|
|
xb;
|
|
return;
|
|
_L15:
|
|
this;
|
|
if(flag) goto _L17; else goto _L16
|
|
_L16:
|
|
ob;
|
|
'\u0100';
|
|
_L14:
|
|
JVM INSTR icmpne 136;
|
|
goto _L18 _L19
|
|
_L18:
|
|
this;
|
|
if(flag) goto _L17; else goto _L20
|
|
_L20:
|
|
pb;
|
|
256;
|
|
JVM INSTR icmpne 136;
|
|
goto _L21 _L19
|
|
_L21:
|
|
qb;
|
|
if(flag) goto _L23; else goto _L22
|
|
_L22:
|
|
256;
|
|
JVM INSTR icmpeq 142;
|
|
goto _L19 _L24
|
|
_L19:
|
|
this;
|
|
_L17:
|
|
3;
|
|
xb;
|
|
return;
|
|
_L24:
|
|
this;
|
|
if(flag) goto _L26; else goto _L25
|
|
_L25:
|
|
lb;
|
|
_L23:
|
|
JVM INSTR ifne 175;
|
|
goto _L27 _L28
|
|
_L27:
|
|
this;
|
|
if(flag) goto _L26; else goto _L29
|
|
_L29:
|
|
mb;
|
|
JVM INSTR ifne 175;
|
|
goto _L30 _L28
|
|
_L30:
|
|
nb;
|
|
if(flag) goto _L32; else goto _L31
|
|
_L31:
|
|
if(nb == 0) goto _L33; else goto _L28
|
|
_L28:
|
|
this;
|
|
_L26:
|
|
2;
|
|
xb;
|
|
return;
|
|
_L33:
|
|
this;
|
|
if(flag) goto _L35; else goto _L34
|
|
_L34:
|
|
ib;
|
|
_L32:
|
|
JVM INSTR ifne 214;
|
|
goto _L36 _L37
|
|
_L36:
|
|
this;
|
|
if(flag) goto _L35; else goto _L38
|
|
_L38:
|
|
jb;
|
|
JVM INSTR ifne 214;
|
|
goto _L39 _L37
|
|
_L39:
|
|
this;
|
|
if(flag) goto _L41; else goto _L40
|
|
_L40:
|
|
kb;
|
|
JVM INSTR ifeq 220;
|
|
goto _L37 _L42
|
|
_L37:
|
|
this;
|
|
_L35:
|
|
1;
|
|
xb;
|
|
return;
|
|
_L42:
|
|
this;
|
|
_L41:
|
|
0;
|
|
xb;
|
|
}
|
|
|
|
private void h(int i1, int j1, int k1)
|
|
{
|
|
int l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= a)
|
|
break;
|
|
X[l1] += i1;
|
|
Y[l1] += j1;
|
|
Z[l1] += k1;
|
|
l1++;
|
|
} while(!q.d);
|
|
}
|
|
|
|
private void i(int i1, int j1, int k1)
|
|
{
|
|
int l1;
|
|
boolean flag;
|
|
flag = q.d;
|
|
l1 = 0;
|
|
_L12:
|
|
if(l1 >= a)
|
|
break; /* Loop/switch isn't completed */
|
|
k1;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
if(k1 != 0)
|
|
{
|
|
int i2 = N[k1];
|
|
int l2 = N[k1 + 256];
|
|
int k3 = Y[l1] * i2 + X[l1] * l2 >> 15;
|
|
Y[l1] = Y[l1] * l2 - X[l1] * i2 >> 15;
|
|
X[l1] = k3;
|
|
}
|
|
i1;
|
|
_L2:
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR ifeq 203;
|
|
goto _L5 _L6
|
|
_L5:
|
|
break MISSING_BLOCK_LABEL_119;
|
|
_L6:
|
|
break MISSING_BLOCK_LABEL_203;
|
|
int j2 = N[i1];
|
|
int i3 = N[i1 + 256];
|
|
int l3 = Y[l1] * i3 - Z[l1] * j2 >> 15;
|
|
Z[l1] = Y[l1] * j2 + Z[l1] * i3 >> 15;
|
|
Y[l1] = l3;
|
|
j1;
|
|
_L4:
|
|
if(flag) goto _L8; else goto _L7
|
|
_L7:
|
|
JVM INSTR ifeq 296;
|
|
goto _L9 _L10
|
|
_L9:
|
|
break MISSING_BLOCK_LABEL_212;
|
|
_L10:
|
|
break MISSING_BLOCK_LABEL_296;
|
|
N[j1];
|
|
_L8:
|
|
int k2;
|
|
k2;
|
|
int j3 = N[j1 + 256];
|
|
int i4 = Z[l1] * k2 + X[l1] * j3 >> 15;
|
|
Z[l1] = Z[l1] * j3 - X[l1] * k2 >> 15;
|
|
X[l1] = i4;
|
|
l1++;
|
|
if(!flag) goto _L12; else goto _L11
|
|
_L11:
|
|
}
|
|
|
|
private void a(int i1, int j1, int k1, int l1, int i2, int j2)
|
|
{
|
|
int k2;
|
|
boolean flag;
|
|
flag = q.d;
|
|
k2 = 0;
|
|
_L22:
|
|
if(k2 >= a)
|
|
break; /* Loop/switch isn't completed */
|
|
i1;
|
|
if(flag) goto _L2; else goto _L1
|
|
_L1:
|
|
if(i1 != 0)
|
|
X[k2] += Y[k2] * i1 >> 8;
|
|
j1;
|
|
_L2:
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR ifeq 79;
|
|
goto _L5 _L6
|
|
_L5:
|
|
break MISSING_BLOCK_LABEL_57;
|
|
_L6:
|
|
break MISSING_BLOCK_LABEL_79;
|
|
Z[k2] += Y[k2] * j1 >> 8;
|
|
k1;
|
|
_L4:
|
|
if(flag) goto _L8; else goto _L7
|
|
_L7:
|
|
JVM INSTR ifeq 110;
|
|
goto _L9 _L10
|
|
_L9:
|
|
break MISSING_BLOCK_LABEL_88;
|
|
_L10:
|
|
break MISSING_BLOCK_LABEL_110;
|
|
X[k2] += Z[k2] * k1 >> 8;
|
|
l1;
|
|
_L8:
|
|
if(flag) goto _L12; else goto _L11
|
|
_L11:
|
|
JVM INSTR ifeq 143;
|
|
goto _L13 _L14
|
|
_L13:
|
|
break MISSING_BLOCK_LABEL_120;
|
|
_L14:
|
|
break MISSING_BLOCK_LABEL_143;
|
|
Y[k2] += Z[k2] * l1 >> 8;
|
|
i2;
|
|
_L12:
|
|
if(flag) goto _L16; else goto _L15
|
|
_L15:
|
|
JVM INSTR ifeq 176;
|
|
goto _L17 _L18
|
|
_L17:
|
|
break MISSING_BLOCK_LABEL_153;
|
|
_L18:
|
|
break MISSING_BLOCK_LABEL_176;
|
|
Z[k2] += X[k2] * i2 >> 8;
|
|
j2;
|
|
_L16:
|
|
JVM INSTR ifeq 204;
|
|
goto _L19 _L20
|
|
_L19:
|
|
break MISSING_BLOCK_LABEL_181;
|
|
_L20:
|
|
break MISSING_BLOCK_LABEL_204;
|
|
Y[k2] += X[k2] * j2 >> 8;
|
|
k2++;
|
|
if(!flag) goto _L22; else goto _L21
|
|
_L21:
|
|
}
|
|
|
|
private void j(int i1, int j1, int k1)
|
|
{
|
|
int l1 = 0;
|
|
do
|
|
{
|
|
if(l1 >= a)
|
|
break;
|
|
X[l1] = X[l1] * i1 >> 8;
|
|
Y[l1] = Y[l1] * j1 >> 8;
|
|
Z[l1] = Z[l1] * k1 >> 8;
|
|
l1++;
|
|
} while(!q.d);
|
|
}
|
|
|
|
private void d()
|
|
{
|
|
int i1;
|
|
boolean flag1;
|
|
flag1 = q.d;
|
|
boolean flag = false;
|
|
w = y = A = 0xf423f;
|
|
yb = x = z = B = 0xfff0bdc1;
|
|
i1 = 0;
|
|
_L66:
|
|
int ai[];
|
|
int k1;
|
|
int l1;
|
|
int i2;
|
|
int j2;
|
|
int k2;
|
|
int l2;
|
|
int i3;
|
|
int j3;
|
|
if(i1 >= i)
|
|
break; /* Loop/switch isn't completed */
|
|
ai = k[i1];
|
|
int j1 = ai[0];
|
|
k1 = j[i1];
|
|
i2 = l1 = X[j1];
|
|
k2 = j2 = Y[j1];
|
|
i3 = l2 = Z[j1];
|
|
j3 = 0;
|
|
_L28:
|
|
int k3;
|
|
if(j3 >= k1)
|
|
break; /* Loop/switch isn't completed */
|
|
k3 = ai[j3];
|
|
X[k3];
|
|
l1;
|
|
if(flag1) goto _L2; else goto _L1
|
|
_L1:
|
|
if(flag1) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR icmpge 162;
|
|
goto _L5 _L6
|
|
_L5:
|
|
l1 = X[k3];
|
|
if(!flag1) goto _L7; else goto _L6
|
|
_L6:
|
|
X[k3];
|
|
i2;
|
|
_L4:
|
|
if(flag1) goto _L9; else goto _L8
|
|
_L8:
|
|
JVM INSTR icmple 188;
|
|
goto _L10 _L7
|
|
_L10:
|
|
i2 = X[k3];
|
|
_L7:
|
|
Y[k3];
|
|
j2;
|
|
_L9:
|
|
if(flag1) goto _L12; else goto _L11
|
|
_L11:
|
|
JVM INSTR icmpge 219;
|
|
goto _L13 _L14
|
|
_L13:
|
|
j2 = Y[k3];
|
|
if(!flag1) goto _L15; else goto _L14
|
|
_L14:
|
|
Y[k3];
|
|
k2;
|
|
_L12:
|
|
if(flag1) goto _L17; else goto _L16
|
|
_L16:
|
|
JVM INSTR icmple 245;
|
|
goto _L18 _L15
|
|
_L18:
|
|
k2 = Y[k3];
|
|
_L15:
|
|
Z[k3];
|
|
l2;
|
|
_L17:
|
|
if(flag1) goto _L20; else goto _L19
|
|
_L19:
|
|
JVM INSTR icmpge 276;
|
|
goto _L21 _L22
|
|
_L21:
|
|
l2 = Z[k3];
|
|
if(!flag1) goto _L23; else goto _L22
|
|
_L22:
|
|
Z[k3];
|
|
if(flag1) goto _L25; else goto _L24
|
|
_L24:
|
|
i3;
|
|
_L20:
|
|
JVM INSTR icmple 302;
|
|
goto _L26 _L23
|
|
_L26:
|
|
Z[k3];
|
|
_L25:
|
|
i3;
|
|
_L23:
|
|
j3++;
|
|
if(!flag1) goto _L28; else goto _L27
|
|
_L27:
|
|
J;
|
|
if(flag1) goto _L30; else goto _L29
|
|
_L29:
|
|
if(!J)
|
|
{
|
|
cb[i1] = l1;
|
|
db[i1] = i2;
|
|
eb[i1] = j2;
|
|
fb[i1] = k2;
|
|
gb[i1] = l2;
|
|
hb[i1] = i3;
|
|
}
|
|
i2 - l1;
|
|
_L30:
|
|
yb;
|
|
_L2:
|
|
if(flag1) goto _L32; else goto _L31
|
|
_L31:
|
|
JVM INSTR icmple 396;
|
|
goto _L33 _L34
|
|
_L33:
|
|
break MISSING_BLOCK_LABEL_387;
|
|
_L34:
|
|
break MISSING_BLOCK_LABEL_396;
|
|
yb = i2 - l1;
|
|
k2 - j2;
|
|
yb;
|
|
_L32:
|
|
if(flag1) goto _L36; else goto _L35
|
|
_L35:
|
|
JVM INSTR icmple 422;
|
|
goto _L37 _L38
|
|
_L37:
|
|
break MISSING_BLOCK_LABEL_413;
|
|
_L38:
|
|
break MISSING_BLOCK_LABEL_422;
|
|
yb = k2 - j2;
|
|
i3 - l2;
|
|
yb;
|
|
_L36:
|
|
if(flag1) goto _L40; else goto _L39
|
|
_L39:
|
|
JVM INSTR icmple 448;
|
|
goto _L41 _L42
|
|
_L41:
|
|
break MISSING_BLOCK_LABEL_439;
|
|
_L42:
|
|
break MISSING_BLOCK_LABEL_448;
|
|
yb = i3 - l2;
|
|
l1;
|
|
w;
|
|
_L40:
|
|
if(flag1) goto _L44; else goto _L43
|
|
_L43:
|
|
JVM INSTR icmpge 468;
|
|
goto _L45 _L46
|
|
_L45:
|
|
break MISSING_BLOCK_LABEL_462;
|
|
_L46:
|
|
break MISSING_BLOCK_LABEL_468;
|
|
w = l1;
|
|
i2;
|
|
x;
|
|
_L44:
|
|
if(flag1) goto _L48; else goto _L47
|
|
_L47:
|
|
JVM INSTR icmple 488;
|
|
goto _L49 _L50
|
|
_L49:
|
|
break MISSING_BLOCK_LABEL_482;
|
|
_L50:
|
|
break MISSING_BLOCK_LABEL_488;
|
|
x = i2;
|
|
j2;
|
|
y;
|
|
_L48:
|
|
if(flag1) goto _L52; else goto _L51
|
|
_L51:
|
|
JVM INSTR icmpge 508;
|
|
goto _L53 _L54
|
|
_L53:
|
|
break MISSING_BLOCK_LABEL_502;
|
|
_L54:
|
|
break MISSING_BLOCK_LABEL_508;
|
|
y = j2;
|
|
k2;
|
|
z;
|
|
_L52:
|
|
if(flag1) goto _L56; else goto _L55
|
|
_L55:
|
|
JVM INSTR icmple 528;
|
|
goto _L57 _L58
|
|
_L57:
|
|
break MISSING_BLOCK_LABEL_522;
|
|
_L58:
|
|
break MISSING_BLOCK_LABEL_528;
|
|
z = k2;
|
|
l2;
|
|
A;
|
|
_L56:
|
|
if(flag1) goto _L60; else goto _L59
|
|
_L59:
|
|
JVM INSTR icmpge 548;
|
|
goto _L61 _L62
|
|
_L61:
|
|
break MISSING_BLOCK_LABEL_542;
|
|
_L62:
|
|
break MISSING_BLOCK_LABEL_548;
|
|
A = l2;
|
|
i3;
|
|
B;
|
|
_L60:
|
|
JVM INSTR icmple 563;
|
|
goto _L63 _L64
|
|
_L63:
|
|
break MISSING_BLOCK_LABEL_557;
|
|
_L64:
|
|
break MISSING_BLOCK_LABEL_563;
|
|
B = i3;
|
|
i1++;
|
|
if(!flag1) goto _L66; else goto _L65
|
|
_L65:
|
|
}
|
|
|
|
public void e()
|
|
{
|
|
boolean flag1;
|
|
flag1 = q.d;
|
|
boolean flag = false;
|
|
K;
|
|
if(flag1) goto _L2; else goto _L1
|
|
_L1:
|
|
if(K)
|
|
return;
|
|
Db * Cb >> 8;
|
|
_L2:
|
|
int i1;
|
|
i1;
|
|
int j1 = 0;
|
|
_L10:
|
|
if(j1 >= i)
|
|
break; /* Loop/switch isn't completed */
|
|
p;
|
|
j1;
|
|
if(flag1) goto _L4; else goto _L3
|
|
_L3:
|
|
JVM INSTR iaload ;
|
|
if(flag1) goto _L6; else goto _L5
|
|
_L5:
|
|
S;
|
|
JVM INSTR icmpeq 109;
|
|
goto _L7 _L8
|
|
_L7:
|
|
p;
|
|
j1;
|
|
_L4:
|
|
(q[j1] * zb + r[j1] * Ab + s[j1] * Bb) / i1;
|
|
JVM INSTR iastore ;
|
|
_L8:
|
|
j1++;
|
|
if(!flag1) goto _L10; else goto _L9
|
|
_L9:
|
|
a;
|
|
_L6:
|
|
new int[];
|
|
int ai[];
|
|
ai;
|
|
int ai1[];
|
|
int ai2[];
|
|
int ai3[];
|
|
int k1;
|
|
label0:
|
|
{
|
|
ai1 = new int[a];
|
|
ai2 = new int[a];
|
|
ai3 = new int[a];
|
|
k1 = 0;
|
|
do
|
|
{
|
|
if(k1 >= a)
|
|
break;
|
|
ai[k1] = 0;
|
|
ai1[k1] = 0;
|
|
ai2[k1] = 0;
|
|
ai3[k1] = 0;
|
|
k1++;
|
|
if(flag1)
|
|
break label0;
|
|
} while(!flag1);
|
|
k1 = 0;
|
|
}
|
|
_L18:
|
|
if(k1 >= i)
|
|
break; /* Loop/switch isn't completed */
|
|
p[k1];
|
|
if(flag1) goto _L12; else goto _L11
|
|
_L11:
|
|
S;
|
|
if(flag1) goto _L14; else goto _L13
|
|
_L13:
|
|
JVM INSTR icmpne 325;
|
|
goto _L15 _L16
|
|
_L15:
|
|
false;
|
|
_L12:
|
|
int l1;
|
|
l1;
|
|
do
|
|
{
|
|
if(l1 >= j[k1])
|
|
break;
|
|
int i2 = k[k1][l1];
|
|
ai[i2] += q[k1];
|
|
ai1[i2] += r[k1];
|
|
ai2[i2] += s[k1];
|
|
ai3[i2]++;
|
|
l1++;
|
|
if(flag1)
|
|
continue; /* Loop/switch isn't completed */
|
|
} while(!flag1);
|
|
_L16:
|
|
k1++;
|
|
if(!flag1) goto _L18; else goto _L17
|
|
_L17:
|
|
k1 = 0;
|
|
_L26:
|
|
k1;
|
|
a;
|
|
_L14:
|
|
JVM INSTR icmpge 412;
|
|
goto _L19 _L20
|
|
_L19:
|
|
break MISSING_BLOCK_LABEL_345;
|
|
_L20:
|
|
break; /* Loop/switch isn't completed */
|
|
ai3;
|
|
k1;
|
|
if(flag1) goto _L22; else goto _L21
|
|
_L21:
|
|
JVM INSTR iaload ;
|
|
JVM INSTR ifle 404;
|
|
goto _L23 _L24
|
|
_L23:
|
|
g;
|
|
k1;
|
|
_L22:
|
|
(ai[k1] * zb + ai1[k1] * Ab + ai2[k1] * Bb) / (i1 * ai3[k1]);
|
|
JVM INSTR iastore ;
|
|
_L24:
|
|
k1++;
|
|
if(!flag1) goto _L26; else goto _L25
|
|
_L25:
|
|
}
|
|
|
|
public void f()
|
|
{
|
|
boolean flag1;
|
|
flag1 = q.d;
|
|
boolean flag = false;
|
|
K;
|
|
if(flag1) goto _L2; else goto _L1
|
|
_L1:
|
|
if(!K) goto _L4; else goto _L3
|
|
_L3:
|
|
J;
|
|
if(flag1) goto _L2; else goto _L5
|
|
_L5:
|
|
if(J)
|
|
return;
|
|
_L4:
|
|
false;
|
|
_L2:
|
|
int i1;
|
|
i1;
|
|
_L23:
|
|
int k3;
|
|
int l3;
|
|
int i4;
|
|
if(i1 >= i)
|
|
break; /* Loop/switch isn't completed */
|
|
int ai[] = k[i1];
|
|
int j1 = X[ai[0]];
|
|
int k1 = Y[ai[0]];
|
|
int l1 = Z[ai[0]];
|
|
int i2 = X[ai[1]] - j1;
|
|
int j2 = Y[ai[1]] - k1;
|
|
int k2 = Z[ai[1]] - l1;
|
|
int l2 = X[ai[2]] - j1;
|
|
int i3 = Y[ai[2]] - k1;
|
|
int j3 = Z[ai[2]] - l1;
|
|
k3 = j2 * j3 - i3 * k2;
|
|
l3 = k2 * l2 - j3 * i2;
|
|
if(flag1)
|
|
break MISSING_BLOCK_LABEL_404;
|
|
i4 = i2 * i3 - l2 * j2;
|
|
_L21:
|
|
if(k3 > 8192) goto _L7; else goto _L6
|
|
_L6:
|
|
l3;
|
|
8192;
|
|
if(flag1 || flag1) goto _L9; else goto _L8
|
|
_L8:
|
|
JVM INSTR icmpgt 279;
|
|
goto _L10 _L7
|
|
_L10:
|
|
i4;
|
|
8192;
|
|
if(flag1) goto _L9; else goto _L11
|
|
_L11:
|
|
JVM INSTR icmpgt 279;
|
|
goto _L12 _L7
|
|
_L12:
|
|
k3;
|
|
-8192;
|
|
if(flag1) goto _L9; else goto _L13
|
|
_L13:
|
|
JVM INSTR icmplt 279;
|
|
goto _L14 _L7
|
|
_L14:
|
|
l3;
|
|
-8192;
|
|
if(flag1) goto _L9; else goto _L15
|
|
_L15:
|
|
JVM INSTR icmplt 279;
|
|
goto _L16 _L7
|
|
_L16:
|
|
i4;
|
|
if(flag1) goto _L18; else goto _L17
|
|
_L17:
|
|
-8192;
|
|
JVM INSTR icmpge 302;
|
|
goto _L7 _L19
|
|
_L19:
|
|
break; /* Loop/switch isn't completed */
|
|
_L7:
|
|
k3 >>= 1;
|
|
l3 >>= 1;
|
|
i4;
|
|
true;
|
|
_L9:
|
|
JVM INSTR ishr ;
|
|
i4;
|
|
if(!flag1) goto _L21; else goto _L20
|
|
_L20:
|
|
(int)(256D * Math.sqrt(k3 * k3 + l3 * l3 + i4 * i4));
|
|
_L18:
|
|
int j4;
|
|
j4;
|
|
if(!flag1)
|
|
{
|
|
if(j4 <= 0)
|
|
j4 = 1;
|
|
q[i1] = (k3 * 0x10000) / j4;
|
|
r[i1] = (l3 * 0x10000) / j4;
|
|
s[i1] = (i4 * 65535) / j4;
|
|
o[i1] = -1;
|
|
i1++;
|
|
}
|
|
if(!flag1) goto _L23; else goto _L22
|
|
_L22:
|
|
e();
|
|
}
|
|
|
|
public void g()
|
|
{
|
|
boolean flag1;
|
|
flag1 = q.d;
|
|
boolean flag = false;
|
|
u;
|
|
2;
|
|
if(flag1) goto _L2; else goto _L1
|
|
_L1:
|
|
JVM INSTR icmpne 118;
|
|
goto _L3 _L4
|
|
_L3:
|
|
break MISSING_BLOCK_LABEL_18;
|
|
_L4:
|
|
break MISSING_BLOCK_LABEL_118;
|
|
label0:
|
|
{
|
|
u = 0;
|
|
int i1 = 0;
|
|
do
|
|
{
|
|
if(i1 >= a)
|
|
break;
|
|
X[i1] = U[i1];
|
|
Y[i1] = V[i1];
|
|
Z[i1] = W[i1];
|
|
i1++;
|
|
if(flag1)
|
|
break label0;
|
|
} while(!flag1);
|
|
w = y = A = 0xff676981;
|
|
yb = x = z = B = 0x98967f;
|
|
}
|
|
return;
|
|
u;
|
|
if(flag1) goto _L6; else goto _L5
|
|
_L5:
|
|
true;
|
|
_L2:
|
|
JVM INSTR icmpne 324;
|
|
goto _L7 _L8
|
|
_L7:
|
|
u = 0;
|
|
false;
|
|
_L6:
|
|
int j1;
|
|
j1;
|
|
_L12:
|
|
if(j1 >= a)
|
|
break; /* Loop/switch isn't completed */
|
|
X[j1] = U[j1];
|
|
Y[j1] = V[j1];
|
|
Z[j1] = W[j1];
|
|
j1++;
|
|
if(flag1) goto _L10; else goto _L9
|
|
_L9:
|
|
if(!flag1) goto _L12; else goto _L11
|
|
_L11:
|
|
xb;
|
|
2;
|
|
if(flag1) goto _L14; else goto _L13
|
|
_L13:
|
|
JVM INSTR icmplt 220;
|
|
goto _L15 _L10
|
|
_L15:
|
|
i(lb, mb, nb);
|
|
_L10:
|
|
xb;
|
|
3;
|
|
_L14:
|
|
if(flag1) goto _L17; else goto _L16
|
|
_L16:
|
|
JVM INSTR icmplt 248;
|
|
goto _L18 _L19
|
|
_L18:
|
|
break MISSING_BLOCK_LABEL_232;
|
|
_L19:
|
|
break MISSING_BLOCK_LABEL_248;
|
|
j(ob, pb, qb);
|
|
xb;
|
|
4;
|
|
_L17:
|
|
if(flag1) goto _L21; else goto _L20
|
|
_L20:
|
|
JVM INSTR icmplt 288;
|
|
goto _L22 _L23
|
|
_L22:
|
|
break MISSING_BLOCK_LABEL_260;
|
|
_L23:
|
|
break MISSING_BLOCK_LABEL_288;
|
|
a(rb, sb, tb, ub, vb, wb);
|
|
this;
|
|
if(flag1) goto _L25; else goto _L24
|
|
_L24:
|
|
xb;
|
|
true;
|
|
_L21:
|
|
JVM INSTR icmplt 316;
|
|
goto _L26 _L27
|
|
_L26:
|
|
break MISSING_BLOCK_LABEL_300;
|
|
_L27:
|
|
break MISSING_BLOCK_LABEL_316;
|
|
h(ib, jb, kb);
|
|
d();
|
|
this;
|
|
_L25:
|
|
f();
|
|
_L8:
|
|
}
|
|
|
|
public void a(int i1, int j1, int k1, int l1, int i2, int j2, int k2,
|
|
int l2)
|
|
{
|
|
boolean flag1;
|
|
flag1 = q.d;
|
|
boolean flag = false;
|
|
g();
|
|
this;
|
|
if(flag1) goto _L2; else goto _L1
|
|
_L1:
|
|
A;
|
|
f.Bb;
|
|
JVM INSTR icmpgt 102;
|
|
goto _L3 _L4
|
|
_L3:
|
|
this;
|
|
if(flag1) goto _L2; else goto _L5
|
|
_L5:
|
|
B;
|
|
f.Ab;
|
|
JVM INSTR icmplt 102;
|
|
goto _L6 _L4
|
|
_L6:
|
|
this;
|
|
if(flag1) goto _L2; else goto _L7
|
|
_L7:
|
|
w;
|
|
f.xb;
|
|
JVM INSTR icmpgt 102;
|
|
goto _L8 _L4
|
|
_L8:
|
|
this;
|
|
if(flag1) goto _L2; else goto _L9
|
|
_L9:
|
|
x;
|
|
f.wb;
|
|
JVM INSTR icmplt 102;
|
|
goto _L10 _L4
|
|
_L10:
|
|
this;
|
|
if(flag1) goto _L2; else goto _L11
|
|
_L11:
|
|
y;
|
|
f.zb;
|
|
JVM INSTR icmpgt 102;
|
|
goto _L12 _L4
|
|
_L12:
|
|
z;
|
|
if(flag1) goto _L14; else goto _L13
|
|
_L13:
|
|
f.yb;
|
|
JVM INSTR icmpge 108;
|
|
goto _L4 _L15
|
|
_L4:
|
|
this;
|
|
_L2:
|
|
false;
|
|
v;
|
|
return;
|
|
_L15:
|
|
v = true;
|
|
false;
|
|
_L14:
|
|
int i3;
|
|
i3;
|
|
int j3;
|
|
int k3;
|
|
int l3;
|
|
int i4;
|
|
int j4;
|
|
j3 = 0;
|
|
k3 = 0;
|
|
l3 = 0;
|
|
i4 = 0;
|
|
j4 = 0;
|
|
j2;
|
|
if(flag1) goto _L17; else goto _L16
|
|
_L16:
|
|
if(j2 != 0)
|
|
{
|
|
i3 = O[j2];
|
|
j3 = O[j2 + 1024];
|
|
}
|
|
i2;
|
|
_L17:
|
|
if(flag1) goto _L19; else goto _L18
|
|
_L18:
|
|
JVM INSTR ifeq 191;
|
|
goto _L20 _L21
|
|
_L20:
|
|
break MISSING_BLOCK_LABEL_171;
|
|
_L21:
|
|
break MISSING_BLOCK_LABEL_191;
|
|
i4 = O[i2];
|
|
j4 = O[i2 + 1024];
|
|
l1;
|
|
_L19:
|
|
if(flag1) goto _L23; else goto _L22
|
|
_L22:
|
|
JVM INSTR ifeq 221;
|
|
goto _L24 _L25
|
|
_L24:
|
|
break MISSING_BLOCK_LABEL_201;
|
|
_L25:
|
|
break MISSING_BLOCK_LABEL_221;
|
|
k3 = O[l1];
|
|
l3 = O[l1 + 1024];
|
|
false;
|
|
_L23:
|
|
int k4;
|
|
k4;
|
|
_L39:
|
|
int l4;
|
|
int i5;
|
|
int j5;
|
|
if(k4 >= a)
|
|
break; /* Loop/switch isn't completed */
|
|
l4 = X[k4] - i1;
|
|
i5 = Y[k4] - j1;
|
|
j5 = Z[k4] - k1;
|
|
j2;
|
|
if(flag1) goto _L27; else goto _L26
|
|
_L26:
|
|
if(j2 != 0)
|
|
{
|
|
int k5 = i5 * i3 + l4 * j3 >> 15;
|
|
i5 = i5 * j3 - l4 * i3 >> 15;
|
|
l4 = k5;
|
|
}
|
|
i2;
|
|
_L27:
|
|
if(flag1) goto _L29; else goto _L28
|
|
_L28:
|
|
JVM INSTR ifeq 358;
|
|
goto _L30 _L31
|
|
_L30:
|
|
break MISSING_BLOCK_LABEL_322;
|
|
_L31:
|
|
break MISSING_BLOCK_LABEL_358;
|
|
int l5 = j5 * i4 + l4 * j4 >> 15;
|
|
j5 = j5 * j4 - l4 * i4 >> 15;
|
|
l4 = l5;
|
|
l1;
|
|
_L29:
|
|
if(flag1) goto _L33; else goto _L32
|
|
_L32:
|
|
JVM INSTR ifeq 404;
|
|
goto _L34 _L35
|
|
_L34:
|
|
break MISSING_BLOCK_LABEL_368;
|
|
_L35:
|
|
break MISSING_BLOCK_LABEL_404;
|
|
int i6 = i5 * l3 - j5 * k3 >> 15;
|
|
j5 = i5 * k3 + j5 * l3 >> 15;
|
|
i5 = i6;
|
|
j5;
|
|
_L33:
|
|
l2;
|
|
JVM INSTR icmplt 431;
|
|
goto _L36 _L37
|
|
_L36:
|
|
break MISSING_BLOCK_LABEL_411;
|
|
_L37:
|
|
break MISSING_BLOCK_LABEL_431;
|
|
e[k4] = (l4 << k2) / j5;
|
|
if(!flag1)
|
|
break MISSING_BLOCK_LABEL_443;
|
|
e[k4] = l4 << k2;
|
|
label0:
|
|
{
|
|
if(j5 >= l2)
|
|
{
|
|
f[k4] = (i5 << k2) / j5;
|
|
if(!flag1)
|
|
break label0;
|
|
}
|
|
f[k4] = i5 << k2;
|
|
}
|
|
b[k4] = l4;
|
|
c[k4] = i5;
|
|
d[k4] = j5;
|
|
k4++;
|
|
if(!flag1) goto _L39; else goto _L38
|
|
_L38:
|
|
}
|
|
|
|
public void h()
|
|
{
|
|
label0:
|
|
{
|
|
boolean flag = q.d;
|
|
g();
|
|
int i1 = 0;
|
|
do
|
|
{
|
|
if(i1 >= a)
|
|
break;
|
|
U[i1] = X[i1];
|
|
V[i1] = Y[i1];
|
|
W[i1] = Z[i1];
|
|
i1++;
|
|
if(flag)
|
|
break label0;
|
|
} while(!flag);
|
|
ib = jb = kb = 0;
|
|
lb = mb = nb = 0;
|
|
ob = pb = qb = 256;
|
|
rb = sb = tb = ub = vb = wb = 256;
|
|
xb = 0;
|
|
}
|
|
}
|
|
|
|
public l i()
|
|
{
|
|
l al[] = new l[1];
|
|
al[0] = this;
|
|
l l1 = new l(al, 1);
|
|
l1.t = 0;
|
|
l1.E = E;
|
|
return l1;
|
|
}
|
|
|
|
public l a(boolean flag, boolean flag1, boolean flag2, boolean flag3)
|
|
{
|
|
l al[] = new l[1];
|
|
al[0] = this;
|
|
l l1 = new l(al, 1, flag, flag1, flag2, flag3);
|
|
l1.t = 0;
|
|
return l1;
|
|
}
|
|
|
|
public void a(l l1)
|
|
{
|
|
lb = l1.lb;
|
|
mb = l1.mb;
|
|
nb = l1.nb;
|
|
ib = l1.ib;
|
|
jb = l1.jb;
|
|
kb = l1.kb;
|
|
c();
|
|
u = 1;
|
|
}
|
|
|
|
public int a(byte abyte0[])
|
|
{
|
|
boolean flag = q.d;
|
|
_L7:
|
|
if(abyte0[Fb] == 10) goto _L2; else goto _L1
|
|
_L1:
|
|
abyte0[Fb];
|
|
if(flag) goto _L4; else goto _L3
|
|
_L3:
|
|
13;
|
|
JVM INSTR icmpne 47;
|
|
goto _L2 _L5
|
|
_L5:
|
|
break; /* Loop/switch isn't completed */
|
|
_L2:
|
|
Fb++;
|
|
if(!flag) goto _L7; else goto _L6
|
|
_L6:
|
|
Q[abyte0[Fb++] & 0xff];
|
|
_L4:
|
|
int i1;
|
|
i1;
|
|
int l1;
|
|
int j1 = Q[abyte0[Fb++] & 0xff];
|
|
int k1 = Q[abyte0[Fb++] & 0xff];
|
|
l1 = (i1 * 4096 + j1 * 64 + k1) - 0x20000;
|
|
l1;
|
|
if(flag) goto _L9; else goto _L8
|
|
_L8:
|
|
0x1e240;
|
|
JVM INSTR icmpne 150;
|
|
goto _L10 _L11
|
|
_L10:
|
|
break MISSING_BLOCK_LABEL_144;
|
|
_L11:
|
|
break MISSING_BLOCK_LABEL_150;
|
|
l1 = S;
|
|
l1;
|
|
_L9:
|
|
return;
|
|
}
|
|
|
|
public int a;
|
|
public int b[];
|
|
public int c[];
|
|
public int d[];
|
|
public int e[];
|
|
public int f[];
|
|
public int g[];
|
|
public byte h[];
|
|
public int i;
|
|
public int j[];
|
|
public int k[][];
|
|
public int l[];
|
|
public int m[];
|
|
public int n[];
|
|
public int o[];
|
|
public int p[];
|
|
public int q[];
|
|
public int r[];
|
|
public int s[];
|
|
public int t;
|
|
public int u;
|
|
public boolean v;
|
|
public int w;
|
|
public int x;
|
|
public int y;
|
|
public int z;
|
|
public int A;
|
|
public int B;
|
|
public boolean C;
|
|
public boolean D;
|
|
public boolean E;
|
|
public int F;
|
|
public int G[];
|
|
public byte H[];
|
|
private boolean I;
|
|
public boolean J;
|
|
public boolean K;
|
|
public boolean L;
|
|
public boolean M;
|
|
private static int N[];
|
|
private static int O[];
|
|
private static byte P[];
|
|
private static int Q[];
|
|
private int R;
|
|
private int S;
|
|
public int T;
|
|
public int U[];
|
|
public int V[];
|
|
public int W[];
|
|
public int X[];
|
|
public int Y[];
|
|
public int Z[];
|
|
private int ab;
|
|
private int bb[][];
|
|
private int cb[];
|
|
private int db[];
|
|
private int eb[];
|
|
private int fb[];
|
|
private int gb[];
|
|
private int hb[];
|
|
private int ib;
|
|
private int jb;
|
|
private int kb;
|
|
private int lb;
|
|
private int mb;
|
|
private int nb;
|
|
private int ob;
|
|
private int pb;
|
|
private int qb;
|
|
private int rb;
|
|
private int sb;
|
|
private int tb;
|
|
private int ub;
|
|
private int vb;
|
|
private int wb;
|
|
private int xb;
|
|
private int yb;
|
|
private int zb;
|
|
private int Ab;
|
|
private int Bb;
|
|
private int Cb;
|
|
protected int Db;
|
|
protected int Eb;
|
|
private int Fb;
|
|
private int Gb;
|
|
|
|
static
|
|
{
|
|
N = new int[512];
|
|
O = new int[2048];
|
|
P = new byte[64];
|
|
Q = new int[256];
|
|
for(int i1 = 0; i1 < 256; i1++)
|
|
{
|
|
N[i1] = (int)(Math.sin((double)i1 * 0.02454369D) * 32768D);
|
|
N[i1 + 256] = (int)(Math.cos((double)i1 * 0.02454369D) * 32768D);
|
|
}
|
|
|
|
for(int j1 = 0; j1 < 1024; j1++)
|
|
{
|
|
O[j1] = (int)(Math.sin((double)j1 * 0.00613592315D) * 32768D);
|
|
O[j1 + 1024] = (int)(Math.cos((double)j1 * 0.00613592315D) * 32768D);
|
|
}
|
|
|
|
for(int k1 = 0; k1 < 10; k1++)
|
|
P[k1] = (byte)(48 + k1);
|
|
|
|
for(int l1 = 0; l1 < 26; l1++)
|
|
P[l1 + 10] = (byte)(65 + l1);
|
|
|
|
for(int i2 = 0; i2 < 26; i2++)
|
|
P[i2 + 36] = (byte)(97 + i2);
|
|
|
|
P[62] = -93;
|
|
P[63] = 36;
|
|
for(int j2 = 0; j2 < 10; j2++)
|
|
Q[48 + j2] = j2;
|
|
|
|
for(int k2 = 0; k2 < 26; k2++)
|
|
Q[65 + k2] = k2 + 10;
|
|
|
|
for(int l2 = 0; l2 < 26; l2++)
|
|
Q[97 + l2] = l2 + 36;
|
|
|
|
Q[163] = 62;
|
|
Q[36] = 63;
|
|
}
|
|
}
|