2862 lines
151 KiB
Java
2862 lines
151 KiB
Java
package h0.a.a;
|
|
|
|
import c.d.b.a.a;
|
|
import java.util.Objects;
|
|
/* compiled from: ClassReader */
|
|
public class d {
|
|
public final byte[] a;
|
|
public final int[] b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public final String[] f2799c;
|
|
public final g[] d;
|
|
public final int[] e;
|
|
public final int f;
|
|
public final int g;
|
|
|
|
/* JADX INFO: Can't fix incorrect switch cases order, some code will duplicate */
|
|
public d(byte[] bArr, int i, boolean z2) {
|
|
int i2;
|
|
this.a = bArr;
|
|
if (z2) {
|
|
int i3 = i + 6;
|
|
if (q(i3) > 56) {
|
|
StringBuilder K = a.K("Unsupported class file major version ");
|
|
K.append((int) q(i3));
|
|
throw new IllegalArgumentException(K.toString());
|
|
}
|
|
}
|
|
int u = u(i + 8);
|
|
this.b = new int[u];
|
|
this.f2799c = new String[u];
|
|
int i4 = i + 10;
|
|
int i5 = 1;
|
|
int i6 = 0;
|
|
boolean z3 = false;
|
|
boolean z4 = false;
|
|
while (true) {
|
|
int i7 = 4;
|
|
if (i5 < u) {
|
|
int i8 = i5 + 1;
|
|
int i9 = i4 + 1;
|
|
this.b[i5] = i9;
|
|
switch (bArr[i4]) {
|
|
case 1:
|
|
i7 = u(i9) + 3;
|
|
if (i7 > i6) {
|
|
i6 = i7;
|
|
}
|
|
i2 = i7;
|
|
break;
|
|
case 2:
|
|
case 13:
|
|
case 14:
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
case 3:
|
|
case 4:
|
|
case 9:
|
|
case 10:
|
|
case 11:
|
|
case 12:
|
|
i2 = 5;
|
|
break;
|
|
case 5:
|
|
case 6:
|
|
i7 = 9;
|
|
i8++;
|
|
i2 = i7;
|
|
break;
|
|
case 7:
|
|
case 8:
|
|
case 16:
|
|
case 19:
|
|
case 20:
|
|
i2 = 3;
|
|
break;
|
|
case 15:
|
|
i2 = i7;
|
|
break;
|
|
case 17:
|
|
z3 = true;
|
|
i2 = 5;
|
|
break;
|
|
case 18:
|
|
z4 = true;
|
|
i2 = 5;
|
|
break;
|
|
}
|
|
i4 += i2;
|
|
i5 = i8;
|
|
} else {
|
|
this.f = i6;
|
|
this.g = i4;
|
|
int[] iArr = null;
|
|
this.d = z3 ? new g[u] : null;
|
|
if (z3 || z4) {
|
|
char[] cArr = new char[i6];
|
|
int c2 = c();
|
|
int u2 = u(c2 - 2);
|
|
while (true) {
|
|
if (u2 > 0) {
|
|
String t = t(c2, cArr);
|
|
int l = l(c2 + 2);
|
|
int i10 = c2 + 6;
|
|
if ("BootstrapMethods".equals(t)) {
|
|
int u3 = u(i10);
|
|
int[] iArr2 = new int[u3];
|
|
int i11 = i10 + 2;
|
|
for (int i12 = 0; i12 < u3; i12++) {
|
|
iArr2[i12] = i11;
|
|
i11 += (u(i11 + 2) * 2) + 4;
|
|
}
|
|
iArr = iArr2;
|
|
} else {
|
|
c2 = i10 + l;
|
|
u2--;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
this.e = iArr;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
public final void a(int i, p[] pVarArr) {
|
|
if (pVarArr[i] == null) {
|
|
if (pVarArr[i] == null) {
|
|
pVarArr[i] = new p();
|
|
}
|
|
p pVar = pVarArr[i];
|
|
pVar.b = (short) (pVar.b | 1);
|
|
}
|
|
}
|
|
|
|
public final p b(int i, p[] pVarArr) {
|
|
if (pVarArr[i] == null) {
|
|
pVarArr[i] = new p();
|
|
}
|
|
p pVar = pVarArr[i];
|
|
pVar.b = (short) (pVar.b & -2);
|
|
return pVar;
|
|
}
|
|
|
|
public final int c() {
|
|
int i = this.g;
|
|
int u = (u(i + 6) * 2) + i + 8;
|
|
int u2 = u(u);
|
|
int i2 = u + 2;
|
|
while (true) {
|
|
int i3 = u2 - 1;
|
|
if (u2 <= 0) {
|
|
break;
|
|
}
|
|
int u3 = u(i2 + 6);
|
|
i2 += 8;
|
|
while (true) {
|
|
int i4 = u3 - 1;
|
|
if (u3 <= 0) {
|
|
break;
|
|
}
|
|
i2 += l(i2 + 2) + 6;
|
|
u3 = i4;
|
|
}
|
|
u2 = i3;
|
|
}
|
|
int u4 = u(i2);
|
|
int i5 = i2 + 2;
|
|
while (true) {
|
|
int i6 = u4 - 1;
|
|
if (u4 <= 0) {
|
|
return i5 + 2;
|
|
}
|
|
int u5 = u(i5 + 6);
|
|
i5 += 8;
|
|
while (true) {
|
|
int i7 = u5 - 1;
|
|
if (u5 <= 0) {
|
|
break;
|
|
}
|
|
i5 += l(i5 + 2) + 6;
|
|
u5 = i7;
|
|
}
|
|
u4 = i6;
|
|
}
|
|
}
|
|
|
|
public final int d(int[] iArr, int i) {
|
|
if (iArr == null || i >= iArr.length || f(iArr[i]) < 67) {
|
|
return -1;
|
|
}
|
|
return u(iArr[i] + 1);
|
|
}
|
|
|
|
public final b e(b[] bVarArr, String str, int i, int i2, char[] cArr, int i3, p[] pVarArr) {
|
|
for (b bVar : bVarArr) {
|
|
if (bVar.a.equals(str)) {
|
|
b bVar2 = new b(bVar.a);
|
|
byte[] bArr = new byte[i2];
|
|
bVar2.b = bArr;
|
|
System.arraycopy(this.a, i, bArr, 0, i2);
|
|
return bVar2;
|
|
}
|
|
}
|
|
b bVar3 = new b(str);
|
|
byte[] bArr2 = new byte[i2];
|
|
bVar3.b = bArr2;
|
|
System.arraycopy(this.a, i, bArr2, 0, i2);
|
|
return bVar3;
|
|
}
|
|
|
|
public int f(int i) {
|
|
return this.a[i] & 255;
|
|
}
|
|
|
|
public String g(int i, char[] cArr) {
|
|
return t(this.b[u(i)], cArr);
|
|
}
|
|
|
|
/* JADX WARNING: Removed duplicated region for block: B:208:0x04c7 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:263:0x066f */
|
|
/* JADX WARNING: Removed duplicated region for block: B:267:0x0683 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:272:0x0695 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:274:0x06b7 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:288:0x06f7 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:289:0x070b */
|
|
/* JADX WARNING: Removed duplicated region for block: B:298:0x0755 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:303:0x077e */
|
|
/* JADX WARNING: Removed duplicated region for block: B:305:0x078f */
|
|
/* JADX WARNING: Removed duplicated region for block: B:322:0x0845 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:335:0x089e */
|
|
/* JADX WARNING: Removed duplicated region for block: B:343:0x092f */
|
|
/* JADX WARNING: Removed duplicated region for block: B:347:0x0972 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:348:0x098c */
|
|
/* JADX WARNING: Removed duplicated region for block: B:349:0x09a6 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:350:0x09be */
|
|
/* JADX WARNING: Removed duplicated region for block: B:352:0x09d8 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:353:0x09f1 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:357:0x0a17 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:358:0x0a31 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:359:0x0a4b */
|
|
/* JADX WARNING: Removed duplicated region for block: B:361:0x0a63 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:364:0x0a80 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:372:0x0ab0 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:376:0x0ab7 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:377:0x0ad9 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:485:0x068f A[SYNTHETIC] */
|
|
public final void h(q qVar, h hVar, int i) {
|
|
int i2;
|
|
p[] pVarArr;
|
|
p[] pVarArr2;
|
|
int i3;
|
|
b bVar;
|
|
int i4;
|
|
b bVar2;
|
|
int i5;
|
|
int[] iArr;
|
|
String str;
|
|
int i6;
|
|
int i7;
|
|
boolean z2;
|
|
int i8;
|
|
boolean z3;
|
|
int i9;
|
|
int i10;
|
|
boolean z4;
|
|
int[] iArr2;
|
|
int i11;
|
|
int i12;
|
|
int i13;
|
|
boolean z5;
|
|
int i14;
|
|
int i15;
|
|
boolean z6;
|
|
int i16;
|
|
int i17;
|
|
boolean z7;
|
|
boolean z8;
|
|
int i18;
|
|
boolean z9;
|
|
int[] iArr3;
|
|
int[] iArr4;
|
|
int i19;
|
|
boolean z10;
|
|
int i20;
|
|
int i21;
|
|
int i22;
|
|
int i23;
|
|
int i24;
|
|
int i25;
|
|
p[] pVarArr3;
|
|
int i26;
|
|
int u;
|
|
short s2;
|
|
int i27;
|
|
p[] pVarArr4;
|
|
int u2;
|
|
int i28;
|
|
int i29;
|
|
int i30;
|
|
int i31;
|
|
p[] pVarArr5;
|
|
int i32;
|
|
int i33;
|
|
p[] pVarArr6;
|
|
int[] iArr5;
|
|
int[] iArr6;
|
|
int i34;
|
|
p[] pVarArr7;
|
|
int[] iArr7;
|
|
int i35;
|
|
int i36;
|
|
int i37;
|
|
int i38;
|
|
byte[] bArr = this.a;
|
|
char[] cArr = hVar.f2806c;
|
|
int u3 = u(i);
|
|
int u4 = u(i + 2);
|
|
int l = l(i + 4);
|
|
int i39 = i + 8;
|
|
int i40 = i39 + l;
|
|
p[] pVarArr8 = new p[(l + 1)];
|
|
hVar.g = pVarArr8;
|
|
int i41 = i39;
|
|
while (i41 < i40) {
|
|
int i42 = i41 - i39;
|
|
switch (bArr[i41] & 255) {
|
|
case 0:
|
|
case 1:
|
|
case 2:
|
|
case 3:
|
|
case 4:
|
|
case 5:
|
|
case 6:
|
|
case 7:
|
|
case 8:
|
|
case 9:
|
|
case 10:
|
|
case 11:
|
|
case 12:
|
|
case 13:
|
|
case 14:
|
|
case 15:
|
|
case 26:
|
|
case 27:
|
|
case 28:
|
|
case 29:
|
|
case 30:
|
|
case 31:
|
|
case 32:
|
|
case 33:
|
|
case 34:
|
|
case 35:
|
|
case 36:
|
|
case 37:
|
|
case 38:
|
|
case 39:
|
|
case 40:
|
|
case 41:
|
|
case 42:
|
|
case 43:
|
|
case 44:
|
|
case 45:
|
|
case 46:
|
|
case 47:
|
|
case 48:
|
|
case 49:
|
|
case 50:
|
|
case 51:
|
|
case 52:
|
|
case 53:
|
|
case 59:
|
|
case 60:
|
|
case 61:
|
|
case 62:
|
|
case 63:
|
|
case 64:
|
|
case 65:
|
|
case 66:
|
|
case 67:
|
|
case 68:
|
|
case 69:
|
|
case 70:
|
|
case 71:
|
|
case 72:
|
|
case 73:
|
|
case 74:
|
|
case 75:
|
|
case 76:
|
|
case 77:
|
|
case 78:
|
|
case 79:
|
|
case 80:
|
|
case 81:
|
|
case 82:
|
|
case 83:
|
|
case 84:
|
|
case 85:
|
|
case 86:
|
|
case 87:
|
|
case 88:
|
|
case 89:
|
|
case 90:
|
|
case 91:
|
|
case 92:
|
|
case 93:
|
|
case 94:
|
|
case 95:
|
|
case 96:
|
|
case 97:
|
|
case 98:
|
|
case 99:
|
|
case 100:
|
|
case 101:
|
|
case 102:
|
|
case 103:
|
|
case 104:
|
|
case 105:
|
|
case 106:
|
|
case 107:
|
|
case 108:
|
|
case 109:
|
|
case 110:
|
|
case 111:
|
|
case 112:
|
|
case 113:
|
|
case 114:
|
|
case 115:
|
|
case 116:
|
|
case 117:
|
|
case 118:
|
|
case 119:
|
|
case 120:
|
|
case 121:
|
|
case 122:
|
|
case 123:
|
|
case 124:
|
|
case 125:
|
|
case 126:
|
|
case 127:
|
|
case 128:
|
|
case 129:
|
|
case 130:
|
|
case 131:
|
|
case 133:
|
|
case 134:
|
|
case 135:
|
|
case 136:
|
|
case 137:
|
|
case 138:
|
|
case 139:
|
|
case 140:
|
|
case 141:
|
|
case 142:
|
|
case 143:
|
|
case 144:
|
|
case 145:
|
|
case 146:
|
|
case 147:
|
|
case 148:
|
|
case 149:
|
|
case 150:
|
|
case 151:
|
|
case 152:
|
|
case 172:
|
|
case 173:
|
|
case 174:
|
|
case 175:
|
|
case 176:
|
|
case 177:
|
|
case 190:
|
|
case 191:
|
|
case 194:
|
|
case 195:
|
|
i41++;
|
|
break;
|
|
case 16:
|
|
case 18:
|
|
case 21:
|
|
case 22:
|
|
case 23:
|
|
case 24:
|
|
case 25:
|
|
case 54:
|
|
case 55:
|
|
case 56:
|
|
case 57:
|
|
case 58:
|
|
case 169:
|
|
case 188:
|
|
i41 += 2;
|
|
break;
|
|
case 17:
|
|
case 19:
|
|
case 20:
|
|
case 132:
|
|
case 178:
|
|
case 179:
|
|
case 180:
|
|
case 181:
|
|
case 182:
|
|
case 183:
|
|
case 184:
|
|
case 187:
|
|
case 189:
|
|
case 192:
|
|
case 193:
|
|
i41 += 3;
|
|
break;
|
|
case 153:
|
|
case 154:
|
|
case 155:
|
|
case 156:
|
|
case 157:
|
|
case 158:
|
|
case 159:
|
|
case 160:
|
|
case 161:
|
|
case 162:
|
|
case 163:
|
|
case 164:
|
|
case 165:
|
|
case 166:
|
|
case 167:
|
|
case 168:
|
|
case 198:
|
|
case 199:
|
|
b(q(i41 + 1) + i42, pVarArr8);
|
|
i41 += 3;
|
|
break;
|
|
case 170:
|
|
int i43 = (4 - (i42 & 3)) + i41;
|
|
b(l(i43) + i42, pVarArr8);
|
|
int l2 = (l(i43 + 8) - l(i43 + 4)) + 1;
|
|
i38 = i43 + 12;
|
|
while (true) {
|
|
int i44 = l2 - 1;
|
|
if (l2 <= 0) {
|
|
i41 = i38;
|
|
break;
|
|
} else {
|
|
b(l(i38) + i42, pVarArr8);
|
|
i38 += 4;
|
|
l2 = i44;
|
|
}
|
|
}
|
|
case 171:
|
|
int i45 = (4 - (i42 & 3)) + i41;
|
|
b(l(i45) + i42, pVarArr8);
|
|
int l3 = l(i45 + 4);
|
|
i38 = i45 + 8;
|
|
while (true) {
|
|
int i46 = l3 - 1;
|
|
if (l3 <= 0) {
|
|
i41 = i38;
|
|
break;
|
|
} else {
|
|
b(l(i38 + 4) + i42, pVarArr8);
|
|
i38 += 8;
|
|
l3 = i46;
|
|
}
|
|
}
|
|
case 185:
|
|
case 186:
|
|
i41 += 5;
|
|
break;
|
|
case 196:
|
|
int i47 = bArr[i41 + 1] & 255;
|
|
if (i47 != 132) {
|
|
if (i47 != 169) {
|
|
switch (i47) {
|
|
case 21:
|
|
case 22:
|
|
case 23:
|
|
case 24:
|
|
case 25:
|
|
break;
|
|
default:
|
|
switch (i47) {
|
|
case 54:
|
|
case 55:
|
|
case 56:
|
|
case 57:
|
|
case 58:
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
}
|
|
i41 += 4;
|
|
break;
|
|
} else {
|
|
i41 += 6;
|
|
break;
|
|
}
|
|
case 197:
|
|
i41 += 4;
|
|
break;
|
|
case 200:
|
|
case 201:
|
|
case 220:
|
|
b(l(i41 + 1) + i42, pVarArr8);
|
|
i41 += 5;
|
|
break;
|
|
case 202:
|
|
case 203:
|
|
case 204:
|
|
case 205:
|
|
case 206:
|
|
case 207:
|
|
case 208:
|
|
case 209:
|
|
case 210:
|
|
case 211:
|
|
case 212:
|
|
case 213:
|
|
case 214:
|
|
case 215:
|
|
case 216:
|
|
case 217:
|
|
case 218:
|
|
case 219:
|
|
b(u(i41 + 1) + i42, pVarArr8);
|
|
i41 += 3;
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
int u5 = u(i41);
|
|
int i48 = i41 + 2;
|
|
while (true) {
|
|
int i49 = u5 - 1;
|
|
if (u5 > 0) {
|
|
p b = b(u(i48), pVarArr8);
|
|
p b2 = b(u(i48 + 2), pVarArr8);
|
|
p b3 = b(u(i48 + 4), pVarArr8);
|
|
String t = t(this.b[u(i48 + 6)], cArr);
|
|
i48 += 8;
|
|
r rVar = (r) qVar;
|
|
if (t != null) {
|
|
i36 = i40;
|
|
i37 = rVar.d.m(7, t).a;
|
|
} else {
|
|
i36 = i40;
|
|
i37 = 0;
|
|
}
|
|
o oVar = new o(b, b2, b3, i37, t);
|
|
if (rVar.m == null) {
|
|
rVar.m = oVar;
|
|
} else {
|
|
rVar.n.f = oVar;
|
|
}
|
|
rVar.n = oVar;
|
|
u5 = i49;
|
|
i40 = i36;
|
|
} else {
|
|
int i50 = i40;
|
|
int u6 = u(i48);
|
|
int i51 = i48 + 2;
|
|
int[] iArr8 = null;
|
|
boolean z11 = true;
|
|
int i52 = 0;
|
|
b bVar3 = null;
|
|
int i53 = 0;
|
|
int[] iArr9 = null;
|
|
int i54 = 0;
|
|
int i55 = 0;
|
|
while (true) {
|
|
int i56 = u6 - 1;
|
|
if (u6 > 0) {
|
|
String t2 = t(i51, cArr);
|
|
int l4 = l(i51 + 2);
|
|
int i57 = i51 + 6;
|
|
if ("LocalVariableTable".equals(t2)) {
|
|
if ((hVar.b & 2) == 0) {
|
|
int u7 = u(i57);
|
|
int i58 = i57 + 2;
|
|
while (true) {
|
|
int i59 = u7 - 1;
|
|
if (u7 > 0) {
|
|
int u8 = u(i58);
|
|
a(u8, pVarArr8);
|
|
a(u(i58 + 2) + u8, pVarArr8);
|
|
i58 += 10;
|
|
u7 = i59;
|
|
} else {
|
|
i54 = i57;
|
|
iArr5 = iArr8;
|
|
pVarArr6 = pVarArr8;
|
|
i33 = l;
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
}
|
|
}
|
|
}
|
|
} else if ("LocalVariableTypeTable".equals(t2)) {
|
|
i55 = i57;
|
|
iArr5 = iArr8;
|
|
pVarArr6 = pVarArr8;
|
|
i33 = l;
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
} else if (!"LineNumberTable".equals(t2)) {
|
|
iArr6 = iArr8;
|
|
pVarArr6 = pVarArr8;
|
|
i33 = l;
|
|
if ("RuntimeVisibleTypeAnnotations".equals(t2)) {
|
|
iArr5 = s(qVar, hVar, i57, true);
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
} else if ("RuntimeInvisibleTypeAnnotations".equals(t2)) {
|
|
iArr9 = s(qVar, hVar, i57, false);
|
|
iArr5 = iArr6;
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
} else {
|
|
if (!"StackMapTable".equals(t2)) {
|
|
if (!"StackMap".equals(t2)) {
|
|
i32 = i57;
|
|
pVarArr5 = pVarArr6;
|
|
i31 = i50;
|
|
i30 = i33;
|
|
b e = e(hVar.a, t2, i57, l4, cArr, i, pVarArr5);
|
|
e.f2798c = bVar3;
|
|
bVar3 = e;
|
|
iArr8 = iArr6;
|
|
} else if ((hVar.b & 4) == 0) {
|
|
i52 = i57 + 2;
|
|
i53 = i57 + l4;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
iArr8 = iArr6;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
z11 = false;
|
|
}
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
} else if ((hVar.b & 4) == 0) {
|
|
i52 = i57 + 2;
|
|
i53 = i57 + l4;
|
|
}
|
|
iArr5 = iArr6;
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
}
|
|
} else if ((hVar.b & 2) == 0) {
|
|
int u9 = u(i57);
|
|
int i60 = i57 + 2;
|
|
while (true) {
|
|
int i61 = u9 - 1;
|
|
if (u9 > 0) {
|
|
int u10 = u(i60);
|
|
int u11 = u(i60 + 2);
|
|
int i62 = i60 + 4;
|
|
a(u10, pVarArr8);
|
|
p pVar = pVarArr8[u10];
|
|
if (pVar.f2813c == 0) {
|
|
pVar.f2813c = (short) u11;
|
|
i35 = i62;
|
|
iArr7 = iArr8;
|
|
pVarArr7 = pVarArr8;
|
|
i34 = l;
|
|
} else {
|
|
if (pVar.d == null) {
|
|
i35 = i62;
|
|
pVar.d = new int[4];
|
|
} else {
|
|
i35 = i62;
|
|
}
|
|
int[] iArr10 = pVar.d;
|
|
iArr7 = iArr8;
|
|
int i63 = iArr10[0] + 1;
|
|
iArr10[0] = i63;
|
|
if (i63 >= iArr10.length) {
|
|
int[] iArr11 = new int[(iArr10.length + 4)];
|
|
pVarArr7 = pVarArr8;
|
|
i34 = l;
|
|
System.arraycopy(iArr10, 0, iArr11, 0, iArr10.length);
|
|
pVar.d = iArr11;
|
|
} else {
|
|
pVarArr7 = pVarArr8;
|
|
i34 = l;
|
|
}
|
|
pVar.d[i63] = u11;
|
|
}
|
|
u9 = i61;
|
|
i60 = i35;
|
|
iArr8 = iArr7;
|
|
pVarArr8 = pVarArr7;
|
|
l = i34;
|
|
}
|
|
}
|
|
}
|
|
iArr6 = iArr8;
|
|
pVarArr6 = pVarArr8;
|
|
i33 = l;
|
|
iArr5 = iArr6;
|
|
iArr8 = iArr5;
|
|
i32 = i57;
|
|
i31 = i50;
|
|
pVarArr5 = pVarArr6;
|
|
i30 = i33;
|
|
i51 = i32 + l4;
|
|
pVarArr8 = pVarArr5;
|
|
u6 = i56;
|
|
i50 = i31;
|
|
l = i30;
|
|
} else {
|
|
p[] pVarArr9 = pVarArr8;
|
|
int i64 = l;
|
|
int i65 = i50;
|
|
boolean z12 = (hVar.b & 8) != 0;
|
|
if (i52 != 0) {
|
|
hVar.m = -1;
|
|
hVar.n = 0;
|
|
hVar.o = 0;
|
|
hVar.p = 0;
|
|
Object[] objArr = new Object[u4];
|
|
hVar.q = objArr;
|
|
hVar.r = 0;
|
|
hVar.f2807s = new Object[u3];
|
|
if (z12) {
|
|
String str2 = hVar.f;
|
|
if ((hVar.d & 8) == 0) {
|
|
if ("<init>".equals(hVar.e)) {
|
|
objArr[0] = t.g;
|
|
} else {
|
|
objArr[0] = g(this.g + 2, hVar.f2806c);
|
|
}
|
|
i28 = 1;
|
|
} else {
|
|
i28 = 0;
|
|
}
|
|
int i66 = i28;
|
|
int i67 = 1;
|
|
while (true) {
|
|
int i68 = i67 + 1;
|
|
char charAt = str2.charAt(i67);
|
|
if (charAt == 'F') {
|
|
i29 = i66 + 1;
|
|
objArr[i66] = t.f2822c;
|
|
} else if (charAt != 'L') {
|
|
if (!(charAt == 'S' || charAt == 'I')) {
|
|
if (charAt == 'J') {
|
|
i29 = i66 + 1;
|
|
objArr[i66] = t.e;
|
|
} else if (charAt != 'Z') {
|
|
if (charAt != '[') {
|
|
switch (charAt) {
|
|
case 'B':
|
|
case 'C':
|
|
break;
|
|
case 'D':
|
|
i29 = i66 + 1;
|
|
objArr[i66] = t.d;
|
|
break;
|
|
default:
|
|
hVar.o = i66;
|
|
break;
|
|
}
|
|
} else {
|
|
while (str2.charAt(i68) == '[') {
|
|
i68++;
|
|
}
|
|
if (str2.charAt(i68) == 'L') {
|
|
do {
|
|
i68++;
|
|
} while (str2.charAt(i68) != ';');
|
|
}
|
|
int i69 = i68 + 1;
|
|
objArr[i66] = str2.substring(i67, i69);
|
|
i67 = i69;
|
|
i66++;
|
|
}
|
|
}
|
|
}
|
|
i29 = i66 + 1;
|
|
objArr[i66] = t.b;
|
|
} else {
|
|
int i70 = i68;
|
|
while (str2.charAt(i70) != ';') {
|
|
i70++;
|
|
}
|
|
objArr[i66] = str2.substring(i68, i70);
|
|
i66++;
|
|
i67 = i70 + 1;
|
|
}
|
|
i66 = i29;
|
|
i67 = i68;
|
|
}
|
|
}
|
|
int i71 = i52;
|
|
while (true) {
|
|
i2 = i53;
|
|
if (i71 < i2 - 2) {
|
|
if (bArr[i71] != 8 || (u2 = u(i71 + 1)) < 0) {
|
|
pVarArr4 = pVarArr9;
|
|
i27 = i64;
|
|
} else {
|
|
i27 = i64;
|
|
if (u2 < i27) {
|
|
if ((bArr[i39 + u2] & 255) == 187) {
|
|
pVarArr4 = pVarArr9;
|
|
b(u2, pVarArr4);
|
|
} else {
|
|
pVarArr4 = pVarArr9;
|
|
}
|
|
i71++;
|
|
pVarArr9 = pVarArr4;
|
|
i64 = i27;
|
|
i53 = i2;
|
|
} else {
|
|
pVarArr4 = pVarArr9;
|
|
}
|
|
}
|
|
i71++;
|
|
pVarArr9 = pVarArr4;
|
|
i64 = i27;
|
|
i53 = i2;
|
|
} else {
|
|
pVarArr = pVarArr9;
|
|
}
|
|
}
|
|
} else {
|
|
pVarArr = pVarArr9;
|
|
i2 = i53;
|
|
}
|
|
if (!z12 || (hVar.b & 256) == 0) {
|
|
pVarArr2 = pVarArr;
|
|
i3 = i64;
|
|
bVar = bVar3;
|
|
i4 = 0;
|
|
} else {
|
|
pVarArr2 = pVarArr;
|
|
bVar = bVar3;
|
|
i4 = 0;
|
|
i3 = i64;
|
|
qVar.c(-1, u4, null, 0, null);
|
|
}
|
|
int[] iArr12 = iArr8;
|
|
int d = d(iArr12, i4);
|
|
int[] iArr13 = iArr9;
|
|
int d2 = d(iArr13, i4);
|
|
int i72 = (hVar.b & 256) == 0 ? 33 : 0;
|
|
int i73 = d2;
|
|
int i74 = i39;
|
|
int i75 = i52;
|
|
int i76 = 0;
|
|
int i77 = 0;
|
|
int i78 = d;
|
|
boolean z13 = false;
|
|
while (i74 < i65) {
|
|
i65 = i65;
|
|
int i79 = i74 - i39;
|
|
p pVar2 = pVarArr2[i79];
|
|
if (pVar2 != null) {
|
|
boolean z14 = (hVar.b & 2) == 0;
|
|
qVar.i(pVar2);
|
|
if (z14 && (s2 = pVar2.f2813c) != 0) {
|
|
qVar.k(s2 & 65535, pVar2);
|
|
if (pVar2.d != null) {
|
|
i7 = i75;
|
|
int i80 = 1;
|
|
while (true) {
|
|
int[] iArr14 = pVar2.d;
|
|
i6 = i74;
|
|
if (i80 <= iArr14[0]) {
|
|
qVar.k(iArr14[i80], pVar2);
|
|
i80++;
|
|
i74 = i6;
|
|
} else {
|
|
z2 = z13;
|
|
i8 = i7;
|
|
while (i8 != 0) {
|
|
int i81 = hVar.m;
|
|
if (i81 == i79 || i81 == -1) {
|
|
if (i81 != -1) {
|
|
if (!z11 || z12) {
|
|
iArr4 = iArr13;
|
|
iArr3 = iArr12;
|
|
i19 = u4;
|
|
i20 = i6;
|
|
i21 = i8;
|
|
qVar.c(-1, hVar.o, hVar.q, hVar.r, hVar.f2807s);
|
|
} else {
|
|
i19 = u4;
|
|
i21 = i8;
|
|
i20 = i6;
|
|
iArr4 = iArr13;
|
|
iArr3 = iArr12;
|
|
qVar.c(hVar.n, hVar.p, hVar.q, hVar.r, hVar.f2807s);
|
|
}
|
|
z10 = false;
|
|
} else {
|
|
iArr4 = iArr13;
|
|
iArr3 = iArr12;
|
|
i19 = u4;
|
|
i20 = i6;
|
|
i21 = i8;
|
|
z10 = z2;
|
|
}
|
|
if (i21 < i2) {
|
|
char[] cArr2 = hVar.f2806c;
|
|
p[] pVarArr10 = hVar.g;
|
|
if (z11) {
|
|
i23 = i21 + 1;
|
|
i22 = this.a[i21] & 255;
|
|
i24 = 0;
|
|
} else {
|
|
hVar.m = -1;
|
|
i23 = i21;
|
|
i24 = 0;
|
|
i22 = 255;
|
|
}
|
|
hVar.p = i24;
|
|
if (i22 < 64) {
|
|
hVar.n = 3;
|
|
hVar.r = i24;
|
|
i26 = i23;
|
|
pVarArr3 = pVarArr10;
|
|
i25 = i2;
|
|
} else {
|
|
if (i22 < 128) {
|
|
u = i22 - 64;
|
|
i25 = i2;
|
|
pVarArr3 = pVarArr10;
|
|
i26 = x(i23, hVar.f2807s, 0, cArr2, pVarArr3);
|
|
hVar.n = 4;
|
|
hVar.r = 1;
|
|
} else {
|
|
pVarArr3 = pVarArr10;
|
|
i25 = i2;
|
|
if (i22 >= 247) {
|
|
u = u(i23);
|
|
int i82 = i23 + 2;
|
|
if (i22 == 247) {
|
|
i26 = x(i82, hVar.f2807s, 0, cArr2, pVarArr3);
|
|
hVar.n = 4;
|
|
hVar.r = 1;
|
|
} else {
|
|
if (i22 >= 248 && i22 < 251) {
|
|
hVar.n = 2;
|
|
int i83 = 251 - i22;
|
|
hVar.p = i83;
|
|
hVar.o -= i83;
|
|
hVar.r = 0;
|
|
} else if (i22 == 251) {
|
|
hVar.n = 3;
|
|
hVar.r = 0;
|
|
} else if (i22 < 255) {
|
|
int i84 = i22 - 251;
|
|
int i85 = z12 ? hVar.o : 0;
|
|
int i86 = i84;
|
|
while (i86 > 0) {
|
|
i82 = x(i82, hVar.q, i85, cArr2, pVarArr3);
|
|
i86--;
|
|
i84 = i84;
|
|
i85++;
|
|
cArr2 = cArr2;
|
|
}
|
|
hVar.n = 1;
|
|
hVar.p = i84;
|
|
hVar.o += i84;
|
|
hVar.r = 0;
|
|
} else {
|
|
int u12 = u(i82);
|
|
int i87 = i82 + 2;
|
|
hVar.n = 0;
|
|
hVar.p = u12;
|
|
hVar.o = u12;
|
|
for (int i88 = 0; i88 < u12; i88++) {
|
|
i87 = x(i87, hVar.q, i88, cArr2, pVarArr3);
|
|
}
|
|
int u13 = u(i87);
|
|
i82 = i87 + 2;
|
|
hVar.r = u13;
|
|
for (int i89 = 0; i89 < u13; i89++) {
|
|
i82 = x(i82, hVar.f2807s, i89, cArr2, pVarArr3);
|
|
}
|
|
}
|
|
i26 = i82;
|
|
}
|
|
} else {
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
i22 = u;
|
|
}
|
|
int i90 = i22 + 1 + hVar.m;
|
|
hVar.m = i90;
|
|
b(i90, pVarArr3);
|
|
i8 = i26;
|
|
i6 = i20;
|
|
z2 = z10;
|
|
i2 = i25;
|
|
u4 = i19;
|
|
iArr13 = iArr4;
|
|
iArr12 = iArr3;
|
|
} else {
|
|
i6 = i20;
|
|
z2 = z10;
|
|
u4 = i19;
|
|
iArr13 = iArr4;
|
|
iArr12 = iArr3;
|
|
i8 = 0;
|
|
}
|
|
} else {
|
|
if (z2) {
|
|
if ((hVar.b & 8) != 0) {
|
|
qVar.c(256, 0, null, 0, null);
|
|
}
|
|
z3 = false;
|
|
} else {
|
|
z3 = z2;
|
|
}
|
|
i9 = bArr[i6] & 255;
|
|
switch (i9) {
|
|
case 0:
|
|
case 1:
|
|
case 2:
|
|
case 3:
|
|
case 4:
|
|
case 5:
|
|
case 6:
|
|
case 7:
|
|
case 8:
|
|
case 9:
|
|
case 10:
|
|
case 11:
|
|
case 12:
|
|
case 13:
|
|
case 14:
|
|
case 15:
|
|
case 46:
|
|
case 47:
|
|
case 48:
|
|
case 49:
|
|
case 50:
|
|
case 51:
|
|
case 52:
|
|
case 53:
|
|
case 79:
|
|
case 80:
|
|
case 81:
|
|
case 82:
|
|
case 83:
|
|
case 84:
|
|
case 85:
|
|
case 86:
|
|
case 87:
|
|
case 88:
|
|
case 89:
|
|
case 90:
|
|
case 91:
|
|
case 92:
|
|
case 93:
|
|
case 94:
|
|
case 95:
|
|
case 96:
|
|
case 97:
|
|
case 98:
|
|
case 99:
|
|
case 100:
|
|
case 101:
|
|
case 102:
|
|
case 103:
|
|
case 104:
|
|
case 105:
|
|
case 106:
|
|
case 107:
|
|
case 108:
|
|
case 109:
|
|
case 110:
|
|
case 111:
|
|
case 112:
|
|
case 113:
|
|
case 114:
|
|
case 115:
|
|
case 116:
|
|
case 117:
|
|
case 118:
|
|
case 119:
|
|
case 120:
|
|
case 121:
|
|
case 122:
|
|
case 123:
|
|
case 124:
|
|
case 125:
|
|
case 126:
|
|
case 127:
|
|
case 128:
|
|
case 129:
|
|
case 130:
|
|
case 131:
|
|
case 133:
|
|
case 134:
|
|
case 135:
|
|
case 136:
|
|
case 137:
|
|
case 138:
|
|
case 139:
|
|
case 140:
|
|
case 141:
|
|
case 142:
|
|
case 143:
|
|
case 144:
|
|
case 145:
|
|
case 146:
|
|
case 147:
|
|
case 148:
|
|
case 149:
|
|
case 150:
|
|
case 151:
|
|
case 152:
|
|
case 172:
|
|
case 173:
|
|
case 174:
|
|
case 175:
|
|
case 176:
|
|
case 177:
|
|
case 190:
|
|
case 191:
|
|
case 194:
|
|
case 195:
|
|
z4 = z12;
|
|
z7 = z3;
|
|
i10 = i8;
|
|
qVar.e(i9);
|
|
i13 = i6 + 1;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z7;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null || i11 >= iArr2.length || i12 > i79) {
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null && i14 < iArr13.length && i15 <= i79) {
|
|
if (i15 != i79) {
|
|
int r = r(hVar, iArr13[i14]);
|
|
z6 = z5;
|
|
i17 = i13;
|
|
i16 = i79;
|
|
k(qVar.f(hVar.h, hVar.i, t(r, cArr), false), r + 2, true, cArr);
|
|
} else {
|
|
z6 = z5;
|
|
i17 = i13;
|
|
i16 = i79;
|
|
}
|
|
i14++;
|
|
i15 = d(iArr13, i14);
|
|
z5 = z6;
|
|
i13 = i17;
|
|
i79 = i16;
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
} else {
|
|
if (i12 == i79) {
|
|
int r2 = r(hVar, iArr2[i11]);
|
|
k(qVar.f(hVar.h, hVar.i, t(r2, cArr), true), r2 + 2, true, cArr);
|
|
}
|
|
i11++;
|
|
i12 = d(iArr2, i11);
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
if (i15 != i79) {
|
|
}
|
|
i14++;
|
|
i15 = d(iArr13, i14);
|
|
z5 = z6;
|
|
i13 = i17;
|
|
i79 = i16;
|
|
break;
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
}
|
|
case 16:
|
|
case 188:
|
|
z4 = z12;
|
|
z7 = z3;
|
|
i10 = i8;
|
|
qVar.g(i9, bArr[i6 + 1]);
|
|
i13 = i6 + 2;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z7;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 17:
|
|
z4 = z12;
|
|
z7 = z3;
|
|
i10 = i8;
|
|
qVar.g(i9, q(i6 + 1));
|
|
i13 = i6 + 3;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z7;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 18:
|
|
z4 = z12;
|
|
z7 = z3;
|
|
i10 = i8;
|
|
qVar.j(i(bArr[i6 + 1] & 255, cArr));
|
|
i13 = i6 + 2;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z7;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 19:
|
|
case 20:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
qVar.j(i(u(i6 + 1), cArr));
|
|
i13 = i6 + 3;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 21:
|
|
case 22:
|
|
case 23:
|
|
case 24:
|
|
case 25:
|
|
case 54:
|
|
case 55:
|
|
case 56:
|
|
case 57:
|
|
case 58:
|
|
case 169:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
qVar.t(i9, bArr[i6 + 1] & 255);
|
|
i13 = i6 + 2;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 26:
|
|
case 27:
|
|
case 28:
|
|
case 29:
|
|
case 30:
|
|
case 31:
|
|
case 32:
|
|
case 33:
|
|
case 34:
|
|
case 35:
|
|
case 36:
|
|
case 37:
|
|
case 38:
|
|
case 39:
|
|
case 40:
|
|
case 41:
|
|
case 42:
|
|
case 43:
|
|
case 44:
|
|
case 45:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
int i91 = i9 - 26;
|
|
qVar.t((i91 >> 2) + 21, 3 & i91);
|
|
i13 = i6 + 1;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 59:
|
|
case 60:
|
|
case 61:
|
|
case 62:
|
|
case 63:
|
|
case 64:
|
|
case 65:
|
|
case 66:
|
|
case 67:
|
|
case 68:
|
|
case 69:
|
|
case 70:
|
|
case 71:
|
|
case 72:
|
|
case 73:
|
|
case 74:
|
|
case 75:
|
|
case 76:
|
|
case 77:
|
|
case 78:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
int i92 = i9 - 59;
|
|
qVar.t((i92 >> 2) + 54, 3 & i92);
|
|
i13 = i6 + 1;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 132:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
qVar.d(bArr[i6 + 1] & 255, bArr[i6 + 2]);
|
|
i13 = i6 + 3;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 153:
|
|
case 154:
|
|
case 155:
|
|
case 156:
|
|
case 157:
|
|
case 158:
|
|
case 159:
|
|
case 160:
|
|
case 161:
|
|
case 162:
|
|
case 163:
|
|
case 164:
|
|
case 165:
|
|
case 166:
|
|
case 167:
|
|
case 168:
|
|
case 198:
|
|
case 199:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
qVar.h(i9, pVarArr2[q(i6 + 1) + i79]);
|
|
i13 = i6 + 3;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 170:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
i10 = i8;
|
|
int i93 = (4 - (i79 & 3)) + i6;
|
|
p pVar3 = pVarArr2[l(i93) + i79];
|
|
int l5 = l(i93 + 4);
|
|
int l6 = l(i93 + 8);
|
|
int i94 = i93 + 12;
|
|
int i95 = (l6 - l5) + 1;
|
|
p[] pVarArr11 = new p[i95];
|
|
for (int i96 = 0; i96 < i95; i96++) {
|
|
pVarArr11[i96] = pVarArr2[l(i94) + i79];
|
|
i94 += 4;
|
|
}
|
|
qVar.q(l5, l6, pVar3, pVarArr11);
|
|
i13 = i94;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 171:
|
|
z4 = z12;
|
|
z8 = z3;
|
|
int i97 = (4 - (i79 & 3)) + i6;
|
|
p pVar4 = pVarArr2[l(i97) + i79];
|
|
int l7 = l(i97 + 4);
|
|
int[] iArr15 = new int[l7];
|
|
p[] pVarArr12 = new p[l7];
|
|
int i98 = i97 + 8;
|
|
for (int i99 = 0; i99 < l7; i99++) {
|
|
iArr15[i99] = l(i98);
|
|
pVarArr12[i99] = pVarArr2[l(i98 + 4) + i79];
|
|
i98 += 8;
|
|
}
|
|
r rVar2 = (r) qVar;
|
|
c cVar = rVar2.l;
|
|
rVar2.Z = cVar.b;
|
|
cVar.g(171);
|
|
i10 = i8;
|
|
cVar.h(null, 0, (4 - (rVar2.l.b % 4)) % 4);
|
|
boolean z15 = true;
|
|
pVar4.e(rVar2.l, rVar2.Z, true);
|
|
rVar2.l.i(l7);
|
|
int i100 = 0;
|
|
while (i100 < l7) {
|
|
rVar2.l.i(iArr15[i100]);
|
|
pVarArr12[i100].e(rVar2.l, rVar2.Z, z15);
|
|
i100++;
|
|
l7 = l7;
|
|
z15 = true;
|
|
}
|
|
rVar2.B(pVar4, pVarArr12);
|
|
i13 = i98;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 178:
|
|
case 179:
|
|
case 180:
|
|
case 181:
|
|
case 182:
|
|
case 183:
|
|
case 184:
|
|
case 185:
|
|
z4 = z12;
|
|
int i101 = this.b[u(i6 + 1)];
|
|
int i102 = this.b[u(i101 + 2)];
|
|
String g = g(i101, cArr);
|
|
String t3 = t(i102, cArr);
|
|
String t4 = t(i102 + 2, cArr);
|
|
if (i9 < 182) {
|
|
qVar.b(i9, g, t3, t4);
|
|
z8 = z3;
|
|
i18 = i9;
|
|
} else {
|
|
z8 = z3;
|
|
i18 = i9;
|
|
qVar.p(i9, g, t3, t4, bArr[i101 + -1] == 11);
|
|
}
|
|
i13 = i18 == 185 ? i6 + 5 : i6 + 3;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
z5 = z8;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 186:
|
|
int i103 = this.b[u(i6 + 1)];
|
|
int i104 = this.b[u(i103 + 2)];
|
|
String t5 = t(i104, cArr);
|
|
String t6 = t(i104 + 2, cArr);
|
|
int i105 = this.e[u(i103)];
|
|
n nVar = (n) i(u(i105), cArr);
|
|
int u14 = u(i105 + 2);
|
|
Object[] objArr2 = new Object[u14];
|
|
int i106 = i105 + 4;
|
|
z4 = z12;
|
|
int i107 = 0;
|
|
while (i107 < u14) {
|
|
objArr2[i107] = i(u(i106), cArr);
|
|
i106 += 2;
|
|
i107++;
|
|
u14 = u14;
|
|
}
|
|
r rVar3 = (r) qVar;
|
|
rVar3.Z = rVar3.l.b;
|
|
v vVar = rVar3.d;
|
|
u d3 = vVar.d(18, t5, t6, vVar.a(nVar, objArr2).a);
|
|
rVar3.l.e(186, d3.a);
|
|
rVar3.l.j(0);
|
|
p pVar5 = rVar3.Q;
|
|
if (pVar5 != null) {
|
|
int i108 = rVar3.N;
|
|
if (i108 == 4 || i108 == 3) {
|
|
pVar5.k.b(186, 0, d3, rVar3.d);
|
|
} else {
|
|
int a = d3.a();
|
|
int i109 = rVar3.R + ((a & 3) - (a >> 2)) + 1;
|
|
if (i109 > rVar3.S) {
|
|
rVar3.S = i109;
|
|
}
|
|
rVar3.R = i109;
|
|
}
|
|
}
|
|
i13 = i6 + 5;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 187:
|
|
case 189:
|
|
case 192:
|
|
case 193:
|
|
qVar.s(i9, g(i6 + 1, cArr));
|
|
i13 = i6 + 3;
|
|
z4 = z12;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 196:
|
|
int i110 = bArr[i6 + 1] & 255;
|
|
if (i110 == 132) {
|
|
qVar.d(u(i6 + 2), q(i6 + 4));
|
|
i13 = i6 + 6;
|
|
z4 = z12;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
} else {
|
|
qVar.t(i110, u(i6 + 2));
|
|
i13 = i6 + 4;
|
|
z4 = z12;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
}
|
|
break;
|
|
case 197:
|
|
String g2 = g(i6 + 1, cArr);
|
|
int i111 = bArr[i6 + 3] & 255;
|
|
r rVar4 = (r) qVar;
|
|
rVar4.Z = rVar4.l.b;
|
|
u m = rVar4.d.m(7, g2);
|
|
c cVar2 = rVar4.l;
|
|
cVar2.e(197, m.a);
|
|
cVar2.g(i111);
|
|
p pVar6 = rVar4.Q;
|
|
if (pVar6 != null) {
|
|
int i112 = rVar4.N;
|
|
if (i112 == 4 || i112 == 3) {
|
|
pVar6.k.b(197, i111, m, rVar4.d);
|
|
} else {
|
|
rVar4.R = (1 - i111) + rVar4.R;
|
|
}
|
|
}
|
|
i13 = i6 + 4;
|
|
z4 = z12;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 200:
|
|
case 201:
|
|
qVar.h(i9 - i72, pVarArr2[l(i6 + 1) + i79]);
|
|
i13 = i6 + 5;
|
|
z4 = z12;
|
|
z9 = z3;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 202:
|
|
case 203:
|
|
case 204:
|
|
case 205:
|
|
case 206:
|
|
case 207:
|
|
case 208:
|
|
case 209:
|
|
case 210:
|
|
case 211:
|
|
case 212:
|
|
case 213:
|
|
case 214:
|
|
case 215:
|
|
case 216:
|
|
case 217:
|
|
case 218:
|
|
case 219:
|
|
int i113 = i9 < 218 ? i9 - 49 : i9 - 20;
|
|
p pVar7 = pVarArr2[u(i6 + 1) + i79];
|
|
if (i113 == 167 || i113 == 168) {
|
|
qVar.h(i113 + 33, pVar7);
|
|
z9 = z3;
|
|
} else {
|
|
qVar.h(i113 < 167 ? ((i113 + 1) ^ 1) - 1 : i113 ^ 1, b(i79 + 3, pVarArr2));
|
|
qVar.h(200, pVar7);
|
|
z9 = true;
|
|
}
|
|
i13 = i6 + 3;
|
|
z4 = z12;
|
|
z5 = z9;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
case 220:
|
|
qVar.h(200, pVarArr2[l(i6 + 1) + i79]);
|
|
i13 = i6 + 5;
|
|
z4 = z12;
|
|
i10 = i8;
|
|
i12 = i78;
|
|
i11 = i76;
|
|
iArr2 = iArr12;
|
|
z5 = true;
|
|
if (iArr2 != null) {
|
|
}
|
|
i14 = i77;
|
|
i15 = i73;
|
|
while (iArr13 != null) {
|
|
}
|
|
z13 = z5;
|
|
i77 = i14;
|
|
i73 = i15;
|
|
i76 = i11;
|
|
iArr12 = iArr2;
|
|
pVarArr2 = pVarArr2;
|
|
i74 = i13;
|
|
u3 = u3;
|
|
z12 = z4;
|
|
i2 = i2;
|
|
i75 = i10;
|
|
i78 = i12;
|
|
iArr13 = iArr13;
|
|
u4 = u4;
|
|
break;
|
|
default:
|
|
throw new AssertionError();
|
|
}
|
|
}
|
|
}
|
|
if (z2) {
|
|
}
|
|
i9 = bArr[i6] & 255;
|
|
switch (i9) {
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
i7 = i75;
|
|
i6 = i74;
|
|
z2 = z13;
|
|
i8 = i7;
|
|
while (i8 != 0) {
|
|
}
|
|
if (z2) {
|
|
}
|
|
i9 = bArr[i6] & 255;
|
|
switch (i9) {
|
|
}
|
|
}
|
|
if (pVarArr2[i3] != null) {
|
|
qVar.i(pVarArr2[i3]);
|
|
}
|
|
if (i54 != 0 && (hVar.b & 2) == 0) {
|
|
if (i55 != 0) {
|
|
int u15 = u(i55) * 3;
|
|
int[] iArr16 = new int[u15];
|
|
int i114 = i55 + 2;
|
|
while (u15 > 0) {
|
|
int i115 = u15 - 1;
|
|
iArr16[i115] = i114 + 6;
|
|
int i116 = i115 - 1;
|
|
iArr16[i116] = u(i114 + 8);
|
|
u15 = i116 - 1;
|
|
iArr16[u15] = u(i114);
|
|
i114 += 10;
|
|
}
|
|
iArr = iArr16;
|
|
} else {
|
|
iArr = null;
|
|
}
|
|
int u16 = u(i54);
|
|
int i117 = i54 + 2;
|
|
while (true) {
|
|
int i118 = u16 - 1;
|
|
if (u16 > 0) {
|
|
int u17 = u(i117);
|
|
int u18 = u(i117 + 2);
|
|
String t7 = t(i117 + 4, cArr);
|
|
String t8 = t(i117 + 6, cArr);
|
|
int u19 = u(i117 + 8);
|
|
int i119 = i117 + 10;
|
|
if (iArr != null) {
|
|
int i120 = 0;
|
|
while (true) {
|
|
if (i120 < iArr.length) {
|
|
if (iArr[i120] == u17 && iArr[i120 + 1] == u19) {
|
|
str = t(iArr[i120 + 2], cArr);
|
|
} else {
|
|
i120 += 3;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
str = null;
|
|
qVar.l(t7, t8, str, pVarArr2[u17], pVarArr2[u17 + u18], u19);
|
|
u16 = i118;
|
|
i117 = i119;
|
|
}
|
|
}
|
|
}
|
|
int i121 = 65;
|
|
if (iArr12 != null) {
|
|
int length = iArr12.length;
|
|
int i122 = 0;
|
|
while (i122 < length) {
|
|
int i123 = iArr12[i122];
|
|
int f = f(i123);
|
|
if (f == 64 || f == i121) {
|
|
int r3 = r(hVar, i123);
|
|
i5 = i122;
|
|
bVar2 = bVar;
|
|
k(qVar.m(hVar.h, hVar.i, hVar.j, hVar.k, hVar.l, t(r3, cArr), true), r3 + 2, true, cArr);
|
|
} else {
|
|
i5 = i122;
|
|
bVar2 = bVar;
|
|
}
|
|
i122 = i5 + 1;
|
|
bVar = bVar2;
|
|
i121 = 65;
|
|
}
|
|
}
|
|
if (iArr13 != null) {
|
|
for (int i124 : iArr13) {
|
|
int f2 = f(i124);
|
|
if (f2 == 64 || f2 == 65) {
|
|
int r4 = r(hVar, i124);
|
|
k(qVar.m(hVar.h, hVar.i, hVar.j, hVar.k, hVar.l, t(r4, cArr), false), r4 + 2, true, cArr);
|
|
}
|
|
}
|
|
}
|
|
b bVar4 = bVar;
|
|
while (bVar4 != null) {
|
|
b bVar5 = bVar4.f2798c;
|
|
bVar4.f2798c = null;
|
|
r rVar5 = (r) qVar;
|
|
bVar4.f2798c = rVar5.M;
|
|
rVar5.M = bVar4;
|
|
bVar4 = bVar5;
|
|
}
|
|
qVar.n(u3, u4);
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
public Object i(int i, char[] cArr) {
|
|
int[] iArr = this.b;
|
|
int i2 = iArr[i];
|
|
byte b = this.a[i2 - 1];
|
|
switch (b) {
|
|
case 3:
|
|
return Integer.valueOf(l(i2));
|
|
case 4:
|
|
return Float.valueOf(Float.intBitsToFloat(l(i2)));
|
|
case 5:
|
|
return Long.valueOf(m(i2));
|
|
case 6:
|
|
return Double.valueOf(Double.longBitsToDouble(m(i2)));
|
|
case 7:
|
|
return w.h(t(i2, cArr));
|
|
case 8:
|
|
return t(i2, cArr);
|
|
default:
|
|
switch (b) {
|
|
case 15:
|
|
int f = f(i2);
|
|
int i3 = this.b[u(i2 + 1)];
|
|
int i4 = this.b[u(i3 + 2)];
|
|
return new n(f, g(i3, cArr), t(i4, cArr), t(i4 + 2, cArr), this.a[i3 - 1] == 11);
|
|
case 16:
|
|
String t = t(i2, cArr);
|
|
return new w(11, t, 0, t.length());
|
|
case 17:
|
|
g gVar = this.d[i];
|
|
if (gVar != null) {
|
|
return gVar;
|
|
}
|
|
int i5 = iArr[i];
|
|
int i6 = iArr[u(i5 + 2)];
|
|
String t2 = t(i6, cArr);
|
|
String t3 = t(i6 + 2, cArr);
|
|
int i7 = this.e[u(i5)];
|
|
n nVar = (n) i(u(i7), cArr);
|
|
int u = u(i7 + 2);
|
|
Object[] objArr = new Object[u];
|
|
int i8 = i7 + 4;
|
|
for (int i9 = 0; i9 < u; i9++) {
|
|
objArr[i9] = i(u(i8), cArr);
|
|
i8 += 2;
|
|
}
|
|
g[] gVarArr = this.d;
|
|
g gVar2 = new g(t2, t3, nVar, objArr);
|
|
gVarArr[i] = gVar2;
|
|
return gVar2;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
}
|
|
|
|
public final int j(a aVar, int i, String str, char[] cArr) {
|
|
int i2 = 0;
|
|
if (aVar == null) {
|
|
int i3 = this.a[i] & 255;
|
|
return i3 != 64 ? i3 != 91 ? i3 != 101 ? i + 3 : i + 5 : k(null, i + 1, false, cArr) : k(null, i + 3, true, cArr);
|
|
}
|
|
int i4 = i + 1;
|
|
int i5 = this.a[i] & 255;
|
|
if (i5 != 64) {
|
|
if (i5 != 70) {
|
|
if (i5 == 83) {
|
|
aVar.e(str, Short.valueOf((short) l(this.b[u(i4)])));
|
|
} else if (i5 == 99) {
|
|
String t = t(i4, cArr);
|
|
aVar.e(str, w.k(t, 0, t.length()));
|
|
} else if (i5 == 101) {
|
|
String t2 = t(i4, cArr);
|
|
String t3 = t(i4 + 2, cArr);
|
|
aVar.e++;
|
|
if (aVar.b) {
|
|
aVar.f2797c.j(aVar.a.l(str));
|
|
}
|
|
c cVar = aVar.f2797c;
|
|
cVar.e(101, aVar.a.l(t2));
|
|
cVar.j(aVar.a.l(t3));
|
|
return i4 + 4;
|
|
} else if (i5 == 115) {
|
|
aVar.e(str, t(i4, cArr));
|
|
} else if (!(i5 == 73 || i5 == 74)) {
|
|
if (i5 == 90) {
|
|
aVar.e(str, l(this.b[u(i4)]) == 0 ? Boolean.FALSE : Boolean.TRUE);
|
|
} else if (i5 != 91) {
|
|
switch (i5) {
|
|
case 66:
|
|
aVar.e(str, Byte.valueOf((byte) l(this.b[u(i4)])));
|
|
break;
|
|
case 67:
|
|
aVar.e(str, Character.valueOf((char) l(this.b[u(i4)])));
|
|
break;
|
|
case 68:
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
} else {
|
|
int u = u(i4);
|
|
int i6 = i4 + 2;
|
|
if (u == 0) {
|
|
return k(aVar.f(str), i6 - 2, false, cArr);
|
|
}
|
|
int i7 = this.a[i6] & 255;
|
|
if (i7 == 70) {
|
|
float[] fArr = new float[u];
|
|
while (i2 < u) {
|
|
fArr[i2] = Float.intBitsToFloat(l(this.b[u(i6 + 1)]));
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, fArr);
|
|
return i6;
|
|
} else if (i7 == 83) {
|
|
short[] sArr = new short[u];
|
|
while (i2 < u) {
|
|
sArr[i2] = (short) l(this.b[u(i6 + 1)]);
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, sArr);
|
|
return i6;
|
|
} else if (i7 == 90) {
|
|
boolean[] zArr = new boolean[u];
|
|
for (int i8 = 0; i8 < u; i8++) {
|
|
zArr[i8] = l(this.b[u(i6 + 1)]) != 0;
|
|
i6 += 3;
|
|
}
|
|
aVar.e(str, zArr);
|
|
return i6;
|
|
} else if (i7 == 73) {
|
|
int[] iArr = new int[u];
|
|
while (i2 < u) {
|
|
iArr[i2] = l(this.b[u(i6 + 1)]);
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, iArr);
|
|
return i6;
|
|
} else if (i7 != 74) {
|
|
switch (i7) {
|
|
case 66:
|
|
byte[] bArr = new byte[u];
|
|
while (i2 < u) {
|
|
bArr[i2] = (byte) l(this.b[u(i6 + 1)]);
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, bArr);
|
|
return i6;
|
|
case 67:
|
|
char[] cArr2 = new char[u];
|
|
while (i2 < u) {
|
|
cArr2[i2] = (char) l(this.b[u(i6 + 1)]);
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, cArr2);
|
|
return i6;
|
|
case 68:
|
|
double[] dArr = new double[u];
|
|
while (i2 < u) {
|
|
dArr[i2] = Double.longBitsToDouble(m(this.b[u(i6 + 1)]));
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, dArr);
|
|
return i6;
|
|
default:
|
|
return k(aVar.f(str), i6 - 2, false, cArr);
|
|
}
|
|
} else {
|
|
long[] jArr = new long[u];
|
|
while (i2 < u) {
|
|
jArr[i2] = m(this.b[u(i6 + 1)]);
|
|
i6 += 3;
|
|
i2++;
|
|
}
|
|
aVar.e(str, jArr);
|
|
return i6;
|
|
}
|
|
}
|
|
}
|
|
return i4 + 2;
|
|
}
|
|
aVar.e(str, i(u(i4), cArr));
|
|
return i4 + 2;
|
|
}
|
|
String t4 = t(i4, cArr);
|
|
aVar.e++;
|
|
if (aVar.b) {
|
|
aVar.f2797c.j(aVar.a.l(str));
|
|
}
|
|
c cVar2 = aVar.f2797c;
|
|
cVar2.e(64, aVar.a.l(t4));
|
|
cVar2.j(0);
|
|
return k(new a(aVar.a, true, aVar.f2797c, null), i4 + 2, true, cArr);
|
|
}
|
|
|
|
public final int k(a aVar, int i, boolean z2, char[] cArr) {
|
|
int u = u(i);
|
|
int i2 = i + 2;
|
|
if (!z2) {
|
|
while (true) {
|
|
int i3 = u - 1;
|
|
if (u <= 0) {
|
|
break;
|
|
}
|
|
i2 = j(aVar, i2, null, cArr);
|
|
u = i3;
|
|
}
|
|
} else {
|
|
while (true) {
|
|
int i4 = u - 1;
|
|
if (u <= 0) {
|
|
break;
|
|
}
|
|
i2 = j(aVar, i2 + 2, t(i2, cArr), cArr);
|
|
u = i4;
|
|
}
|
|
}
|
|
if (aVar != null) {
|
|
aVar.g();
|
|
}
|
|
return i2;
|
|
}
|
|
|
|
public int l(int i) {
|
|
byte[] bArr = this.a;
|
|
return (bArr[i + 3] & 255) | ((bArr[i] & 255) << 24) | ((bArr[i + 1] & 255) << 16) | ((bArr[i + 2] & 255) << 8);
|
|
}
|
|
|
|
public long m(int i) {
|
|
return (((long) l(i)) << 32) | (((long) l(i + 4)) & 4294967295L);
|
|
}
|
|
|
|
public String n(int i, char[] cArr) {
|
|
return t(this.b[u(i)], cArr);
|
|
}
|
|
|
|
public String o(int i, char[] cArr) {
|
|
return t(this.b[u(i)], cArr);
|
|
}
|
|
|
|
public final void p(q qVar, h hVar, int i, boolean z2) {
|
|
a aVar;
|
|
int i2 = i + 1;
|
|
int i3 = this.a[i] & 255;
|
|
r rVar = (r) qVar;
|
|
if (z2) {
|
|
rVar.D = i3;
|
|
} else {
|
|
rVar.F = i3;
|
|
}
|
|
char[] cArr = hVar.f2806c;
|
|
for (int i4 = 0; i4 < i3; i4++) {
|
|
int u = u(i2);
|
|
i2 += 2;
|
|
while (true) {
|
|
int i5 = u - 1;
|
|
if (u <= 0) {
|
|
break;
|
|
}
|
|
String t = t(i2, cArr);
|
|
int i6 = i2 + 2;
|
|
c cVar = new c();
|
|
cVar.j(rVar.d.l(t));
|
|
cVar.j(0);
|
|
if (z2) {
|
|
if (rVar.E == null) {
|
|
rVar.E = new a[w.a(rVar.i).length];
|
|
}
|
|
a[] aVarArr = rVar.E;
|
|
aVar = new a(rVar.d, true, cVar, aVarArr[i4]);
|
|
aVarArr[i4] = aVar;
|
|
} else {
|
|
if (rVar.G == null) {
|
|
rVar.G = new a[w.a(rVar.i).length];
|
|
}
|
|
a[] aVarArr2 = rVar.G;
|
|
aVar = new a(rVar.d, true, cVar, aVarArr2[i4]);
|
|
aVarArr2[i4] = aVar;
|
|
}
|
|
i2 = k(aVar, i6, true, cArr);
|
|
u = i5;
|
|
}
|
|
}
|
|
}
|
|
|
|
public short q(int i) {
|
|
byte[] bArr = this.a;
|
|
return (short) ((bArr[i + 1] & 255) | ((bArr[i] & 255) << 8));
|
|
}
|
|
|
|
/* JADX INFO: Can't fix incorrect switch cases order, some code will duplicate */
|
|
/* JADX WARNING: Removed duplicated region for block: B:11:0x0025 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:19:0x007d */
|
|
/* JADX WARNING: Removed duplicated region for block: B:20:0x007f */
|
|
public final int r(h hVar, int i) {
|
|
int i2;
|
|
int i3;
|
|
int l = l(i);
|
|
int i4 = l >>> 24;
|
|
if (!(i4 == 0 || i4 == 1)) {
|
|
switch (i4) {
|
|
case 16:
|
|
case 17:
|
|
case 18:
|
|
case 23:
|
|
i3 = l & -256;
|
|
i2 = i + 3;
|
|
break;
|
|
case 19:
|
|
case 20:
|
|
case 21:
|
|
i3 = l & -16777216;
|
|
i2 = i + 1;
|
|
break;
|
|
case 22:
|
|
break;
|
|
default:
|
|
switch (i4) {
|
|
case 64:
|
|
case 65:
|
|
i3 = l & -16777216;
|
|
int u = u(i + 1);
|
|
i2 = i + 3;
|
|
hVar.j = new p[u];
|
|
hVar.k = new p[u];
|
|
hVar.l = new int[u];
|
|
for (int i5 = 0; i5 < u; i5++) {
|
|
int u2 = u(i2);
|
|
int u3 = u(i2 + 2);
|
|
int u4 = u(i2 + 4);
|
|
i2 += 6;
|
|
hVar.j[i5] = b(u2, hVar.g);
|
|
hVar.k[i5] = b(u2 + u3, hVar.g);
|
|
hVar.l[i5] = u4;
|
|
}
|
|
break;
|
|
case 66:
|
|
break;
|
|
case 67:
|
|
case 68:
|
|
case 69:
|
|
case 70:
|
|
i3 = l & -16777216;
|
|
i2 = i + 3;
|
|
break;
|
|
case 71:
|
|
case 72:
|
|
case 73:
|
|
case 74:
|
|
case 75:
|
|
i3 = l & -16776961;
|
|
i2 = i + 4;
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
}
|
|
hVar.h = i3;
|
|
int f = f(i2);
|
|
hVar.i = f != 0 ? null : new x(this.a, i2);
|
|
return (f * 2) + i2 + 1;
|
|
}
|
|
i3 = l & -65536;
|
|
i2 = i + 2;
|
|
hVar.h = i3;
|
|
int f = f(i2);
|
|
hVar.i = f != 0 ? null : new x(this.a, i2);
|
|
return (f * 2) + i2 + 1;
|
|
}
|
|
|
|
/* JADX WARNING: Removed duplicated region for block: B:16:0x005a */
|
|
/* JADX WARNING: Removed duplicated region for block: B:23:0x00ab */
|
|
public final int[] s(q qVar, h hVar, int i, boolean z2) {
|
|
int i2;
|
|
a aVar;
|
|
char[] cArr = hVar.f2806c;
|
|
int u = u(i);
|
|
int[] iArr = new int[u];
|
|
int i3 = i + 2;
|
|
for (int i4 = 0; i4 < u; i4++) {
|
|
iArr[i4] = i3;
|
|
int l = l(i3);
|
|
int i5 = l >>> 24;
|
|
if (i5 != 23) {
|
|
switch (i5) {
|
|
default:
|
|
switch (i5) {
|
|
case 64:
|
|
case 65:
|
|
int u2 = u(i3 + 1);
|
|
i2 = i3 + 3;
|
|
while (true) {
|
|
int i6 = u2 - 1;
|
|
if (u2 <= 0) {
|
|
break;
|
|
} else {
|
|
int u3 = u(i2);
|
|
int u4 = u(i2 + 2);
|
|
i2 += 6;
|
|
b(u3, hVar.g);
|
|
b(u3 + u4, hVar.g);
|
|
u2 = i6;
|
|
}
|
|
}
|
|
case 66:
|
|
case 67:
|
|
case 68:
|
|
case 69:
|
|
case 70:
|
|
break;
|
|
case 71:
|
|
case 72:
|
|
case 73:
|
|
case 74:
|
|
case 75:
|
|
i2 = i3 + 4;
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
case 16:
|
|
case 17:
|
|
case 18:
|
|
i2 = i3 + 3;
|
|
break;
|
|
}
|
|
int f = f(i2);
|
|
x xVar = null;
|
|
if (i5 != 66) {
|
|
if (f != 0) {
|
|
xVar = new x(this.a, i2);
|
|
}
|
|
int i7 = (f * 2) + 1 + i2;
|
|
String t = t(i7, cArr);
|
|
int i8 = i7 + 2;
|
|
r rVar = (r) qVar;
|
|
Objects.requireNonNull(rVar);
|
|
c cVar = new c();
|
|
c.q.a.k.a.K(l & -256, cVar);
|
|
x.a(xVar, cVar);
|
|
cVar.j(rVar.d.l(t));
|
|
cVar.j(0);
|
|
if (z2) {
|
|
aVar = new a(rVar.d, true, cVar, rVar.w);
|
|
rVar.w = aVar;
|
|
} else {
|
|
aVar = new a(rVar.d, true, cVar, rVar.f2818x);
|
|
rVar.f2818x = aVar;
|
|
}
|
|
i3 = k(aVar, i8, true, cArr);
|
|
} else {
|
|
i3 = k(null, (f * 2) + 3 + i2, true, cArr);
|
|
}
|
|
}
|
|
i2 = i3 + 3;
|
|
int f = f(i2);
|
|
x xVar = null;
|
|
if (i5 != 66) {
|
|
}
|
|
}
|
|
return iArr;
|
|
}
|
|
|
|
public String t(int i, char[] cArr) {
|
|
int u = u(i);
|
|
if (i == 0 || u == 0) {
|
|
return null;
|
|
}
|
|
return w(u, cArr);
|
|
}
|
|
|
|
public int u(int i) {
|
|
byte[] bArr = this.a;
|
|
return (bArr[i + 1] & 255) | ((bArr[i] & 255) << 8);
|
|
}
|
|
|
|
public final String v(int i, int i2, char[] cArr) {
|
|
int i3;
|
|
int i4 = i2 + i;
|
|
byte[] bArr = this.a;
|
|
int i5 = 0;
|
|
while (i < i4) {
|
|
int i6 = i + 1;
|
|
byte b = bArr[i];
|
|
if ((b & 128) == 0) {
|
|
i3 = i5 + 1;
|
|
cArr[i5] = (char) (b & Byte.MAX_VALUE);
|
|
} else if ((b & 224) == 192) {
|
|
cArr[i5] = (char) (((b & 31) << 6) + (bArr[i6] & 63));
|
|
i5++;
|
|
i = i6 + 1;
|
|
} else {
|
|
i3 = i5 + 1;
|
|
int i7 = i6 + 1;
|
|
int i8 = ((b & 15) << 12) + ((bArr[i6] & 63) << 6);
|
|
i6 = i7 + 1;
|
|
cArr[i5] = (char) (i8 + (bArr[i7] & 63));
|
|
}
|
|
i = i6;
|
|
i5 = i3;
|
|
}
|
|
return new String(cArr, 0, i5);
|
|
}
|
|
|
|
public final String w(int i, char[] cArr) {
|
|
String[] strArr = this.f2799c;
|
|
String str = strArr[i];
|
|
if (str != null) {
|
|
return str;
|
|
}
|
|
int i2 = this.b[i];
|
|
String v = v(i2 + 2, u(i2), cArr);
|
|
strArr[i] = v;
|
|
return v;
|
|
}
|
|
|
|
public final int x(int i, Object[] objArr, int i2, char[] cArr, p[] pVarArr) {
|
|
int i3 = i + 1;
|
|
switch (this.a[i] & 255) {
|
|
case 0:
|
|
objArr[i2] = t.a;
|
|
return i3;
|
|
case 1:
|
|
objArr[i2] = t.b;
|
|
return i3;
|
|
case 2:
|
|
objArr[i2] = t.f2822c;
|
|
return i3;
|
|
case 3:
|
|
objArr[i2] = t.d;
|
|
return i3;
|
|
case 4:
|
|
objArr[i2] = t.e;
|
|
return i3;
|
|
case 5:
|
|
objArr[i2] = t.f;
|
|
return i3;
|
|
case 6:
|
|
objArr[i2] = t.g;
|
|
return i3;
|
|
case 7:
|
|
objArr[i2] = g(i3, cArr);
|
|
break;
|
|
case 8:
|
|
objArr[i2] = b(u(i3), pVarArr);
|
|
break;
|
|
default:
|
|
throw new IllegalArgumentException();
|
|
}
|
|
return i3 + 2;
|
|
}
|
|
}
|