119 lines
3.2 KiB
Java
119 lines
3.2 KiB
Java
package c.i.a.c.a2;
|
|
|
|
import c.i.a.c.i2.f0;
|
|
import c.i.a.c.i2.w;
|
|
/* compiled from: FlacFrameReader */
|
|
public final class m {
|
|
|
|
/* compiled from: FlacFrameReader */
|
|
public static final class a {
|
|
public long a;
|
|
}
|
|
|
|
public static boolean a(w wVar, o oVar, boolean z2, a aVar) {
|
|
try {
|
|
long y2 = wVar.y();
|
|
if (!z2) {
|
|
y2 *= (long) oVar.b;
|
|
}
|
|
aVar.a = y2;
|
|
return true;
|
|
} catch (NumberFormatException unused) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* JADX WARNING: Code restructure failed: missing block: B:43:0x008e, code lost:
|
|
if (r7 == r18.f) goto L_0x00ac;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:47:0x009b, code lost:
|
|
if ((r17.s() * 1000) == r3) goto L_0x00ac;
|
|
*/
|
|
/* JADX WARNING: Code restructure failed: missing block: B:53:0x00aa, code lost:
|
|
if (r4 == r3) goto L_0x00ac;
|
|
*/
|
|
/* JADX WARNING: Removed duplicated region for block: B:57:0x00b1 */
|
|
/* JADX WARNING: Removed duplicated region for block: B:71:? A[RETURN, SYNTHETIC] */
|
|
public static boolean b(w wVar, o oVar, int i, a aVar) {
|
|
boolean z2;
|
|
long t = wVar.t();
|
|
long j = t >>> 16;
|
|
if (j != ((long) i)) {
|
|
return false;
|
|
}
|
|
boolean z3 = (j & 1) == 1;
|
|
int i2 = (int) ((t >> 12) & 15);
|
|
int i3 = (int) ((t >> 8) & 15);
|
|
int i4 = (int) (15 & (t >> 4));
|
|
int i5 = (int) ((t >> 1) & 7);
|
|
boolean z4 = (t & 1) == 1;
|
|
if (!(i4 > 7 ? !(i4 > 10 || oVar.g != 2) : i4 == oVar.g - 1)) {
|
|
return false;
|
|
}
|
|
if (!(i5 == 0 || i5 == oVar.i) || z4 || !a(wVar, oVar, z3, aVar)) {
|
|
return false;
|
|
}
|
|
int c2 = c(wVar, i2);
|
|
if (!(c2 != -1 && c2 <= oVar.b)) {
|
|
return false;
|
|
}
|
|
int i6 = oVar.e;
|
|
if (i3 != 0) {
|
|
if (i3 > 11) {
|
|
if (i3 != 12) {
|
|
if (i3 <= 14) {
|
|
int x2 = wVar.x();
|
|
if (i3 == 14) {
|
|
x2 *= 10;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
z2 = false;
|
|
if (z2) {
|
|
return false;
|
|
}
|
|
int s2 = wVar.s();
|
|
int i7 = wVar.b;
|
|
byte[] bArr = wVar.a;
|
|
int i8 = i7 - 1;
|
|
int i9 = f0.a;
|
|
int i10 = 0;
|
|
for (int i11 = wVar.b; i11 < i8; i11++) {
|
|
i10 = f0.l[i10 ^ (bArr[i11] & 255)];
|
|
}
|
|
return s2 == i10;
|
|
}
|
|
z2 = true;
|
|
if (z2) {
|
|
}
|
|
}
|
|
|
|
public static int c(w wVar, int i) {
|
|
switch (i) {
|
|
case 1:
|
|
return 192;
|
|
case 2:
|
|
case 3:
|
|
case 4:
|
|
case 5:
|
|
return 576 << (i - 2);
|
|
case 6:
|
|
return wVar.s() + 1;
|
|
case 7:
|
|
return wVar.x() + 1;
|
|
case 8:
|
|
case 9:
|
|
case 10:
|
|
case 11:
|
|
case 12:
|
|
case 13:
|
|
case 14:
|
|
case 15:
|
|
return 256 << (i - 8);
|
|
default:
|
|
return -1;
|
|
}
|
|
}
|
|
}
|