public class javassist.bytecode.analysis.ControlFlow extends java.lang.Object { private javassist.CtClass clazz; private javassist.bytecode.MethodInfo methodInfo; private javassist.bytecode.analysis.ControlFlow$Block[] basicBlocks; private javassist.bytecode.analysis.Frame[] frames; public void (javassist.CtMethod) throws javassist.bytecode.BadBytecode { javassist.CtMethod v; javassist.bytecode.MethodInfo v; javassist.bytecode.analysis.ControlFlow v; javassist.CtClass v; v := @this: javassist.bytecode.analysis.ControlFlow; v := @parameter: javassist.CtMethod; v = virtualinvoke v.(); v = virtualinvoke v.(); specialinvoke v.(javassist.CtClass,javassist.bytecode.MethodInfo)>(v, v); return; } public void (javassist.CtClass, javassist.bytecode.MethodInfo) throws javassist.bytecode.BadBytecode { javassist.CtClass v; int[] v; javassist.bytecode.analysis.ControlFlow$Catcher v; javassist.bytecode.analysis.ControlFlow v; javassist.bytecode.analysis.ControlFlow$Catcher[] v; javassist.bytecode.analysis.ControlFlow$Block v, v, v, v; javassist.bytecode.MethodInfo v; javassist.bytecode.analysis.ControlFlow$1 v; int v, v, v, v, v, v, v, v, v, v, v, v, v, v; javassist.bytecode.analysis.ControlFlow$Block[] v, v, v, v, v, v, v, v; javassist.bytecode.stackmap.BasicBlock[] v; v := @this: javassist.bytecode.analysis.ControlFlow; v := @parameter: javassist.CtClass; v := @parameter: javassist.bytecode.MethodInfo; specialinvoke v.()>(); v. = v; v. = v; v. = null; v = new javassist.bytecode.analysis.ControlFlow$1; specialinvoke v.(javassist.bytecode.analysis.ControlFlow)>(v); v = virtualinvoke v.(v); v. = v; v = v.; if v != null goto label; v = newarray (javassist.bytecode.analysis.ControlFlow$Block)[0]; v. = v; label: v = v.; v = lengthof v; v = newarray (int)[v]; v = 0; label: if v >= v goto label; v = v.; v = v[v]; v. = v; v = virtualinvoke v.(); v = newarray (javassist.bytecode.analysis.ControlFlow$Block)[v]; v. = v; v[v] = 0; v = v + 1; goto label; label: v = 0; label: if v >= v goto label; v = v.; v = v[v]; v = 0; label: v = virtualinvoke v.(); if v >= v goto label; v = virtualinvoke v.(v); v = v.; v = v.; v = v[v]; v = v + 1; v[v] = v; v[v] = v; v = v + 1; goto label; label: v = virtualinvoke v.(); v = 0; label: v = lengthof v; if v >= v goto label; v = v[v]; v = v.; v = v.; v = v.; v = v[v]; v = v + 1; v[v] = v; v[v] = v; v = v + 1; goto label; label: v = v + 1; goto label; label: return; } public javassist.bytecode.analysis.ControlFlow$Block[] basicBlocks() { javassist.bytecode.analysis.ControlFlow$Block[] v; javassist.bytecode.analysis.ControlFlow v; v := @this: javassist.bytecode.analysis.ControlFlow; v = v.; return v; } public javassist.bytecode.analysis.Frame frameAt(int) throws javassist.bytecode.BadBytecode { javassist.bytecode.analysis.Analyzer v; javassist.bytecode.analysis.Frame v; javassist.bytecode.analysis.ControlFlow v; javassist.CtClass v; javassist.bytecode.analysis.Frame[] v, v, v; int v; javassist.bytecode.MethodInfo v; v := @this: javassist.bytecode.analysis.ControlFlow; v := @parameter: int; v = v.; if v != null goto label; v = new javassist.bytecode.analysis.Analyzer; specialinvoke v.()>(); v = v.; v = v.; v = virtualinvoke v.(v, v); v. = v; label: v = v.; v = v[v]; return v; } public javassist.bytecode.analysis.ControlFlow$Node[] dominatorTree() { javassist.bytecode.analysis.ControlFlow$2 v; boolean[] v; javassist.bytecode.analysis.ControlFlow v; javassist.bytecode.analysis.ControlFlow$Node[] v; javassist.bytecode.analysis.ControlFlow$Node v, v, v; int[] v; javassist.bytecode.analysis.ControlFlow$Block v; int v, v, v; javassist.bytecode.analysis.ControlFlow$Block[] v, v; boolean v; v := @this: javassist.bytecode.analysis.ControlFlow; v = v.; v = lengthof v; if v != 0 goto label; return null; label: v = newarray (javassist.bytecode.analysis.ControlFlow$Node)[v]; v = newarray (boolean)[v]; v = newarray (int)[v]; v = 0; label: if v >= v goto label; v = new javassist.bytecode.analysis.ControlFlow$Node; v = v.; v = v[v]; specialinvoke v.(javassist.bytecode.analysis.ControlFlow$Block)>(v); v[v] = v; v[v] = 0; v = v + 1; goto label; label: v = new javassist.bytecode.analysis.ControlFlow$2; specialinvoke v.(javassist.bytecode.analysis.ControlFlow,javassist.bytecode.analysis.ControlFlow$Node[])>(v, v); v = v[0]; virtualinvoke v.(null, v, 0, v, v); label: v = 0; label: if v >= v goto label; v[v] = 0; v = v + 1; goto label; label: v = v[0]; v = virtualinvoke v.(v, v, v); if v != 0 goto label; staticinvoke (v); return v; } public javassist.bytecode.analysis.ControlFlow$Node[] postDominatorTree() { javassist.bytecode.analysis.ControlFlow$3 v; javassist.bytecode.analysis.ControlFlow$Node v, v, v, v, v; int[] v; int v, v, v, v, v, v, v, v; javassist.bytecode.analysis.ControlFlow$Block[] v, v; boolean v, v; boolean[] v; javassist.bytecode.analysis.ControlFlow v; javassist.bytecode.analysis.ControlFlow$Node[] v; javassist.bytecode.analysis.ControlFlow$Block v, v, v; v := @this: javassist.bytecode.analysis.ControlFlow; v = v.; v = lengthof v; if v != 0 goto label; return null; label: v = newarray (javassist.bytecode.analysis.ControlFlow$Node)[v]; v = newarray (boolean)[v]; v = newarray (int)[v]; v = 0; label: if v >= v goto label; v = new javassist.bytecode.analysis.ControlFlow$Node; v = v.; v = v[v]; specialinvoke v.(javassist.bytecode.analysis.ControlFlow$Block)>(v); v[v] = v; v[v] = 0; v = v + 1; goto label; label: v = new javassist.bytecode.analysis.ControlFlow$3; specialinvoke v.(javassist.bytecode.analysis.ControlFlow,javassist.bytecode.analysis.ControlFlow$Node[])>(v, v); v = 0; v = 0; label: if v >= v goto label; v = v[v]; v = v.; v = virtualinvoke v.(); if v != 0 goto label; v = v[v]; v = virtualinvoke v.(null, v, v, v, v); label: v = v + 1; goto label; label: v = 0; label: if v >= v goto label; v[v] = 0; v = v + 1; goto label; label: v = 0; v = 0; label: if v >= v goto label; v = v[v]; v = v.; v = virtualinvoke v.(); if v != 0 goto label; v = v[v]; v = virtualinvoke v.(v, v, v); if v == 0 goto label; v = 1; label: v = v + 1; goto label; label: if v != 0 goto label; staticinvoke (v); return v; } }