/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.gateway.common.uddi.UDDIRegistry
 *  com.l7tech.objectmodel.FindException
 *  com.l7tech.uddi.UDDIClient
 *  com.l7tech.util.Pair
 *  com.l7tech.util.TimeUnit
 */
package com.l7tech.server.uddi;

import com.l7tech.gateway.common.uddi.UDDIRegistry;
import com.l7tech.objectmodel.FindException;
import com.l7tech.server.uddi.TimerUDDIEvent;
import com.l7tech.server.uddi.UDDICoordinator;
import com.l7tech.server.uddi.UDDIHelper;
import com.l7tech.server.uddi.ap;
import com.l7tech.uddi.UDDIClient;
import com.l7tech.util.Pair;
import com.l7tech.util.TimeUnit;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Timer;
import java.util.TimerTask;
import java.util.logging.Level;

final class n {
    private final UDDIHelper a;
    private final UDDIRegistry b;
    private final Collection<Pair<Long, TimerTask>> c;
    private final Timer d;
    private static final String[] e;

    n(UDDICoordinator uDDICoordinator, UDDIHelper uDDIHelper, UDDIRegistry uDDIRegistry, Timer timer) {
        this.b = uDDIRegistry;
        this.a = uDDIHelper;
        this.d = timer;
        this.c = n.a(uDDICoordinator, uDDIRegistry);
    }

    UDDIClient a() throws FindException {
        return this.a.newUDDIClient(this.b);
    }

    void b() {
        if (!this.c.isEmpty()) {
            UDDICoordinator.a.info(e[3] + this.d() + ".");
            for (Pair<Long, TimerTask> pair : this.c) {
                this.d.schedule((TimerTask)pair.right, (Long)pair.left, (long)((Long)pair.left));
            }
        }
    }

    void c() {
        if (!this.c.isEmpty()) {
            UDDICoordinator.a.info(e[2] + this.d() + ".");
            for (Pair<Long, TimerTask> pair : this.c) {
                ((TimerTask)pair.right).cancel();
            }
        }
    }

    String d() {
        StringBuilder stringBuilder = new StringBuilder();
        stringBuilder.append(this.b.getName());
        stringBuilder.append(e[1]);
        stringBuilder.append(this.b.getGoid());
        stringBuilder.append(',');
        stringBuilder.append(this.b.getVersion());
        stringBuilder.append(')');
        return stringBuilder.toString();
    }

    static Collection<Pair<Long, TimerTask>> a(UDDICoordinator uDDICoordinator, UDDIRegistry uDDIRegistry) {
        ArrayList<Pair> arrayList = new ArrayList<Pair>();
        if (uDDIRegistry.isEnabled()) {
            TimerUDDIEvent timerUDDIEvent;
            String[] stringArray;
            if (uDDIRegistry.isMonitoringEnabled() && !uDDIRegistry.isSubscribeForNotifications() && n.a((stringArray = e)[4], uDDIRegistry.getMonitoringFrequency())) {
                timerUDDIEvent = new TimerUDDIEvent(uDDIRegistry.getGoid(), TimerUDDIEvent.Type.SUBSCRIPTION_POLL);
                arrayList.add(new Pair((Object)uDDIRegistry.getMonitoringFrequency(), (Object)new ap(uDDICoordinator, timerUDDIEvent)));
            }
            if (uDDIRegistry.isMetricsEnabled() && n.a(e[5], uDDIRegistry.getMetricPublishFrequency())) {
                timerUDDIEvent = new TimerUDDIEvent(uDDIRegistry.getGoid(), TimerUDDIEvent.Type.METRICS_PUBLISH);
                arrayList.add(new Pair((Object)uDDIRegistry.getMetricPublishFrequency(), (Object)new ap(uDDICoordinator, timerUDDIEvent)));
                TimerUDDIEvent timerUDDIEvent2 = new TimerUDDIEvent(uDDIRegistry.getGoid(), TimerUDDIEvent.Type.METRICS_CLEANUP);
                arrayList.add(new Pair((Object)UDDICoordinator.c, (Object)new ap(uDDICoordinator, timerUDDIEvent2)));
            }
        }
        return Collections.unmodifiableCollection(arrayList);
    }

    static boolean a(String string, long l2) {
        boolean bl2 = true;
        if (l2 < TimeUnit.SECONDS.toMillis(5L) || l2 > TimeUnit.DAYS.toMillis(365L)) {
            bl2 = false;
            UDDICoordinator.a.log(Level.WARNING, e[0], new Object[]{string, l2});
        }
        return bl2;
    }

    /*
     * Unable to fully structure code
     */
    static {
        block10: {
            block9: {
                var5 = new String[6];
                var3_1 = 0;
                var2_2 = "2Bl]]BJ\u001c\u0005k\\YJH\u0012A\"Q@EB\u0012Bw@N_M\u0014K\"T@Y\u0004\u0000\u0015\u007f\b\u000fP\u0015\u0006Hq\u001c\u0002S\u0006#8DlQJGH\u0012Ke\u0012[JW\u0010V\"T@Y\u0004.aF{\u000fYA\u001cLqF]R\u0004#(FjWK^H\u0012Ke\u0012[JW\u0010V\"T@Y\u0004.aF{\u000fYA\u001cLqF]R\u0004";
                var4_3 = "2Bl]]BJ\u001c\u0005k\\YJH\u0012A\"Q@EB\u0012Bw@N_M\u0014K\"T@Y\u0004\u0000\u0015\u007f\b\u000fP\u0015\u0006Hq\u001c\u0002S\u0006#8DlQJGH\u0012Ke\u0012[JW\u0010V\"T@Y\u0004.aF{\u000fYA\u001cLqF]R\u0004#(FjWK^H\u0012Ke\u0012[JW\u0010V\"T@Y\u0004.aF{\u000fYA\u001cLqF]R\u0004".length();
                var1_4 = 46;
                var0_5 = -1;
lbl7:
                // 2 sources

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

                while (true) {
                    var5[var3_1++] = n.a(v0, n.a(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    var2_2 = "@\u0018(\t\u0004\u0011\u0005C\u0019#\u0015\tC\u001c\\\u0001&\u000f^\b>\b\u000e\u0000\u001f\u0013\u001d?\u0018\u000b\n\u001f[";
                    var4_3 = "@\u0018(\t\u0004\u0011\u0005C\u0019#\u0015\tC\u001c\\\u0001&\u000f^\b>\b\u000e\u0000\u001f\u0013\u001d?\u0018\u000b\n\u001f[".length();
                    var1_4 = 17;
                    var0_5 = -1;
lbl22:
                    // 2 sources

                    while (true) {
                        v0 = 77;
                        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++] = n.a(v0, n.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;
            }
        }
        n.e = var5;
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x21);
        }
        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 -> 126;
                    case 1 -> 32;
                    case 2 -> 7;
                    case 3 -> 55;
                    case 4 -> 42;
                    case 5 -> 46;
                    default -> 33;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}

