package Y3;

import java.nio.charset.Charset;

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

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public static final Charset f8811a = Charset.forName("UTF-8");

    /* JADX WARN: Code restructure failed: missing block: B:54:0x00e2, code lost:
    
        if (r7 != 4) goto L58;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public static byte[] a(String str) {
        byte[] bytes = str.getBytes(f8811a);
        int length = bytes.length;
        int i6 = (length * 3) / 4;
        byte[] bArr = new byte[i6];
        int[] iArr = e.f8809g;
        int i7 = 0;
        int i8 = 0;
        int i9 = 0;
        int i10 = 0;
        while (i7 < length) {
            if (i8 == 0) {
                while (true) {
                    int i11 = i7 + 4;
                    if (i11 > length || (i9 = (iArr[bytes[i7] & 255] << 18) | (iArr[bytes[i7 + 1] & 255] << 12) | (iArr[bytes[i7 + 2] & 255] << 6) | iArr[bytes[i7 + 3] & 255]) < 0) {
                        break;
                    }
                    bArr[i10 + 2] = (byte) i9;
                    bArr[i10 + 1] = (byte) (i9 >> 8);
                    bArr[i10] = (byte) (i9 >> 16);
                    i10 += 3;
                    i7 = i11;
                }
                if (i7 >= length) {
                    break;
                }
            }
            int i12 = i7 + 1;
            int i13 = iArr[bytes[i7] & 255];
            if (i8 != 0) {
                if (i8 == 1) {
                    if (i13 < 0) {
                        if (i13 != -1) {
                            break;
                        }
                        i7 = i12;
                    }
                    i13 |= i9 << 6;
                } else if (i8 == 2) {
                    if (i13 < 0) {
                        if (i13 != -2) {
                            if (i13 != -1) {
                                break;
                            }
                        } else {
                            bArr[i10] = (byte) (i9 >> 4);
                            i8 = 4;
                            i10++;
                        }
                        i7 = i12;
                    }
                    i13 |= i9 << 6;
                } else if (i8 != 3) {
                    if (i8 == 4) {
                        if (i13 != -2) {
                            if (i13 != -1) {
                                break;
                            }
                        } else {
                            i8++;
                        }
                        i7 = i12;
                    } else {
                        if (i8 == 5 && i13 != -1) {
                            break;
                        }
                        i7 = i12;
                    }
                } else if (i13 >= 0) {
                    i13 |= i9 << 6;
                    bArr[i10 + 2] = (byte) i13;
                    bArr[i10 + 1] = (byte) (i13 >> 8);
                    bArr[i10] = (byte) (i13 >> 16);
                    i10 += 3;
                    i8 = 0;
                } else {
                    if (i13 != -2) {
                        if (i13 != -1) {
                            break;
                        }
                    } else {
                        bArr[i10 + 1] = (byte) (i9 >> 2);
                        bArr[i10] = (byte) (i9 >> 10);
                        i10 += 2;
                        i8 = 5;
                    }
                    i7 = i12;
                }
                i8++;
            } else {
                if (i13 < 0) {
                    if (i13 != -1) {
                        break;
                    }
                    i7 = i12;
                }
                i8++;
            }
            i9 = i13;
            i7 = i12;
        }
        if (i8 != 1) {
            if (i8 == 2) {
                bArr[i10] = (byte) (i9 >> 4);
                i10++;
            } else if (i8 == 3) {
                int i14 = i10 + 1;
                bArr[i10] = (byte) (i9 >> 10);
                i10 += 2;
                bArr[i14] = (byte) (i9 >> 2);
            }
            if (i10 == i6) {
                return bArr;
            }
            byte[] bArr2 = new byte[i10];
            System.arraycopy(bArr, 0, bArr2, 0, i10);
            return bArr2;
        }
        throw new IllegalArgumentException("bad base-64");
    }

    public static byte[] b(byte[] bArr) {
        int length = bArr.length;
        byte[] bArr2 = e.f8810h;
        int i6 = (length / 3) * 4;
        if (length % 3 > 0) {
            i6 += 4;
        }
        byte[] bArr3 = new byte[i6];
        int i7 = 0;
        int i8 = -1;
        int i9 = 0;
        while (true) {
            int i10 = i7 + 3;
            if (i10 > length) {
                break;
            }
            int i11 = (bArr[i7 + 2] & 255) | ((bArr[i7] & 255) << 16) | ((bArr[i7 + 1] & 255) << 8);
            bArr3[i9] = bArr2[(i11 >> 18) & 63];
            bArr3[i9 + 1] = bArr2[(i11 >> 12) & 63];
            bArr3[i9 + 2] = bArr2[(i11 >> 6) & 63];
            bArr3[i9 + 3] = bArr2[i11 & 63];
            int i12 = i9 + 4;
            i8--;
            if (i8 == 0) {
                i9 += 5;
                bArr3[i12] = 10;
                i8 = 19;
            } else {
                i9 = i12;
            }
            i7 = i10;
        }
        if (i7 == length - 1) {
            int i13 = (bArr[i7] & 255) << 4;
            bArr3[i9] = bArr2[(i13 >> 6) & 63];
            bArr3[i9 + 1] = bArr2[i13 & 63];
            bArr3[i9 + 2] = 61;
            bArr3[i9 + 3] = 61;
            return bArr3;
        }
        if (i7 == length - 2) {
            int i14 = ((bArr[i7 + 1] & 255) << 2) | ((bArr[i7] & 255) << 10);
            bArr3[i9] = bArr2[(i14 >> 12) & 63];
            bArr3[i9 + 1] = bArr2[(i14 >> 6) & 63];
            bArr3[i9 + 2] = bArr2[i14 & 63];
            bArr3[i9 + 3] = 61;
        }
        return bArr3;
    }
}