167 lines
5.6 KiB
Java
167 lines
5.6 KiB
Java
package com.google.common.math;
|
|
|
|
import java.math.RoundingMode;
|
|
|
|
/* loaded from: classes.dex */
|
|
public final class LongMath {
|
|
|
|
/* renamed from: com.google.common.math.LongMath$1, reason: invalid class name */
|
|
static /* synthetic */ class AnonymousClass1 {
|
|
static final /* synthetic */ int[] a = new int[RoundingMode.values().length];
|
|
|
|
static {
|
|
try {
|
|
a[RoundingMode.UNNECESSARY.ordinal()] = 1;
|
|
} catch (NoSuchFieldError unused) {
|
|
}
|
|
try {
|
|
a[RoundingMode.DOWN.ordinal()] = 2;
|
|
} catch (NoSuchFieldError unused2) {
|
|
}
|
|
try {
|
|
a[RoundingMode.FLOOR.ordinal()] = 3;
|
|
} catch (NoSuchFieldError unused3) {
|
|
}
|
|
try {
|
|
a[RoundingMode.UP.ordinal()] = 4;
|
|
} catch (NoSuchFieldError unused4) {
|
|
}
|
|
try {
|
|
a[RoundingMode.CEILING.ordinal()] = 5;
|
|
} catch (NoSuchFieldError unused5) {
|
|
}
|
|
try {
|
|
a[RoundingMode.HALF_DOWN.ordinal()] = 6;
|
|
} catch (NoSuchFieldError unused6) {
|
|
}
|
|
try {
|
|
a[RoundingMode.HALF_UP.ordinal()] = 7;
|
|
} catch (NoSuchFieldError unused7) {
|
|
}
|
|
try {
|
|
a[RoundingMode.HALF_EVEN.ordinal()] = 8;
|
|
} catch (NoSuchFieldError unused8) {
|
|
}
|
|
}
|
|
}
|
|
|
|
static {
|
|
long[][] jArr = {new long[]{291830, 126401071349994536L}, new long[]{885594168, 725270293939359937L, 3569819667048198375L}, new long[]{273919523040L, 15, 7363882082L, 992620450144556L}, new long[]{47636622961200L, 2, 2570940, 211991001, 3749873356L}, new long[]{7999252175582850L, 2, 4130806001517L, 149795463772692060L, 186635894390467037L, 3967304179347715805L}, new long[]{585226005592931976L, 2, 123635709730000L, 9233062284813009L, 43835965440333360L, 761179012939631437L, 1263739024124850375L}, new long[]{Long.MAX_VALUE, 2, 325, 9375, 28178, 450775, 9780504, 1795265022}};
|
|
}
|
|
|
|
/* JADX WARN: Can't fix incorrect switch cases order, some code will duplicate */
|
|
/* JADX WARN: Code restructure failed: missing block: B:23:0x0051, code lost:
|
|
|
|
if (r2 > 0) goto L35;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:24:0x0054, code lost:
|
|
|
|
if (r10 > 0) goto L35;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:25:0x0057, code lost:
|
|
|
|
if (r10 < 0) goto L35;
|
|
*/
|
|
/* JADX WARN: Removed duplicated region for block: B:31:0x0064 */
|
|
/* JADX WARN: Removed duplicated region for block: B:33:? A[RETURN, SYNTHETIC] */
|
|
/*
|
|
Code decompiled incorrectly, please refer to instructions dump.
|
|
To view partially-correct code enable 'Show inconsistent code' option in preferences
|
|
*/
|
|
public static long a(long r9, long r11, java.math.RoundingMode r13) {
|
|
/*
|
|
com.google.common.base.Preconditions.a(r13)
|
|
long r0 = r9 / r11
|
|
long r2 = r11 * r0
|
|
long r2 = r9 - r2
|
|
r4 = 0
|
|
int r6 = (r2 > r4 ? 1 : (r2 == r4 ? 0 : -1))
|
|
if (r6 != 0) goto L10
|
|
return r0
|
|
L10:
|
|
long r9 = r9 ^ r11
|
|
r7 = 63
|
|
long r9 = r9 >> r7
|
|
int r10 = (int) r9
|
|
r9 = 1
|
|
r10 = r10 | r9
|
|
int[] r7 = com.google.common.math.LongMath.AnonymousClass1.a
|
|
int r8 = r13.ordinal()
|
|
r7 = r7[r8]
|
|
r8 = 0
|
|
switch(r7) {
|
|
case 1: goto L5a;
|
|
case 2: goto L61;
|
|
case 3: goto L57;
|
|
case 4: goto L62;
|
|
case 5: goto L54;
|
|
case 6: goto L29;
|
|
case 7: goto L29;
|
|
case 8: goto L29;
|
|
default: goto L23;
|
|
}
|
|
L23:
|
|
java.lang.AssertionError r9 = new java.lang.AssertionError
|
|
r9.<init>()
|
|
throw r9
|
|
L29:
|
|
long r2 = java.lang.Math.abs(r2)
|
|
long r11 = java.lang.Math.abs(r11)
|
|
long r11 = r11 - r2
|
|
long r2 = r2 - r11
|
|
int r11 = (r2 > r4 ? 1 : (r2 == r4 ? 0 : -1))
|
|
if (r11 != 0) goto L51
|
|
java.math.RoundingMode r11 = java.math.RoundingMode.HALF_UP
|
|
if (r13 != r11) goto L3d
|
|
r11 = 1
|
|
goto L3e
|
|
L3d:
|
|
r11 = 0
|
|
L3e:
|
|
java.math.RoundingMode r12 = java.math.RoundingMode.HALF_EVEN
|
|
if (r13 != r12) goto L44
|
|
r12 = 1
|
|
goto L45
|
|
L44:
|
|
r12 = 0
|
|
L45:
|
|
r2 = 1
|
|
long r2 = r2 & r0
|
|
int r13 = (r2 > r4 ? 1 : (r2 == r4 ? 0 : -1))
|
|
if (r13 == 0) goto L4d
|
|
goto L4e
|
|
L4d:
|
|
r9 = 0
|
|
L4e:
|
|
r9 = r9 & r12
|
|
r9 = r9 | r11
|
|
goto L62
|
|
L51:
|
|
if (r11 <= 0) goto L61
|
|
goto L62
|
|
L54:
|
|
if (r10 <= 0) goto L61
|
|
goto L62
|
|
L57:
|
|
if (r10 >= 0) goto L61
|
|
goto L62
|
|
L5a:
|
|
if (r6 != 0) goto L5d
|
|
goto L5e
|
|
L5d:
|
|
r9 = 0
|
|
L5e:
|
|
com.google.common.math.MathPreconditions.c(r9)
|
|
L61:
|
|
r9 = 0
|
|
L62:
|
|
if (r9 == 0) goto L66
|
|
long r9 = (long) r10
|
|
long r0 = r0 + r9
|
|
L66:
|
|
return r0
|
|
*/
|
|
throw new UnsupportedOperationException("Method not decompiled: com.google.common.math.LongMath.a(long, long, java.math.RoundingMode):long");
|
|
}
|
|
}
|