/*
 * Decompiled with CFR 0.152.
 */
package com.l7tech.server.transport.jms2;

import com.l7tech.server.transport.jms2.CachedConnection;
import com.l7tech.server.transport.jms2.JmsEndpointConfig;
import com.l7tech.server.transport.jms2.JmsResourceManager;
import com.l7tech.server.transport.jms2.JmsResourceManagerConfig;
import com.l7tech.server.transport.jms2.f;
import java.util.AbstractMap;
import java.util.Iterator;
import java.util.Map;
import java.util.TimerTask;
import java.util.TreeSet;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.AtomicReference;
import java.util.logging.Level;

final class l
extends TimerTask {
    private final ConcurrentHashMap<JmsEndpointConfig.JmsEndpointKey, CachedConnection> a;
    private final AtomicReference<JmsResourceManagerConfig> b;
    private static final String[] c;

    private l(ConcurrentHashMap<JmsEndpointConfig.JmsEndpointKey, CachedConnection> concurrentHashMap, AtomicReference<JmsResourceManagerConfig> atomicReference) {
        this.a = concurrentHashMap;
        this.b = atomicReference;
    }

    @Override
    public void run() {
        String[] stringArray = c;
        JmsResourceManager.a.log(Level.FINE, stringArray[0]);
        JmsResourceManagerConfig jmsResourceManagerConfig = this.b.get();
        long l2 = System.currentTimeMillis();
        int n2 = this.a.size() - jmsResourceManagerConfig.getMaximumSize();
        TreeSet<Map.Entry<JmsEndpointConfig.JmsEndpointKey, CachedConnection>> treeSet = new TreeSet<Map.Entry<JmsEndpointConfig.JmsEndpointKey, CachedConnection>>(new f(this));
        for (JmsEndpointConfig.JmsEndpointKey jmsEndpointKey : this.a.keySet()) {
            JmsEndpointConfig jmsEndpointConfig;
            CachedConnection cachedConnection = this.a.get(jmsEndpointKey);
            if (JmsResourceManager.a.isLoggable(Level.FINE)) {
                stringArray = c;
                JmsResourceManager.a.log(Level.FINE, stringArray[3] + cachedConnection.toString());
                cachedConnection.debugStatus();
            }
            if ((jmsEndpointConfig = cachedConnection.getEndpointConfig()) != null && jmsEndpointConfig.isEvictOnExpired()) {
                if (l2 - cachedConnection.getCreatedTime() > jmsResourceManagerConfig.getMaximumAge() && jmsResourceManagerConfig.getMaximumAge() > 0L) {
                    if (JmsResourceManager.a.isLoggable(Level.FINE)) {
                        stringArray = c;
                        JmsResourceManager.a.log(Level.FINE, stringArray[1] + cachedConnection.toString());
                    }
                    if (!cachedConnection.isActive()) {
                        if (JmsResourceManager.a.isLoggable(Level.FINE)) {
                            stringArray = c;
                            JmsResourceManager.a.log(Level.FINE, stringArray[4] + cachedConnection.toString());
                        }
                        cachedConnection.close();
                        this.a.remove(jmsEndpointKey);
                    }
                } else if (cachedConnection.isIdleTimeoutExpired()) {
                    if (JmsResourceManager.a.isLoggable(Level.FINE)) {
                        stringArray = c;
                        JmsResourceManager.a.log(Level.FINE, stringArray[5] + cachedConnection.toString());
                    }
                    cachedConnection.close();
                    this.a.remove(jmsEndpointKey);
                } else if (n2 > 0) {
                    treeSet.add(new AbstractMap.SimpleEntry<JmsEndpointConfig.JmsEndpointKey, CachedConnection>(jmsEndpointKey, cachedConnection));
                }
            }
            Iterator iterator = treeSet.iterator();
            for (int i2 = 0; i2 < n2 && iterator.hasNext(); ++i2) {
                Map.Entry entry = (Map.Entry)iterator.next();
                CachedConnection cachedConnection2 = (CachedConnection)entry.getValue();
                if (cachedConnection2.isDisconnected()) continue;
                if (JmsResourceManager.a.isLoggable(Level.FINE)) {
                    JmsResourceManager.a.log(Level.FINE, c[2] + cachedConnection2.toString());
                }
                cachedConnection2.close();
                this.a.remove(entry.getKey(), entry.getValue());
            }
        }
    }

    /*
     * Unable to fully structure code
     */
    static {
        block10: {
            block9: {
                var5 = new String[6];
                var3_1 = 0;
                var2_2 = "N*ZvvTb<\u001cU{w_Fp:UvjJQ},_61\u0014\u0018Q>LqrOh<>S}?_}l6F}{\u001acs-\u0014\u001dN:Ywi_%i1Akz^%V\u0012g8|Ukr:WlvUk<\u0019_7Q{t\u001a`j6WlvUk<<Uv{Sa}+Q8";
                var4_3 = "N*ZvvTb<\u001cU{w_Fp:UvjJQ},_61\u0014\u0018Q>LqrOh<>S}?_}l6F}{\u001acs-\u0014\u001dN:Ywi_%i1Akz^%V\u0012g8|Ukr:WlvUk<\u0019_7Q{t\u001a`j6WlvUk<<Uv{Sa}+Q8".length();
                var1_4 = 27;
                var0_5 = -1;
lbl7:
                // 2 sources

                while (true) {
                    v0 = 78;
                    v1 = ++var0_5;
                    v2 = var2_2.substring(v1, v1 + var1_4);
                    v3 = -1;
                    break block9;
                    break;
                }
lbl13:
                // 1 sources

                while (true) {
                    var5[var3_1++] = l.a(v0, l.a(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    var2_2 = "/[8\u0016\b>D\bP \n\u001b?D7s\u0006Y\u001d4\n\u0013[6\r\u00174\n]#/[8\u0016\b>D\u0018F%\u0010\f>\u0000]W1\u0015\u001b{.0mu\u001a\u00115\n\u0018]!\u0010\u00115D";
                    var4_3 = "/[8\u0016\b>D\bP \n\u001b?D7s\u0006Y\u001d4\n\u0013[6\r\u00174\n]#/[8\u0016\b>D\u0018F%\u0010\f>\u0000]W1\u0015\u001b{.0mu\u001a\u00115\n\u0018]!\u0010\u00115D".length();
                    var1_4 = 29;
                    var0_5 = -1;
lbl22:
                    // 2 sources

                    while (true) {
                        v0 = 47;
                        v4 = ++var0_5;
                        v2 = var2_2.substring(v4, v4 + var1_4);
                        v3 = 0;
                        break block9;
                        break;
                    }
                    break;
                }
lbl28:
                // 1 sources

                while (true) {
                    var5[var3_1++] = l.a(v0, l.a(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    break block10;
                    break;
                }
            }
            switch (v3) {
                default: {
                    ** continue;
                }
                ** case 0:
lbl39:
                // 1 sources

                ** continue;
            }
        }
        l.c = var5;
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x4B);
        }
        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 -> 82;
                    case 1 -> 17;
                    case 2 -> 122;
                    case 3 -> 86;
                    case 4 -> 81;
                    case 5 -> 116;
                    default -> 75;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}