package defpackage;

import java.io.EOFException;

/* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
/* JADX INFO: loaded from: classes3.dex */
public abstract class AbstractC0098 {

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public static final byte[] f1355 = "0123456789abcdef".getBytes(AbstractC4490.f17115);

    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    public static final long[] f1354 = {-1, 9, 99, 999, 9999, 99999, 999999, 9999999, 99999999, 999999999, 9999999999L, 99999999999L, 999999999999L, 9999999999999L, 99999999999999L, 999999999999999L, 9999999999999999L, 99999999999999999L, 999999999999999999L, Long.MAX_VALUE};

    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    public static final boolean m1164(C2131 c2131, int i, byte[] bArr, int i2, int i3) {
        int i4 = c2131.f8449;
        byte[] bArr2 = c2131.f8451;
        while (i2 < i3) {
            if (i == i4) {
                c2131 = c2131.f8454;
                byte[] bArr3 = c2131.f8451;
                bArr2 = bArr3;
                i = c2131.f8448;
                i4 = c2131.f8449;
            }
            if (bArr2[i] != bArr[i2]) {
                return false;
            }
            i++;
            i2++;
        }
        return true;
    }

    /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */
    public static final String m1165(C4903 c4903, long j) throws EOFException {
        if (j > 0) {
            long j2 = j - 1;
            if (c4903.m10213(j2) == 13) {
                String strM10195 = c4903.m10195(j2, AbstractC4490.f17115);
                c4903.skip(2L);
                return strM10195;
            }
        }
        String strM101952 = c4903.m10195(j, AbstractC4490.f17115);
        c4903.skip(1L);
        return strM101952;
    }

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public static final long m1166(C4903 c4903, C1054 c1054, long j, long j2, int i) {
        C2131 c2131;
        long j3 = j;
        long j4 = j2;
        long j5 = i;
        ᵻᵪ.ˊᵙᵾᵲ(c1054.mo3458(), 0L, j5);
        if (i <= 0) {
            ᵕᵩʽᵲ.ᵮᵣᵗˈ("byteCount == 0");
            return 0L;
        }
        if (j3 < 0) {
            ᵕᵩʽᵲ.ᵱᵽʡᵚ(AbstractC0659.m2417(j3, "fromIndex < 0: "));
            return 0L;
        }
        if (j3 > j4) {
            StringBuilder sbM8220 = AbstractC3653.m8220(j3, "fromIndex > toIndex: ", " > ");
            sbM8220.append(j4);
            throw new IllegalArgumentException(sbM8220.toString().toString());
        }
        long j6 = c4903.f18672;
        if (j4 > j6) {
            j4 = j6;
        }
        if (j3 == j4 || (c2131 = c4903.f18671) == null) {
            return -1L;
        }
        long j7 = 0;
        if (j6 - j3 < j3) {
            while (j6 > j3) {
                c2131 = c2131.f8452;
                j6 -= (long) (c2131.f8449 - c2131.f8448);
            }
            byte[] bArrMo3465 = c1054.mo3465();
            byte b = bArrMo3465[0];
            long jMin = Math.min(j4, (c4903.f18672 - j5) + 1);
            while (j6 < jMin) {
                byte[] bArr = c2131.f8451;
                int iMin = (int) Math.min(c2131.f8449, (((long) c2131.f8448) + jMin) - j6);
                for (int i2 = (int) ((((long) c2131.f8448) + j3) - j6); i2 < iMin; i2++) {
                    if (bArr[i2] == b && m1164(c2131, i2 + 1, bArrMo3465, 1, i)) {
                        return ((long) (i2 - c2131.f8448)) + j6;
                    }
                }
                j6 += (long) (c2131.f8449 - c2131.f8448);
                c2131 = c2131.f8454;
                j3 = j6;
            }
            return -1L;
        }
        while (true) {
            long j8 = j7 + ((long) (c2131.f8449 - c2131.f8448));
            if (j8 > j3) {
                break;
            }
            c2131 = c2131.f8454;
            j7 = j8;
        }
        byte[] bArrMo34652 = c1054.mo3465();
        byte b2 = bArrMo34652[0];
        long jMin2 = Math.min(j4, (c4903.f18672 - j5) + 1);
        while (j7 < jMin2) {
            byte[] bArr2 = c2131.f8451;
            int iMin2 = (int) Math.min(c2131.f8449, (((long) c2131.f8448) + jMin2) - j7);
            for (int i3 = (int) ((((long) c2131.f8448) + j3) - j7); i3 < iMin2; i3++) {
                if (bArr2[i3] == b2 && m1164(c2131, i3 + 1, bArrMo34652, 1, i)) {
                    return ((long) (i3 - c2131.f8448)) + j7;
                }
            }
            j7 += (long) (c2131.f8449 - c2131.f8448);
            c2131 = c2131.f8454;
            j3 = j7;
        }
        return -1L;
    }

