Daniel Elliott
f9d20bb3fc
- 28,932 files - Full Java source code - Smali files - Resources Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
668 lines
20 KiB
Java
668 lines
20 KiB
Java
package com.fyber.inneractive.sdk.protobuf;
|
|
|
|
import com.applovin.exoplayer2.common.base.Ascii;
|
|
import com.fyber.inneractive.sdk.protobuf.GeneratedMessageLite;
|
|
import com.fyber.inneractive.sdk.protobuf.r1;
|
|
import com.fyber.inneractive.sdk.protobuf.y;
|
|
import java.io.IOException;
|
|
|
|
/* loaded from: classes2.dex */
|
|
public final class e {
|
|
|
|
public static /* synthetic */ class a {
|
|
public static final /* synthetic */ int[] a;
|
|
|
|
static {
|
|
int[] iArr = new int[r1.b.values().length];
|
|
a = iArr;
|
|
try {
|
|
iArr[r1.b.DOUBLE.ordinal()] = 1;
|
|
} catch (NoSuchFieldError unused) {
|
|
}
|
|
try {
|
|
a[r1.b.FLOAT.ordinal()] = 2;
|
|
} catch (NoSuchFieldError unused2) {
|
|
}
|
|
try {
|
|
a[r1.b.INT64.ordinal()] = 3;
|
|
} catch (NoSuchFieldError unused3) {
|
|
}
|
|
try {
|
|
a[r1.b.UINT64.ordinal()] = 4;
|
|
} catch (NoSuchFieldError unused4) {
|
|
}
|
|
try {
|
|
a[r1.b.INT32.ordinal()] = 5;
|
|
} catch (NoSuchFieldError unused5) {
|
|
}
|
|
try {
|
|
a[r1.b.UINT32.ordinal()] = 6;
|
|
} catch (NoSuchFieldError unused6) {
|
|
}
|
|
try {
|
|
a[r1.b.FIXED64.ordinal()] = 7;
|
|
} catch (NoSuchFieldError unused7) {
|
|
}
|
|
try {
|
|
a[r1.b.SFIXED64.ordinal()] = 8;
|
|
} catch (NoSuchFieldError unused8) {
|
|
}
|
|
try {
|
|
a[r1.b.FIXED32.ordinal()] = 9;
|
|
} catch (NoSuchFieldError unused9) {
|
|
}
|
|
try {
|
|
a[r1.b.SFIXED32.ordinal()] = 10;
|
|
} catch (NoSuchFieldError unused10) {
|
|
}
|
|
try {
|
|
a[r1.b.BOOL.ordinal()] = 11;
|
|
} catch (NoSuchFieldError unused11) {
|
|
}
|
|
try {
|
|
a[r1.b.SINT32.ordinal()] = 12;
|
|
} catch (NoSuchFieldError unused12) {
|
|
}
|
|
try {
|
|
a[r1.b.SINT64.ordinal()] = 13;
|
|
} catch (NoSuchFieldError unused13) {
|
|
}
|
|
try {
|
|
a[r1.b.ENUM.ordinal()] = 14;
|
|
} catch (NoSuchFieldError unused14) {
|
|
}
|
|
try {
|
|
a[r1.b.BYTES.ordinal()] = 15;
|
|
} catch (NoSuchFieldError unused15) {
|
|
}
|
|
try {
|
|
a[r1.b.STRING.ordinal()] = 16;
|
|
} catch (NoSuchFieldError unused16) {
|
|
}
|
|
try {
|
|
a[r1.b.GROUP.ordinal()] = 17;
|
|
} catch (NoSuchFieldError unused17) {
|
|
}
|
|
try {
|
|
a[r1.b.MESSAGE.ordinal()] = 18;
|
|
} catch (NoSuchFieldError unused18) {
|
|
}
|
|
}
|
|
}
|
|
|
|
public static final class b {
|
|
public int a;
|
|
public long b;
|
|
public Object c;
|
|
public final q d;
|
|
|
|
public b(q qVar) {
|
|
qVar.getClass();
|
|
this.d = qVar;
|
|
}
|
|
}
|
|
|
|
public static int a(int i, byte[] bArr, int i2, b bVar) {
|
|
int i3 = i & 127;
|
|
int i4 = i2 + 1;
|
|
byte b2 = bArr[i2];
|
|
if (b2 >= 0) {
|
|
bVar.a = i3 | (b2 << 7);
|
|
return i4;
|
|
}
|
|
int i5 = i3 | ((b2 & Byte.MAX_VALUE) << 7);
|
|
int i6 = i2 + 2;
|
|
byte b3 = bArr[i4];
|
|
if (b3 >= 0) {
|
|
bVar.a = i5 | (b3 << Ascii.SO);
|
|
return i6;
|
|
}
|
|
int i7 = i5 | ((b3 & Byte.MAX_VALUE) << 14);
|
|
int i8 = i2 + 3;
|
|
byte b4 = bArr[i6];
|
|
if (b4 >= 0) {
|
|
bVar.a = i7 | (b4 << Ascii.NAK);
|
|
return i8;
|
|
}
|
|
int i9 = i7 | ((b4 & Byte.MAX_VALUE) << 21);
|
|
int i10 = i2 + 4;
|
|
byte b5 = bArr[i8];
|
|
if (b5 >= 0) {
|
|
bVar.a = i9 | (b5 << Ascii.FS);
|
|
return i10;
|
|
}
|
|
int i11 = i9 | ((b5 & Byte.MAX_VALUE) << 28);
|
|
while (true) {
|
|
int i12 = i10 + 1;
|
|
if (bArr[i10] >= 0) {
|
|
bVar.a = i11;
|
|
return i12;
|
|
}
|
|
i10 = i12;
|
|
}
|
|
}
|
|
|
|
public static long b(byte[] bArr, int i) {
|
|
return ((bArr[i + 7] & 255) << 56) | (bArr[i] & 255) | ((bArr[i + 1] & 255) << 8) | ((bArr[i + 2] & 255) << 16) | ((bArr[i + 3] & 255) << 24) | ((bArr[i + 4] & 255) << 32) | ((bArr[i + 5] & 255) << 40) | ((bArr[i + 6] & 255) << 48);
|
|
}
|
|
|
|
public static int c(byte[] bArr, int i, b bVar) {
|
|
int i2 = i + 1;
|
|
byte b2 = bArr[i];
|
|
if (b2 < 0) {
|
|
return a(b2, bArr, i2, bVar);
|
|
}
|
|
bVar.a = b2;
|
|
return i2;
|
|
}
|
|
|
|
public static int d(byte[] bArr, int i, b bVar) {
|
|
int i2 = i + 1;
|
|
long j = bArr[i];
|
|
if (j >= 0) {
|
|
bVar.b = j;
|
|
return i2;
|
|
}
|
|
int i3 = i + 2;
|
|
byte b2 = bArr[i2];
|
|
long j2 = (j & 127) | ((b2 & Byte.MAX_VALUE) << 7);
|
|
int i4 = 7;
|
|
while (b2 < 0) {
|
|
int i5 = i3 + 1;
|
|
i4 += 7;
|
|
j2 |= (r10 & Byte.MAX_VALUE) << i4;
|
|
b2 = bArr[i3];
|
|
i3 = i5;
|
|
}
|
|
bVar.b = j2;
|
|
return i3;
|
|
}
|
|
|
|
public static int b(byte[] bArr, int i, b bVar) throws z {
|
|
int c = c(bArr, i, bVar);
|
|
int i2 = bVar.a;
|
|
if (i2 < 0) {
|
|
throw z.f();
|
|
}
|
|
if (i2 == 0) {
|
|
bVar.c = "";
|
|
return c;
|
|
}
|
|
bVar.c = new String(bArr, c, i2, y.a);
|
|
return c + i2;
|
|
}
|
|
|
|
public static int b(int i, byte[] bArr, int i2, int i3, y.j<?> jVar, b bVar) throws z {
|
|
int c = c(bArr, i2, bVar);
|
|
int i4 = bVar.a;
|
|
if (i4 < 0) {
|
|
throw z.f();
|
|
}
|
|
if (i4 == 0) {
|
|
jVar.add("");
|
|
} else {
|
|
int i5 = c + i4;
|
|
if (q1.a.b(bArr, c, i5)) {
|
|
jVar.add(new String(bArr, c, i4, y.a));
|
|
c = i5;
|
|
} else {
|
|
throw z.c();
|
|
}
|
|
}
|
|
while (c < i3) {
|
|
int c2 = c(bArr, c, bVar);
|
|
if (i != bVar.a) {
|
|
break;
|
|
}
|
|
c = c(bArr, c2, bVar);
|
|
int i6 = bVar.a;
|
|
if (i6 < 0) {
|
|
throw z.f();
|
|
}
|
|
if (i6 == 0) {
|
|
jVar.add("");
|
|
} else {
|
|
int i7 = c + i6;
|
|
if (q1.a.b(bArr, c, i7)) {
|
|
jVar.add(new String(bArr, c, i6, y.a));
|
|
c = i7;
|
|
} else {
|
|
throw z.c();
|
|
}
|
|
}
|
|
}
|
|
return c;
|
|
}
|
|
|
|
public static int a(byte[] bArr, int i) {
|
|
return ((bArr[i + 3] & 255) << 24) | (bArr[i] & 255) | ((bArr[i + 1] & 255) << 8) | ((bArr[i + 2] & 255) << 16);
|
|
}
|
|
|
|
public static int a(byte[] bArr, int i, b bVar) throws z {
|
|
int c = c(bArr, i, bVar);
|
|
int i2 = bVar.a;
|
|
if (i2 >= 0) {
|
|
if (i2 > bArr.length - c) {
|
|
throw z.i();
|
|
}
|
|
if (i2 == 0) {
|
|
bVar.c = i.b;
|
|
return c;
|
|
}
|
|
bVar.c = i.a(bArr, c, i2);
|
|
return c + i2;
|
|
}
|
|
throw z.f();
|
|
}
|
|
|
|
public static int a(d1 d1Var, byte[] bArr, int i, int i2, b bVar) throws IOException {
|
|
int i3 = i + 1;
|
|
int i4 = bArr[i];
|
|
if (i4 < 0) {
|
|
i3 = a(i4, bArr, i3, bVar);
|
|
i4 = bVar.a;
|
|
}
|
|
int i5 = i3;
|
|
if (i4 >= 0 && i4 <= i2 - i5) {
|
|
Object a2 = d1Var.a();
|
|
int i6 = i4 + i5;
|
|
d1Var.a(a2, bArr, i5, i6, bVar);
|
|
d1Var.a(a2);
|
|
bVar.c = a2;
|
|
return i6;
|
|
}
|
|
throw z.i();
|
|
}
|
|
|
|
public static int a(d1 d1Var, byte[] bArr, int i, int i2, int i3, b bVar) throws IOException {
|
|
r0 r0Var = (r0) d1Var;
|
|
Object a2 = r0Var.a();
|
|
int a3 = r0Var.a((r0) a2, bArr, i, i2, i3, bVar);
|
|
r0Var.a((r0) a2);
|
|
bVar.c = a2;
|
|
return a3;
|
|
}
|
|
|
|
public static int a(byte[] bArr, int i, y.j<?> jVar, b bVar) throws IOException {
|
|
x xVar = (x) jVar;
|
|
int c = c(bArr, i, bVar);
|
|
int i2 = bVar.a + c;
|
|
while (c < i2) {
|
|
c = c(bArr, c, bVar);
|
|
xVar.c(bVar.a);
|
|
}
|
|
if (c == i2) {
|
|
return c;
|
|
}
|
|
throw z.i();
|
|
}
|
|
|
|
public static int a(int i, byte[] bArr, int i2, int i3, y.j<?> jVar, b bVar) throws z {
|
|
int c = c(bArr, i2, bVar);
|
|
int i4 = bVar.a;
|
|
if (i4 < 0) {
|
|
throw z.f();
|
|
}
|
|
if (i4 == 0) {
|
|
jVar.add("");
|
|
} else {
|
|
jVar.add(new String(bArr, c, i4, y.a));
|
|
c += i4;
|
|
}
|
|
while (c < i3) {
|
|
int c2 = c(bArr, c, bVar);
|
|
if (i != bVar.a) {
|
|
break;
|
|
}
|
|
c = c(bArr, c2, bVar);
|
|
int i5 = bVar.a;
|
|
if (i5 < 0) {
|
|
throw z.f();
|
|
}
|
|
if (i5 == 0) {
|
|
jVar.add("");
|
|
} else {
|
|
jVar.add(new String(bArr, c, i5, y.a));
|
|
c += i5;
|
|
}
|
|
}
|
|
return c;
|
|
}
|
|
|
|
/* JADX WARN: Can't fix incorrect switch cases order, some code will duplicate */
|
|
public static int a(int i, byte[] bArr, int i2, int i3, GeneratedMessageLite.ExtendableMessage<?, ?> extendableMessage, GeneratedMessageLite.e<?, ?> eVar, k1<l1, l1> k1Var, b bVar) throws IOException {
|
|
Object a2;
|
|
u<GeneratedMessageLite.d> uVar = extendableMessage.extensions;
|
|
int i4 = i >>> 3;
|
|
GeneratedMessageLite.d dVar = eVar.d;
|
|
if (dVar.d && dVar.e) {
|
|
switch (a.a[dVar.c.ordinal()]) {
|
|
case 1:
|
|
n nVar = new n();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i5 = bVar.a + i2;
|
|
while (i2 < i5) {
|
|
nVar.a(Double.longBitsToDouble(b(bArr, i2)));
|
|
i2 += 8;
|
|
}
|
|
if (i2 == i5) {
|
|
uVar.b(eVar.d, nVar);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 2:
|
|
v vVar = new v();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i6 = bVar.a + i2;
|
|
while (i2 < i6) {
|
|
vVar.a(Float.intBitsToFloat(a(bArr, i2)));
|
|
i2 += 4;
|
|
}
|
|
if (i2 == i6) {
|
|
uVar.b(eVar.d, vVar);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 3:
|
|
case 4:
|
|
f0 f0Var = new f0();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i7 = bVar.a + i2;
|
|
while (i2 < i7) {
|
|
i2 = d(bArr, i2, bVar);
|
|
f0Var.a(bVar.b);
|
|
}
|
|
if (i2 == i7) {
|
|
uVar.b(eVar.d, f0Var);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 5:
|
|
case 6:
|
|
x xVar = new x();
|
|
int a3 = a(bArr, i2, xVar, bVar);
|
|
uVar.b(eVar.d, xVar);
|
|
return a3;
|
|
case 7:
|
|
case 8:
|
|
f0 f0Var2 = new f0();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i8 = bVar.a + i2;
|
|
while (i2 < i8) {
|
|
f0Var2.a(b(bArr, i2));
|
|
i2 += 8;
|
|
}
|
|
if (i2 == i8) {
|
|
uVar.b(eVar.d, f0Var2);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 9:
|
|
case 10:
|
|
x xVar2 = new x();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i9 = bVar.a + i2;
|
|
while (i2 < i9) {
|
|
xVar2.c(a(bArr, i2));
|
|
i2 += 4;
|
|
}
|
|
if (i2 == i9) {
|
|
uVar.b(eVar.d, xVar2);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 11:
|
|
g gVar = new g();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i10 = bVar.a + i2;
|
|
while (i2 < i10) {
|
|
i2 = d(bArr, i2, bVar);
|
|
gVar.a(bVar.b != 0);
|
|
}
|
|
if (i2 == i10) {
|
|
uVar.b(eVar.d, gVar);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 12:
|
|
x xVar3 = new x();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i11 = bVar.a + i2;
|
|
while (i2 < i11) {
|
|
i2 = c(bArr, i2, bVar);
|
|
xVar3.c(j.b(bVar.a));
|
|
}
|
|
if (i2 == i11) {
|
|
uVar.b(eVar.d, xVar3);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 13:
|
|
f0 f0Var3 = new f0();
|
|
i2 = c(bArr, i2, bVar);
|
|
int i12 = bVar.a + i2;
|
|
while (i2 < i12) {
|
|
i2 = d(bArr, i2, bVar);
|
|
f0Var3.a(j.a(bVar.b));
|
|
}
|
|
if (i2 == i12) {
|
|
uVar.b(eVar.d, f0Var3);
|
|
break;
|
|
} else {
|
|
throw z.i();
|
|
}
|
|
case 14:
|
|
x xVar4 = new x();
|
|
int a4 = a(bArr, i2, xVar4, bVar);
|
|
l1 l1Var = extendableMessage.unknownFields;
|
|
l1 l1Var2 = (l1) e1.a(i4, xVar4, eVar.d.a, l1Var != l1.f ? l1Var : null, k1Var);
|
|
if (l1Var2 != null) {
|
|
extendableMessage.unknownFields = l1Var2;
|
|
}
|
|
uVar.b(eVar.d, xVar4);
|
|
return a4;
|
|
default:
|
|
throw new IllegalStateException("Type cannot be packed: " + eVar.d.c);
|
|
}
|
|
} else {
|
|
r1.b bVar2 = dVar.c;
|
|
if (bVar2 == r1.b.ENUM) {
|
|
i2 = c(bArr, i2, bVar);
|
|
if (eVar.d.a.a(bVar.a) == null) {
|
|
l1 l1Var3 = extendableMessage.unknownFields;
|
|
if (l1Var3 == l1.f) {
|
|
l1Var3 = new l1();
|
|
extendableMessage.unknownFields = l1Var3;
|
|
}
|
|
int i13 = bVar.a;
|
|
Class<?> cls = e1.a;
|
|
if (l1Var3 == null) {
|
|
l1Var3 = k1Var.a();
|
|
}
|
|
k1Var.b(i4, i13, l1Var3);
|
|
return i2;
|
|
}
|
|
r7 = Integer.valueOf(bVar.a);
|
|
} else {
|
|
switch (a.a[bVar2.ordinal()]) {
|
|
case 1:
|
|
r7 = Double.valueOf(Double.longBitsToDouble(b(bArr, i2)));
|
|
i2 += 8;
|
|
break;
|
|
case 2:
|
|
r7 = Float.valueOf(Float.intBitsToFloat(a(bArr, i2)));
|
|
i2 += 4;
|
|
break;
|
|
case 3:
|
|
case 4:
|
|
i2 = d(bArr, i2, bVar);
|
|
r7 = Long.valueOf(bVar.b);
|
|
break;
|
|
case 5:
|
|
case 6:
|
|
i2 = c(bArr, i2, bVar);
|
|
r7 = Integer.valueOf(bVar.a);
|
|
break;
|
|
case 7:
|
|
case 8:
|
|
r7 = Long.valueOf(b(bArr, i2));
|
|
i2 += 8;
|
|
break;
|
|
case 9:
|
|
case 10:
|
|
r7 = Integer.valueOf(a(bArr, i2));
|
|
i2 += 4;
|
|
break;
|
|
case 11:
|
|
i2 = d(bArr, i2, bVar);
|
|
r7 = Boolean.valueOf(bVar.b != 0);
|
|
break;
|
|
case 12:
|
|
i2 = c(bArr, i2, bVar);
|
|
r7 = Integer.valueOf(j.b(bVar.a));
|
|
break;
|
|
case 13:
|
|
i2 = d(bArr, i2, bVar);
|
|
r7 = Long.valueOf(j.a(bVar.b));
|
|
break;
|
|
case 14:
|
|
throw new IllegalStateException("Shouldn't reach here.");
|
|
case 15:
|
|
i2 = a(bArr, i2, bVar);
|
|
r7 = bVar.c;
|
|
break;
|
|
case 16:
|
|
i2 = b(bArr, i2, bVar);
|
|
r7 = bVar.c;
|
|
break;
|
|
case 17:
|
|
i2 = a(z0.c.a(eVar.c.getClass()), bArr, i2, i3, (i4 << 3) | 4, bVar);
|
|
r7 = bVar.c;
|
|
break;
|
|
case 18:
|
|
i2 = a(z0.c.a(eVar.c.getClass()), bArr, i2, i3, bVar);
|
|
r7 = bVar.c;
|
|
break;
|
|
}
|
|
}
|
|
GeneratedMessageLite.d dVar2 = eVar.d;
|
|
if (dVar2.d) {
|
|
uVar.a(dVar2, r7);
|
|
} else {
|
|
int i14 = a.a[dVar2.c.ordinal()];
|
|
if ((i14 == 17 || i14 == 18) && (a2 = uVar.a((u<GeneratedMessageLite.d>) eVar.d)) != null) {
|
|
r7 = y.a(a2, r7);
|
|
}
|
|
uVar.b(eVar.d, r7);
|
|
}
|
|
}
|
|
return i2;
|
|
}
|
|
|
|
public static int a(int i, byte[] bArr, int i2, int i3, l1 l1Var, b bVar) throws z {
|
|
int i4 = r1.a;
|
|
if ((i >>> 3) == 0) {
|
|
throw z.b();
|
|
}
|
|
int i5 = i & 7;
|
|
if (i5 == 0) {
|
|
int d = d(bArr, i2, bVar);
|
|
l1Var.a(i, Long.valueOf(bVar.b));
|
|
return d;
|
|
}
|
|
if (i5 == 1) {
|
|
l1Var.a(i, Long.valueOf(b(bArr, i2)));
|
|
return i2 + 8;
|
|
}
|
|
if (i5 == 2) {
|
|
int c = c(bArr, i2, bVar);
|
|
int i6 = bVar.a;
|
|
if (i6 >= 0) {
|
|
if (i6 > bArr.length - c) {
|
|
throw z.i();
|
|
}
|
|
if (i6 == 0) {
|
|
l1Var.a(i, i.b);
|
|
} else {
|
|
l1Var.a(i, i.a(bArr, c, i6));
|
|
}
|
|
return c + i6;
|
|
}
|
|
throw z.f();
|
|
}
|
|
if (i5 != 3) {
|
|
if (i5 != 5) {
|
|
throw z.b();
|
|
}
|
|
l1Var.a(i, Integer.valueOf(a(bArr, i2)));
|
|
return i2 + 4;
|
|
}
|
|
l1 l1Var2 = new l1();
|
|
int i7 = (i & (-8)) | 4;
|
|
int i8 = 0;
|
|
while (true) {
|
|
if (i2 >= i3) {
|
|
break;
|
|
}
|
|
int c2 = c(bArr, i2, bVar);
|
|
int i9 = bVar.a;
|
|
if (i9 == i7) {
|
|
i8 = i9;
|
|
i2 = c2;
|
|
break;
|
|
}
|
|
i8 = i9;
|
|
i2 = a(i9, bArr, c2, i3, l1Var2, bVar);
|
|
}
|
|
if (i2 <= i3 && i8 == i7) {
|
|
l1Var.a(i, l1Var2);
|
|
return i2;
|
|
}
|
|
throw z.g();
|
|
}
|
|
|
|
public static int a(int i, byte[] bArr, int i2, int i3, b bVar) throws z {
|
|
int i4 = r1.a;
|
|
if ((i >>> 3) == 0) {
|
|
throw z.b();
|
|
}
|
|
int i5 = i & 7;
|
|
if (i5 == 0) {
|
|
return d(bArr, i2, bVar);
|
|
}
|
|
if (i5 == 1) {
|
|
return i2 + 8;
|
|
}
|
|
if (i5 == 2) {
|
|
return c(bArr, i2, bVar) + bVar.a;
|
|
}
|
|
if (i5 != 3) {
|
|
if (i5 == 5) {
|
|
return i2 + 4;
|
|
}
|
|
throw z.b();
|
|
}
|
|
int i6 = (i & (-8)) | 4;
|
|
int i7 = 0;
|
|
while (i2 < i3) {
|
|
i2 = c(bArr, i2, bVar);
|
|
i7 = bVar.a;
|
|
if (i7 == i6) {
|
|
break;
|
|
}
|
|
i2 = a(i7, bArr, i2, i3, bVar);
|
|
}
|
|
if (i2 > i3 || i7 != i6) {
|
|
throw z.g();
|
|
}
|
|
return i2;
|
|
}
|
|
}
|