/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.util.ExceptionUtils
 */
package com.l7tech.server.security.cert;

import com.l7tech.server.security.cert.g;
import com.l7tech.server.security.cert.h;
import com.l7tech.util.ExceptionUtils;
import java.security.cert.CertPathBuilderException;
import java.util.ArrayList;
import java.util.Iterator;
import sun.security.provider.certpath.AdjacencyList;
import sun.security.provider.certpath.BuildStep;
import sun.security.provider.certpath.SunCertPathBuilderException;

final class j
implements g {
    final g a = new h();
    private static final String b = j.a(111, j.a("Z\u001cR5CX_\u0004X\u00005]KD\u0013\u0014Sy\u000f"));

    private j() {
    }

    @Override
    public String describe(CertPathBuilderException certPathBuilderException) {
        SunCertPathBuilderException sunCertPathBuilderException;
        AdjacencyList adjacencyList;
        Object object = this.a.describe(certPathBuilderException);
        if (certPathBuilderException instanceof SunCertPathBuilderException && (adjacencyList = (sunCertPathBuilderException = (SunCertPathBuilderException)certPathBuilderException).getAdjacencyList()) != null) {
            ArrayList<String> arrayList = new ArrayList<String>();
            Iterator<BuildStep> iterator = adjacencyList.iterator();
            while (iterator.hasNext()) {
                BuildStep buildStep = iterator.next();
                if (buildStep.getThrowable() == null) continue;
                arrayList.add(ExceptionUtils.getMessage((Throwable)buildStep.getThrowable()));
            }
            if (!arrayList.isEmpty()) {
                object = (String)object + b + String.valueOf(arrayList);
            }
        }
        return object;
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x44);
        }
        return cArray;
    }

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String a(int n2, char[] cArray) {
        char[] cArray2;
        block11: {
            int n3;
            int n4;
            int n5;
            block10: {
                n5 = n2;
                cArray2 = cArray;
                n4 = cArray.length;
                n3 = 0;
                if (!true) break block10;
                n4 = n4;
                if (n4 <= n3) break block11;
            }
            do {
                n5 = n5;
                cArray2 = cArray2;
                int n6 = n3;
                cArray2[n6] = (char)(cArray2[n6] ^ (n5 ^ (switch (n3 % 7) {
                    case 0 -> 14;
                    case 1 -> 83;
                    case 2 -> 79;
                    case 3 -> 63;
                    case 4 -> 64;
                    case 5 -> 86;
                    default -> 68;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}