package g.d.a.j;

import g.d.a.j.f;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

/* JADX INFO: compiled from: Analyzer.java */
/* JADX INFO: loaded from: classes.dex */
public class a {
    public static void a(g gVar) {
        if ((gVar.R0() & 32) != 32) {
            j(gVar);
            return;
        }
        gVar.D0 = true;
        gVar.x0 = false;
        gVar.y0 = false;
        gVar.z0 = false;
        ArrayList<f> arrayList = gVar.k0;
        List<h> list = gVar.w0;
        boolean z = gVar.s() == f.b.WRAP_CONTENT;
        boolean z2 = gVar.B() == f.b.WRAP_CONTENT;
        boolean z3 = z || z2;
        list.clear();
        for (f fVar : arrayList) {
            fVar.p = null;
            fVar.d0 = false;
            fVar.S();
        }
        for (f fVar2 : arrayList) {
            if (fVar2.p == null && !b(fVar2, list, z3)) {
                j(gVar);
                gVar.D0 = false;
                return;
            }
        }
        int iMax = 0;
        int iMax2 = 0;
        for (h hVar : list) {
            iMax = Math.max(iMax, c(hVar, 0));
            iMax2 = Math.max(iMax2, c(hVar, 1));
        }
        if (z) {
            gVar.g0(f.b.FIXED);
            gVar.y0(iMax);
            gVar.x0 = true;
            gVar.y0 = true;
            gVar.A0 = iMax;
        }
        if (z2) {
            gVar.u0(f.b.FIXED);
            gVar.b0(iMax2);
            gVar.x0 = true;
            gVar.z0 = true;
            gVar.B0 = iMax2;
        }
        i(list, 0, gVar.D());
        i(list, 1, gVar.r());
    }

    private static boolean b(f fVar, List<h> list, boolean z) {
        h hVar = new h(new ArrayList(), true);
        list.add(hVar);
        return k(fVar, hVar, list, z);
    }

    private static int c(h hVar, int i2) {
        int i3 = i2 * 2;
        List<f> listB = hVar.b(i2);
        int size = listB.size();
        int iMax = 0;
        for (int i4 = 0; i4 < size; i4++) {
            f fVar = listB.get(i4);
            e[] eVarArr = fVar.A;
            int i5 = i3 + 1;
            iMax = Math.max(iMax, d(fVar, i2, eVarArr[i5].d == null || !(eVarArr[i3].d == null || eVarArr[i5].d == null), 0));
        }
        hVar.e[i2] = iMax;
        return iMax;
    }

    private static int d(f fVar, int i2, boolean z, int i3) {
        int iR;
        int iJ;
        int i4;
        int i5;
        int i6;
        int iD;
        int i7;
        int i8;
        int i9;
        int iMax = 0;
        if (!fVar.b0) {
            return 0;
        }
        boolean z2 = fVar.w.d != null && i2 == 1;
        if (z) {
            iR = fVar.j();
            iJ = fVar.r() - fVar.j();
            i5 = i2 * 2;
            i4 = i5 + 1;
        } else {
            iR = fVar.r() - fVar.j();
            iJ = fVar.j();
            i4 = i2 * 2;
            i5 = i4 + 1;
        }
        e[] eVarArr = fVar.A;
        if (eVarArr[i4].d == null || eVarArr[i5].d != null) {
            i6 = 1;
        } else {
            i6 = -1;
            int i10 = i4;
            i4 = i5;
            i5 = i10;
        }
        int i11 = z2 ? i3 - iR : i3;
        int iD2 = (fVar.A[i5].d() * i6) + e(fVar, i2);
        int i12 = i11 + iD2;
        int iD3 = (i2 == 0 ? fVar.D() : fVar.r()) * i6;
        Iterator<n> it = fVar.A[i5].f().a.iterator();
        while (it.hasNext()) {
            iMax = Math.max(iMax, d(((l) it.next()).c.b, i2, z, i12));
        }
        int iMax2 = 0;
        for (Iterator<n> it2 = fVar.A[i4].f().a.iterator(); it2.hasNext(); it2 = it2) {
            iMax2 = Math.max(iMax2, d(((l) it2.next()).c.b, i2, z, iD3 + i12));
        }
        if (z2) {
            iMax -= iR;
            iD = iMax2 + iJ;
        } else {
            iD = iMax2 + ((i2 == 0 ? fVar.D() : fVar.r()) * i6);
        }
        int i13 = 1;
        if (i2 == 1) {
            Iterator<n> it3 = fVar.w.f().a.iterator();
            int iMax3 = 0;
            while (it3.hasNext()) {
                Iterator<n> it4 = it3;
                l lVar = (l) it3.next();
                if (i6 == i13) {
                    iMax3 = Math.max(iMax3, d(lVar.c.b, i2, z, iR + i12));
                    i9 = i4;
                } else {
                    i9 = i4;
                    iMax3 = Math.max(iMax3, d(lVar.c.b, i2, z, (iJ * i6) + i12));
                }
                it3 = it4;
                i4 = i9;
                i13 = 1;
            }
            i7 = i4;
            int i14 = iMax3;
            i8 = (fVar.w.f().a.size() <= 0 || z2) ? i14 : i6 == 1 ? i14 + iR : i14 - iJ;
        } else {
            i7 = i4;
            i8 = 0;
        }
        int iMax4 = iD2 + Math.max(iMax, Math.max(iD, i8));
        int i15 = iD3 + i12;
        if (i6 == -1) {
            i15 = i12;
            i12 = i15;
        }
        if (z) {
            k.e(fVar, i2, i12);
            fVar.Z(i12, i15, i2);
        } else {
            fVar.p.a(fVar, i2);
            fVar.q0(i12, i2);
        }
        if (fVar.o(i2) == f.b.MATCH_CONSTRAINT && fVar.G != 0.0f) {
            fVar.p.a(fVar, i2);
        }
        e[] eVarArr2 = fVar.A;
        if (eVarArr2[i5].d != null && eVarArr2[i7].d != null) {
            f fVarU = fVar.u();
            e[] eVarArr3 = fVar.A;
            if (eVarArr3[i5].d.b == fVarU && eVarArr3[i7].d.b == fVarU) {
                fVar.p.a(fVar, i2);
            }
        }
        return iMax4;
    }

