Created
February 22, 2019 00:08
-
-
Save dentmaged/037a8ff0004ae1ec11d1b4efd3e63d44 to your computer and use it in GitHub Desktop.
Very simple program that demonstrates how obfuscation can be used to protect Java class files from being decompiled
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * Decompiled with CFR 0_125. | |
| * | |
| * Could not load the following classes: | |
| * La.Z; | |
| * bRv.KmG.H | |
| * test.Project | |
| * test.a.b | |
| * test.utils.a.d | |
| */ | |
| package test; | |
| import La.Z;; | |
| import bRv.KmG.H; | |
| import test.a.b; | |
| import test.utils.a.d; | |
| public class Project { | |
| public static int W; | |
| public static int w; | |
| public static String[] pj; | |
| /* | |
| * Exception decompiling | |
| */ | |
| static { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // org.benf.cfr.reader.util.ConfusedCFRException: Tried to end blocks [1[TRYBLOCK]], but top level block is 17[SWITCH] | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:420) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:472) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:809) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| /* | |
| * Exception decompiling | |
| */ | |
| public static void main(String[] var0) throws Exception, Throwable { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // java.lang.IllegalStateException: Dynamic invoke Expected java.lang.Object, got "\u0015\u4415\t\u6161\u001b\u73611\u762e\n\u4477\n\u616e\n\u732e\u001c\u76494\u4461\r\u6161\n\u7365;\u7667\u001c\u44740\u6179\u001e\u7374,\u766d5\u446f\f\u616b,\u736e-\u7646\u001c\u4465\u000f\u6143\u0001\u7361:\u76737\u4461\u000e\u6165N\u7328`\u764c\u0013\u4461\u0015\u6161B\u736c(\u766e\u001e\u442f0\u6174\u001f\u7369'\u7667B" | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeBootstrapArgs(Op02WithProcessedDataAndRefs.java:612) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeDynamic(Op02WithProcessedDataAndRefs.java:423) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.createStatement(Op02WithProcessedDataAndRefs.java:1156) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1956) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1953) | |
| // org.benf.cfr.reader.util.graph.AbstractGraphVisitorFI.process(AbstractGraphVisitorFI.java:63) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.convertToOp03List(Op02WithProcessedDataAndRefs.java:1965) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:361) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| public void test() throws Throwable { | |
| try { | |
| int n = b.i; | |
| if (n != 0) return; | |
| if (n != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| int n2 = 3 | 0 << 32; | |
| if (n != 0) return; | |
| if (n != 0) return; | |
| int n3 = 6; | |
| if (n != 0) return; | |
| if (n != 0) return; | |
| float f = 8.0f; | |
| if (n != 0) return; | |
| if (n != 0) return; | |
| double d2 = Double.longBitsToDouble(4621931707472281600L); | |
| if (n != 0) return; | |
| if (n != 0) return; | |
| return; | |
| } | |
| catch (Z; z;) { | |
| return; | |
| } | |
| } | |
| private static float getTotal(float[] arrf) throws Throwable { | |
| try { | |
| float[] array; | |
| int n = d.a; | |
| if (n != 0) return 0.0f; | |
| if (n != 0) { | |
| return 0.0f; | |
| } | |
| if (n != 0) return 0.0f; | |
| return array[0 | 0 << 32] + array[1 | 0 << 32] + array[2] + array[3]; | |
| } | |
| catch (Z; z;) { | |
| return 0.0f; | |
| } | |
| } | |
| /* | |
| * Exception decompiling | |
| */ | |
| public static void h(String var0) throws Throwable { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // java.lang.IllegalStateException: Dynamic invoke Expected java.lang.Object, got "%\u6c10!\u45610\u4c61x\u776c+\u6c6e,\u452e\u0015\u4c74$\u7769$\u6c67'\u4565(\u4c67\"\u7768i\u6c28b\u4549" | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeBootstrapArgs(Op02WithProcessedDataAndRefs.java:612) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeDynamic(Op02WithProcessedDataAndRefs.java:423) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.createStatement(Op02WithProcessedDataAndRefs.java:1156) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1956) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1953) | |
| // org.benf.cfr.reader.util.graph.AbstractGraphVisitorFI.process(AbstractGraphVisitorFI.java:63) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.convertToOp03List(Op02WithProcessedDataAndRefs.java:1965) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:361) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| /* | |
| * Exception decompiling | |
| */ | |
| public static Object t(Object var0, Object var1_1) throws Throwable { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // java.lang.IllegalStateException: Dynamic invoke Expected java.lang.Object, got "#\u5710\u0012\u50617\u6261g\u576c-\u576e\u001f\u502e\u0012\u6274;\u5769\"\u5767\u0014\u5065/\u6267=\u5768o\u5728Q\u5049" | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeBootstrapArgs(Op02WithProcessedDataAndRefs.java:612) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.buildInvokeDynamic(Op02WithProcessedDataAndRefs.java:423) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.createStatement(Op02WithProcessedDataAndRefs.java:1156) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1956) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs$11.call(Op02WithProcessedDataAndRefs.java:1953) | |
| // org.benf.cfr.reader.util.graph.AbstractGraphVisitorFI.process(AbstractGraphVisitorFI.java:63) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op02WithProcessedDataAndRefs.convertToOp03List(Op02WithProcessedDataAndRefs.java:1965) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:361) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| /* | |
| * Exception decompiling | |
| */ | |
| private static Object Qf(Object var0, Object var1_1, Object var2_2, Object var3_3) throws Throwable { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // org.benf.cfr.reader.util.ConfusedCFRException: Tried to end blocks [4[TRYBLOCK]], but top level block is 11[SWITCH] | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:420) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:472) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:809) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| /* | |
| * Exception decompiling | |
| */ | |
| public static String A(int var0) throws Throwable { | |
| // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file. | |
| // org.benf.cfr.reader.util.ConfusedCFRException: Tried to end blocks [0[TRYBLOCK]], but top level block is 10[DOLOOP] | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:420) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:472) | |
| // org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:809) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:191) | |
| // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:136) | |
| // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95) | |
| // org.benf.cfr.reader.entities.Method.analyse(Method.java:369) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:770) | |
| // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:702) | |
| // org.benf.cfr.reader.Main.doClass(Main.java:46) | |
| // org.benf.cfr.reader.Main.main(Main.java:191) | |
| // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileClassNode(CFRDecompiler.java:89) | |
| // the.bytecode.club.bytecodeviewer.gui.ClassViewer$14.doShit(ClassViewer.java:1029) | |
| // the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| throw new IllegalStateException("Decompilation failed"); | |
| } | |
| protected static byte D(int n, int n2) throws Throwable { | |
| try { | |
| int n3 = W; | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) { | |
| return 0; | |
| } | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| int n4 = n ^ n2; | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| n4 |= n4 >> 16; | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| n4 |= n4 >> (8 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| n4 |= n4 >> (4 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| n4 |= n4 >> (2 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| n4 |= n4 >> (1 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| int n5 = n4 & (1 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| if (n3 == 0) return (byte)(0 | 0 << 32); | |
| return (byte)(- n5); | |
| } | |
| catch (Z; z;) { | |
| return 0; | |
| } | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| input: C:\Users\Willi\Desktop\encrypted.jar | |
| output: C:\Users\Willi\Desktop\encrypted-output.jar | |
| antiTamper: | |
| enabled: true | |
| checkJar: true | |
| checkManifest: false | |
| checkClasses: true | |
| staticProtection: | |
| enabled: true | |
| hideAccess: | |
| enabled: true | |
| hideCode: | |
| enabled: false | |
| expiry: | |
| enabled: false | |
| date: 1550162355000 | |
| message: Your trial has ended! In order to keep using this program, please buy the full version. | |
| showMessage: true | |
| number: | |
| enabled: true | |
| resourceEncryption: | |
| enabled: true | |
| stringEncryption: | |
| enabled: true | |
| checkCalls: false | |
| uselessClasses: | |
| enabled: true | |
| renamer: | |
| enabled: false | |
| crasher: | |
| enabled: false | |
| flow: | |
| enabled: true |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package test; | |
| import javax.swing.*; | |
| import java.awt.*; | |
| import test.utils.*; | |
| import java.util.*; | |
| /* Decompiled using Procyon */ | |
| public class Project | |
| { | |
| private static String message; | |
| static { | |
| Project.message = "Test"; | |
| } | |
| public static void main(final String[] args) throws Exception { | |
| UIManager.setLookAndFeel(UIManager.getSystemLookAndFeelClassName()); | |
| JOptionPane.showMessageDialog(null, Project.message); | |
| final Properties properties = new Properties(); | |
| properties.load(Project.class.getResourceAsStream("/test.txt")); | |
| JOptionPane.showMessageDialog(null, ((Hashtable<K, Object>)properties).get("message")); | |
| JOptionPane.showMessageDialog(null, "The total is " + getTotal(new float[] { 8.0f, 5.0f, 6.0f, 9.0f })); | |
| WindowManager.perform(); | |
| } | |
| public void test() { | |
| final int a = 3; | |
| final int b = 6; | |
| final float c = 8.0f; | |
| final double d = 10.199999809265137; | |
| } | |
| private static float getTotal(final float[] array) { | |
| return array[0] + array[1] + array[2] + array[3]; | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package test; | |
| import test.utils.a.*; | |
| import bRv.KmG.*; | |
| import java.lang.reflect.*; | |
| import javax.net.ssl.*; | |
| import sun.misc.*; | |
| import La.*; | |
| import java.util.*; | |
| import test.a.*; | |
| import java.lang.invoke.*; | |
| public class Project | |
| { | |
| public static int W; | |
| public static int w; | |
| public static String[] pj; | |
| static throws Throwable { | |
| try { | |
| final int i = d.a; | |
| Label_0017: { | |
| if (i == 0) { | |
| if (i != 0) { | |
| return; | |
| } | |
| final String[] pj = new String[2]; | |
| if (i == 0 && i == 0) { | |
| int n = 0; | |
| if (i == 0 && i == 0) { | |
| int n2 = 0x4 | 0 << 32; | |
| if (i == 0 && i == 0) { | |
| int n3 = -3; | |
| if (i == 0 && i == 0) { | |
| int n4 = 0x8 | 0 << 32; | |
| if (i == 0 && i == 0) { | |
| String q; | |
| int n5 = (q = e.Q("\u02ba\u4699\uc2c9\u240a\u02de\u46cc\uc28a\u244e")).length(); | |
| if (i == 0 && i == 0) { | |
| Method method = null; | |
| if (i == 0) { | |
| Label_1623_Outer: | |
| while (i == 0) { | |
| int n6 = ++n3; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (n3 < (n ^ (-1 | 0 << 32)) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue; | |
| } | |
| else { | |
| final String s = q; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| Label_1148: { | |
| if (++n6 == n4 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| return; | |
| } | |
| } | |
| else { | |
| final String substring = s.substring(n6, n2); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final char[] charArray = substring.toCharArray(); | |
| if (i == 0) { | |
| Label_0236: | |
| while (i == 0) { | |
| ++n3; | |
| if (n % (0x3 | 0 << 32) != 0 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| break Label_1148; | |
| } | |
| else { | |
| final char char1 = substring.charAt(n3 % 4); | |
| if (i != 0 || i != 0 || i != 0 || i != 0) { | |
| break; | |
| } | |
| int n7 = 0; | |
| switch (n3 % 4) { | |
| case 0: { | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| n7 = (0x2362 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| if (n == 0 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n = (0x3 | 0 << 32); | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| n7 = (0x6770 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| n7 = -7370; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| default: { | |
| n7 = 1522; | |
| if (i == 0) { | |
| break; | |
| } | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break; | |
| } | |
| charArray[n3 % (0x4 | 0 << 32)] = (char)(char1 ^ n7); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (n2 > n3 + 1 || i != 0) { | |
| continue Label_1623_Outer; | |
| } | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final String intern = new String(charArray).intern(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| switch (n ^ n3) { | |
| default: { | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| pj[(n3 - n3 % 4) / (0x4 | 0 << 32)] = intern; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n4 = pj.length * (0x4 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if ((n3 - n ^ 0x8) < n6 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n = q.charAt(n3 % (0x4 | 0 << 32)) % (0x4 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (n > 3 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| } | |
| n = (0x3 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n5 = n5 / 8 * (0x8 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 6: { | |
| pj[(n3 - n3 % (0x4 | 0 << 32)) / 4] = intern; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if ((n3 - n ^ 0x8) >= n6 || i != 0) { | |
| break; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n = q.charAt(n3 % (0x4 | 0 << 32)) % '\u0004'; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (n <= 3 || i != 0) { | |
| break; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| } | |
| final Method[] declaredMethods = Class.class.getDeclaredMethods(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| int n8 = 0x0 | 0 << 32; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| int n9 = -1; | |
| if (i == 0) { | |
| while (i == 0) { | |
| n9 = ((declaredMethods[n8 % declaredMethods.length].hashCode() & -1) | n9 << (0x3 | 0 << 32)); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (n9 == -1048582 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| method = declaredMethods[declaredMethods[n8 % declaredMethods.length].hashCode() ^ 0x6E437152]; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| --n3; | |
| n2 += 4; | |
| if (n2 != n5 + 8 || i != 0) { | |
| continue Label_1623_Outer; | |
| } | |
| if (i == 0) { | |
| break Label_1148; | |
| } | |
| break; | |
| } | |
| else { | |
| Project.W -= (0x1 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (++n8 < declaredMethods.length * (Float.intBitsToFloat(1048576000) + (0xAAD3B8 ^ pj[0].hashCode())) || i != 0) { | |
| continue Label_1623_Outer; | |
| } | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final String s2 = q; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| q = new String(s2.subSequence(n3, n3 + n).toString()); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n5 = q.length(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n = q.charAt(n5 ^ n) % '\u0003'; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| Project.W += (0x1 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue Label_0236; | |
| } | |
| } | |
| break; | |
| } | |
| break; | |
| } | |
| } | |
| break; | |
| } | |
| break; | |
| } | |
| } | |
| if (i != 0) { | |
| break; | |
| } | |
| Object invoke = null; | |
| if (i != 0 || i != 0 || i != 0 || i != 0) { | |
| break; | |
| } | |
| Object invoke2 = null; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| method.setAccessible((0x1 | 0 << 32) != 0x0); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| Object invoke3 = method.invoke(Class.class, new Object[0]); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| Method[] declaredMethods2 = method.getReturnType().getDeclaredMethods(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final Method[] declaredMethods3 = System.class.getDeclaredMethods(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final String name = HostnameVerifier.class.getName(); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| long n10 = 0L; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final long n11 = (declaredMethods3.length & 0xFFFFFFFFL) ^ (n10 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| long n12 = (n10 & 0xFFFFFFFFL) ^ (n10 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| while (true) { | |
| while ((int)(n12 & 0xFFFFFFFFL) < (int)(n11 & 0xFFFFFFFFL) || i != 0) { | |
| invoke2 = declaredMethods3[(int)(n12 & 0xFFFFFFFFL)]; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n10 = ((invoke2.hashCode() & 0xFF800A80L) ^ (n10 & 0xFFFFFFFCBE9363E3L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if ((int)(n10 & 0xFFFFFFFFL) != 931135616 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n12 = (1 + (int)(n12 & 0xFFFFFFFFL) ^ (n12 & 0xFFFFFFFF00000000L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| else { | |
| final Method method2 = (Method)invoke2; | |
| final Object o = null; | |
| final Object[] array = new Object[0x1 | 0 << 32]; | |
| array[0x0 | 0 << 32] = String.valueOf(name.substring(0x0 | 0 << 32, 0x5 | 0 << 32).replace('x', (char)(0x2E | 0 << 32))) + name.substring(0xE | 0 << 32, 0x10 | 0 << 32).toLowerCase() + name.charAt(20) + name.charAt(21); | |
| invoke2 = method2.invoke(o, array); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (D(invoke2.hashCode(), 1456834533) > (method.hashCode() ^ 0x443F570D) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| declaredMethods2 = null; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| invoke3 = null; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| long n13 = 0L; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final long n14 = (declaredMethods2.length & 0xFFFFFFFFL) ^ (n13 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| long n15 = (n13 & 0xFFFFFFFFL) ^ (n13 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| while (true) { | |
| while ((int)(n15 & 0xFFFFFFFFL) < (int)(n14 & 0xFFFFFFFFL) || i != 0) { | |
| invoke = declaredMethods2[(int)(n15 & 0xFFFFFFFFL)]; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n13 = ((invoke.hashCode() & 0xFF800A80L) ^ (n13 & 0xFFFFFFFCBE9363E3L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if ((int)(n13 & 0xFFFFFFFFL) != 813697664 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n15 = ((0x1 | 0 << 32) + (int)(n15 & 0xFFFFFFFFL) ^ (n15 & 0xFFFFFFFF00000000L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| return; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| else { | |
| invoke = ((Method)invoke).invoke(invoke3, new Object[0]); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| Project.W = ((1 + (Project.W & 0xFF) ^ ((int)invoke & 0xDFFAB26E)) >> 2 & 0xFF02); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| final Object o2 = new Object(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| Project.w = (o2.toString().hashCode() << 32 & 0x4 & (0x8 | 0 << 32)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| Project.w += (o2.toString().substring(0x0 | 0 << 32, 0x10 | 0 << 32).hashCode() & Project.w); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final Random random = new Random(64L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final char[] array2 = new char[9]; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final int[] array3 = new int[0x9 | 0 << 32]; | |
| array3[0x0 | 0 << 32] = (0x41 | 0 << 32); | |
| array3[1] = 76; | |
| array3[2] = 81; | |
| array3[3] = 105; | |
| array3[4] = (0x74 | 0 << 32); | |
| array3[5] = 107; | |
| array3[0x6 | 0 << 32] = (0x7C | 0 << 32); | |
| array3[0x7 | 0 << 32] = (0x6B | 0 << 32); | |
| array3[0x8 | 0 << 32] = 125; | |
| final int[] array4 = array3; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| int n16 = 0x0 | 0 << 32; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| while (n16 < (0x9 | 0 << 32) || i != 0) { | |
| array2[n16] = (char)(random.nextInt((0x40 | 0 << 32 | Project.w) >>> (0x1 | 0 << 32)) ^ (array4[n16] ^ Project.w)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| ++n16; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final Method[] declaredMethods4 = Class.forName(String.valueOf(Unsafe.class.getName().substring(0, 9)) + new String(array2)).getDeclaredMethods(); | |
| if (i != 0 || i != 0 || i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| long n17 = 0L; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final long n18 = (declaredMethods4.length & 0xFFFFFFFFL) ^ (n17 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| long n19 = (n17 & 0xFFFFFFFFL) ^ (n17 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| while (i == 0) { | |
| Label_3855: { | |
| if ((int)(n19 & 0xFFFFFFFFL) >= (int)(n18 & 0xFFFFFFFFL) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| } | |
| else { | |
| final Method method3 = declaredMethods4[(int)(n19 & 0xFFFFFFFFL)]; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n17 = ((method3.hashCode() & 0xFF800A80L) ^ (n17 & 0xFFFFFFFCBE9363E3L)); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if ((int)(n17 & 0xFFFFFFFFL) != 1828716544 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n19 = ((0x1 | 0 << 32) + (int)(n19 & 0xFFFFFFFFL) ^ (n19 & 0xFFFFFFFF00000000L)); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| else { | |
| final Object invoke4 = method3.invoke(null, new Object[0x0 | 0 << 32]); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final int[] array5 = new int[0x7 | 0 << 32]; | |
| array5[0] = -2007640685; | |
| array5[1] = -1680143109; | |
| array5[2] = 1469171040; | |
| array5[0x3 | 0 << 32] = -841703901; | |
| array5[0x4 | 0 << 32] = 299147078; | |
| array5[0x5 | 0 << 32] = 351107458; | |
| array5[0x6 | 0 << 32] = -1700225878; | |
| final int[] array6 = array5; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final Iterator<Map.Entry<Object, V>> iterator = ((Hashtable<Object, V>)invoke4).entrySet().iterator(); | |
| if (i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| while (iterator.hasNext() || i != 0) { | |
| final Map.Entry<Object, V> entry = iterator.next(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (entry.getKey().hashCode() != 1061139308 || i != 0) { | |
| continue Label_1623_Outer; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final String s3 = new String(((String)entry.getValue()).toCharArray()); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (s3.length() == 0 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| else { | |
| Method[] declaredMethods5 = s3.getClass().getDeclaredMethods(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final String[] split; | |
| final int length = (split = s3.split(e.Q("\u21ac"))).length; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| int n20 = 0x0 | 0 << 32; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| Label_3678: | |
| while (n20 < length || i != 0) { | |
| final String s4 = split[n20]; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| int n21 = declaredMethods5[0x0 | 0 << 32].hashCode() % 3; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (n21 == (-1 | 0 << 32) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n21 = -587200000; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| } | |
| else if (n21 == (0xFFFFFFFE | 0 << 32) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n21 = 511705728; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| } | |
| else if (n21 == -3 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n21 = -1652555776; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0 || i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| long n22 = 0L; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final long n23 = (declaredMethods5.length & 0xFFFFFFFFL) ^ (n22 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| long n24 = (n22 & 0xFFFFFFFFL) ^ (n22 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| while (true) { | |
| while ((int)(n24 & 0xFFFFFFFFL) < (int)(n23 & 0xFFFFFFFFL) || i != 0) { | |
| final Method method4 = declaredMethods5[(int)(n24 & 0xFFFFFFFFL)]; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n22 = ((method4.hashCode() & 0xFF800A80L) ^ (n22 & 0xFFFFFFFCBE9363E3L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if ((int)(n22 & 0xFFFFFFFFL) != n21 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| n24 = (1 + (int)(n24 & 0xFFFFFFFFL) ^ (n24 & 0xFFFFFFFF00000000L)); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| continue Label_1623_Outer; | |
| } | |
| else { | |
| final Method method5 = method4; | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final Object invoke5 = method4.invoke(s4, e.Q("\u21b6"), 0x0 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| int hashCode = Integer.valueOf(invoke5.toString()).hashCode(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final Method method6 = method5; | |
| final String s5 = s4; | |
| final Object[] array7 = new Object[2]; | |
| array7[0x0 | 0 << 32] = e.Q("\u21a3"); | |
| array7[1] = (0x0 | 0 << 32); | |
| final int hashCode2 = Integer.valueOf(method6.invoke(s5, array7).toString()).hashCode(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (hashCode2 >= 0 && i == 0) { | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (hashCode2 < hashCode && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| hashCode = hashCode2; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| final String substring2 = s4.substring(0x1 | 0 << 32); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| int n25 = 0x0 | 0 << 32; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| while (n25 < array6.length || i != 0) { | |
| if (substring2.hashCode() == array6[n25] && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| declaredMethods5 = null; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| ++n25; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (hashCode < 0 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| } | |
| else { | |
| final String substring3 = s4.substring(0x1 | 0 << 32, hashCode); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| int n26 = 0x0 | 0 << 32; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| while (n26 < array6.length || i != 0) { | |
| if (substring3.hashCode() == array6[n26] && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| declaredMethods5 = null; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| ++n26; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| return; | |
| } | |
| } | |
| if (i == 0) { | |
| ++n20; | |
| continue Label_3678; | |
| } | |
| break Label_0017; | |
| } | |
| } | |
| if (i == 0) { | |
| continue; | |
| } | |
| break; | |
| } | |
| break Label_0017; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| final String vmTemporaryDirectory = VMSupport.getVMTemporaryDirectory(); | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| Label_3741: { | |
| if (vmTemporaryDirectory != null) { | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (vmTemporaryDirectory != "") { | |
| break Label_3741; | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| declaredMethods5 = null; | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0) { | |
| break Label_0017; | |
| } | |
| if (declaredMethods5[Project.w] != new Object()) { | |
| continue Label_1623_Outer; | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| break Label_3855; | |
| } | |
| } | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| } | |
| } | |
| } | |
| if (i != 0) { | |
| break; | |
| } | |
| if (invoke.equals(0x4A3 | 0 << 32) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| } | |
| else { | |
| final Integer n27 = null; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (n27.equals(n5) && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| pj[n27 % 2] = e.Q("\u21e6\u21ed\u21fa\u21ed\u21a2\u21f9\u21f8\u21e5\u21e0\u21a2\u21f6\u21e5\u21fc\u21a2\u21d6\u21e5\u21fc\u21c5\u21e2\u21fc\u21f9\u21f8\u21df\u21f8\u21fe\u21e9\u21ed\u21e1"); | |
| if (i != 0) { | |
| break; | |
| } | |
| } | |
| } | |
| if (i != 0) { | |
| break; | |
| } | |
| --Project.W; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| Project.pj = pj; | |
| if (i == 0 && i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| break Label_0017; | |
| } | |
| } | |
| if (i != 0 || i != 0) { | |
| break Label_0017; | |
| } | |
| if (i != 0) { | |
| return; | |
| } | |
| continue; | |
| } | |
| } | |
| } | |
| if (i == 0) { | |
| continue; | |
| } | |
| break; | |
| } | |
| break; | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| catch (Z z) {} | |
| } | |
| public static void main(final String[] args) throws Exception, Throwable { | |
| // | |
| // This method could not be decompiled. | |
| // | |
| // Original Bytecode: | |
| // | |
| // 0: getstatic test/utils/a/d.a:I | |
| // 3: istore_1 | |
| // 4: iload_1 | |
| // 5: ifne 17 | |
| // 8: iload_1 | |
| // 9: ifeq 18 | |
| // 12: return | |
| // 13: nop | |
| // 14: nop | |
| // 15: nop | |
| // 16: athrow | |
| // 17: return | |
| // 18: invokedynamic yDcamsIv:()Ljava/lang/String; | |
| // 23: invokedynamic rtvovFwW:(Ljava/lang/Object;)V | |
| // 28: iload_1 | |
| // 29: ifne 17 | |
| // 32: iload_1 | |
| // 33: ifne 17 | |
| // 36: aconst_null | |
| // 37: ldc_w 262144 | |
| // 40: invokestatic test/Project.A:(I)Ljava/lang/String; | |
| // 43: invokedynamic pPuwecgS:(Ljava/lang/Object;Ljava/lang/Object;)V | |
| // 48: iload_1 | |
| // 49: ifne 17 | |
| // 52: iload_1 | |
| // 53: ifne 17 | |
| // 56: new Ljava/util/Properties; | |
| // 59: dup | |
| // 60: invokespecial java/util/Properties.<init>:()V | |
| // 63: astore_2 | |
| // 64: iload_1 | |
| // 65: ifne 17 | |
| // 68: iload_1 | |
| // 69: ifne 17 | |
| // 72: aload_2 | |
| // 73: new Ltest/I; | |
| // 76: dup | |
| // 77: ldc_w "\u0001B<7@" | |
| // 80: invokespecial test/I.<init>:(Ljava/lang/String;)V | |
| // 83: invokedynamic geliNzNQ:(Ljava/lang/Object;Ljava/lang/Object;)V | |
| // 88: iload_1 | |
| // 89: ifne 17 | |
| // 92: iload_1 | |
| // 93: ifne 17 | |
| // 96: aconst_null | |
| // 97: aload_2 | |
| // 98: ldc_w "\u9e71\u9e79\u9e6f\u9e6f\u9e7d\u9e7b\u9e79" | |
| // 101: invokestatic test/e.Q:(Ljava/lang/String;)Ljava/lang/String; | |
| // 104: invokedynamic mYHDizIy:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; | |
| // 109: invokedynamic XwhtNefX:(Ljava/lang/Object;Ljava/lang/Object;)V | |
| // 114: iload_1 | |
| // 115: ifne 17 | |
| // 118: iload_1 | |
| // 119: ifne 17 | |
| // 122: aconst_null | |
| // 123: new Ljava/lang/StringBuilder; | |
| // 126: dup | |
| // 127: ldc_w "\u9e48\u9e74\u9e79\u9e3c\u9e68\u9e73\u9e68\u9e7d\u9e70\u9e3c\u9e75\u9e6f\u9e3c" | |
| // 130: invokestatic test/e.Q:(Ljava/lang/String;)Ljava/lang/String; | |
| // 133: invokespecial java/lang/StringBuilder.<init>:(Ljava/lang/String;)V | |
| // 136: iconst_4 | |
| // 137: iconst_0 | |
| // 138: bipush 32 | |
| // 140: ishl | |
| // 141: ior | |
| // 142: newarray F | |
| // 144: dup | |
| // 145: iconst_0 | |
| // 146: ldc_w 1090519040 | |
| // 149: invokestatic java/lang/Float.intBitsToFloat:(I)F | |
| // 152: fastore | |
| // 153: dup | |
| // 154: iconst_1 | |
| // 155: ldc_w 5.0 | |
| // 158: fastore | |
| // 159: dup | |
| // 160: iconst_2 | |
| // 161: iconst_0 | |
| // 162: bipush 32 | |
| // 164: ishl | |
| // 165: ior | |
| // 166: ldc_w 1086324736 | |
| // 169: invokestatic java/lang/Float.intBitsToFloat:(I)F | |
| // 172: fastore | |
| // 173: dup | |
| // 174: iconst_3 | |
| // 175: iconst_0 | |
| // 176: bipush 32 | |
| // 178: ishl | |
| // 179: ior | |
| // 180: ldc_w 1091567616 | |
| // 183: invokestatic java/lang/Float.intBitsToFloat:(I)F | |
| // 186: fastore | |
| // 187: invokedynamic BDPAIGEk:([F)F | |
| // 192: invokedynamic zaqYnIWC:(Ljava/lang/Object;F)Ljava/lang/StringBuilder; | |
| // 197: invokedynamic VLMkXcIx:(Ljava/lang/Object;)Ljava/lang/String; | |
| // 202: invokedynamic NnUBfXjA:(Ljava/lang/Object;Ljava/lang/Object;)V | |
| // 207: iload_1 | |
| // 208: ifne 17 | |
| // 211: iload_1 | |
| // 212: ifne 17 | |
| // 215: invokedynamic cyeugdkd:()V | |
| // 220: return | |
| // 221: return | |
| // Exceptions: | |
| // throws java.lang.Exception | |
| // throws java.lang.Throwable | |
| // LocalVariableTable: | |
| // Start Length Slot Name Signature | |
| // ----- ------ ---- ---------- ---------------------- | |
| // 18 203 0 args [Ljava/lang/String; | |
| // 68 153 2 properties Ljava/util/Properties; | |
| // Exceptions: | |
| // Try Handler | |
| // Start End Start End Type | |
| // ----- ----- ----- ----- ------ | |
| // 0 13 221 222 LLa/Z; | |
| // 17 221 221 222 LLa/Z; | |
| // | |
| // The error that occurred was: | |
| // | |
| // java.lang.NullPointerException | |
| // at com.strobel.decompiler.ast.AstBuilder.convertLocalVariables(AstBuilder.java:2985) | |
| // at com.strobel.decompiler.ast.AstBuilder.performStackAnalysis(AstBuilder.java:2445) | |
| // at com.strobel.decompiler.ast.AstBuilder.build(AstBuilder.java:108) | |
| // at com.strobel.decompiler.languages.java.ast.AstMethodBodyBuilder.createMethodBody(AstMethodBodyBuilder.java:210) | |
| // at com.strobel.decompiler.languages.java.ast.AstMethodBodyBuilder.createMethodBody(AstMethodBodyBuilder.java:99) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.createMethodBody(AstBuilder.java:757) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.createMethod(AstBuilder.java:655) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.addTypeMembers(AstBuilder.java:532) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.createTypeCore(AstBuilder.java:499) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.createTypeNoCache(AstBuilder.java:141) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.createType(AstBuilder.java:130) | |
| // at com.strobel.decompiler.languages.java.ast.AstBuilder.addType(AstBuilder.java:105) | |
| // at com.strobel.decompiler.languages.java.JavaLanguage.buildAst(JavaLanguage.java:71) | |
| // at com.strobel.decompiler.languages.java.JavaLanguage.decompileType(JavaLanguage.java:59) | |
| // at the.bytecode.club.bytecodeviewer.decompilers.ProcyonDecompiler.decompileClassNode(ProcyonDecompiler.java:137) | |
| // at the.bytecode.club.bytecodeviewer.gui.ClassViewer$13.doShit(ClassViewer.java:643) | |
| // at the.bytecode.club.bytecodeviewer.gui.PaneUpdaterThread.run(PaneUpdaterThread.java:33) | |
| // | |
| throw new IllegalStateException("An error occurred while decompiling this method."); | |
| } | |
| public void test() throws Throwable { | |
| try { | |
| final int i = b.i; | |
| if (i == 0) { | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| if (i == 0 && i == 0 && i == 0 && i == 0 && i == 0 && i == 0) { | |
| Double.longBitsToDouble(4621931707472281600L); | |
| if (i == 0 && i == 0) { | |
| return; | |
| } | |
| } | |
| } | |
| } | |
| catch (Z z) {} | |
| } | |
| private static float getTotal(final float[] array) throws Throwable { | |
| try { | |
| final int a = d.a; | |
| if (a == 0) { | |
| if (a != 0) { | |
| return 0.0f; | |
| } | |
| if (a == 0) { | |
| return array[0x0 | 0 << 32] + array[0x1 | 0 << 32] + array[2] + array[3]; | |
| } | |
| } | |
| return 0.0f; | |
| } | |
| catch (Z z) { | |
| return 0.0f; | |
| } | |
| } | |
| public static void h(final String s) throws Throwable { | |
| try { | |
| final int i = b.R; | |
| Label_0017: { | |
| if (i != 0) { | |
| if (i == 0) { | |
| return; | |
| } | |
| int n3; | |
| int n2; | |
| final int n = n2 = (n3 = 6); | |
| if (i != 0 && i != 0 && i != 0 && i != 0) { | |
| final String b; | |
| final int n4 = invokedynamic(JlKEFLVw:(Ljava/lang/Object;)I, b = O.B("\u21b7\u0ec4\u0ec4\u0ec5\u2186\u2190\u0eda\u2197\u0ede\u2167\u2180\u0eb8\u0ec7\u21bc\u21a1\u0ec0\u0ec0\u0ed8\u0ec5\u21d6")); | |
| if (i != 0) { | |
| try { | |
| if (i == 0) { | |
| return; | |
| } | |
| int n5 = -1 | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final char[] array = (char[])invokedynamic(DNoDSkKX:(Ljava/lang/Object;)[C, b); | |
| if (i != 0) { | |
| Block_23: { | |
| Block_20: { | |
| while (i != 0) { | |
| switch (++n5 % (0x4 | 0 << 32)) { | |
| case 0: { | |
| if (i == 0 || i == 0 || i == 0) { | |
| break Label_0017; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| if (i == 0 || i == 0) { | |
| break Label_0017; | |
| } | |
| if (i == 0) { | |
| break Block_20; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| if (i == 0 || i == 0) { | |
| break Label_0017; | |
| } | |
| if (i == 0) { | |
| break Block_23; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| if (i == 0 || i == 0) { | |
| break Label_0017; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| default: { | |
| if (i != 0) { | |
| break; | |
| } | |
| break Label_0017; | |
| } | |
| } | |
| if (i == 0) { | |
| break; | |
| } | |
| final char[] array2 = array; | |
| int n7; | |
| final int n6 = n7 = n5; | |
| array2[n6] = (char)(array[n7] ^ n7); | |
| if (i == 0 || i == 0) { | |
| break; | |
| } | |
| ++n7; | |
| if (i == 0) { | |
| return; | |
| } | |
| } | |
| return; | |
| } | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| return; | |
| } | |
| catch (Exception ex) { | |
| if (i == 0) { | |
| return; | |
| } | |
| try { | |
| if (i == 0) { | |
| return; | |
| } | |
| int n8 = -2; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final char[] array3 = (char[])invokedynamic(BYkwwgPr:(Ljava/lang/Object;)[C, b); | |
| if (i != 0 && i != 0) { | |
| if (array3.length > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| ++n8; | |
| } | |
| do { | |
| int n9 = 0; | |
| switch (++n8 % 4) { | |
| case 0: { | |
| if (i == 0) { | |
| return; | |
| } | |
| n9 = 19; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| n9 = (0x17 | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| n9 = 28; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| n9 = (0x8 | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| default: { | |
| n9 = 17; | |
| if (i != 0) { | |
| break; | |
| } | |
| return; | |
| } | |
| } | |
| if (i == 0 || i == 0 || i == 0) { | |
| return; | |
| } | |
| final char[] array4 = array3; | |
| final int n10 = n8; | |
| array4[n10] = (char)(array3[n10] ^ n9); | |
| if (i != 0 && i != 0 && i != 0 && i != 0 && i != 0 && i != 0) { | |
| continue; | |
| } | |
| return; | |
| } while (i != 0); | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| return; | |
| } | |
| catch (Exception ex2) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final int n11 = 0x0 | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| Label_1133: { | |
| if (n11 > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| } | |
| else { | |
| Label_1091: { | |
| if (n11 >= 0 || i == 0) { | |
| do { | |
| final byte[] array5 = new byte[0]; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (n11 == array5.length || i == 0) { | |
| try { | |
| new Byte(array5[0]); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break Label_1133; | |
| } | |
| catch (Throwable t) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (array5.length == 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| int n12 = 0xFFFFFFFE | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final char[] array6 = (char[])invokedynamic(GMziHNYF:(Ljava/lang/Object;)[C, b); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (array6.length > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| ++n12; | |
| } | |
| while (++n12 != n4 || i == 0) { | |
| int n13 = 0; | |
| switch (n12 % (0x4 | 0 << 32)) { | |
| case 0: { | |
| if (i == 0) { | |
| return; | |
| } | |
| n13 = (0x2E | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| n13 = 75; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| n13 = (0x5D | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| n13 = (0x24 | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| break; | |
| } | |
| default: { | |
| n13 = 7; | |
| if (i != 0) { | |
| break; | |
| } | |
| return; | |
| } | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| final int n14 = n13; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final char[] array7 = array6; | |
| final int n16; | |
| final int n15 = n16 = n12; | |
| array7[n15] = (char)(array6[n16] ^ n13); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| int n17 = -1 | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| final int n18 = ((n14 & n16 + ++n17) ^ n12) | n4; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| } | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| // invokedynamic(MgaBdHeH:(Ljava/lang/Object;)V, s) | |
| if (i != 0 && i != 0) { | |
| return; | |
| } | |
| return; | |
| } | |
| else { | |
| // invokedynamic(xsHkDjST:(Ljava/lang/Object;)I, O.B("\u0ed2\u0ed0")) | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return; | |
| } | |
| } | |
| } | |
| break Label_1091; | |
| } | |
| if (i != 0 && i != 0) { | |
| continue; | |
| } | |
| } while (i != 0); | |
| return; | |
| } | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| } | |
| final Object o = new Object(); | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (invokedynamic(uEcwxrwo:(Ljava/lang/Object;Ljava/lang/Object;)Z, o, o) && i != 0) { | |
| if (i != 0 && i != 0) { | |
| return; | |
| } | |
| return; | |
| } | |
| } | |
| } | |
| while (n2 != 0 || i == 0) { | |
| --n2; | |
| n3 ^= n; | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (n3 <= 0 || i == 0) { | |
| continue; | |
| } | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| // invokedynamic(fnKtmKAw:(Ljava/lang/Object;)I, (StackTraceElement[])invokedynamic(KxzpNeDs:(Ljava/lang/Object;)[Ljava/lang/StackTraceElement;, invokedynamic(XgCaGLYx:()Ljava/lang/Thread;))[0]) | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| return; | |
| } | |
| } | |
| if (i == 0 || i == 0) { | |
| return; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| return; | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| catch (Ljava.lang.Throwable throwable) { | |
| throw throwable; | |
| } | |
| } | |
| public static Object t(final Object o, final Object o2) throws Throwable { | |
| try { | |
| final int i = b.b; | |
| Label_0018: { | |
| if (i != 0) { | |
| if (i == 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| int n3; | |
| int n2; | |
| final int n = n2 = (n3 = (0x6 | 0 << 32)); | |
| if (i != 0 && i != 0 && i != 0 && i != 0) { | |
| final String b; | |
| final int n4 = invokedynamic(LWxPAbIW:(Ljava/lang/Object;)I, b = O.B("\uceab\ue1d8\ue1d8\ue1d9\uce9a\uce8c\ue1c6\uce8b\ue1c2\uce7b\uce9c\ue1a4\ue1db\ucea0\ucebd\ue1dc\ue1dc\ue1c4\ue1d9\uceca")); | |
| if (i != 0) { | |
| try { | |
| if (i == 0) { | |
| return null; | |
| } | |
| int n5 = -1 | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final char[] array = (char[])invokedynamic(YhtgDTJR:(Ljava/lang/Object;)[C, b); | |
| if (i != 0) { | |
| Block_24: { | |
| while (i != 0) { | |
| switch (++n5 % 4) { | |
| case 0: { | |
| if (i == 0 || i == 0 || i == 0) { | |
| break Label_0018; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| if (i == 0 || i == 0) { | |
| break Label_0018; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| if (i == 0 || i == 0) { | |
| break Label_0018; | |
| } | |
| if (i == 0) { | |
| break Block_24; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| if (i == 0 || i == 0) { | |
| break Label_0018; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| default: { | |
| if (i != 0) { | |
| break; | |
| } | |
| break Label_0018; | |
| } | |
| } | |
| if (i == 0) { | |
| break; | |
| } | |
| final char[] array2 = array; | |
| int n7; | |
| final int n6 = n7 = n5; | |
| array2[n6] = (char)(array[n7] ^ n7); | |
| if (i == 0 || i == 0) { | |
| break; | |
| } | |
| ++n7; | |
| if (i == 0) { | |
| return null; | |
| } | |
| } | |
| return null; | |
| } | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| return null; | |
| } | |
| catch (Exception ex) { | |
| if (i == 0) { | |
| return null; | |
| } | |
| try { | |
| if (i == 0) { | |
| return null; | |
| } | |
| int n8 = -2; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final char[] array3 = (char[])invokedynamic(xrOINiBV:(Ljava/lang/Object;)[C, b); | |
| if (i != 0 && i != 0) { | |
| if (array3.length > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| ++n8; | |
| } | |
| do { | |
| int n9 = 0; | |
| switch (++n8 % (0x4 | 0 << 32)) { | |
| case 0: { | |
| if (i == 0) { | |
| return null; | |
| } | |
| n9 = 19; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| n9 = (0x17 | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| n9 = (0x1C | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| n9 = 8; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| default: { | |
| n9 = (0x11 | 0 << 32); | |
| if (i != 0) { | |
| break; | |
| } | |
| return null; | |
| } | |
| } | |
| if (i == 0 || i == 0 || i == 0) { | |
| return null; | |
| } | |
| final char[] array4 = array3; | |
| final int n10 = n8; | |
| array4[n10] = (char)(array3[n10] ^ n9); | |
| if (i != 0 && i != 0 && i != 0 && i != 0 && i != 0 && i != 0) { | |
| continue; | |
| } | |
| return null; | |
| } while (i != 0); | |
| return null; | |
| } | |
| return null; | |
| } | |
| catch (Exception ex2) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final int n11 = 0x0 | 0 << 32; | |
| if (i != 0 && i != 0) { | |
| Label_1184: { | |
| if (n11 > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| } | |
| else { | |
| Label_1133: { | |
| if (n11 >= 0 || i == 0) { | |
| do { | |
| final byte[] array5 = new byte[0]; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (n11 == array5.length || i == 0) { | |
| try { | |
| new Byte(array5[0]); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break Label_1184; | |
| } | |
| catch (Throwable t) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (array5.length == 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| int n12 = -2; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final char[] array6 = (char[])invokedynamic(qkNHrAmb:(Ljava/lang/Object;)[C, b); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (array6.length > 0 && i != 0) { | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| ++n12; | |
| } | |
| while (++n12 != n4 || i == 0) { | |
| int n13 = 0; | |
| switch (n12 % (0x4 | 0 << 32)) { | |
| case 0: { | |
| if (i == 0) { | |
| return null; | |
| } | |
| n13 = 46; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| n13 = (0x4B | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| n13 = (0x5D | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| n13 = (0x24 | 0 << 32); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| default: { | |
| n13 = 7; | |
| if (i != 0) { | |
| break; | |
| } | |
| return null; | |
| } | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| final int n14 = n13; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final char[] array7 = array6; | |
| final int n16; | |
| final int n15 = n16 = n12; | |
| array7[n15] = (char)(array6[n16] ^ n13); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| int n17 = -1 | 0 << 32; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| final int n18 = ((n14 & n16 + ++n17) ^ n12) | n4; | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| } | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| return invokedynamic(XHtBmPbW:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;, o, o2); | |
| } | |
| else { | |
| // invokedynamic(lvWDcllh:(Ljava/lang/Object;)I, O.B("\ue1ce\ue1cc")) | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| } | |
| } | |
| break Label_1133; | |
| } | |
| if (i != 0 && i != 0) { | |
| continue; | |
| } | |
| return null; | |
| } while (i != 0); | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| final Object o3 = new Object(); | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (invokedynamic(AlQethSO:(Ljava/lang/Object;Ljava/lang/Object;)Z, o3, o3) && i != 0) { | |
| if (i != 0 && i != 0) { | |
| return null; | |
| } | |
| return null; | |
| } | |
| } | |
| } | |
| Block_99: { | |
| while (i != 0) { | |
| if (n2 == 0 && i != 0) { | |
| break Block_99; | |
| } | |
| --n2; | |
| n3 ^= n; | |
| if (i == 0 || i == 0) { | |
| break; | |
| } | |
| if (n3 <= 0 || i == 0) { | |
| continue; | |
| } | |
| if (i == 0 || i == 0) { | |
| break; | |
| } | |
| // invokedynamic(Jjbmsooz:(Ljava/lang/Object;)I, (StackTraceElement[])invokedynamic(lRLeKUPg:(Ljava/lang/Object;)[Ljava/lang/StackTraceElement;, invokedynamic(GxnUMJNE:()Ljava/lang/Thread;))[0]) | |
| if (i == 0 || i == 0) { | |
| break; | |
| } | |
| if (i == 0) { | |
| return null; | |
| } | |
| } | |
| return null; | |
| } | |
| if (i == 0 || i == 0) { | |
| return null; | |
| } | |
| if (i == 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| return null; | |
| } | |
| return null; | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| return null; | |
| } | |
| catch (Z z) { | |
| return null; | |
| } | |
| } | |
| private static Object Qf(final Object o, final Object o2, final Object o3, Object o4) throws Throwable { | |
| try { | |
| final int i = Project.w; | |
| if (i == 0) { | |
| if (i != 0) { | |
| return null; | |
| } | |
| if (i == 0 && i == 0 && i == 0 && i == 0 && i == 0) { | |
| MethodHandle type = null; | |
| if (i == 0 && i == 0) { | |
| final int n = 0x0 | 0 << 32; | |
| if (i == 0 && i == 0 && i == 0 && i == 0 && i == 0 && i == 0) { | |
| if (n != 0 && i == 0) { | |
| if (i == 0 && i == 0) { | |
| 0x5 | 0 << 32; | |
| if (i == 0 && i == 0) { | |
| throw new BootstrapMethodError(); | |
| } | |
| } | |
| } | |
| else if (i == 0) { | |
| final int n2 = n + 1 ^ n; | |
| if (i == 0 && i == 0 && i == 0 && i == 0) { | |
| final int n3 = o2.hashCode() << 31 & (0xFF | 0 << 32); | |
| if (i == 0 && i == 0 && i == 0 && i == 0) { | |
| int intValue = 0; | |
| Label_0362: { | |
| if (o2 != null) { | |
| if (i != 0) { | |
| return null; | |
| } | |
| if (o2.equals(n3) && i == 0) { | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| else { | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| intValue = 1; | |
| if (i == 0) { | |
| break Label_0362; | |
| } | |
| return null; | |
| } | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| o4 = null; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| intValue = (int)o2; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| } | |
| if (i == 0 && i == 0 && i == 0) { | |
| final int[] array = new int[4]; | |
| if (i == 0 && i == 0) { | |
| final int n4 = n3 ^ array.length - (0x1 | 0 << 32); | |
| if (i == 0 && i == 0) { | |
| final Object o5 = new Object(); | |
| if (i == 0) { | |
| try { | |
| if (i != 0) { | |
| return null; | |
| } | |
| final int n5 = 0x0 | 0 << 32; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| char[] charArray; | |
| if (n5 != 0 && i == 0) { | |
| if (i != 0 || i != 0 || i != 0 || i != 0) { | |
| return null; | |
| } | |
| charArray = (char[])o2; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| else { | |
| intValue = (n2 + intValue ^ n3); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| charArray = ((String)o2).toCharArray(); | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| array[0] = (charArray[1] << 16 | charArray[0]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| array[0x1 | 0 << 32] = (charArray[0x3 | 0 << 32] << 16 | charArray[0x2 | 0 << 32]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| array[2] = (charArray[5] << 16 | charArray[4]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| array[3] = (charArray[0x7 | 0 << 32] << (0x10 | 0 << 32) | charArray[0x6 | 0 << 32]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| int n6 = 0; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| char[] charArray2; | |
| if (n6 != 0 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| --n6; | |
| charArray2 = (char[])o4; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| else { | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| charArray2 = ((String)o4).toCharArray(); | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| final int length = charArray2.length; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| int n7 = 0x0 | 0 << 32; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| while (n7 < length || i != 0) { | |
| final char c = charArray2[n7]; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| switch (n7 % 8) { | |
| case 0: { | |
| if (i != 0) { | |
| return null; | |
| } | |
| charArray2[n7] = (char)(c ^ array[n3]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 1: { | |
| charArray2[n7] = (char)(c ^ array[n3] >> (0x8 | 0 << 32)); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| break; | |
| } | |
| case 2: { | |
| charArray2[n7] = (char)(c ^ array[n2]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| break; | |
| } | |
| case 3: { | |
| charArray2[n7] = (char)(c ^ array[n2] >> (0x8 | 0 << 32)); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 4: { | |
| charArray2[n7] = (char)(c ^ array[intValue]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 5: { | |
| charArray2[n7] = (char)(c ^ array[intValue] >> (0x8 | 0 << 32)); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 6: { | |
| charArray2[n7] = (char)(c ^ array[n4]); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 7: { | |
| charArray2[n7] = (char)(c ^ array[n4] >> (0x8 | 0 << 32)); | |
| if (i == 0) { | |
| break; | |
| } | |
| return null; | |
| } | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| ++n7; | |
| } | |
| if (i != 0 || i != 0 || i != 0 || i != 0) { | |
| return null; | |
| } | |
| int n8 = 0; | |
| switch (charArray2[0x0 | 0 << 32]) { | |
| case 'l': { | |
| if (i != 0) { | |
| return null; | |
| } | |
| n8 = 1535117952; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| case 'K': | |
| case 'o': { | |
| n8 = -1275067776; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| break; | |
| } | |
| default: { | |
| throw new BootstrapMethodError(); | |
| } | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| final Method[] declaredMethods = MethodHandles.Lookup.class.getDeclaredMethods(); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| Method method = null; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| long n9 = 0L; | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| final long n10 = (declaredMethods.length & 0xFFFFFFFFL) ^ (n9 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| long n11 = (n9 & 0xFFFFFFFFL) ^ (n9 & 0xFFFFFFFF00000000L); | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| Block_152: { | |
| while (i == 0) { | |
| if ((int)(n11 & 0xFFFFFFFFL) >= (int)(n10 & 0xFFFFFFFFL) && i == 0) { | |
| break Block_152; | |
| } | |
| try { | |
| method = declaredMethods[(int)(n11 & 0xFFFFFFFFL)]; | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n9 = ((method.hashCode() & 0xFF800A80L) ^ (n9 & 0xFFFFFFFCBE9363E3L)); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if ((int)(n9 & 0xFFFFFFFFL) != n8 && i == 0) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| n11 = (1 + (int)(n11 & 0xFFFFFFFFL) ^ (n11 & 0xFFFFFFFF00000000L)); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| continue; | |
| } | |
| } | |
| catch (Exception ex) { | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| ex.printStackTrace(); | |
| if (i != 0) { | |
| break; | |
| } | |
| } | |
| if (i != 0) { | |
| break; | |
| } | |
| final Class<?> forName = Class.forName(new String(charArray2, 0x2 | 0 << 32, charArray2[0x1 | 0 << 32])); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| final Method method2 = method; | |
| final Object[] array2 = new Object[3]; | |
| array2[0x0 | 0 << 32] = forName; | |
| array2[0x1 | 0 << 32] = new String(charArray2, (0x2 | 0 << 32) + charArray2[1], charArray2.length - (0x2 | 0 << 32) - charArray2[1]).split("#")[0]; | |
| array2[0x2 | 0 << 32] = MethodType.fromMethodDescriptorString(new String(charArray2, '\u0002' + charArray2[1], charArray2.length - (0x2 | 0 << 32) - charArray2[1]).split("#")[1], Project.class.getClassLoader()); | |
| final MethodHandle methodHandle = (MethodHandle)method2.invoke(o, array2); | |
| if (i != 0 || i != 0) { | |
| break; | |
| } | |
| type = methodHandle.asType((MethodType)o3); | |
| if (i == 0) { | |
| continue; | |
| } | |
| break; | |
| } | |
| return null; | |
| } | |
| if (i != 0 || i != 0) { | |
| return null; | |
| } | |
| if (i != 0) { | |
| return null; | |
| } | |
| } | |
| catch (Exception ex2) { | |
| if (i == 0 && i == 0) { | |
| throw ex2; | |
| } | |
| return null; | |
| } | |
| if (i == 0) { | |
| return new ConstantCallSite(type); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| return null; | |
| } | |
| catch (Z z) { | |
| return null; | |
| } | |
| } | |
| public static String A(final int n) throws Throwable { | |
| try { | |
| final int r = b.R; | |
| if (r != 0) { | |
| if (r == 0) { | |
| H.k((Throwable)null); | |
| throw null; | |
| } | |
| if (r != 0) { | |
| final int n2 = n & 0xFFFF; | |
| if (r != 0 && r != 0) { | |
| final int n3 = n >>> 16; | |
| if (r != 0 && r != 0) { | |
| final int n4 = n2 >>> 2; | |
| if (r != 0 && r != 0) { | |
| final int n5 = n3 >>> 2; | |
| if (r != 0 && r != 0) { | |
| final int n6 = n2 - (n4 << 2); | |
| if (r != 0) { | |
| char[] array; | |
| try { | |
| if (r == 0) { | |
| return null; | |
| } | |
| array = new char[n5 - n4 + (0x1 | 0 << 32) << (0x2 | 0 << 32)]; | |
| if (r == 0 || r == 0) { | |
| return null; | |
| } | |
| int n7 = 0x0 | 0 << 32; | |
| if (r == 0) { | |
| return null; | |
| } | |
| int n8 = n4; | |
| if (r == 0) { | |
| return null; | |
| } | |
| if (r == 0) { | |
| return null; | |
| } | |
| while (n8 < n5 + (0x1 | 0 << 32) || r == 0) { | |
| if (Project.pj[n8] == null) { | |
| if (r == 0 || r == 0) { | |
| return null; | |
| } | |
| if (r == 0) { | |
| return null; | |
| } | |
| } | |
| else { | |
| int n9 = 0x0 | 0 << 32; | |
| if (r == 0) { | |
| return null; | |
| } | |
| if (r == 0) { | |
| return null; | |
| } | |
| while (n9 < (0x4 | 0 << 32) || r == 0) { | |
| array[n7] = Project.pj[n8].charAt(n9); | |
| if (r == 0 || r == 0) { | |
| return null; | |
| } | |
| ++n7; | |
| ++n9; | |
| } | |
| if (r == 0) { | |
| return null; | |
| } | |
| } | |
| if (r == 0) { | |
| return null; | |
| } | |
| ++n8; | |
| } | |
| if (r == 0 || r == 0) { | |
| return null; | |
| } | |
| if (r == 0) { | |
| H.k((Throwable)null); | |
| return null; | |
| } | |
| } | |
| catch (Throwable t) { | |
| if (r == 0 || r == 0) { | |
| return null; | |
| } | |
| array = new char[0x0 | 0 << 32]; | |
| if (r == 0) { | |
| return null; | |
| } | |
| } | |
| if (r != 0) { | |
| return new String(array).substring(n6, n3 - n4 * (0x4 | 0 << 32)); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| return null; | |
| } | |
| catch (Z z) { | |
| return null; | |
| } | |
| } | |
| protected static byte D(final int n, final int n2) throws Throwable { | |
| try { | |
| final int w = Project.W; | |
| if (w != 0) { | |
| if (w == 0) { | |
| return 0; | |
| } | |
| if (w != 0) { | |
| final int n3 = n ^ n2; | |
| if (w != 0 && w != 0) { | |
| final int n4 = n3 | n3 >> 16; | |
| if (w != 0 && w != 0) { | |
| final int n5 = n4 | n4 >> (0x8 | 0 << 32); | |
| if (w != 0 && w != 0) { | |
| final int n6 = n5 | n5 >> (0x4 | 0 << 32); | |
| if (w != 0 && w != 0) { | |
| final int n7 = n6 | n6 >> (0x2 | 0 << 32); | |
| if (w != 0 && w != 0) { | |
| final int n8 = n7 | n7 >> (0x1 | 0 << 32); | |
| if (w != 0 && w != 0) { | |
| final int n9 = n8 & (0x1 | 0 << 32); | |
| if (w != 0 && w != 0) { | |
| return (byte)(-n9); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| return (byte)(0x0 | 0 << 32); | |
| } | |
| catch (Z z) { | |
| return 0; | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment