| Code with Finding: |
/*
* Decompiled with CFR 0_128.
*
* Could not load the following classes:
* com.whatsapp.DialogToastActivity
* com.whatsapp.protocol.a
* com.whatsapp.protocol.a0
* com.whatsapp.protocol.a1
* com.whatsapp.protocol.a3
* com.whatsapp.protocol.a4
* com.whatsapp.protocol.a5
* com.whatsapp.protocol.a6
* com.whatsapp.protocol.a7
* com.whatsapp.protocol.a8
* com.whatsapp.protocol.a9
* com.whatsapp.protocol.a_
* com.whatsapp.protocol.aa
* com.whatsapp.protocol.ac
* com.whatsapp.protocol.ad
* com.whatsapp.protocol.af
* com.whatsapp.protocol.ag
* com.whatsapp.protocol.ah
* com.whatsapp.protocol.aj
* com.whatsapp.protocol.ak
* com.whatsapp.protocol.am
* com.whatsapp.protocol.an
* com.whatsapp.protocol.ao
* com.whatsapp.protocol.ap
* com.whatsapp.protocol.aq
* com.whatsapp.protocol.ar
* com.whatsapp.protocol.as
* com.whatsapp.protocol.at
* com.whatsapp.protocol.au
* com.whatsapp.protocol.ay
* com.whatsapp.protocol.az
* com.whatsapp.protocol.b0
* com.whatsapp.protocol.b1
* com.whatsapp.protocol.b2
* com.whatsapp.protocol.b3
* com.whatsapp.protocol.b4
* com.whatsapp.protocol.b6
* com.whatsapp.protocol.b8
* com.whatsapp.protocol.b9
* com.whatsapp.protocol.b_
* com.whatsapp.protocol.ba
* com.whatsapp.protocol.bb
* com.whatsapp.protocol.bc
* com.whatsapp.protocol.bd
* com.whatsapp.protocol.be
* com.whatsapp.protocol.bf
* com.whatsapp.protocol.bg
* com.whatsapp.protocol.bh
* com.whatsapp.protocol.bi
* com.whatsapp.protocol.bj
* com.whatsapp.protocol.bk
* com.whatsapp.protocol.bl
* com.whatsapp.protocol.bm
* com.whatsapp.protocol.bn
* com.whatsapp.protocol.bo
* com.whatsapp.protocol.bp
* com.whatsapp.protocol.bq
* com.whatsapp.protocol.br
* com.whatsapp.protocol.bs
* com.whatsapp.protocol.bt
* com.whatsapp.protocol.bu
* com.whatsapp.protocol.bv
* com.whatsapp.protocol.bw
* com.whatsapp.protocol.bx
* com.whatsapp.protocol.by
* com.whatsapp.protocol.bz
* com.whatsapp.protocol.c
* com.whatsapp.protocol.c4
* com.whatsapp.protocol.c6
* com.whatsapp.protocol.c8
* com.whatsapp.protocol.c9
* com.whatsapp.protocol.c_
* com.whatsapp.protocol.cb
* com.whatsapp.protocol.cd
* com.whatsapp.protocol.ce
* com.whatsapp.protocol.cf
* com.whatsapp.protocol.ci
* com.whatsapp.protocol.cj
* com.whatsapp.protocol.ck
* com.whatsapp.protocol.cs
* com.whatsapp.protocol.ct
* com.whatsapp.protocol.cw
* com.whatsapp.protocol.cx
* com.whatsapp.protocol.cy
* com.whatsapp.protocol.d
* com.whatsapp.protocol.f
* com.whatsapp.protocol.i
* com.whatsapp.protocol.j
* com.whatsapp.protocol.k
* com.whatsapp.protocol.m
* com.whatsapp.protocol.o
* com.whatsapp.protocol.p
* com.whatsapp.protocol.q
* com.whatsapp.protocol.r
* com.whatsapp.protocol.s
* com.whatsapp.protocol.u
* com.whatsapp.protocol.v
* com.whatsapp.protocol.y
* com.whatsapp.protocol.z
*/
package com.whatsapp.protocol;
import com.whatsapp.DialogToastActivity;
import com.whatsapp.protocol.a;
import com.whatsapp.protocol.a0;
import com.whatsapp.protocol.a1;
import com.whatsapp.protocol.a3;
import com.whatsapp.protocol.a4;
import com.whatsapp.protocol.a5;
import com.whatsapp.protocol.a6;
import com.whatsapp.protocol.a7;
import com.whatsapp.protocol.a8;
import com.whatsapp.protocol.a9;
import com.whatsapp.protocol.a_;
import com.whatsapp.protocol.aa;
import com.whatsapp.protocol.ac;
import com.whatsapp.protocol.ad;
import com.whatsapp.protocol.af;
import com.whatsapp.protocol.ag;
import com.whatsapp.protocol.ah;
import com.whatsapp.protocol.aj;
import com.whatsapp.protocol.ak;
import com.whatsapp.protocol.am;
import com.whatsapp.protocol.an;
import com.whatsapp.protocol.ao;
import com.whatsapp.protocol.ap;
import com.whatsapp.protocol.aq;
import com.whatsapp.protocol.ar;
import com.whatsapp.protocol.as;
import com.whatsapp.protocol.at;
import com.whatsapp.protocol.au;
import com.whatsapp.protocol.ay;
import com.whatsapp.protocol.az;
import com.whatsapp.protocol.b0;
import com.whatsapp.protocol.b1;
import com.whatsapp.protocol.b2;
import com.whatsapp.protocol.b3;
import com.whatsapp.protocol.b4;
import com.whatsapp.protocol.b6;
import com.whatsapp.protocol.b8;
import com.whatsapp.protocol.b9;
import com.whatsapp.protocol.b_;
import com.whatsapp.protocol.ba;
import com.whatsapp.protocol.bb;
import com.whatsapp.protocol.bc;
import com.whatsapp.protocol.bd;
import com.whatsapp.protocol.be;
import com.whatsapp.protocol.bf;
import com.whatsapp.protocol.bg;
import com.whatsapp.protocol.bh;
import com.whatsapp.protocol.bi;
import com.whatsapp.protocol.bj;
import com.whatsapp.protocol.bk;
import com.whatsapp.protocol.bl;
import com.whatsapp.protocol.bm;
import com.whatsapp.protocol.bn;
import com.whatsapp.protocol.bo;
import com.whatsapp.protocol.bp;
import com.whatsapp.protocol.bq;
import com.whatsapp.protocol.br;
import com.whatsapp.protocol.bs;
import com.whatsapp.protocol.bt;
import com.whatsapp.protocol.bu;
import com.whatsapp.protocol.bv;
import com.whatsapp.protocol.bw;
import com.whatsapp.protocol.bx;
import com.whatsapp.protocol.by;
import com.whatsapp.protocol.bz;
import com.whatsapp.protocol.c;
import com.whatsapp.protocol.c4;
import com.whatsapp.protocol.c6;
import com.whatsapp.protocol.c8;
import com.whatsapp.protocol.c9;
import com.whatsapp.protocol.c_;
import com.whatsapp.protocol.cb;
import com.whatsapp.protocol.cd;
import com.whatsapp.protocol.ce;
import com.whatsapp.protocol.cf;
import com.whatsapp.protocol.ci;
import com.whatsapp.protocol.cj;
import com.whatsapp.protocol.ck;
import com.whatsapp.protocol.cs;
import com.whatsapp.protocol.ct;
import com.whatsapp.protocol.cw;
import com.whatsapp.protocol.cx;
import com.whatsapp.protocol.cy;
import com.whatsapp.protocol.d;
import com.whatsapp.protocol.f;
import com.whatsapp.protocol.i;
import com.whatsapp.protocol.j;
import com.whatsapp.protocol.k;
import com.whatsapp.protocol.m;
import com.whatsapp.protocol.o;
import com.whatsapp.protocol.p;
import com.whatsapp.protocol.q;
import com.whatsapp.protocol.r;
import com.whatsapp.protocol.s;
import com.whatsapp.protocol.u;
import com.whatsapp.protocol.v;
import com.whatsapp.protocol.y;
import com.whatsapp.protocol.z;
import java.io.IOException;
import java.io.InputStream;
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.Vector;
public class cg {
private static final String[] N;
private final ck A;
boolean B = false;
final String C;
private Hashtable D = new Hashtable();
public Integer E;
public final an F;
final String G;
private boolean H = false;
final byte[] I;
private final ag J;
public long K;
private final cy L;
public q M;
private final at a;
boolean b = true;
final c4 c;
public int d = -1;
boolean e = false;
private String f;
final c g;
private final c6 h;
private final m i;
private final z j;
public int k = -1;
public long l;
boolean m = false;
private final y n;
int o;
ci p;
public long q;
private final d r;
final String s;
private Hashtable t = new Hashtable();
private Vector u = new Vector();
public final long v = System.currentTimeMillis();
boolean w = true;
String x;
private final Hashtable y = new Hashtable();
boolean z = false;
/*
* 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: First case is not immediately after switch.
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.examineSwitchContiguity(SwitchReplacer.java:366)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.rebuildSwitches(SwitchReplacer.java:334)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:515)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public cg(an an2, String string, String string2, String string3, String string4, byte[] arrby, at at2, cy cy2, c c2, ag ag2, d d2, c6 c62, c4 c42, q q2) {
this.i = an2.c();
this.n = an2.a();
this.F = an2;
this.C = string;
this.s = string2;
this.G = string3;
this.f = string4;
this.I = arrby;
this.a = at2;
this.L = cy2;
this.g = c2;
this.J = ag2;
this.r = d2;
this.h = c62;
this.c = c42;
this.M = q2;
u u2 = q2 != null ? new u(as.a, new String[0]) : null;
this.A = u2;
v v2 = q2 != null ? new v(as.a, new String[0]) : null;
this.j = v2;
}
/*
* Enabled force condition propagation
* Lifted jumps to return sites
*/
private static a6 a(s s2, boolean bl) {
Vector vector = s2.f(N[537]);
if (!bl) return cg.a(vector);
if (vector == null) throw new o(N[536] + s2.f);
if (vector.size() != 0) return cg.a(vector);
throw new o(N[536] + s2.f);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private static a6 a(Vector vector) {
int n = ad.q;
a6 a62 = new a6();
if (vector == null) {
return a62;
}
byte[][] arrarrby = new byte[vector.size()][];
int[] arrn = new int[vector.size()];
int n2 = 0;
while (n2 < vector.size()) {
int n3;
s s2 = (s)vector.elementAt(n2);
arrarrby[n2] = s2.e;
String string = s2.a(N[989], "0");
try {
arrn[n2] = Integer.parseInt(string);
n3 = n2 + 1;
if (n != 0) {
break;
}
}
catch (NumberFormatException numberFormatException) {
throw new o(N[988] + string);
}
n2 = n3;
}
a62.b = arrarrby;
a62.a = arrn;
return a62;
}
/*
* Exception decompiling
*/
private a a(s var1_1) {
// 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: Started 3 blocks at once
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.getStartingBlocks(Op04StructuredStatement.java:395)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:473)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
static d a(cg cg2) {
return cg2.r;
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private j a(j j2, s s2) {
int n;
block11 : {
String string;
block10 : {
int n2;
block9 : {
n2 = ad.q;
string = s2.e(N[1232]);
if (string != null) {
boolean bl = N[1233].equals(string);
n = 0;
if (!bl) break block9;
}
n = 1;
if (n2 == 0) break block11;
}
boolean bl = N[1234].equals(string);
if (!bl) break block10;
n = 2;
if (n2 == 0) break block11;
}
boolean bl = N[1235].equals(string);
if (!bl) break block11;
n = 3;
}
String string = s2.a();
return j2.b().e(string).d(n);
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
static p a(cg cg2, s s2) {
return cg2.d(s2);
}
private s a(a9 a92, int n) {
String string;
int n2 = ad.q;
switch (n) {
default: {
string = N[790];
if (n2 == 0) break;
}
case 13: {
string = N[795];
if (n2 == 0) break;
}
case 8: {
string = N[792];
}
}
String string2 = N[791];
cf[] arrcf = new cf[]{new cf(N[793], string), new cf(N[794], a92.c), new cf(N[796], a92.a)};
return new s(string2, arrcf);
}
private s a(ad ad2) {
return this.a(ad2, false);
}
/*
* Unable to fully structure code
* Enabled aggressive exception aggregation
*/
private static s a(ad var0, s var1_1, String var2_2, String[] var3_3, boolean var4_4) {
block45 : {
block44 : {
block43 : {
block42 : {
block41 : {
var5_5 = ad.q;
var6_6 = new Vector<s>();
if (var1_1 != null) {
var6_6.addElement(var1_1);
}
var10_7 = var0.f();
if (var10_7 == null || var4_4) ** GOTO lbl26
var37_8 = var0.G;
if (var37_8 == 0) break block41;
var38_9 = 4;
lbl13: // 2 sources:
do {
var39_10 = new cf[var38_9];
var39_10[0] = new cf("v", "1");
var41_11 = cg.N[373];
if (var0.a() != 0) break block42;
var42_12 = cg.N[381];
lbl20: // 2 sources:
do {
var39_10[1] = new cf(var41_11, var42_12);
var39_10[2] = new cf(cg.N[385], cg.N[372]);
if (var0.G != 0) {
var39_10[3] = new cf(cg.N[367], String.valueOf(var0.G));
}
var6_6.addElement(new s(cg.N[390], var39_10, var0.f()));
lbl26: // 2 sources:
if (var3_3 == null) ** GOTO lbl40
var30_13 = new s[var3_3.length];
for (var31_14 = 0; var31_14 < var3_3.length; ++var31_14) {
var35_15 = cg.N[391];
var36_16 = new cf[]{new cf(cg.N[369], var3_3[var31_14])};
var30_13[var31_14] = new s(var35_15, var36_16);
if (var5_5 == 0) continue;
}
if (var2_2 == null) break block43;
var34_17 = var2_2.length();
if (var34_17 <= 0) break block43;
var32_18 = new cf[]{new cf(cg.N[370], var2_2)};
lbl38: // 2 sources:
do {
var6_6.addElement(new s(cg.N[384], var32_18, var30_13));
lbl40: // 2 sources:
if (var0.t != null) {
var26_19 = new s[var0.t.length];
for (var27_20 = 0; var27_20 < var26_19.length; ++var27_20) {
var28_21 = cg.N[371];
var29_22 = new cf[]{new cf(cg.N[382], var0.t[var27_20])};
var26_19[var27_20] = new s(var28_21, var29_22);
if (var5_5 == 0) continue;
}
var6_6.addElement(new s(cg.N[378], null, var26_19));
}
var11_23 = new Vector<cf>();
if (!var0.m.b) break block44;
var13_24 = cg.N[375];
lbl52: // 2 sources:
do {
var11_23.addElement(new cf(var13_24, var0.m.a));
var14_25 = cg.N[392];
if (var1_1 != null && !cg.N[388].equals(var1_1.f)) break block45;
var15_26 = cg.N[380];
lbl57: // 2 sources:
do {
block47 : {
block48 : {
block46 : {
var11_23.addElement(new cf(var14_25, var15_26));
var11_23.addElement(new cf(cg.N[374], var0.m.c));
if (var0.I != null) {
if (var0.I.length() <= 0) break block46;
var11_23.addElement(new cf(cg.N[379], var0.I));
}
}
if (var0.v != null) {
var11_23.addElement(new cf(cg.N[383], var0.v));
}
if (!var4_4) break block47;
var22_27 = var0.K;
if (var22_27 == null) break block48;
var24_28 = "".equals(var0.K);
if (var24_28) break block48;
if (!var0.m.a.endsWith(cg.N[393])) break block48;
var11_23.addElement(new cf(cg.N[389], var0.K));
}
if (!var0.J) break block47;
var6_6.addElement(new s(cg.N[387], null));
}
var17_29 = new s[var6_6.size()];
var6_6.copyInto(var17_29);
var18_30 = new cf[var11_23.size()];
var11_23.copyInto(var18_30);
return new s(cg.N[368], (cf[])var18_30, (s[])var17_29);
break;
} while (true);
break;
} while (true);
break;
} while (true);
break;
} while (true);
break;
} while (true);
catch (RuntimeException var43_31) {
throw var43_31;
}
catch (RuntimeException var7_32) {
throw var7_32;
}
}
var38_9 = 3;
** while (true)
catch (RuntimeException var40_35) {
throw var40_35;
}
}
var42_12 = cg.N[376];
** while (true)
catch (RuntimeException var33_36) {
throw var33_36;
}
}
var32_18 = null;
** while (true)
catch (RuntimeException var12_37) {
throw var12_37;
}
}
var13_24 = cg.N[377];
** while (true)
}
var15_26 = cg.N[386];
** while (true)
catch (RuntimeException var25_38) {
throw var25_38;
}
catch (RuntimeException var16_39) {
throw var16_39;
}
catch (RuntimeException var19_40) {
throw var19_40;
}
catch (RuntimeException var23_43) {
throw var23_43;
}
}
/*
* Exception decompiling
*/
private s a(ad var1_1, boolean var2_2) {
// 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: First case is not immediately after switch.
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.examineSwitchContiguity(SwitchReplacer.java:366)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.rebuildSwitches(SwitchReplacer.java:334)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:515)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
/*
* Exception decompiling
*/
private static s a(ay var0, s var1_1) {
// 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 2[SIMPLE_IF_TAKEN]
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:418)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:470)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
/*
* Exception decompiling
*/
private s a(f var1_1) {
// 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 [32[CASE]], but top level block is 14[TRYBLOCK]
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:418)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:470)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
private s a(i i2) {
return this.a(i2, false);
}
/*
* Exception decompiling
*/
private s a(i var1_1, boolean var2_2) {
// 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.CannotPerformDecode: reachable test BLOCK was exited and re-entered.
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.Misc.getFarthestReachableInRange(Misc.java:143)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.examineSwitchContiguity(SwitchReplacer.java:385)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.replaceRawSwitches(SwitchReplacer.java:65)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:401)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private s a(String string, String string2, String string3, boolean bl, String string4) {
cf[] arrcf = new cf[2];
arrcf[0] = new cf(N[1547], string3);
String string5 = N[1546];
String string6 = bl ? N[1545] : N[1548];
arrcf[1] = new cf(string5, string6);
s s2 = new s(string4, arrcf);
String string7 = N[1544];
cf[] arrcf2 = new cf[]{new cf(N[1549], string2), new cf(N[1550], string)};
return new s(string7, arrcf2, s2);
}
static String a(cg cg2, String string) {
return cg2.a(string);
}
private String a(String string) {
return string + N[1441];
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(a9 a92, String string, int n, long l, byte[] arrby) {
String string2;
boolean bl = this.g(string);
String string3 = bl ? string : a92.a;
if (bl) {
string2 = a92.a;
} else {
string2 = string;
}
s[] arrs = new s[2];
String string4 = N[999];
cf[] arrcf = new cf[]{new cf("v", "1"), new cf(N[1000], String.valueOf(n)), new cf(N[996], a92.c), new cf("t", String.valueOf(l / 1000L))};
arrs[0] = new s(string4, arrcf);
arrs[1] = new s(N[1001], null, arrby);
cf[] arrcf2 = this.a(a92, N[997], null, string3, string2);
this.n.a(new s(N[998], arrcf2, arrs));
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(a9 a92, String string, String string2, String[] arrstring, String string3, boolean bl) {
String string4;
boolean bl2 = this.g(string2);
String string5 = bl2 ? string2 : a92.a;
if (bl2) {
string4 = a92.a;
} else {
string4 = string2;
}
s[] arrs = this.a(arrstring);
cf[] arrcf = this.a(a92, string, string3, string5, string4);
s s2 = new s(N[1226], arrcf, arrs);
this.n.a(s2, bl);
}
/*
* Enabled aggressive block sorting
*/
private void a(ad ad2, String string, String[] arrstring) {
cf[] arrcf;
block4 : {
int n = ad.q;
switch (ad2.D) {
default: {
break;
}
case 2: {
arrcf = new cf[]{new cf(N[71], N[70])};
if (n == 0) break block4;
}
case 3: {
arrcf = new cf[]{new cf(N[73], N[72])};
if (n == 0) break block4;
}
}
arrcf = null;
}
s s2 = new s(N[69], arrcf, ad2.c());
this.n.a(cg.a(ad2, s2, string, arrstring, false));
}
private void a(ay ay2, s s2, boolean bl) {
s s3 = cg.a(ay2, s2);
this.n.a(s3, bl);
}
static void a(cg cg2, s s2, Hashtable hashtable) {
cg2.a(s2, hashtable);
}
static void a(cg cg2, s s2, Hashtable hashtable, Hashtable hashtable2, String string) {
cg2.a(s2, hashtable, hashtable2, string);
}
static void a(cg cg2, s s2, Vector vector) {
cg2.a(s2, vector);
}
static void a(cg cg2, s s2, Vector vector, String string, String string2) {
cg2.a(s2, vector, string, string2);
}
static void a(cg cg2, s s2, Vector vector, Hashtable hashtable, String string) {
cg2.a(s2, vector, hashtable, string);
}
private void a(s s2, Hashtable hashtable) {
int n = ad.q;
Vector vector = s2.f(N[1394]);
int n2 = 0;
do {
int n3;
block6 : {
block5 : {
if (n2 >= vector.size()) break block5;
s s3 = (s)vector.elementAt(n2);
String string = s3.e(N[1392]);
String string2 = s3.e(N[1393]);
if (string2 == null) {
string2 = "";
}
hashtable.put(string, string2);
n3 = n2 + 1;
if (n == 0) break block6;
}
return;
}
n2 = n3;
} while (true);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(s s2, Hashtable hashtable, Hashtable hashtable2, String string) {
int n = ad.q;
s s3 = s2.d(string);
Vector vector = new Vector();
this.a(s3, vector, N[1421], N[1422]);
Vector vector2 = new Vector();
this.a(s3, vector2, N[1423], N[1424]);
Vector vector3 = new Vector();
this.a(s3, vector3, N[1425], N[1420]);
int n2 = 0;
while (n2 < vector.size()) {
block9 : {
String string2;
String string3;
block8 : {
Integer n3;
string2 = (String)vector.elementAt(n2);
String string4 = (String)vector3.elementAt(n2);
if (!(string4 instanceof String)) break block8;
try {
Integer n4;
n3 = n4 = Integer.valueOf(string4);
}
catch (Exception exception) {
n3 = new Integer(499);
}
hashtable2.put(string2, n3);
if (n == 0) break block9;
}
if ((string3 = (String)vector2.elementAt(n2)) == null) {
string3 = "";
}
hashtable.put(string2, string3);
}
int n5 = n2 + 1;
if (n != 0) {
return;
}
n2 = n5;
}
}
/*
* Enabled force condition propagation
* Lifted jumps to return sites
*/
private void a(s s2, Vector vector) {
int n = ad.q;
s s3 = s2.d(N[1513]);
if (s3 == null) return;
Vector vector2 = s3.f(N[1508]);
int n2 = vector2.size();
int n3 = 0;
block0 : while (n3 < n2) {
s s4 = (s)vector2.elementAt(n3);
String string = s4.e(N[1510]);
String string2 = s4.e(N[1509]);
Vector vector3 = s4.f(N[1512]);
int n4 = vector3.size();
String[] arrstring = new String[n4];
int n5 = 0;
do {
int n6;
block7 : {
block6 : {
if (n5 >= n4) break block6;
arrstring[n5] = ((s)vector3.elementAt(n5)).e(N[1511]);
n6 = n5 + 1;
if (n == 0) break block7;
}
this.L.a(string, string2, arrstring);
int n7 = n3 + 1;
if (n != 0) {
return;
}
n3 = n7;
continue block0;
}
n5 = n6;
} while (true);
break;
}
return;
}
private void a(s s2, Vector vector, String string, String string2) {
int n = ad.q;
Vector vector2 = s2.f(string);
int n2 = 0;
do {
int n3;
block4 : {
block3 : {
if (n2 >= vector2.size()) break block3;
vector.addElement(((s)vector2.elementAt(n2)).e(string2));
n3 = n2 + 1;
if (n == 0) break block4;
}
return;
}
n2 = n3;
} while (true);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private void a(s var1_1, Vector var2_2, Hashtable var3_3, String var4_4) {
var5_5 = ad.q;
var6_6 = var1_1.d(var4_4);
var7_7 = new Vector<E>();
this.a(var6_6, var7_7, cg.N[29], cg.N[31]);
var8_8 = new Vector<E>();
this.a(var6_6, var8_8, cg.N[30], cg.N[28]);
var9_9 = 0;
while (var9_9 < var7_7.size()) {
block6 : {
var10_10 = (String)var7_7.elementAt(var9_9);
var11_11 = (String)var8_8.elementAt(var9_9);
if (!(var11_11 instanceof String)) ** GOTO lbl20
try {
var15_14 = var17_15 = Integer.valueOf(var11_11);
}
catch (Exception var14_13) {
var15_14 = new Integer(499);
}
var3_3.put(var10_10, var15_14);
if (var5_5 == 0) break block6;
lbl20: // 2 sources:
var2_2.addElement(var10_10);
}
var13_12 = var9_9 + 1;
if (var5_5 != 0) {
return;
}
var9_9 = var13_12;
}
}
private void a(Exception exception) {
int n = ad.q;
Enumeration enumeration = this.y.elements();
while (enumeration.hasMoreElements()) {
((aj)enumeration.nextElement()).a(exception);
if (n == 0) continue;
}
this.y.clear();
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(String string, String string2, s s2) {
byte[] arrby = this.j.a(s2);
byte[] arrby2 = this.M.b(arrby);
if (arrby2 != null) {
cf[] arrcf;
if (string2 != null) {
arrcf = new cf[]{new cf(N[268], string2)};
} else {
arrcf = null;
}
String string3 = N[271];
cf[] arrcf2 = new cf[]{new cf(N[267], N[272]), new cf(N[269], N[270]), new cf(N[273], string)};
s s3 = new s(string3, arrcf2, new s(N[266], arrcf, arrby2));
this.n.a(s3);
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(String string, Vector vector, String string2, String string3, cj cj2) {
int n = ad.q;
int n2 = vector.size();
s[] arrs = new s[n2];
int n3 = 0;
do {
int n4;
block6 : {
s s2;
cf[] arrcf;
block4 : {
block5 : {
if (n3 >= n2) break block5;
String string4 = N[1527];
cf[] arrcf2 = new cf[]{new cf(N[1522], (String)vector.elementAt(n3))};
arrs[n3] = new s(string4, arrcf2);
n4 = n3 + 1;
if (n == 0) break block6;
}
s2 = new s(string3, null, arrs);
int n5 = cj2 == null ? 4 : 5;
arrcf = new cf[n5];
arrcf[0] = new cf(N[1519], string2);
arrcf[1] = new cf(N[1525], N[1521]);
arrcf[2] = new cf(N[1526], N[1523]);
arrcf[3] = new cf(N[1524], string);
if (cj2 == null) break block4;
arrcf[4] = new cf(N[1528], cj2.b);
}
s s3 = new s(N[1520], arrcf, s2);
this.n.a(s3);
return;
}
n3 = n4;
} while (true);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private void a(String var1_1, byte[] var2_2, InputStream var3_3, int var4_4, byte[] var5_5, InputStream var6_6, int var7_7, r var8_8, ak var9_9, cj var10_10) {
block12 : {
var11_11 = ad.q;
if (var10_10 != null) {
var12_12 = var10_10.a;
} else {
var12_12 = this.f(cg.N[789]);
}
var13_13 = var2_2 == null && var3_3 == null;
this.y.put(var12_12, new bt(this, var8_8, var13_13, var9_9));
if (var3_3 == null) ** GOTO lbl-1000
var31_14 = cg.N[771];
var32_15 = new cf[]{new cf(cg.N[770], cg.N[773])};
var33_16 = new s(var31_14, var32_15, var3_3, var4_4);
if (var11_11 != 0) lbl-1000: // 2 sources:
{
var15_17 = cg.N[775];
var16_18 = new cf[]{new cf(cg.N[783], cg.N[779])};
var17_19 = new s(var15_17, var16_18, var2_2);
} else {
var17_19 = var33_16;
}
if (var6_6 == null) ** GOTO lbl-1000
var28_20 = cg.N[769];
var29_21 = new cf[]{new cf(cg.N[776], cg.N[778])};
var30_22 = new s(var28_20, var29_21, var6_6, var7_7);
if (var11_11 != 0) lbl-1000: // 2 sources:
{
var18_23 = cg.N[784];
var19_24 = new cf[]{new cf(cg.N[786], cg.N[785])};
var20_25 = new s(var18_23, var19_24, var5_5);
} else {
var20_25 = var30_22;
}
var21_26 = var10_10 == null ? 4 : 5;
var22_27 = new cf[var21_26];
var22_27[0] = new cf(cg.N[780], var12_12);
var22_27[1] = new cf(cg.N[777], cg.N[787]);
var22_27[2] = new cf(cg.N[788], var1_1);
var22_27[3] = new cf(cg.N[782], cg.N[774]);
if (var10_10 == null) break block12;
var22_27[4] = new cf(cg.N[781], var10_10.b);
}
var25_28 = cg.N[772];
var26_29 = var5_5 == null && var6_6 == null ? new s[]{var17_19} : new s[]{var17_19, var20_25};
var27_30 = new s(var25_28, var22_27, var26_29);
this.n.a(var27_30);
}
private void a(Hashtable hashtable, aj aj2) {
int n = ad.q;
String string = this.f(N[1442]);
this.y.put(string, aj2);
Enumeration enumeration = hashtable.keys();
int n2 = hashtable.size();
s[] arrs = new s[n2];
int n3 = 0;
do {
int n4;
block9 : {
block8 : {
block7 : {
if (n3 >= n2 || !enumeration.hasMoreElements()) break block8;
String string2 = (String)enumeration.nextElement();
long l = (Long)hashtable.get(string2) / 1000L;
if (l == 0L) {
String string3 = N[1453];
cf[] arrcf = new cf[]{new cf(N[1447], string2)};
arrs[n3] = new s(string3, arrcf);
if (n == 0) break block7;
}
String string4 = N[1451];
cf[] arrcf = new cf[]{new cf(N[1444], string2), new cf("t", Long.toString(l))};
arrs[n3] = new s(string4, arrcf);
}
n4 = n3 + 1;
if (n == 0) break block9;
}
s s2 = new s(N[1448], null, arrs);
String string5 = N[1445];
cf[] arrcf = new cf[]{new cf(N[1446], string), new cf(N[1443], N[1452]), new cf(N[1450], N[1454]), new cf(N[1455], N[1449])};
s s3 = new s(string5, arrcf, s2);
this.n.a(s3);
return;
}
n3 = n4;
} while (true);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private void a(Vector var1_1, Vector var2_2) {
var3_3 = ad.q;
var4_4 = var1_1.size();
var5_5 = 0;
while (var5_5 < var4_4) {
block22 : {
block21 : {
block20 : {
block19 : {
var6_6 = (i)var1_1.elementAt(var5_5);
var7_7 = var6_6.j.endsWith(cg.N[1315]);
var9_8 = var6_6.o;
if (var9_8 != null) break block19;
var17_13 = 0;
break block20;
}
var12_9 = var6_6.p;
var13_10 = var12_9 == false && var7_7 != false ? 2 : 1;
var15_11 = var6_6.k;
var16_12 = var15_11 == null ? 0 : 1;
var17_13 = var16_12 + var13_10;
}
var18_14 = new cf[var17_13 + 1];
var18_14[0] = new cf(cg.N[1317], var6_6.j);
if (var6_6.o != null) {
var18_14[1] = new cf(cg.N[1314], var6_6.o);
var22_16 = var6_6.p;
** if (var22_16 || !var7_7) goto lbl-1000
lbl-1000: // 1 sources:
{
var18_14[2] = new cf(cg.N[1319], cg.N[1313]);
var23_17 = 3;
}
lbl-1000: // 1 sources:
{
break block21;
}
}
break block22;
catch (RuntimeException var20_22) {
throw var20_22;
}
}
var23_17 = 2;
if (var6_6.k == null) break block22;
var18_14[var23_17] = new cf(cg.N[1318], var6_6.k);
}
var2_2.addElement(new s(cg.N[1316], var18_14));
var19_15 = var5_5 + 1;
if (var3_3 != 0) {
return;
}
var5_5 = var19_15;
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void a(byte[] arrby, InputStream inputStream, int n, String string, Runnable runnable, ak ak2, c8 c82, boolean bl) {
String string2;
s s2;
block5 : {
block4 : {
string2 = this.f(N[442]);
this.y.put(string2, new a7(this, runnable, ak2, c82));
if (inputStream == null) break block4;
String string3 = N[446];
cf[] arrcf = new cf[]{new cf("t", string)};
s2 = new s(string3, arrcf, inputStream, n);
if (ad.q == 0) break block5;
}
String string4 = N[447];
cf[] arrcf = new cf[]{new cf("t", string)};
s2 = new s(string4, arrcf, arrby);
}
String string5 = N[443];
cf[] arrcf = new cf[]{new cf(N[448], string2), new cf(N[441], N[439]), new cf(N[445], N[444]), new cf(N[440], N[438])};
s s3 = new s(string5, arrcf, s2);
y y2 = this.n;
int n2 = bl ? 2 : 0;
y2.a(s3, n2 | 1);
}
private void a(s[] arrs, Runnable runnable, ak ak2, c8 c82) {
c c2 = this.g;
if (c2 == null) {
return;
}
String string = this.f(N[1382]);
this.y.put(string, new c9(this, runnable, ak2, c82));
this.a(string, "a", new s(N[1381], null, arrs));
}
private void a(String[] arrstring, aj aj2) {
int n = ad.q;
String string = this.f(N[1556]);
this.y.put(string, aj2);
int n2 = arrstring.length;
s[] arrs = new s[n2];
for (int i2 = 0; i2 < n2; ++i2) {
String string2 = arrstring[i2];
String string3 = N[1559];
cf[] arrcf = new cf[]{new cf(N[1558], string2)};
arrs[i2] = new s(string3, arrcf);
if (n == 0) continue;
}
s s2 = new s(N[1553], null, arrs);
String string4 = N[1561];
cf[] arrcf = new cf[]{new cf(N[1551], string), new cf(N[1562], N[1560]), new cf(N[1552], N[1554]), new cf(N[1555], N[1557])};
s s3 = new s(string4, arrcf, s2);
this.n.a(s3);
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private boolean a(s s2, ay ay2) {
boolean bl;
s s3;
block39 : {
int n;
block38 : {
String string2;
String string;
block37 : {
block36 : {
block35 : {
block34 : {
block33 : {
block30 : {
block40 : {
long l;
s s4;
String string3;
long l2;
String string4;
String string5;
String string6;
String string7;
block31 : {
n = ad.q;
string2 = ay2.c;
string = s2.e(N[85]);
if (string == null) {
string = "";
}
s3 = s2.a(0);
boolean bl2 = s.a((s)s3, (String)N[86]);
bl = false;
if (bl2) {
Hashtable hashtable = new Hashtable();
this.a(s3, hashtable);
int n2 = hashtable.size();
bl = false;
if (n2 > 0) {
this.L.a(ay2, hashtable, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl3 = s.a((s)s3, (String)N[89]);
if (!bl3) break block30;
s4 = s3.a(0);
string4 = s3.e(N[105]);
string6 = s3.e(N[101]);
if (s.a((s)s4, (String)N[84])) {
string7 = this.a(s4.e(N[96]));
string3 = s4.e(N[74]);
String string8 = s4.e(N[97]);
l2 = 0L;
long l3 = Long.parseLong(string8);
l2 = l3 * 1000L;
break block31;
}
break block40;
catch (NumberFormatException numberFormatException) {}
}
string5 = s4.e(N[80]);
String string9 = s4.e(N[75]);
l = 0L;
try {
long l4 = Long.parseLong(string9);
l = l4 * 1000L;
}
catch (NumberFormatException numberFormatException) {}
String string10 = s4.e(N[82]);
String string11 = s4.e(N[88]);
Hashtable hashtable = new Hashtable();
this.a(s4, hashtable);
this.L.a(ay2, string7, string6, string4, string3, l2, string5, l, string10, string11, hashtable, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl4 = s.a((s)s3, (String)N[78]);
if (!bl4) break block33;
this.L.a(ay2, string);
bl = true;
if (n == 0) return bl;
}
boolean bl5 = s.a((s)s3, (String)N[91]);
if (!bl5) break block34;
Vector vector = new Vector();
this.a(s3, vector, N[76], N[83]);
if (vector.size() > 0) {
this.L.a(ay2, vector, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl6 = s.a((s)s3, (String)N[92]);
if (!bl6) break block35;
this.L.b(ay2);
bl = true;
if (n == 0) return bl;
}
boolean bl7 = s.a((s)s3, (String)N[95]);
if (!bl7) break block36;
Vector vector = new Vector();
this.a(s3, vector, N[90], N[94]);
if (vector.size() > 0) {
String string12 = (String)vector.elementAt(0);
this.L.a(ay2, string2, string12, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl8 = s.a((s)s3, (String)N[79]);
if (!bl8) break block37;
Vector vector = new Vector();
this.a(s3, vector, N[102], N[98]);
if (vector.size() > 0) {
this.L.b(ay2, vector, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl9 = s.a((s)s3, (String)N[81]);
if (!bl9) break block38;
String string13 = s3.e(N[93]);
Vector vector = new Vector();
this.a(s3, vector, N[104], N[87]);
if (vector.size() > 0) {
this.L.a(ay2, vector, string2, string13, string);
bl = true;
}
if (n == 0) return bl;
}
boolean bl10 = s.a((s)s3, (String)N[99]);
if (!bl10) break block39;
String string = s3.e(N[103]);
String string14 = s3.e(N[100]);
String string15 = s3.e(N[77]);
this.L.a(ay2, string, string15, Integer.parseInt(string14));
bl = true;
if (n == 0) return bl;
}
boolean bl11 = s.a((s)s3, (String)N[106]);
if (!bl11) return bl;
this.L.a(ay2);
return true;
}
/*
* Exception decompiling
*/
private boolean a(s var1_1, ay var2_2, long var3_3) {
// 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 [3[TRYBLOCK]], but top level block is 103[SIMPLE_IF_TAKEN]
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:418)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:470)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private cf[] a(a9 a92, String string, String string2, String string3, String string4) {
int n;
cf[] arrcf;
int n2;
block15 : {
boolean bl;
block14 : {
block13 : {
block12 : {
if (string4 != null) {
int n3 = string4.length();
if (n3 <= 0) break block12;
bl = true;
break block13;
}
}
bl = false;
}
int n4 = string == null ? 0 : 1;
int n5 = n4 + 2;
int n6 = !bl ? 0 : 1;
int n7 = n6 + n5;
int n8 = 0;
if (string2 != null) {
n8 = 1;
}
arrcf = new cf[n7 + n8];
arrcf[0] = new cf(N[1266], string3);
arrcf[1] = new cf(N[1267], a92.c);
if (string != null) {
n = 3;
arrcf[2] = new cf(N[1264], string);
break block14;
}
n = 2;
}
if (bl) {
n2 = n + 1;
arrcf[n] = new cf(N[1265], string4);
}
break block15;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
n2 = n;
if (string2 == null) return arrcf;
n2 + 1;
arrcf[n2] = new cf(N[1263], string2);
return arrcf;
}
private s[] a(String[] arrstring) {
int n = ad.q;
if (arrstring != null) {
s[] arrs = new s[arrstring.length];
for (int i2 = 0; i2 < arrstring.length; ++i2) {
String string = N[1565];
cf[] arrcf = new cf[]{new cf(N[1564], arrstring[i2])};
arrs[i2] = new s(string, arrcf);
if (n == 0) continue;
}
s[] arrs2 = new s[]{new s(N[1563], null, arrs)};
return arrs2;
}
return null;
}
/*
* Enabled force condition propagation
* Lifted jumps to return sites
*/
private String[] a(String string, s[] arrs) {
int n = 0;
int n2 = ad.q;
if (arrs == null) return new String[]{string};
if (arrs.length != 1) {
return new String[]{string};
}
s s2 = arrs[0];
s.b((s)s2, (String)N[799]);
s[] arrs2 = s2.c;
String[] arrstring = new String[1 + arrs2.length];
arrstring[0] = string;
do {
String string2;
if (n >= arrs2.length) return arrstring;
s s3 = arrs2[n];
s.b((s)s3, (String)N[800]);
arrstring[n + 1] = string2 = s3.e(N[798]);
++n;
} while (n2 == 0);
return arrstring;
}
static a b(cg cg2, s s2) {
return cg2.a(s2);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private static ac b(Vector vector) {
int n = ad.q;
ac ac2 = new ac();
if (vector == null) {
return ac2;
}
byte[][] arrarrby = new byte[vector.size()][];
int[] arrn = new int[vector.size()];
int n2 = 0;
while (n2 < vector.size()) {
int n3;
s s2 = (s)vector.elementAt(n2);
arrarrby[n2] = s2.e;
String string = s2.c(N[459]);
try {
arrn[n2] = Integer.parseInt(string);
n3 = n2 + 1;
if (n != 0) {
break;
}
}
catch (NumberFormatException numberFormatException) {
throw new o(N[458] + string);
}
n2 = n3;
}
ac2.b = arrarrby;
ac2.a = arrn;
return ac2;
}
static cy b(cg cg2) {
return cg2.L;
}
/*
* Unable to fully structure code
* Enabled aggressive exception aggregation
*/
private j b(j var1_1, s var2_2) {
block46 : {
block48 : {
block49 : {
var3_3 = ad.q;
var4_4 = var2_2.e(cg.N[349]);
if (var4_4 != null) {
var44_5 = cg.N[348].equals(var4_4);
if (!var44_5) break block46;
}
var5_6 = 2;
if (var3_3 != 0) lbl-1000: // 2 sources:
{
block47 : {
var40_7 = cg.N[357].equals(var4_4);
if (!var40_7) break block47;
if (var3_3 == 0) break block48;
var5_6 = 1;
}
var42_8 = cg.N[361].equals(var4_4);
if (!var42_8) break block49;
var5_6 = 3;
}
}
lbl20: // 2 sources:
var1_1.a(ad.b((String)var2_2.e(cg.N[346]))).m(var2_2.e(cg.N[358])).k(var2_2.e(cg.N[345])).j(var2_2.e(cg.N[365])).d(var5_6);
var7_9 = var2_2.e(cg.N[341]);
if (var7_9 != null) {
var1_1.a(Long.parseLong(var7_9));
}
lbl25: // 4 sources:
do {
var8_10 = var2_2.e(cg.N[362]);
if (var8_10 != null) {
var1_1.a(Integer.parseInt(var8_10));
}
lbl30: // 4 sources:
do {
block54 : {
block53 : {
block52 : {
block51 : {
block50 : {
var1_1.d(var2_2.e(cg.N[364]));
var1_1.f(var2_2.e(cg.N[352]));
var11_11 = var2_2.e(cg.N[350]);
if (var11_11 != null) {
var31_12 = var11_11.equals(cg.N[359]);
if (!var31_12) break block50;
var1_1.e(1);
if (var3_3 == 0) break block51;
}
}
var1_1.e(0);
}
if (var1_1.a() == 5) {
var22_13 = var2_2.e(cg.N[355]);
var23_14 = var2_2.e(cg.N[343]);
if (var22_13 == null || var23_14 == null) {
cw.a((String)cg.N[342], (Throwable)null);
var22_13 = "0";
var23_14 = "0";
}
var25_15 = Double.valueOf(var22_13);
var26_16 = Double.valueOf(var23_14);
var1_1.a(var25_15).b(var26_16);
var1_1.l(var2_2.e(cg.N[344]));
}
var14_17 = var2_2.e(cg.N[360]);
if (!cg.N[356].equals(var14_17)) break block52;
var1_1.a(Boolean.TRUE);
}
if (var1_1.a() != 4) break block53;
var18_18 = var2_2.a(0);
if (var18_18 != null) {
var1_1.l(var18_18.e(cg.N[347])).a(var18_18.e);
}
if (var3_3 == 0) break block54;
}
var1_1.a(var2_2.e);
}
return var1_1.b();
break;
} while (true);
break;
} while (true);
catch (NumberFormatException var43_19) {
throw var43_19;
}
catch (NumberFormatException var39_20) {
throw var39_20;
}
catch (NumberFormatException var41_21) {
throw var41_21;
}
catch (NullPointerException var37_22) {
try {
throw var37_22;
}
catch (NumberFormatException var36_23) {
cw.a((String)(cg.N[351] + var7_9 + cg.N[353]), (Throwable)var36_23);
** continue;
}
}
catch (NullPointerException var34_24) {
try {
throw var34_24;
}
catch (NumberFormatException var33_25) {
cw.a((String)(cg.N[354] + var7_9 + cg.N[366]), (Throwable)var33_25);
** continue;
}
}
catch (NumberFormatException var29_26) {
throw var29_26;
}
catch (NumberFormatException var24_29) {
throw new o(cg.N[363] + var22_13 + " " + var23_14, this.i.b());
}
catch (NumberFormatException var15_30) {
throw var15_30;
}
catch (NumberFormatException var19_31) {
throw var19_31;
}
catch (NumberFormatException var16_32) {
throw var16_32;
}
}
var5_6 = 1;
** GOTO lbl20
}
var5_6 = 0;
** GOTO lbl-1000
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private void b(s s2) {
ad ad2;
String string;
j j2;
String string6;
long l;
int n;
String string4;
String string3;
boolean bl;
String string5;
String string2;
block20 : {
block25 : {
String string7;
block24 : {
String string8;
block23 : {
n = ad.q;
j2 = new j();
string4 = s2.e(N[284]);
string3 = s2.e("t");
string8 = s2.e(N[286]);
string5 = s2.e(N[287]);
string2 = s2.e(N[291]);
bl = this.g(string8);
if (!bl) break block23;
string7 = s2.e(N[293]);
if (n != 0) break block24;
string = string7;
string6 = string8;
break block25;
}
string7 = string8;
}
String string9 = s2.e(N[292]);
string = string7;
string6 = string9;
}
if (string6 == null) {
string6 = "";
}
String string10 = s2.e(N[283]);
if (N[288].equals(string10)) break block20;
boolean bl2 = N[289].equals(string10);
if (!bl2) return;
}
try {
long l2 = Long.parseLong(string3);
l = l2 * 1000L;
}
catch (NumberFormatException numberFormatException) {
l = System.currentTimeMillis();
}
j2.b(l);
Integer n2 = string5 == null ? null : Integer.valueOf(string5);
j2.a(n2);
Boolean bl3 = bl ? Boolean.TRUE : Boolean.FALSE;
j2.b(bl3);
j2.g(string2);
j2.h(string4);
j2.a(false);
j2.i(string);
j2.a(string6);
s[] arrs = s2.c == null ? new s[]{} : s2.c;
j j3 = j2;
for (int i2 = 0; i2 < arrs.length; ++i2) {
s s3;
block22 : {
block21 : {
s3 = arrs[i2];
boolean bl4 = s.a((s)s3, (String)N[290]);
if (!bl4 || string4 == null) break block21;
j3 = this.a(j3, s3);
if (n == 0) continue;
}
boolean bl5 = s.a((s)s3, (String)N[285]);
if (!bl5 || string4 == null) break block22;
j3 = this.b(j3, s3);
if (n == 0) continue;
}
boolean bl6 = s.a((s)s3, (String)N[294]);
if (!bl6 || string4 == null) continue;
j3 = this.c(j3, s3);
if (n == 0) continue;
}
if ((ad2 = j3.c()) == null) return;
if (this.a == null) return;
this.a.a(ad2);
return;
catch (NumberFormatException numberFormatException) {
throw numberFormatException;
}
catch (NumberFormatException numberFormatException) {
throw numberFormatException;
}
catch (NumberFormatException numberFormatException) {
throw numberFormatException;
}
}
private void b(String string, String string2, String string3, String string4) {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
s[] arrs = new s[1];
cf[] arrcf = new cf[]{new cf(N[1399], string3)};
arrs[0] = new s(string4, arrcf);
cf[] arrcf2 = new cf[]{new cf(N[1401], string), new cf(N[1400], string2)};
this.n.a(new s(N[1398], arrcf2, arrs));
}
static c6 c(cg cg2) {
return cg2.h;
}
/*
* Exception decompiling
*/
private j c(j var1_1, s var2_2) {
// 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: Started 3 blocks at once
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.getStartingBlocks(Op04StructuredStatement.java:395)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:473)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
private void c(ad ad2, String string, String[] arrstring) {
if (7 == ad2.N) {
throw new RuntimeException(N[1]);
}
s s2 = this.a(ad2);
this.n.a(cg.a(ad2, s2, string, arrstring, false));
}
/*
* Exception decompiling
*/
private void c(s var1_1) {
// 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 [2[TRYBLOCK]], but top level block is 132[SIMPLE_IF_TAKEN]
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:418)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:470)
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:2880)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:816)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
static at d(cg cg2) {
return cg2.a;
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
private p d(s s2) {
String string4;
String string3;
p p2 = new p();
p2.i = s2.e(N[490]);
String string = s2.e(N[489]);
String string2 = s2.e(N[486]);
if (string == null) return p2;
if (string2 == null) return p2;
p2.c = Double.parseDouble(string);
p2.e = Double.parseDouble(string2);
String string5 = s2.e(N[487]);
if (string5 != null) {
p2.d = Integer.parseInt(string5);
}
if ((string3 = s2.e(N[491])) != null) {
p2.f = Float.parseFloat(string3);
}
if ((string4 = s2.e(N[488])) != null) {
p2.j = Integer.parseInt(string4);
}
String string6 = s2.e(N[492]);
long l = 0L;
if (string6 != null) {
l = Integer.parseInt(string6);
}
p2.b = System.currentTimeMillis() - l * 1000L;
return p2;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
catch (RuntimeException runtimeException) {
throw runtimeException;
}
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
/*
* Enabled force condition propagation
* Lifted jumps to return sites
*/
private static ac e(s s2) {
Vector vector = s2.f(N[1247]);
if (vector == null) throw new o(N[1248] + s2.f);
if (vector.size() != 0) return cg.b(vector);
throw new o(N[1248] + s2.f);
}
private String f(String string) {
String string2;
block3 : {
block2 : {
this.o = 1 + this.o;
if (!this.H) break block2;
string2 = string + this.o;
if (ad.q == 0) break block3;
}
string2 = Integer.toHexString(this.o);
}
return string2;
}
private void f(s s2) {
a a2 = this.a(s2);
this.a.a(a2.b, a2.a);
}
private Hashtable g(s s2) {
int n = ad.q;
Hashtable<String, String> hashtable = new Hashtable<String, String>();
if (s2.c != null) {
for (int i2 = 0; i2 < s2.c.length; ++i2) {
s s3 = s2.c[i2];
if (!s.a((s)s3, (String)N[1605])) continue;
hashtable.put(s3.e(N[1604]), s3.e(N[1606]));
if (n == 0) continue;
}
}
return hashtable;
}
private boolean g(String string) {
if (string != null) {
boolean bl = string.endsWith(N[1581]);
if (bl) {
return true;
}
}
return false;
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
private void m() {
int n = ad.q;
int n2 = this.u.size();
int n3 = 0;
while (n3 < n2) {
block12 : {
String string;
s s2;
String string2;
block11 : {
s2 = (s)this.u.elementAt(n3);
string2 = s2.e(N[995]);
if (this.D.containsKey(string2)) break block11;
int n4 = s2.d.length;
cf[] arrcf = new cf[n4 - 1];
int n5 = 0;
int n6 = 0;
while (n5 < n4) {
int n7;
block10 : {
block9 : {
cf cf2 = s2.d[n5];
if (N[992].equals(cf2.b)) break block9;
n7 = n6 + 1;
arrcf[n6] = cf2;
break block10;
}
n7 = n6;
}
int n8 = n5 + 1;
if (n != 0) break;
n5 = n8;
n6 = n7;
}
this.c(new s(s2.f, arrcf, s2.c));
if (n == 0) break block12;
}
if ((string = s2.e(N[991])) == null) {
string = "";
}
ay ay2 = new ay();
ay2.d = s2.e(N[993]);
ay2.e = N[994];
ay2.a = string2;
ay2.b = s2.e(N[990]);
ay2.c = string;
this.a(ay2);
}
int n9 = n3 + 1;
if (n != 0) break;
n3 = n9;
}
this.u.removeAllElements();
this.t.clear();
this.D.clear();
}
public void a() {
this.f(null, null, null);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(int var1_1, String var2_2, String var3_3) {
block12 : {
var5_4 = this.g;
if (var5_4 == null) {
return;
}
switch (var1_1) {
default: {
return;
}
case 0: {
var8_7 = cg.N[1426];
var9_6 = null;
** break;
}
case 1: {
var8_7 = cg.N[1436];
var9_6 = null;
** break;
}
case 2:
}
var6_15 = cg.N[1434];
var7_16 = new cf(cg.N[1430], var3_3);
var8_7 = var6_15;
var9_6 = var7_16;
** break;
lbl25: // 3 sources:
if (var8_7 == null) return;
var10_8 = this.f(cg.N[1440]);
this.y.put(var10_8, new br(this, var1_1, var2_2));
var13_9 = var9_6 == null ? 1 : 3;
var14_10 = new cf[var13_9];
var14_10[0] = new cf(cg.N[1427], var8_7);
if (var9_6 == null) break block12;
var14_10[1] = new cf(cg.N[1431], cg.N[1435]);
var14_10[2] = var9_6;
}
var16_11 = new s(cg.N[1439], var14_10, var2_2);
var17_12 = cg.N[1428];
var18_13 = new cf[]{new cf(cg.N[1429], cg.N[1437]), new cf(cg.N[1433], var10_8), new cf(cg.N[1432], cg.N[1438])};
var19_14 = new s(var17_12, var18_13, var16_11);
this.n.a(var19_14);
}
/*
* Exception decompiling
*/
public void a(int var1_1, Vector var2_2, Runnable var3_3, ak var4_4, c8 var5_5) {
// 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: First case is not immediately after switch.
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.examineSwitchContiguity(SwitchReplacer.java:366)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.rebuildSwitches(SwitchReplacer.java:334)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:515)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
public void a(a9 a92, int n, Runnable runnable, ak ak2, c8 c82) {
c c3 = this.g;
if (c3 == null) {
return;
}
String string = this.f(N[409]);
this.y.put(string, new bo(this, runnable, ak2, c82));
s s2 = this.a(a92, n);
this.a(string, "9", new s(N[410], null, s2));
}
public void a(a9 a92, String string) {
this.a(a92, N[590], string, null, null, true);
}
public void a(a9 a92, String string, String string2) {
this.a(a92, N[1228], string, null, string2, true);
}
public void a(a9 a92, String string, String[] arrstring) {
this.a(a92, N[265], string, arrstring, null, true);
}
public void a(ad ad2, int n, byte[] arrby) {
this.a(ad2.m, ad2.K, n, ad2.x, arrby);
}
public void a(ad ad2, String[] arrstring) {
this.a(ad2, arrstring, true);
}
public void a(ad ad2, String[] arrstring, boolean bl) {
this.a(ad2.m, null, ad2.K, arrstring, ad2.v, bl);
}
public void a(ay ay2) {
this.a(ay2, ay2.a(), true);
}
public void a(ay ay2, boolean bl) {
this.a(ay2, ay2.a(), bl);
}
/*
* Enabled force condition propagation
* Lifted jumps to return sites
*/
public void a(f f2, Runnable runnable, ak ak2, c8 c82) {
f2.d = null;
s s2 = this.a(f2);
if (s2 == null) return;
this.a(new s[]{s2}, runnable, ak2, c82);
return;
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(p p2) {
Vector<cf> vector;
block11 : {
block10 : {
block9 : {
vector = new Vector<cf>(3);
vector.addElement(new cf(N[753], Double.toString(p2.c)));
vector.addElement(new cf(N[752], Double.toString(p2.e)));
long l = (System.currentTimeMillis() - p2.b) / 1000L;
if (l != 0L) {
vector.addElement(new cf(N[755], Long.toString(l)));
}
if (p2.d == p.h) break block9;
vector.addElement(new cf(N[751], Integer.toString(p2.d)));
}
if (p2.f == p.a) break block10;
vector.addElement(new cf(N[754], Float.toString(p2.f)));
}
if (p2.j == p.g) break block11;
vector.addElement(new cf(N[756], Integer.toString(p2.j)));
}
Object[] arrobject = new cf[vector.size()];
vector.copyInto(arrobject);
s s2 = new s(N[757], (cf[])arrobject);
s s3 = new s(N[758], null, s2);
this.n.a(s3);
return;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(Integer n, Boolean bl, Boolean bl2) {
c c3 = this.g;
if (c3 == null) {
return;
}
if (n == null && bl == null) {
if (bl2 == null) return;
}
String string = this.f(N[394]);
Vector<cf> vector = new Vector<cf>(3);
if (n != null) {
vector.addElement(new cf(N[397], n.toString()));
}
if (bl != null) {
vector.addElement(new cf(N[399], bl.toString()));
}
if (bl2 != null) {
vector.addElement(new cf(N[396], bl2.toString()));
}
Object[] arrobject = new cf[vector.size()];
vector.copyInto(arrobject);
s s2 = new s(N[395], (cf[])arrobject);
this.a(string, "c", new s(N[398], null, s2));
return;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
catch (RuntimeException runtimeException) {
throw runtimeException;
}
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
public void a(Runnable runnable) {
String string = this.f(N[413]);
this.y.put(string, new a4(this, runnable));
s s2 = new s(N[416], null);
String string2 = N[419];
cf[] arrcf = new cf[]{new cf(N[414], string), new cf(N[412], N[417]), new cf(N[411], N[415]), new cf(N[418], this.C)};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
public void a(Runnable runnable, ak ak2) {
synchronized (this) {
String string = this.f(N[1573]);
this.y.put(string, new b8(this, runnable, ak2));
s s2 = new s(N[1570], null);
String string2 = N[1566];
cf[] arrcf = new cf[]{new cf(N[1567], string), new cf(N[1574], N[1572]), new cf(N[1575], N[1569]), new cf(N[1571], N[1568])};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3, this.w);
return;
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, int n) {
String string2 = this.f(N[819]);
this.y.put(string2, new bc(this));
String string3 = N[818];
cf[] arrcf = n == 0 ? null : new cf[]{new cf(N[815], N[816])};
s s2 = new s(string3, arrcf);
String string4 = N[817];
cf[] arrcf2 = new cf[]{new cf(N[820], string2), new cf(N[811], N[810]), new cf(N[813], N[812]), new cf(N[814], string)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3, this.w);
}
public void a(String string, long l, a_ a_2) {
Hashtable<String, Long> hashtable = new Hashtable<String, Long>();
hashtable.put(string, new Long(l));
this.a(hashtable, (aj)new au(this, a_2));
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, long l, Runnable runnable, ak ak2) {
String string2 = this.f(N[693]);
this.y.put(string2, new bj(this, runnable, ak2));
String string3 = N[684];
cf[] arrcf = l == 0L ? null : new cf[]{new cf(N[691], Long.toString((l - System.currentTimeMillis()) / 1000L))};
s s2 = new s(string3, arrcf);
String string4 = N[685];
cf[] arrcf2 = new cf[]{new cf(N[688], string2), new cf(N[690], N[689]), new cf(N[686], N[687]), new cf(N[692], string)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, r r2, ak ak2, c8 c82, cj cj2) {
cf[] arrcf;
s s2;
block6 : {
String string2;
if (cj2 != null) {
String string3;
string2 = string3 = cj2.a;
} else {
string2 = this.f(N[895]);
}
this.y.put(string2, new aa(this, r2, string, ak2, c82));
s2 = new s(N[896], null, string);
int n = cj2 == null ? 4 : 5;
arrcf = new cf[n];
arrcf[0] = new cf(N[897], string2);
arrcf[1] = new cf(N[898], N[893]);
arrcf[2] = new cf(N[901], N[900]);
arrcf[3] = new cf(N[892], N[894]);
if (cj2 == null) break block6;
arrcf[4] = new cf(N[902], cj2.b);
}
s s3 = new s(N[899], arrcf, s2);
this.n.a(s3);
}
/*
* Unable to fully structure code
* Enabled aggressive exception aggregation
*/
public void a(String var1_1, Integer var2_2, Vector var3_3, Runnable var4_4, ak var5_5, c8 var6_6) {
var7_7 = ad.q;
var8_8 = this.f(cg.N[530]);
this.y.put(var8_8, new cd(this, var4_4, var5_5, var6_6));
var10_9 = var3_3.size();
var11_10 = new s[var10_9];
var12_11 = 0;
do {
block13 : {
block12 : {
if (var12_11 >= var10_9) ** GOTO lbl22
var20_12 = (a9)var3_3.elementAt(var12_11);
var22_13 = cg.N[529];
var23_14 = new cf[2];
var23_14[0] = new cf(cg.N[524], var20_12.c);
var24_15 = cg.N[526];
if (!var20_12.b) break block12;
var25_16 = cg.N[532];
lbl17: // 2 sources:
do {
block14 : {
var23_14[1] = new cf(var24_15, var25_16);
var11_10[var12_11] = new s(var22_13, var23_14);
var26_17 = var12_11 + 1;
if (var7_7 == 0) break block13;
lbl22: // 2 sources:
var13_18 = new Vector<cf>();
var13_18.addElement(new cf(cg.N[533], cg.N[527]));
var13_18.addElement(new cf(cg.N[535], var1_1));
if (var2_2 == null) break block14;
var19_19 = var2_2;
if (var19_19 <= 0) break block14;
if (var2_2 >= 1000000) break block14;
var13_18.addElement(new cf(cg.N[528], var2_2.toString()));
}
var17_20 = new cf[var13_18.size()];
var13_18.copyInto(var17_20);
var18_21 = new s(cg.N[525], (cf[])var17_20, var11_10);
this.a(var8_8, "f", new s(cg.N[531], null, var18_21));
return;
break;
} while (true);
}
var25_16 = cg.N[534];
** continue;
catch (RuntimeException var14_23) {
throw var14_23;
}
}
var12_11 = var26_17;
} while (true);
}
public void a(String string, Runnable runnable, ak ak2) {
String string2 = this.f(N[805]);
this.y.put(string2, new bf(this, runnable, ak2));
s s2 = new s(N[808], null);
String string3 = N[806];
cf[] arrcf = new cf[]{new cf(N[801], string2), new cf(N[807], N[802]), new cf(N[803], N[804]), new cf(N[809], string)};
s s3 = new s(string3, arrcf, s2);
this.n.a(s3);
}
public void a(String string, Runnable runnable, ak ak2, c8 c82) {
c c3 = this.g;
if (c3 == null) {
return;
}
String string2 = this.f(N[67]);
this.y.put(string2, new ba(this, runnable, ak2, string, c82));
String string3 = N[65];
cf[] arrcf = new cf[]{new cf(N[68], string)};
s s2 = new s(string3, arrcf);
this.a(string2, "d", new s(N[66], null, s2));
}
public void a(String string, Runnable runnable, ak ak2, cj cj2) {
Vector<String> vector = new Vector<String>();
vector.addElement(string);
this.a(vector, runnable, ak2, cj2);
}
public void a(String string, String string2) {
this.d(string, null, string2);
}
public void a(String string, String string2, int n) {
s s2;
block3 : {
block2 : {
if (n != 0) break block2;
String string3 = N[585];
cf[] arrcf = new cf[]{new cf(N[578], string2), new cf(N[587], string), new cf(N[582], N[579])};
s2 = new s(string3, arrcf);
if (ad.q == 0) break block3;
}
String string4 = N[583];
cf[] arrcf = new cf[]{new cf(N[584], Integer.toString(n))};
s s3 = new s(string4, arrcf);
String string5 = N[580];
cf[] arrcf2 = new cf[]{new cf(N[586], string2), new cf(N[589], string), new cf(N[588], N[581])};
s2 = new s(string5, arrcf2, s3);
}
this.n.a(s2);
}
public void a(String string, String string2, r r2, ak ak2) {
String string3 = this.f(N[260]);
this.y.put(string3, new af(this, r2, ak2));
String string4 = N[264];
s[] arrs = new s[]{new s(N[261], null, string), new s(N[256], null, string2)};
s s2 = new s(string4, null, arrs);
String string5 = N[259];
cf[] arrcf = new cf[]{new cf(N[254], N[257]), new cf(N[258], N[253]), new cf(N[262], N[263]), new cf(N[255], string3)};
s s3 = new s(string5, arrcf, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, Runnable runnable, ak ak2, cj cj2) {
s s2;
cf[] arrcf;
block7 : {
String string3;
int n = 4;
if (cj2 != null) {
string3 = cj2.a;
} else {
string3 = this.f(N[701]);
}
this.y.put(string3, new bg(this, runnable, ak2));
s2 = new s(N[705], null, string2);
if (cj2 != null) {
n = 5;
}
arrcf = new cf[n];
arrcf[0] = new cf(N[706], string3);
arrcf[1] = new cf(N[703], N[707]);
arrcf[2] = new cf(N[709], N[704]);
arrcf[3] = new cf(N[702], string);
if (cj2 == null) break block7;
arrcf[4] = new cf(N[710], cj2.b);
}
s s3 = new s(N[708], arrcf, s2);
this.n.a(s3);
}
public void a(String string, String string2, String string3) {
this.b(string, string2, string3, N[1483]);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(String var1_1, String var2_2, String var3_3, int var4_4, boolean var5_5, Vector var6_6, Vector var7_7, boolean var8_8) {
block27 : {
var9_9 = ad.q;
var10_10 = this.f(cg.N[110]);
this.y.put(var10_10, new ar(this, var3_3, var4_4));
var13_11 = var7_7 == null ? 0 : var7_7.size();
var14_12 = new s[var13_11 + var6_6.size()];
var15_13 = 0;
var16_14 = 0;
while (var16_14 < var6_6.size()) {
var46_15 = (String)var6_6.elementAt(var16_14);
var14_12[var15_13] = new s(cg.N[119], new cf[0], var46_15);
var47_16 = var16_14 + 1;
var17_17 = var15_13 + 1;
if (var9_9 == 0) {
var15_13 = var17_17;
var16_14 = var47_16;
continue;
}
break block27;
}
var17_17 = var15_13;
}
var18_18 = var17_17;
var19_19 = 0;
do {
block31 : {
block29 : {
block33 : {
block32 : {
block28 : {
block30 : {
if (var19_19 >= var13_11) break block30;
var41_20 = (String)var7_7.elementAt(var19_19);
var42_21 = cg.N[117];
var43_22 = new cf[]{new cf(cg.N[116], var41_20), new cf(cg.N[121], cg.N[111])};
var14_12[var18_18] = new s(var42_21, var43_22, (s[])null);
var44_23 = var19_19 + 1;
var45_24 = var18_18 + 1;
if (var9_9 == 0) break block31;
}
if (var4_4 != 0) {
var40_25 = cg.N[126].equals(var1_1);
if (!var40_25) break block28;
}
var20_26 = 1;
break block32;
catch (RuntimeException var39_40) {
throw var39_40;
}
}
var20_26 = 0;
}
var21_27 = var20_26 + 2;
var22_28 = var4_4 == 0 ? 1 : 0;
var23_29 = var21_27 + var22_28;
var24_30 = var5_5 != false ? 1 : 0;
var25_31 = new cf[var24_30 + var23_29];
var25_31[0] = new cf(cg.N[123], var3_3);
var25_31[1] = new cf(cg.N[124], String.valueOf(var4_4));
if (var4_4 == 0) ** GOTO lbl57
if (!cg.N[107].equals(var1_1)) break block33;
lbl57: // 2 sources:
var25_31[2] = new cf(cg.N[128], var1_1);
}
if (var4_4 != 0) break block29;
{
catch (RuntimeException var27_42) {
throw var27_42;
}
}
var25_31[2] = new cf(cg.N[114], var1_1);
var25_31[3] = new cf(cg.N[122], var2_2);
}
if (var5_5) {
var25_31[-1 + var25_31.length] = new cf(cg.N[125], cg.N[127]);
}
var28_32 = new s(cg.N[108], var25_31, var14_12);
var29_33 = cg.N[109];
var30_34 = new cf[]{new cf(cg.N[120], var10_10), new cf(cg.N[112], cg.N[115]), new cf(cg.N[118], cg.N[113])};
var31_35 = new s(var29_33, var30_34, var28_32);
var33_36 = this.n;
var34_37 = var8_8 != false ? 2 : 0;
var35_38 = var34_37 | 1;
var33_36.a(var31_35, var35_38);
if (DialogToastActivity.e == 0) return;
ad.q = var9_9 + 1;
return;
catch (RuntimeException var26_41) {
throw var26_41;
}
catch (RuntimeException var37_44) {
throw var37_44;
}
}
var18_18 = var45_24;
var19_19 = var44_23;
} while (true);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, String string3, String string4) {
cf[] arrcf;
block10 : {
int n;
block9 : {
block8 : {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (string4 != null) {
int n2 = string4.length();
if (n2 <= 0) break block8;
n = 2;
break block9;
}
}
n = 1;
}
arrcf = new cf[n];
arrcf[0] = new cf(N[905], string3);
if (arrcf.length <= 1) break block10;
arrcf[1] = new cf(N[906], string4);
}
s s2 = new s(N[903], arrcf);
String string5 = N[907];
cf[] arrcf2 = new cf[]{new cf(N[908], string2), new cf(N[904], string)};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
public void a(String string, String string2, String string3, String string4, int n, byte[] arrby) {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
s[] arrs = new s[2];
String string5 = N[277];
cf[] arrcf = new cf[]{new cf(N[278], string4), new cf(N[281], String.valueOf(n))};
arrs[0] = new s(string5, arrcf);
arrs[1] = new s(N[276], null, arrby);
String string6 = N[282];
cf[] arrcf2 = new cf[]{new cf(N[280], string3)};
s s2 = new s(string6, arrcf2, arrs);
String string7 = N[274];
cf[] arrcf3 = new cf[]{new cf(N[279], string2), new cf(N[275], string)};
s s3 = new s(string7, arrcf3, s2);
this.n.a(s3);
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(String string, String string2, String string3, String string4, int n, byte[][] arrby, int[] arrn, byte[] arrby2, byte[] arrby3, byte[] arrby4, int n2) {
int n3;
int n4;
int n5 = ad.q;
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (arrby != null) {
n4 = arrby.length;
} else {
n4 = 0;
}
if (arrn != null) {
n3 = arrn.length;
} else {
n3 = 0;
}
if (n4 != n3) {
throw new IllegalArgumentException(N[1494]);
}
int n6 = arrby4 == null ? 3 : 4;
s[] arrs = new s[n6 + n4];
String string5 = N[1493];
cf[] arrcf = new cf[]{new cf(N[1498], string4), new cf(N[1502], String.valueOf(n))};
arrs[0] = new s(string5, arrcf);
arrs[1] = new s(N[1501], null, arrby2);
arrs[2] = new s(N[1507], null, arrby3);
for (int i2 = 0; i2 < n4; ++i2) {
cf[] arrcf2 = new cf[]{new cf(N[1495], String.valueOf(arrn[i2]))};
arrs[i2 + 3] = new s(N[1503], arrcf2, arrby[i2]);
if (n5 == 0) continue;
}
if (arrby4 != null) {
int n7 = -1 + arrs.length;
String string6 = N[1496];
String string7 = N[1492];
cf[] arrcf3 = new cf[]{new cf(N[1497], String.valueOf(n2))};
arrs[n7] = new s(string6, null, new s(string7, arrcf3, arrby4));
}
String string8 = N[1505];
cf[] arrcf4 = new cf[]{new cf(N[1506], string3)};
s s2 = new s(string8, arrcf4, arrs);
String string9 = N[1499];
cf[] arrcf5 = new cf[]{new cf(N[1500], string2), new cf(N[1504], string)};
s s3 = new s(string9, arrcf5, s2);
this.n.a(s3);
return;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, String string3, String string4, long l) {
cf[] arrcf;
block11 : {
boolean bl;
block10 : {
block9 : {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (string4 != null) {
int n = string4.length();
if (n <= 0) break block9;
bl = true;
break block10;
}
}
bl = false;
}
boolean bl2 = l > 0L;
int n = bl ? 1 : 0;
int n2 = n + 1;
int n3 = bl2 ? 1 : 0;
arrcf = new cf[n3 + n2];
arrcf[0] = new cf(N[1287], string3);
if (bl) {
arrcf[1] = new cf(N[1285], string4);
}
if (!bl2) break block11;
int n4 = bl ? 2 : 1;
arrcf[n4] = new cf(N[1288], String.valueOf(l));
}
s s2 = new s(N[1291], arrcf);
String string5 = N[1290];
cf[] arrcf2 = new cf[]{new cf(N[1286], string2), new cf(N[1289], string)};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, String string3, String string4, long l, k k2) {
s s2;
String string5;
block3 : {
block2 : {
string5 = this.f(N[1012]);
this.y.put(string5, new b1(this, k2));
if (string3 != null) break block2;
String string6 = N[1004];
cf[] arrcf = new cf[]{new cf(N[1015], string2), new cf(N[1016], string4), new cf(N[1010], Long.toString(l))};
s2 = new s(string6, arrcf);
break block3;
}
String string7 = N[1018];
cf[] arrcf = new cf[]{new cf(N[1007], string2), new cf(N[1013], string3), new cf(N[1008], string4), new cf(N[1005], Long.toString(l))};
s2 = new s(string7, arrcf);
}
String string8 = N[1006];
cf[] arrcf = new cf[]{new cf(N[1019], string5), new cf(N[1003], N[1002]), new cf(N[1014], N[1011]), new cf(N[1009], N[1017])};
s s3 = new s(string8, arrcf, s2);
this.n.a(s3);
}
/*
* Unable to fully structure code
* Enabled force condition propagation
* Lifted jumps to return sites
*/
public void a(String var1_1, String var2_2, String var3_3, String var4_4, String var5_5, int var6_6, int var7_7, boolean var8_8, boolean var9_9, String var10_10, String var11_11, boolean var12_12) {
block37 : {
block36 : {
block35 : {
var13_13 = ad.q;
var15_14 = this.g;
if (var15_14 == null) {
return;
}
var16_16 = this.f(cg.N[713]);
this.y.put(var16_16, new bm(this, var1_1, var2_2, var4_4, var5_5));
var18_17 = new Vector<cf>(2);
var18_17.addElement(new cf(cg.N[712], cg.N[722]));
switch (var6_6) {
default: {
if (var13_13 == 0) break;
}
case 1: {
var18_17.addElement(new cf(cg.N[714], cg.N[727]));
if (var13_13 == 0) break;
}
case 2: {
var18_17.addElement(new cf(cg.N[724], cg.N[729]));
}
}
var22_18 = new cf[var18_17.size()];
var18_17.copyInto(var22_18);
if (var3_3 == null) break block35;
var24_19 = 1;
lbl29: // 2 sources:
do {
var25_20 = new s[var24_19 + 4];
var25_20[0] = new s(cg.N[721], (cf[])var22_18, var1_1);
var27_21 = cg.N[725];
var28_22 = new cf[3];
var28_22[0] = new cf(cg.N[715], Integer.toString(var7_7));
var29_23 = cg.N[734];
if (!var8_8) break block36;
var30_24 = cg.N[719];
lbl40: // 2 sources:
do {
var28_22[1] = new cf(var29_23, var30_24);
var31_25 = cg.N[736];
if (!var9_9) break block37;
var32_26 = cg.N[717];
lbl45: // 2 sources:
do {
block38 : {
var28_22[2] = new cf(var31_25, var32_26);
var25_20[1] = new s(var27_21, var28_22);
var25_20[2] = new s(cg.N[711], null, var5_5);
var33_27 = new Vector<cf>(3);
if (var10_10 != null) {
var33_27.addElement(new cf(cg.N[716], var10_10));
}
if (var11_11 != null) {
var33_27.addElement(new cf(cg.N[718], var11_11));
}
if (var12_12) {
var33_27.addElement(new cf("t", cg.N[731]));
}
var34_28 = new cf[var33_27.size()];
var33_27.copyInto(var34_28);
var25_20[3] = new s(cg.N[728], (cf[])var34_28);
if (var3_3 == null) break block38;
var25_20[4] = new s(cg.N[737], null, var3_3);
}
var36_29 = cg.N[738];
var37_30 = new cf[]{new cf(cg.N[723], cg.N[730]), new cf(cg.N[733], cg.N[735]), new cf(cg.N[720], var16_16)};
var38_31 = new s(var36_29, var37_30, var25_20);
this.n.a(var38_31);
return;
break;
} while (true);
break;
} while (true);
break;
} while (true);
catch (RuntimeException var19_32) {
throw var19_32;
}
}
var24_19 = 0;
** while (true)
catch (RuntimeException var26_36) {
throw var26_36;
}
}
var30_24 = cg.N[732];
** while (true)
}
var32_26 = cg.N[726];
** while (true)
catch (RuntimeException var41_37) {
throw var41_37;
}
catch (RuntimeException var40_38) {
throw var40_38;
}
catch (RuntimeException var39_39) {
throw var39_39;
}
catch (RuntimeException var35_40) {
throw var35_40;
}
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(String var1_1, String var2_2, String var3_3, Vector var4_4, r var5_5, ak var6_6, cj var7_7) {
var8_8 = ad.q;
if (var7_7 != null) {
var9_10 = var35_9 = var7_7.a;
} else {
var9_10 = this.f(cg.N[1470]);
}
this.y.put(var9_10, new b2(this, var5_5, var6_6));
var11_11 = var4_4.size();
var12_12 = null;
if (var11_11 <= 0) ** GOTO lbl25
var28_13 = new s[var4_4.size()];
var29_14 = 0;
do {
block27 : {
block25 : {
block24 : {
block23 : {
block22 : {
block21 : {
block26 : {
if (var29_14 >= var28_13.length) break block26;
var30_17 = (String)var4_4.elementAt(var29_14);
var31_18 = cg.N[1466];
var32_15 = new cf[]{new cf(cg.N[1477], var30_17)};
var28_13[var29_14] = new s(var31_18, var32_15);
var33_16 = var29_14 + 1;
if (var8_8 == 0) break block27;
}
var12_12 = var28_13;
lbl25: // 2 sources:
var13_19 = 1;
if (var2_2 != null) {
var27_20 = var2_2.length();
if (var27_20 <= 0) break block21;
var13_19 = 2;
}
}
if (var3_3 != null) {
var25_21 = var3_3.length();
if (var25_21 <= 0) break block22;
++var13_19;
}
}
var14_22 = new cf[var13_19];
var14_22[0] = new cf(cg.N[1478], var1_1);
var15_23 = 1;
if (var2_2 != null) {
if (var2_2.length() <= 0) break block23;
var14_22[var15_23] = new cf(cg.N[1467], var2_2);
var15_23 = 2;
}
}
if (var3_3 != null) {
if (var3_3.length() <= 0) break block24;
var14_22[var15_23] = new cf(cg.N[1479], var3_3);
var15_23 + 1;
}
}
var16_24 = var12_12 == null ? new s(cg.N[1481], var14_22) : new s(cg.N[1468], var14_22, var12_12);
var17_25 = var7_7 == null ? 4 : 5;
var18_26 = new cf[var17_25];
var18_26[0] = new cf(cg.N[1471], cg.N[1469]);
var18_26[1] = new cf(cg.N[1472], var9_10);
var18_26[2] = new cf(cg.N[1474], cg.N[1480]);
var18_26[3] = new cf(cg.N[1475], cg.N[1482]);
if (var7_7 == null) break block25;
var18_26[4] = new cf(cg.N[1473], var7_7.b);
}
var20_27 = new s(cg.N[1476], var18_26, var16_24);
this.n.a(var20_27);
return;
catch (RuntimeException var26_29) {
throw var26_29;
}
catch (RuntimeException var24_30) {
throw var24_30;
}
catch (RuntimeException var23_31) {
throw var23_31;
}
catch (RuntimeException var21_32) {
throw var21_32;
}
}
var29_14 = var33_16;
} while (true);
}
public void a(String string, String string2, String string3, boolean bl) {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
this.n.a(this.a(string, string2, string3, bl, N[551]));
}
public void a(String string, String string2, String string3, byte[] arrby, int n) {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
String string4 = N[700];
cf[] arrcf = new cf[]{new cf(N[699], String.valueOf(n))};
s s2 = new s(string4, arrcf, arrby);
String string5 = N[694];
cf[] arrcf2 = new cf[]{new cf(N[698], string3)};
s s3 = new s(string5, arrcf2, s2);
String string6 = N[697];
cf[] arrcf3 = new cf[]{new cf(N[696], string2), new cf(N[695], string)};
s s4 = new s(string6, arrcf3, s3);
this.n.a(s4);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, String string3, String[] arrstring, int[] arrn, byte[][] arrby, int[] arrn2, byte[] arrby2, byte[] arrby3) {
int n;
int n2;
int n3 = ad.q;
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (arrstring.length != arrn.length) {
throw new IllegalArgumentException(N[1539]);
}
if (arrstring.length == 0) {
throw new IllegalArgumentException(N[1529]);
}
if (arrby != null) {
n2 = arrby.length;
} else {
n2 = 0;
}
if (arrn2 != null) {
n = arrn2.length;
} else {
n = 0;
}
if (n2 != n) {
throw new IllegalArgumentException(N[1530]);
}
s[] arrs = new s[2 + (n2 + arrstring.length)];
for (int i2 = 0; i2 < arrstring.length; ++i2) {
String string4 = N[1535];
cf[] arrcf = new cf[]{new cf(N[1542], arrstring[i2]), new cf(N[1531], String.valueOf(arrn[i2]))};
arrs[i2] = new s(string4, arrcf);
if (n3 == 0) continue;
}
arrs[arrstring.length] = new s(N[1537], null, arrby2);
arrs[1 + arrstring.length] = new s(N[1543], null, arrby3);
for (int i3 = 0; i3 < n2; ++i3) {
cf[] arrcf = new cf[]{new cf(N[1540], String.valueOf(arrn2[i3]))};
arrs[i3 + (2 + arrstring.length)] = new s(N[1532], arrcf, arrby[i3]);
if (n3 == 0) continue;
}
String string5 = N[1541];
cf[] arrcf = new cf[]{new cf(N[1533], string3)};
s s2 = new s(string5, arrcf, arrs);
String string6 = N[1534];
cf[] arrcf2 = new cf[]{new cf(N[1538], string2), new cf(N[1536], string)};
s s3 = new s(string6, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, String string3, byte[][] arrby, int[] arrn) {
int n;
int n2;
int n3 = ad.q;
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (arrby != null) {
n = arrby.length;
} else {
n = 0;
}
if (arrn != null) {
n2 = arrn.length;
} else {
n2 = 0;
}
if (n != n2) {
throw new IllegalArgumentException(N[63]);
}
s[] arrs = new s[n];
for (int i2 = 0; i2 < n; ++i2) {
cf[] arrcf = new cf[]{new cf(N[59], String.valueOf(arrn[i2]))};
arrs[i2] = new s(N[64], arrcf, arrby[i2]);
if (n3 == 0) continue;
}
String string4 = N[61];
cf[] arrcf = new cf[]{new cf(N[58], string3)};
s s2 = new s(string4, arrcf, arrs);
String string5 = N[57];
cf[] arrcf2 = new cf[]{new cf(N[62], string2), new cf(N[60], string)};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, String string2, boolean bl, Runnable runnable, ak ak2) {
c c3 = this.g;
if (c3 == null) {
return;
}
this.y.put(string, new bh(this, runnable, ak2));
String string3 = bl ? N[1599] : N[1597];
cf[] arrcf = new cf[]{new cf(N[1598], N[1594])};
s s2 = new s(string3, arrcf, string2);
String string4 = N[1596];
cf[] arrcf2 = new cf[]{new cf(N[1595], N[1601]), new cf(N[1602], N[1600]), new cf(N[1603], string)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
/*
* Exception decompiling
*/
public void a(String var1_1, Vector var2_2, int var3_3, ak var4_4, c8 var5_5) {
// 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.CannotPerformDecode: reachable test BLOCK was exited and re-entered.
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.Misc.getFarthestReachableInRange(Misc.java:143)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.examineSwitchContiguity(SwitchReplacer.java:385)
// org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.SwitchReplacer.replaceRawSwitches(SwitchReplacer.java:65)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:401)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
public void a(String string, Vector vector, Runnable runnable, ak ak2, c8 c82) {
int n = ad.q;
c c3 = this.g;
if (c3 == null) {
return;
}
String string2 = this.f(N[1336]);
this.y.put(string2, new cx(this, runnable, ak2, c82));
s[] arrs = new s[vector.size()];
int n2 = 0;
do {
int n3;
block9 : {
block8 : {
if (n2 >= vector.size()) break block8;
String string3 = N[1335];
cf[] arrcf = new cf[]{new cf(N[1340], (String)vector.elementAt(n2))};
arrs[n2] = new s(string3, arrcf);
n3 = n2 + 1;
if (n == 0) break block9;
}
String string4 = N[1339];
cf[] arrcf = new cf[]{new cf(N[1334], string), new cf(N[1337], N[1333])};
s s2 = new s(string4, arrcf, arrs);
this.a(string2, "e", new s(N[1338], null, s2));
return;
}
n2 = n3;
} while (true);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, Vector vector, Runnable runnable, ak ak2, cj cj2) {
String string2;
if (cj2 != null) {
string2 = cj2.a;
} else {
string2 = this.f(N[150]);
}
this.y.put(string2, new bk(this, runnable, ak2));
this.a(string, vector, string2, N[149], cj2);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String string, boolean bl, ak ak2, ak ak3) {
String string2 = this.f(N[599]);
this.y.put(string2, new bz(this, ak2, ak3));
String string3 = N[600];
cf[] arrcf = bl ? new cf[]{new cf(N[597], N[598])} : null;
s s2 = new s(string3, arrcf);
String string4 = N[593];
cf[] arrcf2 = new cf[]{new cf(N[595], string2), new cf(N[596], N[601]), new cf(N[591], N[592]), new cf(N[594], string)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
public void a(String string, boolean bl, Runnable runnable, ak ak2) {
s s2;
String string2;
block3 : {
block2 : {
string2 = this.f(N[300]);
this.y.put(string2, new a5(this, runnable, ak2));
if (!bl) break block2;
String string3 = N[295];
cf[] arrcf = new cf[]{new cf(N[304], string), new cf(N[306], N[296])};
s2 = new s(string3, arrcf);
if (ad.q == 0) break block3;
}
String string4 = N[302];
cf[] arrcf = new cf[]{new cf(N[307], string)};
s2 = new s(string4, arrcf);
}
String string5 = N[305];
cf[] arrcf = new cf[]{new cf(N[297], string2), new cf(N[301], N[299]), new cf(N[298], N[303]), new cf(N[309], N[308])};
s s3 = new s(string5, arrcf, s2);
this.n.a(s3);
}
public void a(String string, byte[] arrby, Runnable runnable, ak ak2) {
String string2 = this.f(N[747]);
this.y.put(string2, new a8(this, runnable, ak2));
s s2 = new s(N[739], null, string);
s s3 = new s(N[750], null, arrby);
s s4 = new s(N[742], null, new s[]{s2, s3});
String string3 = N[744];
cf[] arrcf = new cf[]{new cf(N[745], string2), new cf(N[743], N[749]), new cf(N[740], N[748]), new cf(N[746], N[741])};
s s5 = new s(string3, arrcf, s4);
this.n.a(s5);
}
public void a(String string, byte[] arrby, byte[] arrby2, r r2, ak ak2, cj cj2) {
this.a(string, arrby, null, 0, arrby2, null, 0, r2, ak2, cj2);
}
public void a(String string, byte[] arrby, byte[] arrby2, Runnable runnable, String string2) {
String string3 = this.f(N[1249]);
am am2 = new am(this, string, arrby, arrby2, runnable);
this.y.put(string3, am2);
String string4 = N[1261];
cf[] arrcf = new cf[]{new cf(N[1250], N[1257]), new cf(N[1255], string)};
s[] arrs = new s[]{new s(string2, null, arrby2), new s(N[1253], null, arrby)};
s s2 = new s(string4, arrcf, arrs);
String string5 = N[1262];
cf[] arrcf2 = new cf[]{new cf(N[1256], N[1252]), new cf(N[1260], N[1258]), new cf(N[1251], N[1259]), new cf(N[1254], string3)};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
public void a(Hashtable hashtable) {
this.a(hashtable, (aj)new ao(this, hashtable));
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(Hashtable hashtable, Runnable runnable, ak ak2) {
int n = ad.q;
String string = this.f(N[1402]);
this.y.put(string, new b9(this, runnable, ak2));
s[] arrs = new s[hashtable.size()];
Enumeration enumeration = hashtable.elements();
int n2 = 0;
do {
int n3;
block6 : {
block5 : {
if (!enumeration.hasMoreElements()) break block5;
String string2 = (String)enumeration.nextElement();
String string3 = N[1415];
cf[] arrcf = new cf[]{new cf(N[1406], N[1419]), new cf(N[1407], string2), new cf(N[1412], N[1418]), new cf(N[1408], Integer.toString(n2))};
arrs[n2] = new s(string3, arrcf);
n3 = n2 + 1;
if (n == 0) break block6;
}
String string4 = N[1410];
cf[] arrcf = new cf[]{new cf(N[1414], N[1416])};
int n4 = arrs.length;
s[] arrs2 = n4 == 0 ? null : arrs;
s s2 = new s(string4, arrcf, arrs2);
s s3 = new s(N[1405], null, s2);
String string5 = N[1413];
cf[] arrcf2 = new cf[]{new cf(N[1409], string), new cf(N[1403], N[1411]), new cf(N[1404], N[1417])};
s s4 = new s(string5, arrcf2, s3);
this.n.a(s4);
return;
}
n2 = n3;
} while (true);
}
public void a(Vector vector, Runnable runnable, ak ak2) {
int n = ad.q;
String string = this.f(N[40]);
this.y.put(string, new bi(this, runnable, ak2));
int n2 = vector.size();
s[] arrs = new s[n2];
int n3 = 0;
do {
int n4;
block4 : {
block3 : {
if (n3 >= n2) break block3;
String string2 = N[36];
cf[] arrcf = new cf[]{new cf(N[38], (String)vector.elementAt(n3))};
arrs[n3] = new s(string2, arrcf);
n4 = n3 + 1;
if (n == 0) break block4;
}
s s2 = new s(N[33], null, arrs);
String string3 = N[34];
cf[] arrcf = new cf[]{new cf(N[39], string), new cf(N[42], N[35]), new cf(N[32], N[37]), new cf(N[43], N[41])};
s s3 = new s(string3, arrcf, s2);
this.n.a(s3);
return;
}
n3 = n4;
} while (true);
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void a(Vector vector, Runnable runnable, ak ak2, c8 c82) {
int n = ad.q;
int n2 = vector.size();
Vector<s> vector2 = new Vector<s>(n2);
int n3 = 0;
while (n3 < n2) {
int n4;
block7 : {
s s2;
f f2 = (f)vector.elementAt(n3);
String string = f2.d;
if ((string != null || n != 0) && (s2 = this.a(f2)) != null) {
vector2.addElement(s2);
}
n4 = n3 + 1;
if (n != 0) {
break;
}
break block7;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
n3 = n4;
}
if (vector2.size() == 0) return;
Object[] arrobject = new s[vector2.size()];
vector2.copyInto(arrobject);
this.a((s[])arrobject, runnable, ak2, c82);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(Vector vector, Runnable runnable, ak ak2, cj cj2) {
String string;
int n = ad.q;
if (cj2 != null) {
String string2;
string = string2 = cj2.a;
} else {
string = this.f(N[554]);
}
this.y.put(string, new bl(this, runnable, ak2));
int n2 = vector.size();
s[] arrs = new s[n2];
int n3 = 0;
do {
int n4;
block10 : {
cf[] arrcf;
s s2;
block8 : {
block9 : {
if (n3 >= n2) break block9;
String string3 = N[563];
cf[] arrcf2 = new cf[]{new cf(N[561], (String)vector.elementAt(n3))};
arrs[n3] = new s(string3, arrcf2);
n4 = n3 + 1;
if (n == 0) break block10;
}
s2 = new s(N[552], null, arrs);
int n5 = cj2 == null ? 4 : 5;
arrcf = new cf[n5];
arrcf[0] = new cf(N[559], string);
arrcf[1] = new cf(N[553], N[556]);
arrcf[2] = new cf(N[558], N[562]);
arrcf[3] = new cf(N[557], N[564]);
if (cj2 == null) break block8;
arrcf[4] = new cf(N[555], cj2.b);
}
s s3 = new s(N[560], arrcf, s2);
this.n.a(s3);
return;
}
n3 = n4;
} while (true);
}
public void a(boolean bl2) {
this.z = bl2;
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(boolean bl2, Runnable runnable, ak ak2) {
c c3 = this.g;
if (c3 == null) {
return;
}
String string = this.f(N[509]);
this.y.put(string, new b0(this, runnable, ak2));
cf[] arrcf = bl2 ? null : new cf[]{new cf(N[507], N[501])};
s s2 = new s(N[503], arrcf);
String string2 = N[505];
cf[] arrcf2 = new cf[]{new cf(N[504], string), new cf(N[506], N[502]), new cf(N[508], N[510])};
s s3 = new s(string2, arrcf2, s2);
this.n.a(s3);
}
public void a(byte[] arrby, Runnable runnable, ak ak2) {
String string = this.f(N[1462]);
this.y.put(string, new az(this, runnable, ak2));
s s2 = new s(N[1459], null, arrby);
String string2 = N[1460];
cf[] arrcf = new cf[]{new cf(N[1457], string), new cf(N[1464], N[1456]), new cf(N[1465], N[1463]), new cf(N[1461], N[1458])};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
public void a(byte[] arrby, Runnable runnable, ak ak2, c8 c82, boolean bl2) {
this.a(arrby, Long.toString(System.currentTimeMillis() / 1000L), runnable, ak2, c82, bl2);
}
public void a(byte[] arrby, String string, Runnable runnable, ak ak2, c8 c82, boolean bl2) {
this.a(arrby, null, 0, string, runnable, ak2, c82, bl2);
}
public void a(byte[] arrby, byte[] arrby2, byte by, c_[] arrc_, c_ c_2) {
int n = ad.q;
String string = this.f(N[141]);
this.y.put(string, new bw(this));
s[] arrs = new s[arrc_.length];
for (int i2 = 0; i2 < arrc_.length; ++i2) {
String string2 = N[132];
s[] arrs2 = new s[]{new s(N[134], null, arrc_[i2].b), new s(N[148], null, arrc_[i2].c)};
arrs[i2] = new s(string2, null, arrs2);
if (n == 0) continue;
}
String string3 = N[129];
cf[] arrcf = new cf[]{new cf(N[133], string), new cf(N[136], N[138]), new cf(N[145], N[143]), new cf(N[131], N[147])};
s[] arrs3 = new s[5];
arrs3[0] = new s(N[144], null, arrby);
arrs3[1] = new s(N[146], null, arrby2);
arrs3[2] = new s(N[135], null, new byte[]{by});
arrs3[3] = new s(N[137], null, arrs);
String string4 = N[139];
s[] arrs4 = new s[]{new s(N[142], null, c_2.b), new s(N[130], null, c_2.c), new s(N[140], null, c_2.a)};
arrs3[4] = new s(string4, null, arrs4);
s s2 = new s(string3, arrcf, arrs3);
this.n.a(s2);
}
public void a(byte[] arrby, byte[] arrby2, String string) {
String string2 = this.f(N[46]);
a1 a12 = new a1(this, arrby);
this.y.put(string2, a12);
String string3 = N[50];
cf[] arrcf = new cf[]{new cf(N[56], string)};
s[] arrs = new s[]{new s(N[53], null, arrby), new s(N[47], null, arrby2)};
s s2 = new s(string3, arrcf, arrs);
String string4 = N[54];
cf[] arrcf2 = new cf[]{new cf(N[48], N[52]), new cf(N[51], N[49]), new cf(N[44], N[45]), new cf(N[55], string2)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void a(String[] arrstring, Runnable runnable, ak ak2) {
s[] arrs;
String string;
block5 : {
s[] arrs2;
block4 : {
block3 : {
int n;
int n2 = ad.q;
string = this.f(N[986]);
this.y.put(string, new bq(this, runnable, ak2));
if (arrstring == null || (n = arrstring.length) <= 0) break block3;
arrs2 = new s[arrstring.length];
for (int i2 = 0; i2 < arrstring.length; ++i2) {
String string2 = N[987];
cf[] arrcf = new cf[]{new cf(N[982], arrstring[i2])};
arrs2[i2] = new s(string2, arrcf);
if (n2 == 0) continue;
}
if (n2 == 0) break block4;
}
arrs = null;
break block5;
}
arrs = arrs2;
}
s s2 = new s(N[983], null, arrs);
String string3 = N[981];
cf[] arrcf = new cf[]{new cf(N[978], string), new cf(N[977], N[979]), new cf(N[985], N[976]), new cf(N[984], N[980])};
s s3 = new s(string3, arrcf, s2);
this.n.a(s3);
}
public Integer b() {
return this.E;
}
public void b(ad ad2) {
this.a(ad2, null);
}
/*
* Unable to fully structure code
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void b(ad var1_1, String var2_2, String[] var3_3) {
var6_4 = var1_1.N;
if (var6_4 == 0) ** GOTO lbl9
{
catch (RuntimeException var4_5) {
throw var4_5;
}
}
this.c(var1_1, var2_2, var3_3);
if (ad.q == 0) return;
lbl9: // 2 sources:
this.a(var1_1, var2_2, var3_3);
return;
}
public void b(ay ay2, boolean bl2) {
s s2 = null;
if (bl2) {
cf cf2 = new cf(N[549], N[550]);
s2 = new s(N[548], new cf[]{cf2}, (s[])null);
}
this.a(ay2, s2, this.b);
}
public void b(Runnable runnable, ak ak2) {
synchronized (this) {
String string = this.f(N[1325]);
this.y.put(string, new by(this, runnable, ak2));
s s2 = new s(N[1322], null);
String string2 = N[1320];
cf[] arrcf = new cf[]{new cf(N[1321], string), new cf(N[1327], N[1329]), new cf(N[1328], N[1323]), new cf(N[1324], N[1326])};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3, this.w);
return;
}
}
public void b(String string) {
this.x = string;
}
public void b(String string, int n) {
c c3 = this.g;
if (c3 == null) {
return;
}
String string2 = N[1294];
cf[] arrcf = new cf[]{new cf(N[1295], Integer.toString(n))};
s s2 = new s(string2, arrcf);
String string3 = N[1293];
cf[] arrcf2 = new cf[]{new cf(N[1292], string), new cf(N[1296], N[1297]), new cf(N[1298], N[1299])};
s s3 = new s(string3, arrcf2, s2);
this.n.a(s3);
}
public void b(String string, Runnable runnable, ak ak2) {
String string2 = this.f(N[404]);
this.y.put(string2, new b4(this, runnable, ak2));
s s2 = new s(N[407], null);
String string3 = N[402];
cf[] arrcf = new cf[]{new cf(N[406], string2), new cf(N[400], N[403]), new cf(N[405], N[401]), new cf(N[408], string)};
s s3 = new s(string3, arrcf, s2);
this.n.a(s3);
}
public void b(String string, String string2, String string3) {
s s2;
String string4;
block3 : {
block2 : {
string4 = this.f(N[313]);
this.y.put(string4, new cb(this, string, string2));
if (string3 == null) break block2;
String string5 = N[316];
cf[] arrcf = new cf[]{new cf(N[326], string), new cf(N[327], string3.toString()), new cf(N[315], string2)};
s2 = new s(string5, arrcf);
if (ad.q == 0) break block3;
}
String string6 = N[323];
cf[] arrcf = new cf[]{new cf(N[325], string), new cf(N[320], string2)};
s2 = new s(string6, arrcf);
}
String string7 = N[319];
cf[] arrcf = new cf[]{new cf(N[324], string4), new cf(N[321], N[314]), new cf(N[317], N[322]), new cf(N[318], this.C)};
s s3 = new s(string7, arrcf, s2);
this.n.a(s3, this.w);
}
public void b(String string, String string2, String string3, boolean bl2) {
ag ag2 = this.J;
if (ag2 == null) {
return;
}
this.n.a(this.a(string, string2, string3, bl2, N[0]));
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void b(String string, String string2, String string3, byte[][] arrby, int[] arrn) {
int n;
int n2;
int n3 = ad.q;
ag ag2 = this.J;
if (ag2 == null) {
return;
}
if (arrby != null) {
n = arrby.length;
} else {
n = 0;
}
if (arrn != null) {
n2 = arrn.length;
} else {
n2 = 0;
}
if (n != n2) {
throw new IllegalArgumentException(N[1361]);
}
s[] arrs = new s[n];
for (int i2 = 0; i2 < n; ++i2) {
cf[] arrcf = new cf[]{new cf(N[1365], String.valueOf(arrn[i2]))};
arrs[i2] = new s(N[1360], arrcf, arrby[i2]);
if (n3 == 0) continue;
}
String string4 = N[1362];
cf[] arrcf = new cf[]{new cf(N[1367], string3)};
s s2 = new s(string4, arrcf, arrs);
String string5 = N[1366];
cf[] arrcf2 = new cf[]{new cf(N[1363], string2), new cf(N[1364], string)};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void b(String string, Vector vector, Runnable runnable, ak ak2, cj cj2) {
String string2;
if (cj2 != null) {
string2 = cj2.a;
} else {
string2 = this.f(N[495]);
}
this.y.put(string2, new bn(this, runnable, ak2));
this.a(string, vector, string2, N[496], cj2);
}
public void b(Hashtable hashtable) {
int n = ad.q;
String string = this.f(N[572]);
this.y.put(string, new bd(this));
s[] arrs = new s[hashtable.size()];
Enumeration enumeration = hashtable.keys();
int n2 = 0;
do {
int n3;
block4 : {
block3 : {
if (!enumeration.hasMoreElements()) break block3;
String string2 = (String)enumeration.nextElement();
String string3 = (String)hashtable.get(string2);
String string4 = N[566];
cf[] arrcf = new cf[]{new cf(N[577], string2), new cf(N[568], string3)};
arrs[n2] = new s(string4, arrcf);
n3 = n2 + 1;
if (n == 0) break block4;
}
s s2 = new s(N[574], null, arrs);
String string5 = N[567];
cf[] arrcf = new cf[]{new cf(N[565], N[573]), new cf(N[575], N[570]), new cf(N[571], string), new cf(N[576], N[569])};
s s3 = new s(string5, arrcf, s2);
this.n.a(s3);
return;
}
n2 = n3;
} while (true);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void b(Vector vector, Runnable runnable, ak ak2, c8 c82) {
block4 : {
c c3 = this.g;
if (c3 != null) break block4;
return;
}
String string = this.f(N[340]);
this.y.put(string, new ce(this, runnable, ak2, c82));
Vector vector2 = new Vector(vector.size());
this.a(vector, vector2);
if (vector2.size() == 0) {
return;
}
Object[] arrobject = new s[vector2.size()];
vector2.copyInto(arrobject);
this.a(string, "b", new s(N[339], null, (s[])arrobject));
}
public void b(boolean bl2) {
this.F.a(false);
this.c(bl2);
}
public void b(byte[] arrby, byte[] arrby2, String string) {
String string2 = this.f(N[481]);
ah ah2 = new ah(this, arrby, arrby2);
this.y.put(string2, ah2);
String string3 = N[484];
cf[] arrcf = new cf[]{new cf(N[474], N[483])};
s[] arrs = new s[]{new s(string, null, arrby)};
s s2 = new s(string3, arrcf, arrs);
String string4 = N[482];
cf[] arrcf2 = new cf[]{new cf(N[478], N[479]), new cf(N[476], N[475]), new cf(N[477], N[480]), new cf(N[485], string2)};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
public void b(String[] arrstring) {
int n = ad.q;
String string = this.f(N[1283]);
this.y.put(string, new bp(this, arrstring));
s[] arrs = new s[arrstring.length];
for (int i2 = 0; i2 < arrstring.length; ++i2) {
String string2 = N[1278];
cf[] arrcf = new cf[]{new cf(N[1277], arrstring[i2])};
arrs[i2] = new s(string2, arrcf);
if (n == 0) continue;
}
String string3 = N[1284];
cf[] arrcf = new cf[]{new cf(N[1274], string), new cf(N[1281], N[1279]), new cf(N[1280], N[1282]), new cf(N[1275], N[1276])};
s s2 = new s(string3, arrcf, new s(N[1273], null, arrs));
this.n.a(s2);
}
public void c() {
String string = N[1229];
cf[] arrcf = new cf[]{new cf(N[1231], N[1230])};
s s2 = new s(string, arrcf);
this.n.a(s2);
}
public void c(ad ad2) {
this.n.a(cg.a(ad2, null, null, null, false));
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void c(ay ay2, boolean bl2) {
String string = N[470];
String string2 = bl2 ? N[472] : N[471];
cf cf2 = new cf(string, string2);
this.a(ay2, new s(N[473], new cf[]{cf2}, (s[])null), this.b);
}
public void c(String string) {
String string2 = N[1516];
cf[] arrcf = new cf[]{new cf(N[1518], N[1515]), new cf(N[1514], this.C), new cf(N[1517], string)};
s s2 = new s(string2, arrcf);
this.n.a(s2);
}
public void c(String string, Runnable runnable, ak ak2) {
Vector<String> vector = new Vector<String>();
vector.addElement(string);
this.a(vector, runnable, ak2);
}
public void c(String string, String string2, String string3) {
this.b(string, string2, string3, N[1227]);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void c(String string, Vector vector, Runnable runnable, ak ak2, cj cj2) {
String string2;
if (cj2 != null) {
string2 = cj2.a;
} else {
string2 = this.f(N[1490]);
}
this.y.put(string2, new b6(this, runnable, ak2));
this.a(string, vector, string2, N[1491], cj2);
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void c(boolean bl2) {
String string = N[1580];
cf[] arrcf = new cf[2];
String string2 = N[1578];
String string3 = bl2 ? N[1576] : N[1579];
arrcf[0] = new cf(string2, string3);
arrcf[1] = new cf(N[1577], this.f);
s s2 = new s(string, arrcf);
this.n.a(s2, this.w);
}
public void c(String[] arrstring) {
int n = ad.q;
at at2 = this.a;
if (at2 == null) {
return;
}
String string = this.f(N[516]);
this.y.put(string, new bu(this, arrstring));
s[] arrs = new s[arrstring.length];
for (int i2 = 0; i2 < arrstring.length; ++i2) {
String string2 = N[518];
cf[] arrcf = new cf[]{new cf(N[519], arrstring[i2])};
arrs[i2] = new s(string2, arrcf);
if (n == 0) continue;
}
s s2 = new s(N[523], null, arrs);
s s3 = new s(N[515], null, s2);
String string3 = N[521];
cf[] arrcf = new cf[]{new cf(N[511], string), new cf(N[512], N[513]), new cf(N[520], N[514]), new cf(N[522], N[517])};
s s4 = new s(string3, arrcf, s3);
this.n.a(s4);
}
public void d() {
String string = this.f(N[1356]);
this.y.put(string, new b_(this));
s s2 = new s(N[1357], null);
String string2 = N[1353];
cf[] arrcf = new cf[]{new cf(N[1352], string), new cf(N[1358], "w"), new cf(N[1359], N[1355]), new cf(N[1351], N[1354])};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3, this.w);
}
public void d(ad ad2) {
this.b(ad2, null, null);
}
public void d(String string) {
String string2 = N[1487];
cf[] arrcf = new cf[]{new cf(N[1484], N[1486]), new cf(N[1488], string), new cf(N[1489], N[1485])};
s s2 = new s(string2, arrcf);
this.n.a(s2);
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void d(String string, String string2, String string3) {
Vector<cf> vector;
s s2;
block5 : {
cf[] arrcf = string3 == null ? null : new cf[]{new cf(N[1268], string3)};
s2 = new s(N[1269], arrcf);
vector = new Vector<cf>();
vector.addElement(new cf(N[1270], string));
if (string2 == null) break block5;
if (string2.length() <= 0) break block5;
vector.addElement(new cf(N[1271], string2));
{
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
}
Object[] arrobject = new cf[vector.size()];
vector.copyInto(arrobject);
s s3 = new s(N[1272], (cf[])arrobject, s2);
this.n.a(s3);
return;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void d(String string, Vector vector, Runnable runnable, ak ak2, cj cj2) {
String string2;
if (cj2 != null) {
string2 = cj2.a;
} else {
string2 = this.f(N[494]);
}
this.y.put(string2, new bv(this, runnable, ak2));
this.a(string, vector, string2, N[493], cj2);
}
public void d(boolean bl2) {
this.B = bl2;
}
public void d(String[] arrstring) {
this.a(arrstring, (aj)new a3(this));
}
public void e() {
String string = this.f(N[1238]);
this.y.put(string, new be(this));
String string2 = N[1241];
cf[] arrcf = new cf[]{new cf(N[1239], N[1240])};
s s2 = new s(string2, arrcf);
s s3 = new s(N[1242], null, s2);
String string3 = N[1243];
cf[] arrcf2 = new cf[]{new cf(N[1244], string), new cf(N[1245], N[1237]), new cf(N[1246], N[1236])};
s s4 = new s(string3, arrcf2, s3);
this.n.a(s4);
}
public void e(String string) {
s s2 = new s(N[1397], null);
String string2 = N[1395];
cf[] arrcf = new cf[]{new cf(N[1396], string)};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void e(String string, String string2, String string3) {
String string4;
cf[] arrcf;
block14 : {
block13 : {
if (string == null) {
throw new NullPointerException(N[14]);
}
int n = string.length();
if (n == 0) throw new IllegalArgumentException(N[20]);
if (N[27].equals(string)) {
throw new IllegalArgumentException(N[20]);
}
{
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
catch (RuntimeException runtimeException) {
throw runtimeException;
}
string4 = this.f(N[21]);
this.y.put(string4, new bs(this, string2, string3, string));
if (string2 != null) break block13;
arrcf = new cf[]{new cf(N[23], string3)};
if (ad.q == 0) break block14;
}
arrcf = new cf[]{new cf(N[18], string2), new cf(N[22], string3)};
}
s s2 = new s(N[16], arrcf);
String string5 = N[25];
cf[] arrcf2 = new cf[]{new cf(N[15], string4), new cf(N[26], N[13]), new cf(N[24], string), new cf(N[17], N[19])};
s s3 = new s(string5, arrcf2, s2);
this.n.a(s3);
}
public void e(boolean bl2) {
this.F.a(true);
this.c(bl2);
}
public void f() {
String string = N[310];
cf[] arrcf = new cf[]{new cf(N[312], N[311])};
s s2 = new s(string, arrcf);
this.n.a(s2);
this.n.a();
}
/*
* Loose catch block
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
* Lifted jumps to return sites
*/
public void f(String string, String string2, String string3) {
String string4;
s[] arrs;
block11 : {
block9 : {
block10 : {
string4 = this.f(N[1303]);
this.y.put(string4, new aq(this));
if (string3 == null) break block9;
int n = string3.length();
if (n <= 0) break block9;
if (string == null) {
string = "";
}
if (string2 != null) break block10;
string2 = "";
{
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
}
String string5 = N[1310];
cf[] arrcf = new cf[]{new cf(N[1304], string), new cf(N[1300], string2)};
arrs = new s[]{new s(string5, arrcf, string3)};
if (ad.q == 0) break block11;
}
arrs = null;
}
s s2 = new s(N[1301], null, arrs);
String string6 = N[1306];
cf[] arrcf = new cf[]{new cf(N[1311], N[1312]), new cf(N[1307], N[1305]), new cf(N[1308], N[1302]), new cf(N[1309], string4)};
s s3 = new s(string6, arrcf, s2);
this.n.a(s3);
return;
catch (RuntimeException runtimeException) {
throw runtimeException;
}
}
/*
* Enabled aggressive block sorting
* Enabled unnecessary exception pruning
* Enabled aggressive exception aggregation
*/
public void f(boolean bl2) {
String string = this.f(N[540]);
this.y.put(string, new ap(this, bl2));
String string2 = bl2 ? N[538] : N[546];
s s2 = new s(string2, null);
String string3 = N[539];
cf[] arrcf = new cf[]{new cf(N[541], string), new cf(N[542], N[543]), new cf(N[547], N[544]), new cf(N[545], this.C)};
s s3 = new s(string3, arrcf, s2);
this.n.a(s3);
}
public void g() {
N[331];
String string = this.f(N[329]);
a0 a02 = new a0(this);
this.y.put(string, a02);
s s2 = new s(N[335], null);
String string2 = N[336];
cf[] arrcf = new cf[]{new cf(N[328], N[337]), new cf(N[338], N[333]), new cf(N[334], N[332]), new cf(N[330], string)};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
public void g(String string, String string2, String string3) {
this.b(string, string2, string3, N[797]);
}
public void g(boolean bl2) {
this.m = bl2;
}
public void h() {
String string = this.f(N[767]);
this.y.put(string, new bx(this));
s s2 = new s(N[759], null);
String string2 = N[763];
cf[] arrcf = new cf[]{new cf(N[760], N[765]), new cf(N[766], string), new cf(N[762], N[768]), new cf(N[764], N[761])};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
public void h(String string) {
this.f = string;
try {
this.c(true);
return;
}
catch (IOException iOException) {
return;
}
}
public void h(boolean bl2) {
this.e = bl2;
}
public void i() {
String string = this.f(N[1345]);
this.y.put(string, new b3(this));
String string2 = N[1341];
cf[] arrcf = new cf[]{new cf(N[1342], string), new cf(N[1346], N[1343]), new cf(N[1349], N[1344]), new cf(N[1350], N[1347])};
s s2 = new s(string2, arrcf, new s(N[1348], null));
this.n.a(s2);
}
public void i(String string) {
String string2 = N[497];
cf[] arrcf = new cf[]{new cf(N[500], N[498]), new cf(N[499], string)};
s s2 = new s(string2, arrcf);
this.n.a(s2);
}
public void j() {
synchronized (this) {
this.a((Runnable)null, (ak)null);
return;
}
}
public void j(String string) {
String string2 = this.f(N[3]);
this.y.put(string2, new bb(this));
String string3 = N[10];
cf[] arrcf = new cf[]{new cf(N[8], string)};
s s2 = new s(string3, arrcf, (s[])null);
String string4 = N[6];
cf[] arrcf2 = new cf[]{new cf(N[2], string2), new cf(N[7], N[11]), new cf(N[12], N[4]), new cf(N[9], N[5])};
s s3 = new s(string4, arrcf2, s2);
this.n.a(s3);
}
/*
* Exception decompiling
*/
public boolean k() {
// 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.UnsupportedOperationException
// org.benf.cfr.reader.bytecode.analysis.opgraph.Op01WithProcessedDataAndByteJumps.getAStoreIdx(Op01WithProcessedDataAndByteJumps.java:77)
// org.benf.cfr.reader.entities.exceptions.ExceptionGroup.isSynchronisedHandler(ExceptionGroup.java:90)
// org.benf.cfr.reader.entities.exceptions.ExceptionGroup.removeSynchronisedHandlers(ExceptionGroup.java:67)
// org.benf.cfr.reader.entities.exceptions.ExceptionAggregator.removeSynchronisedHandlers(ExceptionAggregator.java:383)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:295)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:196)
// org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:141)
// org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:95)
// org.benf.cfr.reader.entities.Method.analyse(Method.java:370)
// org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:852)
// org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:753)
// org.benf.cfr.reader.Main.doClass(Main.java:46)
// org.benf.cfr.reader.Main.main(Main.java:190)
// ReviewPreparator.unZipIt(ReviewPreparator.java:54)
// PrepareAndSendToReview$.$anonfun$prepareAndSendToReview$4(PrepareAndSendToReview.scala:37)
// scala.collection.TraversableLike.$anonfun$map$1(TraversableLike.scala:234)
// scala.collection.immutable.HashSet$HashSet1.foreach(HashSet.scala:320)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.immutable.HashSet$HashTrieSet.foreach(HashSet.scala:976)
// scala.collection.TraversableLike.map(TraversableLike.scala:234)
// scala.collection.TraversableLike.map$(TraversableLike.scala:227)
// scala.collection.AbstractSet.scala$collection$SetLike$$super$map(Set.scala:47)
// scala.collection.SetLike.map(SetLike.scala:101)
// scala.collection.SetLike.map$(SetLike.scala:101)
// scala.collection.AbstractSet.map(Set.scala:47)
// PrepareAndSendToReview$.prepareAndSendToReview(PrepareAndSendToReview.scala:35)
// PrepareAndSendToReview$.main(PrepareAndSendToReview.scala:12)
// PrepareAndSendToReview.main(PrepareAndSendToReview.scala)
throw new IllegalStateException("Decompilation failed");
}
public void l() {
String string = this.f(N[457]);
this.y.put(string, new ct(this));
s s2 = new s(N[453], null);
String string2 = N[454];
cf[] arrcf = new cf[]{new cf(N[450], string), new cf(N[449], N[455]), new cf(N[456], N[451]), new cf(N[452], this.C)};
s s3 = new s(string2, arrcf, s2);
this.n.a(s3);
}
public void n() {
String string = N[1331];
cf[] arrcf = new cf[]{new cf(N[1330], N[1332])};
s s2 = new s(string, arrcf);
this.n.a(s2);
}
public void o() {
String string = this.f(N[463]);
this.y.put(string, new cs(this));
String string2 = N[461];
cf[] arrcf = new cf[]{new cf(N[467], string), new cf(N[469], N[465]), new cf(N[466], N[462]), new cf(N[468], N[464])};
s s2 = new s(string2, arrcf, new s(N[460], null));
this.n.a(s2);
}
}
|
