578 lines
20 KiB
Java
578 lines
20 KiB
Java
package h0.a.a;
|
|
|
|
import h0.a.a.v;
|
|
import java.util.Objects;
|
|
/* compiled from: Frame */
|
|
public class m {
|
|
public p a;
|
|
public int[] b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public int[] f2810c;
|
|
public int[] d;
|
|
public int[] e;
|
|
public short f;
|
|
public short g;
|
|
public int h;
|
|
public int[] i;
|
|
|
|
public m(p pVar) {
|
|
this.a = pVar;
|
|
}
|
|
|
|
public static int c(v vVar, Object obj) {
|
|
return obj instanceof Integer ? 16777216 | ((Integer) obj).intValue() : obj instanceof String ? d(vVar, w.h((String) obj).d(), 0) : vVar.p("", ((p) obj).e) | 50331648;
|
|
}
|
|
|
|
public static int d(v vVar, String str, int i) {
|
|
char charAt = str.charAt(i);
|
|
int i2 = 16777218;
|
|
if (charAt == 'F') {
|
|
return 16777218;
|
|
}
|
|
if (charAt == 'L') {
|
|
return vVar.n(str.substring(i + 1, str.length() - 1)) | 33554432;
|
|
}
|
|
if (charAt != 'S') {
|
|
if (charAt == 'V') {
|
|
return 0;
|
|
}
|
|
if (charAt != 'I') {
|
|
if (charAt == 'J') {
|
|
return 16777220;
|
|
}
|
|
if (charAt != 'Z') {
|
|
if (charAt != '[') {
|
|
switch (charAt) {
|
|
case 'B':
|
|
case 'C':
|
|
break;
|
|
case 'D':
|
|
return 16777219;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
} else {
|
|
int i3 = i + 1;
|
|
while (str.charAt(i3) == '[') {
|
|
i3++;
|
|
}
|
|
char charAt2 = str.charAt(i3);
|
|
if (charAt2 != 'F') {
|
|
if (charAt2 == 'L') {
|
|
i2 = vVar.n(str.substring(i3 + 1, str.length() - 1)) | 33554432;
|
|
} else if (charAt2 == 'S') {
|
|
i2 = 16777228;
|
|
} else if (charAt2 == 'Z') {
|
|
i2 = 16777225;
|
|
} else if (charAt2 == 'I') {
|
|
i2 = 16777217;
|
|
} else if (charAt2 != 'J') {
|
|
switch (charAt2) {
|
|
case 'B':
|
|
i2 = 16777226;
|
|
break;
|
|
case 'C':
|
|
i2 = 16777227;
|
|
break;
|
|
case 'D':
|
|
i2 = 16777219;
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
} else {
|
|
i2 = 16777220;
|
|
}
|
|
}
|
|
return ((i3 - i) << 28) | i2;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return 16777217;
|
|
}
|
|
|
|
public static boolean g(v vVar, int i, int[] iArr, int i2) {
|
|
int min;
|
|
int n;
|
|
int i3;
|
|
int i4 = i;
|
|
int i5 = iArr[i2];
|
|
if (i5 == i4) {
|
|
return false;
|
|
}
|
|
if ((268435455 & i4) == 16777221) {
|
|
if (i5 == 16777221) {
|
|
return false;
|
|
}
|
|
i4 = 16777221;
|
|
}
|
|
if (i5 == 0) {
|
|
iArr[i2] = i4;
|
|
return true;
|
|
}
|
|
int i6 = i5 & -268435456;
|
|
int i7 = 16777216;
|
|
if (i6 != 0 || (i5 & 251658240) == 33554432) {
|
|
if (i4 == 16777221) {
|
|
return false;
|
|
}
|
|
String str = "java/lang/Object";
|
|
if ((i4 & -16777216) != (-16777216 & i5)) {
|
|
int i8 = i4 & -268435456;
|
|
if (i8 != 0 || (i4 & 251658240) == 33554432) {
|
|
if (!(i8 == 0 || (i4 & 251658240) == 33554432)) {
|
|
i8 -= 268435456;
|
|
}
|
|
if (!(i6 == 0 || (i5 & 251658240) == 33554432)) {
|
|
i6 -= 268435456;
|
|
}
|
|
min = Math.min(i8, i6) | 33554432;
|
|
n = vVar.n(str);
|
|
}
|
|
} else if ((i5 & 251658240) == 33554432) {
|
|
int i9 = (i4 & -268435456) | 33554432;
|
|
int i10 = i4 & 1048575;
|
|
int i11 = 1048575 & i5;
|
|
long j = ((long) i10) | (((long) i11) << 32);
|
|
int r = v.r(130, i10 + i11);
|
|
v.a q = vVar.q(r);
|
|
while (true) {
|
|
if (q != null) {
|
|
if (q.b == 130 && q.h == r && q.f == j) {
|
|
i3 = q.g;
|
|
break;
|
|
}
|
|
q = q.i;
|
|
} else {
|
|
v.a[] aVarArr = vVar.l;
|
|
String str2 = aVarArr[i10].e;
|
|
String str3 = aVarArr[i11].e;
|
|
Objects.requireNonNull(vVar.a);
|
|
ClassLoader classLoader = f.class.getClassLoader();
|
|
try {
|
|
Class<?> cls = Class.forName(str2.replace('/', '.'), false, classLoader);
|
|
try {
|
|
Class<?> cls2 = Class.forName(str3.replace('/', '.'), false, classLoader);
|
|
if (cls.isAssignableFrom(cls2)) {
|
|
str = str2;
|
|
} else if (cls2.isAssignableFrom(cls)) {
|
|
str = str3;
|
|
} else if (!cls.isInterface() && !cls2.isInterface()) {
|
|
do {
|
|
cls = cls.getSuperclass();
|
|
} while (!cls.isAssignableFrom(cls2));
|
|
str = cls.getName().replace('.', '/');
|
|
}
|
|
int n2 = vVar.n(str);
|
|
v.a aVar = new v.a(vVar.k, 130, j, r);
|
|
vVar.v(aVar);
|
|
aVar.g = n2;
|
|
i3 = n2;
|
|
} catch (ClassNotFoundException e) {
|
|
throw new TypeNotPresentException(str3, e);
|
|
}
|
|
} catch (ClassNotFoundException e2) {
|
|
throw new TypeNotPresentException(str2, e2);
|
|
}
|
|
}
|
|
}
|
|
i7 = i9 | i3;
|
|
} else {
|
|
min = ((i4 & -268435456) - 268435456) | 33554432;
|
|
n = vVar.n(str);
|
|
}
|
|
i7 = min | n;
|
|
} else if (i5 == 16777221) {
|
|
if ((i4 & -268435456) == 0 && (i4 & 251658240) != 33554432) {
|
|
i4 = 16777216;
|
|
}
|
|
i7 = i4;
|
|
}
|
|
if (i7 == i5) {
|
|
return false;
|
|
}
|
|
iArr[i2] = i7;
|
|
return true;
|
|
}
|
|
|
|
public final void a(r rVar) {
|
|
int i;
|
|
int[] iArr = this.b;
|
|
int i2 = 0;
|
|
int i3 = 0;
|
|
int i4 = 0;
|
|
loop0:
|
|
while (true) {
|
|
int i5 = 0;
|
|
do {
|
|
int i6 = 2;
|
|
if (i3 >= iArr.length) {
|
|
break loop0;
|
|
}
|
|
i = iArr[i3];
|
|
if (!(i == 16777220 || i == 16777219)) {
|
|
i6 = 1;
|
|
}
|
|
i3 += i6;
|
|
i5++;
|
|
} while (i == 16777216);
|
|
i4 += i5;
|
|
}
|
|
int[] iArr2 = this.f2810c;
|
|
int i7 = 0;
|
|
int i8 = 0;
|
|
while (i7 < iArr2.length) {
|
|
int i9 = iArr2[i7];
|
|
i7 += (i9 == 16777220 || i9 == 16777219) ? 2 : 1;
|
|
i8++;
|
|
}
|
|
rVar.A(this.a.e, i4, i8);
|
|
int i10 = 3;
|
|
int i11 = 0;
|
|
while (true) {
|
|
int i12 = i4 - 1;
|
|
if (i4 <= 0) {
|
|
break;
|
|
}
|
|
int i13 = iArr[i11];
|
|
i11 += (i13 == 16777220 || i13 == 16777219) ? 2 : 1;
|
|
rVar.W[i10] = i13;
|
|
i4 = i12;
|
|
i10++;
|
|
}
|
|
while (true) {
|
|
int i14 = i8 - 1;
|
|
if (i8 > 0) {
|
|
int i15 = iArr2[i2];
|
|
i2 += (i15 == 16777220 || i15 == 16777219) ? 2 : 1;
|
|
rVar.W[i10] = i15;
|
|
i10++;
|
|
i8 = i14;
|
|
} else {
|
|
rVar.z();
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* JADX ERROR: JadxRuntimeException in pass: RegionMakerVisitor
|
|
jadx.core.utils.exceptions.JadxRuntimeException: Failed to find switch 'out' block
|
|
at jadx.core.dex.visitors.regions.RegionMaker.processSwitch(RegionMaker.java:821)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.traverse(RegionMaker.java:157)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.makeRegion(RegionMaker.java:94)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.processSwitch(RegionMaker.java:860)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.traverse(RegionMaker.java:157)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.makeRegion(RegionMaker.java:94)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.processSwitch(RegionMaker.java:860)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.traverse(RegionMaker.java:157)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.makeRegion(RegionMaker.java:94)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.processSwitch(RegionMaker.java:860)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.traverse(RegionMaker.java:157)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.makeRegion(RegionMaker.java:94)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.processSwitch(RegionMaker.java:860)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.traverse(RegionMaker.java:157)
|
|
at jadx.core.dex.visitors.regions.RegionMaker.makeRegion(RegionMaker.java:94)
|
|
at jadx.core.dex.visitors.regions.RegionMakerVisitor.visit(RegionMakerVisitor.java:50)
|
|
*/
|
|
/* JADX WARNING: Removed duplicated region for block: B:100:0x02f8 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:116:0x035f */
|
|
/* JADX WARNING: Removed duplicated region for block: B:117:0x0366 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:118:0x036a */
|
|
/* JADX WARNING: Removed duplicated region for block: B:119:0x0371 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:97:0x02da */
|
|
/* JADX WARNING: Removed duplicated region for block: B:98:0x02e5 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:99:0x02ed */
|
|
public void b(int r17, int r18, h0.a.a.u r19, h0.a.a.v r20) {
|
|
/*
|
|
// Method dump skipped, instructions count: 1272
|
|
*/
|
|
throw new UnsupportedOperationException("Method not decompiled: h0.a.a.m.b(int, int, h0.a.a.u, h0.a.a.v):void");
|
|
}
|
|
|
|
/* JADX WARNING: Removed duplicated region for block: B:21:0x004f A[LOOP:0: B:5:0x000d->B:21:0x004f, LOOP_END] */
|
|
/* JADX WARNING: Removed duplicated region for block: B:23:0x0037 A[SYNTHETIC] */
|
|
public final int e(v vVar, int i) {
|
|
int i2;
|
|
if (i == 16777222 || (-16777216 & i) == 50331648) {
|
|
for (int i3 = 0; i3 < this.h; i3++) {
|
|
int i4 = this.i[i3];
|
|
int i5 = -268435456 & i4;
|
|
int i6 = 251658240 & i4;
|
|
int i7 = i4 & 1048575;
|
|
if (i6 == 67108864) {
|
|
i2 = this.b[i7];
|
|
} else {
|
|
if (i6 == 83886080) {
|
|
int[] iArr = this.f2810c;
|
|
i2 = iArr[iArr.length - i7];
|
|
}
|
|
if (i != i4) {
|
|
return (i == 16777222 ? vVar.n(vVar.d) : vVar.n(vVar.l[i & 1048575].e)) | 33554432;
|
|
}
|
|
}
|
|
i4 = i2 + i5;
|
|
if (i != i4) {
|
|
}
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
public final int f(int i) {
|
|
int[] iArr = this.d;
|
|
if (iArr == null || i >= iArr.length) {
|
|
return i | 67108864;
|
|
}
|
|
int i2 = iArr[i];
|
|
if (i2 != 0) {
|
|
return i2;
|
|
}
|
|
int i3 = i | 67108864;
|
|
iArr[i] = i3;
|
|
return i3;
|
|
}
|
|
|
|
/* JADX WARNING: Code restructure failed: missing block: B:19:0x0051, code lost:
|
|
if (r8 == 16777219) goto L_0x0053;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:26:0x0069, code lost:
|
|
if (r8 == 16777219) goto L_0x0053;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:60:0x00f6, code lost:
|
|
if (r6 == 16777219) goto L_0x00f8;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:67:0x010e, code lost:
|
|
if (r6 == 16777219) goto L_0x00f8;
|
|
*/
|
|
/* JADX WARNING: Removed duplicated region for block: B:70:0x0115 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:82:0x0119 A[SYNTHETIC] */
|
|
public final boolean h(v vVar, m mVar, int i) {
|
|
boolean z2;
|
|
boolean z3;
|
|
int i2;
|
|
boolean z4;
|
|
int i3;
|
|
int i4;
|
|
int length = this.b.length;
|
|
int length2 = this.f2810c.length;
|
|
if (mVar.b == null) {
|
|
mVar.b = new int[length];
|
|
z2 = true;
|
|
} else {
|
|
z2 = false;
|
|
}
|
|
for (int i5 = 0; i5 < length; i5++) {
|
|
int[] iArr = this.d;
|
|
if (iArr == null || i5 >= iArr.length) {
|
|
i3 = this.b[i5];
|
|
} else {
|
|
int i6 = iArr[i5];
|
|
if (i6 == 0) {
|
|
i3 = this.b[i5];
|
|
} else {
|
|
int i7 = i6 & -268435456;
|
|
int i8 = 251658240 & i6;
|
|
if (i8 == 67108864) {
|
|
i4 = i7 + this.b[i6 & 1048575];
|
|
if ((i6 & 1048576) != 0) {
|
|
if (i4 != 16777220) {
|
|
}
|
|
}
|
|
i3 = i4;
|
|
} else if (i8 == 83886080) {
|
|
i4 = i7 + this.f2810c[length2 - (i6 & 1048575)];
|
|
if ((i6 & 1048576) != 0) {
|
|
if (i4 != 16777220) {
|
|
}
|
|
}
|
|
i3 = i4;
|
|
} else {
|
|
i3 = i6;
|
|
}
|
|
i3 = 16777216;
|
|
}
|
|
}
|
|
if (this.i != null) {
|
|
i3 = e(vVar, i3);
|
|
}
|
|
z2 |= g(vVar, i3, mVar.b, i5);
|
|
}
|
|
if (i > 0) {
|
|
for (int i9 = 0; i9 < length; i9++) {
|
|
z2 |= g(vVar, this.b[i9], mVar.b, i9);
|
|
}
|
|
if (mVar.f2810c == null) {
|
|
mVar.f2810c = new int[1];
|
|
z4 = true;
|
|
} else {
|
|
z4 = z2;
|
|
}
|
|
return g(vVar, i, mVar.f2810c, 0) | z4;
|
|
}
|
|
int length3 = this.f2810c.length + this.f;
|
|
if (mVar.f2810c == null) {
|
|
mVar.f2810c = new int[(this.g + length3)];
|
|
z3 = true;
|
|
} else {
|
|
z3 = z2;
|
|
}
|
|
for (int i10 = 0; i10 < length3; i10++) {
|
|
int i11 = this.f2810c[i10];
|
|
if (this.i != null) {
|
|
i11 = e(vVar, i11);
|
|
}
|
|
z3 |= g(vVar, i11, mVar.f2810c, i10);
|
|
}
|
|
for (int i12 = 0; i12 < this.g; i12++) {
|
|
int i13 = this.e[i12];
|
|
int i14 = i13 & -268435456;
|
|
int i15 = i13 & 251658240;
|
|
if (i15 == 67108864) {
|
|
i2 = i14 + this.b[i13 & 1048575];
|
|
if ((i13 & 1048576) != 0) {
|
|
if (i2 != 16777220) {
|
|
}
|
|
}
|
|
i13 = i2;
|
|
if (this.i != null) {
|
|
i13 = e(vVar, i13);
|
|
}
|
|
z3 |= g(vVar, i13, mVar.f2810c, length3 + i12);
|
|
} else {
|
|
if (i15 == 83886080) {
|
|
i2 = i14 + this.f2810c[length2 - (i13 & 1048575)];
|
|
if ((i13 & 1048576) != 0) {
|
|
if (i2 != 16777220) {
|
|
}
|
|
}
|
|
i13 = i2;
|
|
}
|
|
if (this.i != null) {
|
|
}
|
|
z3 |= g(vVar, i13, mVar.f2810c, length3 + i12);
|
|
}
|
|
i13 = 16777216;
|
|
if (this.i != null) {
|
|
}
|
|
z3 |= g(vVar, i13, mVar.f2810c, length3 + i12);
|
|
}
|
|
return z3;
|
|
}
|
|
|
|
public final int i() {
|
|
short s2 = this.g;
|
|
if (s2 > 0) {
|
|
int[] iArr = this.e;
|
|
short s3 = (short) (s2 - 1);
|
|
this.g = s3;
|
|
return iArr[s3];
|
|
}
|
|
short s4 = (short) (this.f - 1);
|
|
this.f = s4;
|
|
return 83886080 | (-s4);
|
|
}
|
|
|
|
public final void j(int i) {
|
|
short s2 = this.g;
|
|
if (s2 >= i) {
|
|
this.g = (short) (s2 - i);
|
|
return;
|
|
}
|
|
this.f = (short) (this.f - (i - s2));
|
|
this.g = 0;
|
|
}
|
|
|
|
public final void k(String str) {
|
|
char charAt = str.charAt(0);
|
|
if (charAt == '(') {
|
|
j((w.b(str) >> 2) - 1);
|
|
} else if (charAt == 'J' || charAt == 'D') {
|
|
j(2);
|
|
} else {
|
|
j(1);
|
|
}
|
|
}
|
|
|
|
public final void l(int i) {
|
|
if (this.e == null) {
|
|
this.e = new int[10];
|
|
}
|
|
int length = this.e.length;
|
|
short s2 = this.g;
|
|
if (s2 >= length) {
|
|
int[] iArr = new int[Math.max(s2 + 1, length * 2)];
|
|
System.arraycopy(this.e, 0, iArr, 0, length);
|
|
this.e = iArr;
|
|
}
|
|
int[] iArr2 = this.e;
|
|
short s3 = this.g;
|
|
short s4 = (short) (s3 + 1);
|
|
this.g = s4;
|
|
iArr2[s3] = i;
|
|
short s5 = (short) (this.f + s4);
|
|
p pVar = this.a;
|
|
if (s5 > pVar.i) {
|
|
pVar.i = s5;
|
|
}
|
|
}
|
|
|
|
public final void m(v vVar, String str) {
|
|
int i = 0;
|
|
if (str.charAt(0) == '(') {
|
|
i = str.indexOf(41) + 1;
|
|
}
|
|
int d = d(vVar, str, i);
|
|
if (d != 0) {
|
|
l(d);
|
|
if (d == 16777220 || d == 16777219) {
|
|
l(16777216);
|
|
}
|
|
}
|
|
}
|
|
|
|
public final void n(v vVar, int i, String str, int i2) {
|
|
int[] iArr = new int[i2];
|
|
this.b = iArr;
|
|
this.f2810c = new int[0];
|
|
int i3 = 1;
|
|
if ((i & 8) != 0) {
|
|
i3 = 0;
|
|
} else if ((i & 262144) == 0) {
|
|
iArr[0] = 33554432 | vVar.n(vVar.d);
|
|
} else {
|
|
iArr[0] = 16777222;
|
|
}
|
|
for (w wVar : w.a(str)) {
|
|
int d = d(vVar, wVar.d(), 0);
|
|
int[] iArr2 = this.b;
|
|
int i4 = i3 + 1;
|
|
iArr2[i3] = d;
|
|
if (d == 16777220 || d == 16777219) {
|
|
i3 = i4 + 1;
|
|
iArr2[i4] = 16777216;
|
|
} else {
|
|
i3 = i4;
|
|
}
|
|
}
|
|
while (i3 < i2) {
|
|
this.b[i3] = 16777216;
|
|
i3++;
|
|
}
|
|
}
|
|
|
|
public final void o(int i, int i2) {
|
|
if (this.d == null) {
|
|
this.d = new int[10];
|
|
}
|
|
int length = this.d.length;
|
|
if (i >= length) {
|
|
int[] iArr = new int[Math.max(i + 1, length * 2)];
|
|
System.arraycopy(this.d, 0, iArr, 0, length);
|
|
this.d = iArr;
|
|
}
|
|
this.d[i] = i2;
|
|
}
|
|
}
|