package q5;

import java.io.EOFException;
import kotlin.jvm.internal.o;
import p5.C2740j;
import p5.F;
import p5.K;

/* JADX INFO: loaded from: classes3.dex */
public abstract class a {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public static final byte[] f23732a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public static final long[] f23733b;

    static {
        byte[] bytes = "0123456789abcdef".getBytes(S4.a.f6257a);
        o.g(bytes, "getBytes(...)");
        f23732a = bytes;
        f23733b = new long[]{-1, 9, 99, 999, 9999, 99999, 999999, 9999999, 99999999, 999999999, 9999999999L, 99999999999L, 999999999999L, 9999999999999L, 99999999999999L, 999999999999999L, 9999999999999999L, 99999999999999999L, 999999999999999999L, Long.MAX_VALUE};
    }

    public static final String a(C2740j c2740j, long j4) throws EOFException {
        o.h(c2740j, "<this>");
        if (j4 > 0) {
            long j6 = j4 - 1;
            if (c2740j.f(j6) == 13) {
                String strG = c2740j.G(j6, S4.a.f6257a);
                c2740j.J(2L);
                return strG;
            }
        }
        String strG2 = c2740j.G(j4, S4.a.f6257a);
        c2740j.J(1L);
        return strG2;
    }

    /* JADX WARN: Code restructure failed: missing block: B:27:0x0061, code lost:
    
        if (r19 == false) goto L37;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0063, code lost:
    
        return -2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x008c, code lost:
    
        return r9;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public static final int b(C2740j c2740j, F options, boolean z6) {
        int i6;
        byte[] bArr;
        int i7;
        int i8;
        K k6;
        byte[] bArr2;
        int i9;
        o.h(c2740j, "<this>");
        o.h(options, "options");
        K k7 = c2740j.f23099a;
        if (k7 != null) {
            int i10 = k7.f23062b;
            int i11 = k7.f23063c;
            byte[] bArr3 = k7.f23061a;
            K k8 = k7;
            int i12 = -1;
            int i13 = 0;
            loop0: while (true) {
                int i14 = i13 + 1;
                int[] iArr = options.f23046b;
                int i15 = iArr[i13];
                int i16 = i13 + 2;
                int i17 = iArr[i14];
                if (i17 != -1) {
                    i12 = i17;
                }
                if (k8 == null) {
                    break;
                }
                if (i15 >= 0) {
                    int i18 = i10 + 1;
                    int i19 = bArr3[i10] & 255;
                    int i20 = i16 + i15;
                    while (i16 != i20) {
                        if (i19 == iArr[i16]) {
                            i6 = iArr[i16 + i15];
                            if (i18 == i11) {
                                k8 = k8.f23066f;
                                o.e(k8);
                                i8 = k8.f23062b;
                                i7 = k8.f23063c;
                                bArr = k8.f23061a;
                                if (k8 == k7) {
                                    k8 = null;
                                }
                            } else {
                                bArr = bArr3;
                                i7 = i11;
                                i8 = i18;
                            }
                            if (i6 >= 0) {
                                return i6;
                            }
                            byte[] bArr4 = bArr;
                            i13 = -i6;
                            i10 = i8;
                            i11 = i7;
                            bArr3 = bArr4;
                        } else {
                            i16++;
                        }
                    }
                    break loop0;
                }
                int i21 = (i15 * (-1)) + i16;
                while (true) {
                    int i22 = i10 + 1;
                    int i23 = i16 + 1;
                    if ((bArr3[i10] & 255) != iArr[i16]) {
                        break loop0;
                    }
                    boolean z7 = i23 == i21;
                    if (i22 == i11) {
                        o.e(k8);
                        K k9 = k8.f23066f;
                        o.e(k9);
                        i9 = k9.f23062b;
                        int i24 = k9.f23063c;
                        bArr2 = k9.f23061a;
                        if (k9 != k7) {
                            k6 = k9;
                            i11 = i24;
                        } else {
                            if (!z7) {
                                break loop0;
                            }
                            i11 = i24;
                            k6 = null;
                        }
                    } else {
                        k6 = k8;
                        bArr2 = bArr3;
                        i9 = i22;
                    }
                    if (z7) {
                        i6 = iArr[i23];
                        int i25 = i9;
                        i7 = i11;
                        i8 = i25;
                        byte[] bArr5 = bArr2;
                        k8 = k6;
                        bArr = bArr5;
                        break;
                    }
                    i10 = i9;
                    bArr3 = bArr2;
                    k8 = k6;
                    i16 = i23;
                }
            }
        } else {
            return z6 ? -2 : -1;
        }
    }
}