/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.common.http.HttpHeaders
 */
package com.l7tech.server.policy.assertion;

import com.l7tech.common.http.HttpHeaders;
import com.l7tech.server.message.PolicyEnforcementContext;
import com.l7tech.server.policy.assertion.CompositeRoutingResultListener;
import com.l7tech.server.policy.assertion.RoutingResultListener;
import java.net.URL;
import java.util.logging.Level;

class g
implements RoutingResultListener {
    private final RoutingResultListener a;
    private static final String[] b;

    private g(RoutingResultListener routingResultListener) {
        this.a = routingResultListener;
    }

    @Override
    public boolean reroute(URL uRL, int n2, HttpHeaders httpHeaders, PolicyEnforcementContext policyEnforcementContext) {
        boolean bl2 = false;
        if (this.a != null) {
            try {
                bl2 = this.a.reroute(uRL, n2, httpHeaders, policyEnforcementContext);
            }
            catch (Exception exception) {
                CompositeRoutingResultListener.a.log(Level.WARNING, b[1], exception);
            }
        }
        return bl2;
    }

    @Override
    public void routed(URL uRL, int n2, HttpHeaders httpHeaders, PolicyEnforcementContext policyEnforcementContext) {
        if (this.a != null) {
            try {
                this.a.routed(uRL, n2, httpHeaders, policyEnforcementContext);
            }
            catch (Exception exception) {
                CompositeRoutingResultListener.a.log(Level.WARNING, b[0], exception);
            }
        }
    }

    @Override
    public void failed(URL uRL, Throwable throwable, PolicyEnforcementContext policyEnforcementContext) {
        if (this.a != null) {
            try {
                this.a.failed(uRL, throwable, policyEnforcementContext);
            }
            catch (Exception exception) {
                CompositeRoutingResultListener.a.log(Level.WARNING, b[0], exception);
            }
        }
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "\"\t5\u007f)\u001f\u007f\u0012\u0003}{?\u0018v\u0007\u00134q)[z\u0019G/q2\u000fz\u0019\u0000}l\"\bf\u001b\u0013}r.\bg\u0012\t8li/\"\t5\u007f)\u001f\u007f\u0012\u0003}{?\u0018v\u0007\u00134q)[z\u0019G/q2\u000fz\u0019\u0000}l\"\bf\u001b\u0013}r.\bg\u0012\t8li";
        int n3 = "\"\t5\u007f)\u001f\u007f\u0012\u0003}{?\u0018v\u0007\u00134q)[z\u0019G/q2\u000fz\u0019\u0000}l\"\bf\u001b\u0013}r.\bg\u0012\t8li/\"\t5\u007f)\u001f\u007f\u0012\u0003}{?\u0018v\u0007\u00134q)[z\u0019G/q2\u000fz\u0019\u0000}l\"\bf\u001b\u0013}r.\bg\u0012\t8li".length();
        int n4 = 47;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = g.a(7, g.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                b = stringArray;
                return;
            }
            n4 = string.charAt(n5);
        }
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x14);
        }
        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 -> 112;
                    case 1 -> 96;
                    case 2 -> 90;
                    case 3 -> 25;
                    case 4 -> 64;
                    case 5 -> 124;
                    default -> 20;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}