class org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2 extends org.graalvm.compiler.graph.Node$EdgeVisitor
minor version: 0
major version: 59
flags: flags: (0x0020) ACC_SUPER
this_class: org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2
super_class: org.graalvm.compiler.graph.Node$EdgeVisitor
{
private final org.graalvm.compiler.graph.NodeFlood val$flood;
descriptor: Lorg/graalvm/compiler/graph/NodeFlood;
flags: (0x1012) ACC_PRIVATE, ACC_FINAL, ACC_SYNTHETIC
void <init>(org.graalvm.compiler.graph.NodeFlood);
descriptor: (Lorg/graalvm/compiler/graph/NodeFlood;)V
flags: (0x0000)
Code:
stack=2, locals=2, args_size=2
start local 0 // org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2 this
0: .line 128
aload 0 /* this */
aload 1
putfield org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2.val$flood:Lorg/graalvm/compiler/graph/NodeFlood;
aload 0 /* this */
invokespecial org.graalvm.compiler.graph.Node$EdgeVisitor.<init>:()V
return
end local 0 // org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2 this
LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Lorg/graalvm/compiler/phases/common/DeadCodeEliminationPhase$2;
MethodParameters:
Name Flags
val$flood final
public org.graalvm.compiler.graph.Node apply(org.graalvm.compiler.graph.Node, org.graalvm.compiler.graph.Node);
descriptor: (Lorg/graalvm/compiler/graph/Node;Lorg/graalvm/compiler/graph/Node;)Lorg/graalvm/compiler/graph/Node;
flags: (0x0001) ACC_PUBLIC
Code:
stack=2, locals=3, args_size=3
start local 0 // org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2 this
start local 1 // org.graalvm.compiler.graph.Node n
start local 2 // org.graalvm.compiler.graph.Node input
0: .line 131
aload 2 /* input */
invokevirtual org.graalvm.compiler.graph.Node.isAlive:()Z
ifeq 2
aload 0 /* this */
getfield org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2.val$flood:Lorg/graalvm/compiler/graph/NodeFlood;
aload 2 /* input */
invokevirtual org.graalvm.compiler.graph.NodeFlood.isMarked:(Lorg/graalvm/compiler/graph/Node;)Z
ifeq 2
1: .line 132
aload 2 /* input */
aload 1 /* n */
invokevirtual org.graalvm.compiler.graph.Node.removeUsage:(Lorg/graalvm/compiler/graph/Node;)Z
pop
2: .line 134
StackMap locals:
StackMap stack:
aload 2 /* input */
areturn
end local 2 // org.graalvm.compiler.graph.Node input
end local 1 // org.graalvm.compiler.graph.Node n
end local 0 // org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2 this
LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Lorg/graalvm/compiler/phases/common/DeadCodeEliminationPhase$2;
0 3 1 n Lorg/graalvm/compiler/graph/Node;
0 3 2 input Lorg/graalvm/compiler/graph/Node;
MethodParameters:
Name Flags
n
input
}
SourceFile: "DeadCodeEliminationPhase.java"
EnclosingMethod: org.graalvm.compiler.phases.common.DeadCodeEliminationPhase.deleteNodes:(Lorg/graalvm/compiler/graph/NodeFlood;Lorg/graalvm/compiler/nodes/StructuredGraph;)V
NestHost: org.graalvm.compiler.phases.common.DeadCodeEliminationPhase
InnerClasses:
public abstract EdgeVisitor = org.graalvm.compiler.graph.Node$EdgeVisitor of org.graalvm.compiler.graph.Node
org.graalvm.compiler.phases.common.DeadCodeEliminationPhase$2