package com.google.android.gms.internal.fido;

import java.math.RoundingMode;

/* JADX INFO: loaded from: classes3.dex */
public final class zzcj {
    public static int zza(int i6, int i7, RoundingMode roundingMode) {
        roundingMode.getClass();
        if (i7 == 0) {
            throw new ArithmeticException("/ by zero");
        }
        int i8 = i6 / i7;
        int i9 = i6 - (i7 * i8);
        if (i9 == 0) {
            return i8;
        }
        int i10 = ((i6 ^ i7) >> 31) | 1;
        switch (zzci.zza[roundingMode.ordinal()]) {
            case 1:
                zzck.zza(false);
                return i8;
            case 2:
                return i8;
            case 3:
                if (i10 >= 0) {
                    return i8;
                }
                break;
            case 4:
                break;
            case 5:
                if (i10 <= 0) {
                    return i8;
                }
                break;
            case 6:
            case 7:
            case 8:
                int iAbs = Math.abs(i9);
                int iAbs2 = iAbs - (Math.abs(i7) - iAbs);
                if (iAbs2 == 0) {
                    if (roundingMode != RoundingMode.HALF_UP) {
                        if ((i8 & 1 & (roundingMode != RoundingMode.HALF_EVEN ? 0 : 1)) == 0) {
                            return i8;
                        }
                    }
                } else if (iAbs2 <= 0) {
                    return i8;
                }
            default:
                throw new AssertionError();
        }
        return i8 + i10;
    }

    public static int zzb(int i6, RoundingMode roundingMode) {
        if (i6 <= 0) {
            throw new IllegalArgumentException("x (0) must be > 0");
        }
        switch (zzci.zza[roundingMode.ordinal()]) {
            case 1:
                zzck.zza(((i6 + (-1)) & i6) == 0);
                break;
            case 2:
            case 3:
                break;
            case 4:
            case 5:
                return 32 - Integer.numberOfLeadingZeros(i6 - 1);
            case 6:
            case 7:
            case 8:
                int iNumberOfLeadingZeros = Integer.numberOfLeadingZeros(i6);
                return (31 - iNumberOfLeadingZeros) + ((((-1257966797) >>> iNumberOfLeadingZeros) - i6) >>> 31);
            default:
                throw new AssertionError();
        }
        return 31 - Integer.numberOfLeadingZeros(i6);
    }
}