    /* JADX WARN: Code restructure failed: missing block: B:27:0x0051, code lost:
    
        if (r18 == false) goto L37;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0053, code lost:
    
        return -2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x0073, code lost:
    
        return r9;
     */
    /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public static final int m1167(C4903 c4903, C4135 c4135, boolean z) {
        int i;
        int i2;
        int i3;
        C2131 c2131;
        int i4;
        C2131 c21312 = c4903.f18671;
        if (c21312 != null) {
            byte[] bArr = c21312.f8451;
            int i5 = c21312.f8448;
            int i6 = c21312.f8449;
            int[] iArr = c4135.f15801;
            C2131 c21313 = c21312;
            int i7 = -1;
            int i8 = 0;
            loop0: while (true) {
                int i9 = i8 + 1;
                int i10 = iArr[i8];
                int i11 = i8 + 2;
                int i12 = iArr[i9];
                if (i12 != -1) {
                    i7 = i12;
                }
                if (c21313 == null) {
                    break;
                }
                if (i10 >= 0) {
                    int i13 = i5 + 1;
                    int i14 = bArr[i5] & 255;
                    int i15 = i11 + i10;
                    while (i11 != i15) {
                        if (i14 == iArr[i11]) {
                            i = iArr[i11 + i10];
                            if (i13 == i6) {
                                c21313 = c21313.f8454;
                                int i16 = c21313.f8448;
                                byte[] bArr2 = c21313.f8451;
                                i2 = c21313.f8449;
                                if (c21313 == c21312) {
                                    i3 = i16;
                                    bArr = bArr2;
                                    c21313 = null;
                                } else {
                                    i3 = i16;
                                    bArr = bArr2;
                                }
                            } else {
                                i2 = i6;
                                i3 = i13;
                            }
                            if (i >= 0) {
                                return i;
                            }
                            int i17 = i2;
                            i8 = -i;
                            i5 = i3;
                            i6 = i17;
                        } else {
                            i11++;
                        }
                    }
                    break loop0;
                }
                int i18 = (i10 * (-1)) + i11;
                while (true) {
                    int i19 = i5 + 1;
                    int i20 = i11 + 1;
                    if ((bArr[i5] & 255) != iArr[i11]) {
                        break loop0;
                    }
                    boolean z2 = i20 == i18;
                    if (i19 == i6) {
                        C2131 c21314 = c21313.f8454;
                        i3 = c21314.f8448;
                        byte[] bArr3 = c21314.f8451;
                        i4 = c21314.f8449;
                        if (c21314 != c21312) {
                            c2131 = c21314;
                            bArr = bArr3;
                        } else {
                            if (!z2) {
                                break loop0;
                            }
                            bArr = bArr3;
                            c2131 = null;
                        }
                    } else {
                        c2131 = c21313;
                        i4 = i6;
                        i3 = i19;
                    }
                    if (z2) {
                        i = iArr[i20];
                        int i21 = i4;
                        c21313 = c2131;
                        i2 = i21;
                        break;
                    }
                    i5 = i3;
                    i6 = i4;
                    c21313 = c2131;
                    i11 = i20;
                }
            }
        } else {
            return z ? -2 : -1;
        }
    }
}