    private static int e(f fVar, int i2) {
        e eVar;
        int i3 = i2 * 2;
        e[] eVarArr = fVar.A;
        e eVar2 = eVarArr[i3];
        e eVar3 = eVarArr[i3 + 1];
        e eVar4 = eVar2.d;
        if (eVar4 == null) {
            return 0;
        }
        f fVar2 = eVar4.b;
        f fVar3 = fVar.D;
        if (fVar2 != fVar3 || (eVar = eVar3.d) == null || eVar.b != fVar3) {
            return 0;
        }
        return (int) ((((fVar3.t(i2) - eVar2.d()) - eVar3.d()) - fVar.t(i2)) * (i2 == 0 ? fVar.V : fVar.W));
    }

    private static void f(g gVar, f fVar, h hVar) {
        hVar.d = false;
        gVar.D0 = false;
        fVar.b0 = false;
    }

    private static int g(f fVar) {
        if (fVar.s() == f.b.MATCH_CONSTRAINT) {
            int iR = (int) (fVar.H == 0 ? fVar.r() * fVar.G : fVar.r() / fVar.G);
            fVar.y0(iR);
            return iR;
        }
        if (fVar.B() != f.b.MATCH_CONSTRAINT) {
            return -1;
        }
        int iD = (int) (fVar.H == 1 ? fVar.D() * fVar.G : fVar.D() / fVar.G);
        fVar.b0(iD);
        return iD;
    }

    private static void h(e eVar) {
        l lVarF = eVar.f();
        e eVar2 = eVar.d;
        if (eVar2 == null || eVar2.d == eVar) {
            return;
        }
        eVar2.f().a(lVarF);
    }

    public static void i(List<h> list, int i2, int i3) {
        int size = list.size();
        for (int i4 = 0; i4 < size; i4++) {
            for (f fVar : list.get(i4).c(i2)) {
                if (fVar.b0) {
                    l(fVar, i2, i3);
                }
            }
        }
    }

    private static void j(g gVar) {
        gVar.w0.clear();
        gVar.w0.add(0, new h(gVar.k0));
    }

    /* JADX WARN: Removed duplicated region for block: B:123:0x0183  */
    /* JADX WARN: Removed duplicated region for block: B:92:0x012a  */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    private static boolean k(g.d.a.j.f r8, g.d.a.j.h r9, java.util.List<g.d.a.j.h> r10, boolean r11) {
        /*
            Method dump skipped, instruction units count: 560
            To view this dump add '--comments-level debug' option
        */
        throw new UnsupportedOperationException("Method not decompiled: g.d.a.j.a.k(g.d.a.j.f, g.d.a.j.h, java.util.List, boolean):boolean");
    }

    private static void l(f fVar, int i2, int i3) {
        int i4 = i2 * 2;
        e[] eVarArr = fVar.A;
        e eVar = eVarArr[i4];
        e eVar2 = eVarArr[i4 + 1];
        if ((eVar.d == null || eVar2.d == null) ? false : true) {
            k.e(fVar, i2, e(fVar, i2) + eVar.d());
            return;
        }
        if (fVar.G == 0.0f || fVar.o(i2) != f.b.MATCH_CONSTRAINT) {
            int iV = i3 - fVar.v(i2);
            int iT = iV - fVar.t(i2);
            fVar.Z(iT, iV, i2);
            k.e(fVar, i2, iT);
            return;
        }
        int iG = g(fVar);
        int i5 = (int) fVar.A[i4].f().f495g;
        eVar2.f().f = eVar.f();
        eVar2.f().f495g = iG;
        eVar2.f().b = 1;
        fVar.Z(i5, i5 + iG, i2);
    }
}