package o;

import com.google.zxing.ChecksumException;
import com.google.zxing.FormatException;
import com.google.zxing.NotFoundException;
import com.prolificinteractive.materialcalendarview.TitleChanger;
import java.util.Arrays;
import java.util.Map;
import org.bouncycastle.crypto.tls.CipherSuite;

/* renamed from: o.krh, reason: case insensitive filesystem */
/* loaded from: classes2.dex */
public final class C16068krh extends xue {
    static final int[] e = {52, 289, 97, 352, 49, 304, 112, 37, 292, 100, 265, 73, 328, 25, 280, 88, 13, 268, 76, 28, 259, 67, 322, 19, 274, 82, 7, 262, 70, 22, 385, CipherSuite.TLS_DH_DSS_WITH_CAMELLIA_256_CBC_SHA256, 448, CipherSuite.TLS_DHE_PSK_WITH_AES_256_CBC_SHA, TitleChanger.DEFAULT_ANIMATION_DELAY, 208, 133, 388, CipherSuite.TLS_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA256, CipherSuite.TLS_PSK_WITH_AES_128_GCM_SHA256, CipherSuite.TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, CipherSuite.TLS_PSK_WITH_RC4_128_SHA, 42};
    private final int[] a;
    private final boolean b;
    private final StringBuilder c;
    private final boolean d;

    public C16068krh() {
        this(false);
    }

    public C16068krh(boolean z) {
        this(z, (byte) 0);
    }

    private C16068krh(boolean z, byte b) {
        this.b = z;
        this.d = false;
        this.c = new StringBuilder(20);
        this.a = new int[9];
    }

    @Override // o.xue
    public final WFF d(int i, C17416wdP c17416wdP, Map<CGg, ?> map) throws NotFoundException, ChecksumException, FormatException {
        char c;
        int[] iArr = this.a;
        Arrays.fill(iArr, 0);
        StringBuilder sb = this.c;
        sb.setLength(0);
        int i2 = c17416wdP.d;
        int a = c17416wdP.a(0);
        int length = iArr.length;
        boolean z = false;
        int i3 = 0;
        int i4 = a;
        while (a < i2) {
            if (((c17416wdP.a[a / 32] & (1 << (a & 31))) != 0) != z) {
                iArr[i3] = iArr[i3] + 1;
            } else {
                if (i3 != length - 1) {
                    i3++;
                } else if (b(iArr) == 148 && c17416wdP.d(Math.max(0, i4 - ((a - i4) / 2)), i4)) {
                    int a2 = c17416wdP.a(new int[]{i4, a}[1]);
                    int i5 = c17416wdP.d;
                    while (true) {
                        b(c17416wdP, a2, iArr);
                        int b = b(iArr);
                        if (b < 0) {
                            throw NotFoundException.b();
                        }
                        int i6 = 0;
                        while (true) {
                            int[] iArr2 = e;
                            if (i6 < iArr2.length) {
                                if (iArr2[i6] == b) {
                                    c = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%".charAt(i6);
                                    break;
                                }
                                i6++;
                            } else {
                                if (b != 148) {
                                    throw NotFoundException.b();
                                }
                                c = '*';
                            }
                        }
                        sb.append(c);
                        int i7 = a2;
                        for (int i8 : iArr) {
                            i7 += i8;
                        }
                        int a3 = c17416wdP.a(i7);
                        if (c == '*') {
                            sb.setLength(sb.length() - 1);
                            int i9 = 0;
                            for (int i10 : iArr) {
                                i9 += i10;
                            }
                            if (a3 != i5 && (((a3 - a2) - i9) << 1) < i9) {
                                throw NotFoundException.b();
                            }
                            if (this.b) {
                                int length2 = sb.length() - 1;
                                int i11 = 0;
                                for (int i12 = 0; i12 < length2; i12++) {
                                    i11 += "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%".indexOf(this.c.charAt(i12));
                                }
                                if (sb.charAt(length2) != "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%".charAt(i11 % 43)) {
                                    throw ChecksumException.e();
                                }
                                sb.setLength(length2);
                            }
                            if (sb.length() == 0) {
                                throw NotFoundException.b();
                            }
                            float f = i;
                            WFF wff = new WFF(sb.toString(), null, new qCz[]{new qCz((r5[1] + r5[0]) / 2.0f, f), new qCz(a2 + (i9 / 2.0f), f)}, PTS.CODE_39);
                            wff.b(MoF.SYMBOLOGY_IDENTIFIER, "]A0");
                            return wff;
                        }
                        a2 = a3;
                    }
                } else {
                    i4 += iArr[0] + iArr[1];
                    int i13 = i3 - 1;
                    System.arraycopy(iArr, 2, iArr, 0, i13);
                    iArr[i13] = 0;
                    iArr[i3] = 0;
                    i3--;
                }
                iArr[i3] = 1;
                z = !z;
            }
            a++;
        }
        throw NotFoundException.b();
    }

    private static int b(int[] iArr) {
        int length = iArr.length;
        int i = 0;
        while (true) {
            int i2 = Integer.MAX_VALUE;
            for (int i3 : iArr) {
                if (i3 < i2 && i3 > i) {
                    i2 = i3;
                }
            }
            int i4 = 0;
            int i5 = 0;
            int i6 = 0;
            for (int i7 = 0; i7 < length; i7++) {
                int i8 = iArr[i7];
                if (i8 > i2) {
                    i5 |= 1 << ((length - 1) - i7);
                    i4++;
                    i6 += i8;
                }
            }
            if (i4 == 3) {
                for (int i9 = 0; i9 < length && i4 > 0; i9++) {
                    int i10 = iArr[i9];
                    if (i10 > i2) {
                        i4--;
                        if ((i10 << 1) >= i6) {
                            return -1;
                        }
                    }
                }
                return i5;
            }
            if (i4 <= 3) {
                return -1;
            }
            i = i2;
        }
    }
}