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

import com.l7tech.server.identity.ldap.LdapCertificateCache;
import com.l7tech.server.identity.ldap.LdapRuntimeConfig;
import com.l7tech.server.util.ManagedTimerTask;
import java.text.MessageFormat;

class ai
extends ManagedTimerTask {
    private final LdapCertificateCache c;
    private final LdapRuntimeConfig d;
    private final String e;
    private long f;
    private static final String[] g;

    ai(LdapCertificateCache ldapCertificateCache, LdapRuntimeConfig ldapRuntimeConfig, String string) {
        this.c = ldapCertificateCache;
        this.d = ldapRuntimeConfig;
        this.e = string;
        this.f = ldapRuntimeConfig.getRebuildTimerLength();
    }

    @Override
    protected void doRun() {
        if (this.c.a()) {
            this.cancel();
        } else {
            long l2 = this.d.getRebuildTimerLength();
            if (this.f != l2) {
                LdapCertificateCache.a.info(MessageFormat.format(g[1], this.f, l2));
                this.f = l2;
                this.c.b();
            } else {
                this.c.d();
            }
        }
    }

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

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "_2|;y}\u0011h($\u001b}{\u0000!'#\u001cywEs+/\ruc\u0001!'#\fy}\u0013`\"m\u0010}|Eb&,\u0016{j\u0001!f\"\u0014x/\u0013`\"8\u001d<2Ez~0T<a\u0000vn;\u0019pz\u0000!sm\u0003-rL/n\u001f\u001dol\rd*8\u0014ua\u0002!:%\u0011o/\u0011`=&Xkf\u0011in#\u001dk/\fo:(\njn\t/ ;}a\u0006d\"!\u0011rhEb+?\f<f\u000be+5Xhn\u0016jn+\u0017n/B";
        int n3 = "_2|;y}\u0011h($\u001b}{\u0000!'#\u001cywEs+/\ruc\u0001!'#\fy}\u0013`\"m\u0010}|Eb&,\u0016{j\u0001!f\"\u0014x/\u0013`\"8\u001d<2Ez~0T<a\u0000vn;\u0019pz\u0000!sm\u0003-rL/n\u001f\u001dol\rd*8\u0014ua\u0002!:%\u0011o/\u0011`=&Xkf\u0011in#\u001dk/\fo:(\njn\t/ ;}a\u0006d\"!\u0011rhEb+?\f<f\u000be+5Xhn\u0016jn+\u0017n/B".length();
        int n4 = 2;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = ai.b(109, ai.b(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                g = 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] ^ 0x20);
        }
        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 -> 21;
                    case 1 -> 113;
                    case 2 -> 98;
                    case 3 -> 8;
                    case 4 -> 108;
                    case 5 -> 35;
                    default -> 32;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}