/*
 * Decompiled with CFR 0.152.
 */
package com.l7tech.server.identity.ldap;

import com.l7tech.server.identity.ldap.LdapCertificateCache;
import com.l7tech.server.util.ManagedTimerTask;

class ah
extends ManagedTimerTask {
    private final LdapCertificateCache c;
    private final String d;
    private static final String[] e;

    ah(LdapCertificateCache ldapCertificateCache, String string) {
        this.c = ldapCertificateCache;
        this.d = string;
    }

    @Override
    protected void doRun() {
        if (this.c.a()) {
            this.cancel();
        } else {
            this.c.c();
        }
    }

    @Override
    public boolean cancel() {
        String[] stringArray = e;
        LdapCertificateCache.a.info(stringArray[1] + this.d + stringArray[0]);
        return super.cancel();
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "LA((\u000e\u0014AFdm\u0002\u0001\u001d\u0002@ms\u001fO\u0019C@`dK\f\u0016GBft\u001bO\u000eCPc!\r\u0000\b\u0002\u0004";
        int n3 = "LA((\u000e\u0014AFdm\u0002\u0001\u001d\u0002@ms\u001fO\u0019C@`dK\f\u0016GBft\u001bO\u000eCPc!\r\u0000\b\u0002\u0004".length();
        int n4 = 2;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = ah.b(117, ah.b(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                e = stringArray;
                return;
            }
            n4 = string.charAt(n5);
        }
    }

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

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String b(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 -> 30;
                    case 1 -> 26;
                    case 2 -> 15;
                    case 3 -> 87;
                    case 4 -> 86;
                    case 5 -> 125;
                    default -> 116;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}