/*
 * Decompiled with CFR 0.152.
 */
package com.l7tech.server.security.cert;

import com.l7tech.server.security.cert.CrlCacheImpl;
import java.security.cert.X509CRL;
import java.util.Date;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;

class k {
    private X509CRL a;
    private long b;
    private long c;
    private final ReadWriteLock d;
    final CrlCacheImpl this$0;
    private static final String[] e;

    private k(CrlCacheImpl crlCacheImpl) {
        this.this$0 = crlCacheImpl;
        this.d = new ReentrantReadWriteLock();
        this.b = System.currentTimeMillis();
        this.c = this.b + 30000L;
    }

    public synchronized X509CRL getCrl() {
        return this.a;
    }

    public synchronized void setCrl(X509CRL x509CRL) {
        this.a = x509CRL;
        this.b = System.currentTimeMillis();
        this.c = this.a(this.b, x509CRL.getNextUpdate());
    }

    private long a(long l2, Date date) {
        long l3;
        long l4;
        long l5 = date == null ? l2 + this.a() : ((l4 = (l3 = date.getTime() - (long)CrlCacheImpl.c) - l2) > this.c() ? l2 + this.c() : (l4 < this.b() ? l2 + this.b() : l3));
        return l5;
    }

    private long a() {
        return this.a(e[2]);
    }

    private long b() {
        return this.a(e[0]);
    }

    private long c() {
        return this.a(e[1]);
    }

    private long a(String string) {
        return this.this$0.l.getTimeUnitProperty(string, (long)CrlCacheImpl.b);
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "p*\u001d\u0006c]L.,\u001d\u0010ewpi3\r?Gj\u0014p*\u001d\u0006c]L.,\u0015\u0006ewpi3\r?Gj\u000ep*\u001d\u0006c]L.$\f\u000eI}y";
        int n3 = "p*\u001d\u0006c]L.,\u001d\u0010ewpi3\r?Gj\u0014p*\u001d\u0006c]L.,\u0015\u0006ewpi3\r?Gj\u000ep*\u001d\u0006c]L.$\f\u000eI}y".length();
        int n4 = 20;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = k.a(81, k.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] ^ 0x51);
        }
        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 -> 81;
                    case 1 -> 16;
                    case 2 -> 37;
                    case 3 -> 47;
                    case 4 -> 113;
                    case 5 -> 94;
                    default -> 81;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}