115 lines
3.2 KiB
Java
115 lines
3.2 KiB
Java
package c.i.a.c.v1;
|
|
|
|
import c.i.a.c.i2.v;
|
|
import c.i.a.c.i2.w;
|
|
/* compiled from: Ac4Util */
|
|
public final class m {
|
|
public static final int[] a = {2002, 2000, 1920, 1601, 1600, 1001, 1000, 960, 800, 800, 480, 400, 400, 2048};
|
|
|
|
/* compiled from: Ac4Util */
|
|
public static final class b {
|
|
public final int a;
|
|
public final int b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public final int f993c;
|
|
|
|
public b(int i, int i2, int i3, int i4, int i5, a aVar) {
|
|
this.a = i3;
|
|
this.b = i4;
|
|
this.f993c = i5;
|
|
}
|
|
}
|
|
|
|
public static void a(int i, w wVar) {
|
|
wVar.z(7);
|
|
byte[] bArr = wVar.a;
|
|
bArr[0] = -84;
|
|
bArr[1] = 64;
|
|
bArr[2] = -1;
|
|
bArr[3] = -1;
|
|
bArr[4] = (byte) ((i >> 16) & 255);
|
|
bArr[5] = (byte) ((i >> 8) & 255);
|
|
bArr[6] = (byte) (i & 255);
|
|
}
|
|
|
|
/* JADX WARNING: Code restructure failed: missing block: B:39:0x0093, code lost:
|
|
if (r10 != 11) goto L_0x00a0;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:41:0x0098, code lost:
|
|
if (r10 != 11) goto L_0x00a0;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:43:0x009d, code lost:
|
|
if (r10 != 8) goto L_0x00a0;
|
|
*/
|
|
public static b b(v vVar) {
|
|
int i;
|
|
int i2;
|
|
int g;
|
|
int g2 = vVar.g(16);
|
|
int g3 = vVar.g(16);
|
|
if (g3 == 65535) {
|
|
g3 = vVar.g(24);
|
|
i = 7;
|
|
} else {
|
|
i = 4;
|
|
}
|
|
int i3 = g3 + i;
|
|
if (g2 == 44097) {
|
|
i3 += 2;
|
|
}
|
|
int g4 = vVar.g(2);
|
|
if (g4 == 3) {
|
|
int i4 = 0;
|
|
while (true) {
|
|
g = vVar.g(2) + i4;
|
|
if (!vVar.f()) {
|
|
break;
|
|
}
|
|
i4 = (g + 1) << 2;
|
|
}
|
|
g4 += g;
|
|
}
|
|
int g5 = vVar.g(10);
|
|
if (vVar.f() && vVar.g(3) > 0) {
|
|
vVar.m(2);
|
|
}
|
|
int i5 = vVar.f() ? 48000 : 44100;
|
|
int g6 = vVar.g(4);
|
|
if (i5 == 44100 && g6 == 13) {
|
|
i2 = a[g6];
|
|
} else {
|
|
if (i5 == 48000) {
|
|
int[] iArr = a;
|
|
if (g6 < iArr.length) {
|
|
int i6 = iArr[g6];
|
|
int i7 = g5 % 5;
|
|
if (i7 != 1) {
|
|
if (i7 == 2) {
|
|
if (g6 != 8) {
|
|
}
|
|
i6++;
|
|
i2 = i6;
|
|
} else if (i7 != 3) {
|
|
if (i7 == 4) {
|
|
if (g6 != 3) {
|
|
if (g6 != 8) {
|
|
}
|
|
}
|
|
i6++;
|
|
}
|
|
i2 = i6;
|
|
}
|
|
}
|
|
if (g6 != 3) {
|
|
}
|
|
i6++;
|
|
i2 = i6;
|
|
}
|
|
}
|
|
i2 = 0;
|
|
}
|
|
return new b(g4, 2, i5, i3, i2, null);
|
|
}
|
|
}
|