/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.gateway.common.transport.firewall.SsgFirewallRule
 *  com.l7tech.util.Functions$Unary
 */
package com.l7tech.server.transport.firewall;

import com.l7tech.gateway.common.transport.firewall.SsgFirewallRule;
import com.l7tech.server.transport.firewall.SsgFirewallRuleManagerImpl;
import com.l7tech.util.Functions;

class c
implements Functions.Unary<SsgFirewallRule, SsgFirewallRule> {
    final SsgFirewallRuleManagerImpl this$0;
    private static final String[] a;

    c(SsgFirewallRuleManagerImpl ssgFirewallRuleManagerImpl) {
        this.this$0 = ssgFirewallRuleManagerImpl;
    }

    public SsgFirewallRule call(SsgFirewallRule ssgFirewallRule) {
        String[] stringArray = a;
        ssgFirewallRule = this.this$0.a(ssgFirewallRule, stringArray[0]);
        ssgFirewallRule = this.this$0.a(ssgFirewallRule, stringArray[1]);
        return ssgFirewallRule;
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "-5\u0003a\u0016uf6=Ok\u001d\r+.Z%\u0011ow!)Hi\u001bd";
        int n3 = "-5\u0003a\u0016uf6=Ok\u001d\r+.Z%\u0011ow!)Hi\u001bd".length();
        int n4 = 12;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = c.a(100, c.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                a = 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] ^ 0x67);
        }
        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 -> 32;
                    case 1 -> 63;
                    case 2 -> 74;
                    case 3 -> 108;
                    case 4 -> 28;
                    case 5 -> 101;
                    default -> 103;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}