java/10 : jdk.internal.vm.compiler/org/graalvm/compiler/phases/graph/SinglePassNodeIterator.class

SinglePassNodeIterator
https://openjdk.java.net/
GPLv2 + Classpath Exception
public abstract class org.graalvm.compiler.phases.graph.SinglePassNodeIterator<T extends org.graalvm.compiler.phases.graph.MergeableState<T>>
  minor version: 0
  major version: 59
  flags: flags: (0x0421) ACC_PUBLIC, ACC_SUPER, ACC_ABSTRACT
  this_class: org.graalvm.compiler.phases.graph.SinglePassNodeIterator
  super_class: java.lang.Object
{
  private final org.graalvm.compiler.graph.NodeBitMap visitedEnds;
    descriptor: Lorg/graalvm/compiler/graph/NodeBitMap;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL

  private final java.util.Deque<org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart<T>> nodeQueue;
    descriptor: Ljava/util/Deque;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Ljava/util/Deque<Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator$PathStart<TT;>;>;

  private final org.graalvm.util.EconomicMap<org.graalvm.compiler.nodes.FixedNode, T> nodeStates;
    descriptor: Lorg/graalvm/util/EconomicMap;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Lorg/graalvm/util/EconomicMap<Lorg/graalvm/compiler/nodes/FixedNode;TT;>;

  private final org.graalvm.compiler.nodes.StartNode start;
    descriptor: Lorg/graalvm/compiler/nodes/StartNode;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL

  protected T state;
    descriptor: Lorg/graalvm/compiler/phases/graph/MergeableState;
    flags: (0x0004) ACC_PROTECTED
    Signature: TT;

  static final boolean $assertionsDisabled;
    descriptor: Z
    flags: (0x1018) ACC_STATIC, ACC_FINAL, ACC_SYNTHETIC

  static void <clinit>();
    descriptor: ()V
    flags: (0x0008) ACC_STATIC
    Code:
      stack=1, locals=0, args_size=0
         0: .line 74
            ldc Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator;
            invokevirtual java.lang.Class.desiredAssertionStatus:()Z
            ifne 1
            iconst_1
            goto 2
      StackMap locals:
      StackMap stack:
         1: iconst_0
      StackMap locals:
      StackMap stack: int
         2: putstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            return
      LocalVariableTable:
        Start  End  Slot  Name  Signature

  public void <init>(org.graalvm.compiler.nodes.StartNode, );
    descriptor: (Lorg/graalvm/compiler/nodes/StartNode;Lorg/graalvm/compiler/phases/graph/MergeableState;)V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=4, args_size=3
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.StartNode start
        start local 2 // org.graalvm.compiler.phases.graph.MergeableState initialState
         0: .line 154
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
         1: .line 155
            aload 1 /* start */
            invokevirtual org.graalvm.compiler.nodes.StartNode.graph:()Lorg/graalvm/compiler/nodes/StructuredGraph;
            astore 3 /* graph */
        start local 3 // org.graalvm.compiler.nodes.StructuredGraph graph
         2: .line 156
            aload 0 /* this */
            aload 3 /* graph */
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph.createNodeBitMap:()Lorg/graalvm/compiler/graph/NodeBitMap;
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
         3: .line 157
            aload 0 /* this */
            new java.util.ArrayDeque
            dup
            invokespecial java.util.ArrayDeque.<init>:()V
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
         4: .line 158
            aload 0 /* this */
            getstatic org.graalvm.util.Equivalence.IDENTITY:Lorg/graalvm/util/Equivalence;
            invokestatic org.graalvm.util.EconomicMap.create:(Lorg/graalvm/util/Equivalence;)Lorg/graalvm/util/EconomicMap;
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeStates:Lorg/graalvm/util/EconomicMap;
         5: .line 159
            aload 0 /* this */
            aload 1 /* start */
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.start:Lorg/graalvm/compiler/nodes/StartNode;
         6: .line 160
            aload 0 /* this */
            aload 2 /* initialState */
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
         7: .line 161
            return
        end local 3 // org.graalvm.compiler.nodes.StructuredGraph graph
        end local 2 // org.graalvm.compiler.phases.graph.MergeableState initialState
        end local 1 // org.graalvm.compiler.nodes.StartNode start
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot          Name  Signature
            0    8     0          this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    8     1         start  Lorg/graalvm/compiler/nodes/StartNode;
            0    8     2  initialState  TT;
            2    8     3         graph  Lorg/graalvm/compiler/nodes/StructuredGraph;
    Signature: (Lorg/graalvm/compiler/nodes/StartNode;TT;)V
    MethodParameters:
              Name  Flags
      start         
      initialState  

  public void apply();
    descriptor: ()V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=3, args_size=1
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
         0: .line 173
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.start:Lorg/graalvm/compiler/nodes/StartNode;
            astore 1 /* current */
        start local 1 // org.graalvm.compiler.nodes.FixedNode current
         1: .line 176
      StackMap locals: org.graalvm.compiler.nodes.FixedNode
      StackMap stack:
            aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.InvokeWithExceptionNode
            ifeq 6
         2: .line 177
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.Invoke
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.invoke:(Lorg/graalvm/compiler/nodes/Invoke;)V
         3: .line 178
            aload 0 /* this */
            aload 1 /* current */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.queueSuccessors:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         4: .line 179
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nextQueuedNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
         5: .line 180
            goto 43
      StackMap locals:
      StackMap stack:
         6: aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.LoopBeginNode
            ifeq 13
         7: .line 181
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.LoopBeginNode
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.loopBegin:(Lorg/graalvm/compiler/nodes/LoopBeginNode;)V
         8: .line 182
            aload 0 /* this */
            aload 1 /* current */
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.keepForLater:(Lorg/graalvm/compiler/nodes/FixedNode;Lorg/graalvm/compiler/phases/graph/MergeableState;)V
         9: .line 183
            aload 0 /* this */
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.clone:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.phases.graph.MergeableState
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
        10: .line 184
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.LoopBeginNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.loopBegin:(Lorg/graalvm/compiler/nodes/LoopBeginNode;)V
        11: .line 185
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.LoopBeginNode
            invokevirtual org.graalvm.compiler.nodes.LoopBeginNode.next:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        12: .line 186
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 43
            aload 1 /* current */
            ifnonnull 43
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
        13: .line 187
      StackMap locals:
      StackMap stack:
            aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.LoopEndNode
            ifeq 18
        14: .line 188
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.LoopEndNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.loopEnd:(Lorg/graalvm/compiler/nodes/LoopEndNode;)V
        15: .line 189
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.LoopEndNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.finishLoopEnds:(Lorg/graalvm/compiler/nodes/LoopEndNode;)V
        16: .line 190
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nextQueuedNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        17: .line 191
            goto 43
      StackMap locals:
      StackMap stack:
        18: aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.AbstractMergeNode
            ifeq 22
        19: .line 192
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.AbstractMergeNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.merge:(Lorg/graalvm/compiler/nodes/AbstractMergeNode;)V
        20: .line 193
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.AbstractMergeNode
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.next:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        21: .line 194
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 43
            aload 1 /* current */
            ifnonnull 43
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
        22: .line 195
      StackMap locals:
      StackMap stack:
            aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.FixedWithNextNode
            ifeq 28
        23: .line 196
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.FixedWithNextNode
            invokevirtual org.graalvm.compiler.nodes.FixedWithNextNode.next:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 2 /* next */
        start local 2 // org.graalvm.compiler.nodes.FixedNode next
        24: .line 197
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 25
            aload 2 /* next */
            ifnonnull 25
            new java.lang.AssertionError
            dup
            aload 1 /* current */
            invokespecial java.lang.AssertionError.<init>:(Ljava/lang/Object;)V
            athrow
        25: .line 198
      StackMap locals: org.graalvm.compiler.nodes.FixedNode
      StackMap stack:
            aload 0 /* this */
            aload 1 /* current */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
        26: .line 199
            aload 2 /* next */
            astore 1 /* current */
        end local 2 // org.graalvm.compiler.nodes.FixedNode next
        27: .line 200
            goto 43
      StackMap locals:
      StackMap stack:
        28: aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.EndNode
            ifeq 33
        29: .line 201
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.EndNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.end:(Lorg/graalvm/compiler/nodes/EndNode;)V
        30: .line 202
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.EndNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.queueMerge:(Lorg/graalvm/compiler/nodes/EndNode;)V
        31: .line 203
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nextQueuedNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        32: .line 204
            goto 43
      StackMap locals:
      StackMap stack:
        33: aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.ControlSinkNode
            ifeq 37
        34: .line 205
            aload 0 /* this */
            aload 1 /* current */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
        35: .line 206
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nextQueuedNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        36: .line 207
            goto 43
      StackMap locals:
      StackMap stack:
        37: aload 1 /* current */
            instanceof org.graalvm.compiler.nodes.ControlSplitNode
            ifeq 42
        38: .line 208
            aload 0 /* this */
            aload 1 /* current */
            checkcast org.graalvm.compiler.nodes.ControlSplitNode
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.controlSplit:(Lorg/graalvm/compiler/nodes/ControlSplitNode;)V
        39: .line 209
            aload 0 /* this */
            aload 1 /* current */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.queueSuccessors:(Lorg/graalvm/compiler/nodes/FixedNode;)V
        40: .line 210
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nextQueuedNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            astore 1 /* current */
        41: .line 211
            goto 43
        42: .line 212
      StackMap locals:
      StackMap stack:
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 43
            new java.lang.AssertionError
            dup
            aload 1 /* current */
            invokespecial java.lang.AssertionError.<init>:(Ljava/lang/Object;)V
            athrow
        43: .line 214
      StackMap locals:
      StackMap stack:
            aload 1 /* current */
            ifnonnull 1
        44: .line 215
            aload 0 /* this */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.finished:()V
        45: .line 216
            return
        end local 1 // org.graalvm.compiler.nodes.FixedNode current
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot     Name  Signature
            0   46     0     this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            1   46     1  current  Lorg/graalvm/compiler/nodes/FixedNode;
           24   27     2     next  Lorg/graalvm/compiler/nodes/FixedNode;

  private void queueSuccessors(org.graalvm.compiler.nodes.FixedNode);
    descriptor: (Lorg/graalvm/compiler/nodes/FixedNode;)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=5, locals=7, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.FixedNode x
         0: .line 230
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            astore 2 /* startState */
        start local 2 // org.graalvm.compiler.phases.graph.MergeableState startState
         1: .line 231
            aload 2 /* startState */
            astore 3 /* curState */
        start local 3 // org.graalvm.compiler.phases.graph.MergeableState curState
         2: .line 232
            aload 1 /* x */
            invokevirtual org.graalvm.compiler.nodes.FixedNode.successors:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 5
            goto 9
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.FixedNode org.graalvm.compiler.phases.graph.MergeableState org.graalvm.compiler.phases.graph.MergeableState top java.util.Iterator
      StackMap stack:
         3: aload 5
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.graph.Node
            astore 4 /* succ */
        start local 4 // org.graalvm.compiler.graph.Node succ
         4: .line 233
            aload 4 /* succ */
            ifnull 9
         5: .line 234
            aload 3 /* curState */
            ifnonnull 7
         6: .line 237
            aload 2 /* startState */
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.clone:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.phases.graph.MergeableState
            astore 3 /* curState */
         7: .line 239
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.FixedNode org.graalvm.compiler.phases.graph.MergeableState org.graalvm.compiler.phases.graph.MergeableState org.graalvm.compiler.graph.Node java.util.Iterator
      StackMap stack:
            aload 4 /* succ */
            checkcast org.graalvm.compiler.nodes.AbstractBeginNode
            astore 6 /* begin */
        start local 6 // org.graalvm.compiler.nodes.AbstractBeginNode begin
         8: .line 240
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
            new org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart
            dup
            aload 6 /* begin */
            aload 3 /* curState */
            invokespecial org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.<init>:(Lorg/graalvm/compiler/nodes/AbstractBeginNode;Ljava/lang/Object;)V
            invokeinterface java.util.Deque.addFirst:(Ljava/lang/Object;)V
        end local 6 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        end local 4 // org.graalvm.compiler.graph.Node succ
         9: .line 232
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.FixedNode org.graalvm.compiler.phases.graph.MergeableState org.graalvm.compiler.phases.graph.MergeableState top java.util.Iterator
      StackMap stack:
            aload 5
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 3
        10: .line 243
            return
        end local 3 // org.graalvm.compiler.phases.graph.MergeableState curState
        end local 2 // org.graalvm.compiler.phases.graph.MergeableState startState
        end local 1 // org.graalvm.compiler.nodes.FixedNode x
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot        Name  Signature
            0   11     0        this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0   11     1           x  Lorg/graalvm/compiler/nodes/FixedNode;
            1   11     2  startState  TT;
            2   11     3    curState  TT;
            4    9     4        succ  Lorg/graalvm/compiler/graph/Node;
            8    9     6       begin  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
    MethodParameters:
      Name  Flags
      x     

  private org.graalvm.compiler.nodes.FixedNode nextQueuedNode();
    descriptor: ()Lorg/graalvm/compiler/nodes/FixedNode;
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=4, locals=6, args_size=1
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
         0: .line 256
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
            invokeinterface java.util.Deque.isEmpty:()Z
            ifeq 2
         1: .line 257
            aconst_null
            areturn
         2: .line 259
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
            invokeinterface java.util.Deque.removeFirst:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart
            astore 1 /* elem */
        start local 1 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart elem
         3: .line 260
            aload 1 /* elem */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.node:Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            instanceof org.graalvm.compiler.nodes.AbstractMergeNode
            ifeq 16
         4: .line 261
            aload 1 /* elem */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.node:Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            checkcast org.graalvm.compiler.nodes.AbstractMergeNode
            astore 2 /* merge */
        start local 2 // org.graalvm.compiler.nodes.AbstractMergeNode merge
         5: .line 262
            aload 0 /* this */
            aload 0 /* this */
            aload 2 /* merge */
            iconst_0
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndAt:(I)Lorg/graalvm/compiler/nodes/EndNode;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.pruneEntry:(Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/phases/graph/MergeableState;
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
         6: .line 263
            new java.util.ArrayList
            dup
            aload 2 /* merge */
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndCount:()I
            iconst_1
            isub
            invokespecial java.util.ArrayList.<init>:(I)V
            astore 3 /* states */
        start local 3 // java.util.ArrayList states
         7: .line 264
            iconst_1
            istore 4 /* i */
        start local 4 // int i
         8: goto 12
         9: .line 265
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart org.graalvm.compiler.nodes.AbstractMergeNode java.util.ArrayList int
      StackMap stack:
            aload 0 /* this */
            aload 2 /* merge */
            iload 4 /* i */
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndAt:(I)Lorg/graalvm/compiler/nodes/EndNode;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.pruneEntry:(Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/phases/graph/MergeableState;
            astore 5 /* other */
        start local 5 // org.graalvm.compiler.phases.graph.MergeableState other
        10: .line 266
            aload 3 /* states */
            aload 5 /* other */
            invokevirtual java.util.ArrayList.add:(Ljava/lang/Object;)Z
            pop
        end local 5 // org.graalvm.compiler.phases.graph.MergeableState other
        11: .line 264
            iinc 4 /* i */ 1
      StackMap locals:
      StackMap stack:
        12: iload 4 /* i */
            aload 2 /* merge */
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndCount:()I
            if_icmplt 9
        end local 4 // int i
        13: .line 268
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            aload 2 /* merge */
            aload 3 /* states */
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.merge:(Lorg/graalvm/compiler/nodes/AbstractMergeNode;Ljava/util/List;)Z
            istore 4 /* ready */
        start local 4 // boolean ready
        14: .line 269
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 15
            iload 4 /* ready */
            ifne 15
            new java.lang.AssertionError
            dup
            ldc "Not a single-pass iterator after all"
            invokespecial java.lang.AssertionError.<init>:(Ljava/lang/Object;)V
            athrow
        15: .line 270
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart org.graalvm.compiler.nodes.AbstractMergeNode java.util.ArrayList int
      StackMap stack:
            aload 2 /* merge */
            areturn
        end local 4 // boolean ready
        end local 3 // java.util.ArrayList states
        end local 2 // org.graalvm.compiler.nodes.AbstractMergeNode merge
        16: .line 272
      StackMap locals:
      StackMap stack:
            aload 1 /* elem */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.node:Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            astore 2 /* begin */
        start local 2 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        17: .line 273
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 18
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.predecessor:()Lorg/graalvm/compiler/graph/Node;
            ifnonnull 18
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
        18: .line 274
      StackMap locals: org.graalvm.compiler.nodes.AbstractBeginNode
      StackMap stack:
            aload 0 /* this */
            aload 1 /* elem */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.stateOnEntry:Ljava/lang/Object;
            checkcast org.graalvm.compiler.phases.graph.MergeableState
            putfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
        19: .line 275
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.afterSplit:(Lorg/graalvm/compiler/nodes/AbstractBeginNode;)V
        20: .line 276
            aload 2 /* begin */
            areturn
        end local 2 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        end local 1 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart elem
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot    Name  Signature
            0   21     0    this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            3   21     1    elem  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator$PathStart<TT;>;
            5   16     2   merge  Lorg/graalvm/compiler/nodes/AbstractMergeNode;
            7   16     3  states  Ljava/util/ArrayList<TT;>;
            8   13     4       i  I
           10   11     5   other  TT;
           14   16     4   ready  Z
           17   21     2   begin  Lorg/graalvm/compiler/nodes/AbstractBeginNode;

  private void finishLoopEnds(org.graalvm.compiler.nodes.LoopEndNode);
    descriptor: (Lorg/graalvm/compiler/nodes/LoopEndNode;)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=3, locals=10, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.LoopEndNode end
         0: .line 297
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 1
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.isMarked:(Lorg/graalvm/compiler/graph/Node;)Z
            ifeq 1
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         1: .line 298
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.mark:(Lorg/graalvm/compiler/graph/Node;)V
         2: .line 299
            aload 0 /* this */
            aload 1 /* end */
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.keepForLater:(Lorg/graalvm/compiler/nodes/FixedNode;Lorg/graalvm/compiler/phases/graph/MergeableState;)V
         3: .line 300
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.nodes.LoopEndNode.loopBegin:()Lorg/graalvm/compiler/nodes/LoopBeginNode;
            astore 2 /* begin */
        start local 2 // org.graalvm.compiler.nodes.LoopBeginNode begin
         4: .line 301
            iconst_1
            istore 3 /* endsVisited */
        start local 3 // boolean endsVisited
         5: .line 302
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.nodes.LoopBeginNode.loopEnds:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 5
            goto 10
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.LoopEndNode org.graalvm.compiler.nodes.LoopBeginNode int top java.util.Iterator
      StackMap stack:
         6: aload 5
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.LoopEndNode
            astore 4 /* le */
        start local 4 // org.graalvm.compiler.nodes.LoopEndNode le
         7: .line 303
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 4 /* le */
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.isMarked:(Lorg/graalvm/compiler/graph/Node;)Z
            ifne 10
         8: .line 304
            iconst_0
            istore 3 /* endsVisited */
         9: .line 305
            goto 11
        end local 4 // org.graalvm.compiler.nodes.LoopEndNode le
        10: .line 302
      StackMap locals:
      StackMap stack:
            aload 5
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 6
        11: .line 308
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.LoopEndNode org.graalvm.compiler.nodes.LoopBeginNode int
      StackMap stack:
            iload 3 /* endsVisited */
            ifeq 21
        12: .line 309
            new java.util.ArrayList
            dup
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.nodes.LoopBeginNode.loopEnds:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.count:()I
            invokespecial java.util.ArrayList.<init>:(I)V
            astore 4 /* states */
        start local 4 // java.util.ArrayList states
        13: .line 310
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.nodes.LoopBeginNode.orderedLoopEnds:()[Lorg/graalvm/compiler/nodes/LoopEndNode;
            dup
            astore 8
            arraylength
            istore 7
            iconst_0
            istore 6
            goto 18
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.LoopEndNode org.graalvm.compiler.nodes.LoopBeginNode int java.util.ArrayList top int int org.graalvm.compiler.nodes.LoopEndNode[]
      StackMap stack:
        14: aload 8
            iload 6
            aaload
            astore 5 /* le */
        start local 5 // org.graalvm.compiler.nodes.LoopEndNode le
        15: .line 311
            aload 0 /* this */
            aload 5 /* le */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.pruneEntry:(Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/phases/graph/MergeableState;
            astore 9 /* leState */
        start local 9 // org.graalvm.compiler.phases.graph.MergeableState leState
        16: .line 312
            aload 4 /* states */
            aload 9 /* leState */
            invokevirtual java.util.ArrayList.add:(Ljava/lang/Object;)Z
            pop
        end local 9 // org.graalvm.compiler.phases.graph.MergeableState leState
        end local 5 // org.graalvm.compiler.nodes.LoopEndNode le
        17: .line 310
            iinc 6 1
      StackMap locals:
      StackMap stack:
        18: iload 6
            iload 7
            if_icmplt 14
        19: .line 314
            aload 0 /* this */
            aload 2 /* begin */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.pruneEntry:(Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/phases/graph/MergeableState;
            astore 5 /* loopBeginState */
        start local 5 // org.graalvm.compiler.phases.graph.MergeableState loopBeginState
        20: .line 315
            aload 5 /* loopBeginState */
            aload 2 /* begin */
            aload 4 /* states */
            invokevirtual org.graalvm.compiler.phases.graph.MergeableState.loopEnds:(Lorg/graalvm/compiler/nodes/LoopBeginNode;Ljava/util/List;)V
        end local 5 // org.graalvm.compiler.phases.graph.MergeableState loopBeginState
        end local 4 // java.util.ArrayList states
        21: .line 317
      StackMap locals: org.graalvm.compiler.phases.graph.SinglePassNodeIterator org.graalvm.compiler.nodes.LoopEndNode org.graalvm.compiler.nodes.LoopBeginNode int
      StackMap stack:
            return
        end local 3 // boolean endsVisited
        end local 2 // org.graalvm.compiler.nodes.LoopBeginNode begin
        end local 1 // org.graalvm.compiler.nodes.LoopEndNode end
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot            Name  Signature
            0   22     0            this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0   22     1             end  Lorg/graalvm/compiler/nodes/LoopEndNode;
            4   22     2           begin  Lorg/graalvm/compiler/nodes/LoopBeginNode;
            5   22     3     endsVisited  Z
            7   10     4              le  Lorg/graalvm/compiler/nodes/LoopEndNode;
           13   21     4          states  Ljava/util/ArrayList<TT;>;
           15   17     5              le  Lorg/graalvm/compiler/nodes/LoopEndNode;
           16   17     9         leState  TT;
           20   21     5  loopBeginState  TT;
    MethodParameters:
      Name  Flags
      end   

  private void queueMerge(org.graalvm.compiler.nodes.EndNode);
    descriptor: (Lorg/graalvm/compiler/nodes/EndNode;)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=5, locals=5, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.EndNode end
         0: .line 329
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 1
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.isMarked:(Lorg/graalvm/compiler/graph/Node;)Z
            ifeq 1
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         1: .line 330
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.mark:(Lorg/graalvm/compiler/graph/Node;)V
         2: .line 331
            aload 0 /* this */
            aload 1 /* end */
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.state:Lorg/graalvm/compiler/phases/graph/MergeableState;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.keepForLater:(Lorg/graalvm/compiler/nodes/FixedNode;Lorg/graalvm/compiler/phases/graph/MergeableState;)V
         3: .line 332
            aload 1 /* end */
            invokevirtual org.graalvm.compiler.nodes.EndNode.merge:()Lorg/graalvm/compiler/nodes/AbstractMergeNode;
            astore 2 /* merge */
        start local 2 // org.graalvm.compiler.nodes.AbstractMergeNode merge
         4: .line 333
            iconst_1
            istore 3 /* endsVisited */
        start local 3 // boolean endsVisited
         5: .line 334
            iconst_0
            istore 4 /* i */
        start local 4 // int i
         6: goto 11
         7: .line 335
      StackMap locals: org.graalvm.compiler.nodes.AbstractMergeNode int int
      StackMap stack:
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.visitedEnds:Lorg/graalvm/compiler/graph/NodeBitMap;
            aload 2 /* merge */
            iload 4 /* i */
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndAt:(I)Lorg/graalvm/compiler/nodes/EndNode;
            invokevirtual org.graalvm.compiler.graph.NodeBitMap.isMarked:(Lorg/graalvm/compiler/graph/Node;)Z
            ifne 10
         8: .line 336
            iconst_0
            istore 3 /* endsVisited */
         9: .line 337
            goto 12
        10: .line 334
      StackMap locals:
      StackMap stack:
            iinc 4 /* i */ 1
      StackMap locals:
      StackMap stack:
        11: iload 4 /* i */
            aload 2 /* merge */
            invokevirtual org.graalvm.compiler.nodes.AbstractMergeNode.forwardEndCount:()I
            if_icmplt 7
        end local 4 // int i
        12: .line 340
      StackMap locals:
      StackMap stack:
            iload 3 /* endsVisited */
            ifeq 14
        13: .line 341
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
            new org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart
            dup
            aload 2 /* merge */
            aconst_null
            invokespecial org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart.<init>:(Lorg/graalvm/compiler/nodes/AbstractBeginNode;Ljava/lang/Object;)V
            invokeinterface java.util.Deque.add:(Ljava/lang/Object;)Z
            pop
        14: .line 343
      StackMap locals:
      StackMap stack:
            return
        end local 3 // boolean endsVisited
        end local 2 // org.graalvm.compiler.nodes.AbstractMergeNode merge
        end local 1 // org.graalvm.compiler.nodes.EndNode end
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot         Name  Signature
            0   15     0         this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0   15     1          end  Lorg/graalvm/compiler/nodes/EndNode;
            4   15     2        merge  Lorg/graalvm/compiler/nodes/AbstractMergeNode;
            5   15     3  endsVisited  Z
            6   12     4            i  I
    MethodParameters:
      Name  Flags
      end   

  protected abstract void node(org.graalvm.compiler.nodes.FixedNode);
    descriptor: (Lorg/graalvm/compiler/nodes/FixedNode;)V
    flags: (0x0404) ACC_PROTECTED, ACC_ABSTRACT
    MethodParameters:
      Name  Flags
      node  

  protected void end(org.graalvm.compiler.nodes.EndNode);
    descriptor: (Lorg/graalvm/compiler/nodes/EndNode;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.EndNode endNode
         0: .line 348
            aload 0 /* this */
            aload 1 /* endNode */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 349
            return
        end local 1 // org.graalvm.compiler.nodes.EndNode endNode
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot     Name  Signature
            0    2     0     this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  endNode  Lorg/graalvm/compiler/nodes/EndNode;
    MethodParameters:
         Name  Flags
      endNode  

  protected void merge(org.graalvm.compiler.nodes.AbstractMergeNode);
    descriptor: (Lorg/graalvm/compiler/nodes/AbstractMergeNode;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.AbstractMergeNode merge
         0: .line 352
            aload 0 /* this */
            aload 1 /* merge */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 353
            return
        end local 1 // org.graalvm.compiler.nodes.AbstractMergeNode merge
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    2     0   this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  merge  Lorg/graalvm/compiler/nodes/AbstractMergeNode;
    MethodParameters:
       Name  Flags
      merge  

  protected void loopBegin(org.graalvm.compiler.nodes.LoopBeginNode);
    descriptor: (Lorg/graalvm/compiler/nodes/LoopBeginNode;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.LoopBeginNode loopBegin
         0: .line 356
            aload 0 /* this */
            aload 1 /* loopBegin */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 357
            return
        end local 1 // org.graalvm.compiler.nodes.LoopBeginNode loopBegin
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot       Name  Signature
            0    2     0       this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  loopBegin  Lorg/graalvm/compiler/nodes/LoopBeginNode;
    MethodParameters:
           Name  Flags
      loopBegin  

  protected void loopEnd(org.graalvm.compiler.nodes.LoopEndNode);
    descriptor: (Lorg/graalvm/compiler/nodes/LoopEndNode;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.LoopEndNode loopEnd
         0: .line 360
            aload 0 /* this */
            aload 1 /* loopEnd */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 361
            return
        end local 1 // org.graalvm.compiler.nodes.LoopEndNode loopEnd
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot     Name  Signature
            0    2     0     this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  loopEnd  Lorg/graalvm/compiler/nodes/LoopEndNode;
    MethodParameters:
         Name  Flags
      loopEnd  

  protected void controlSplit(org.graalvm.compiler.nodes.ControlSplitNode);
    descriptor: (Lorg/graalvm/compiler/nodes/ControlSplitNode;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
         0: .line 364
            aload 0 /* this */
            aload 1 /* controlSplit */
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 365
            return
        end local 1 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot          Name  Signature
            0    2     0          this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  controlSplit  Lorg/graalvm/compiler/nodes/ControlSplitNode;
    MethodParameters:
              Name  Flags
      controlSplit  

  protected void invoke(org.graalvm.compiler.nodes.Invoke);
    descriptor: (Lorg/graalvm/compiler/nodes/Invoke;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.Invoke invoke
         0: .line 368
            aload 0 /* this */
            aload 1 /* invoke */
            invokeinterface org.graalvm.compiler.nodes.Invoke.asNode:()Lorg/graalvm/compiler/nodes/FixedNode;
            invokevirtual org.graalvm.compiler.phases.graph.SinglePassNodeIterator.node:(Lorg/graalvm/compiler/nodes/FixedNode;)V
         1: .line 369
            return
        end local 1 // org.graalvm.compiler.nodes.Invoke invoke
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot    Name  Signature
            0    2     0    this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    2     1  invoke  Lorg/graalvm/compiler/nodes/Invoke;
    MethodParameters:
        Name  Flags
      invoke  

  protected void finished();
    descriptor: ()V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
         0: .line 380
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 1
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeQueue:Ljava/util/Deque;
            invokeinterface java.util.Deque.isEmpty:()Z
            ifne 1
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         1: .line 381
      StackMap locals:
      StackMap stack:
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 2
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeStates:Lorg/graalvm/util/EconomicMap;
            invokeinterface org.graalvm.util.EconomicMap.isEmpty:()Z
            ifne 2
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         2: .line 382
      StackMap locals:
      StackMap stack:
            return
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    3     0  this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;

  private void keepForLater(org.graalvm.compiler.nodes.FixedNode, );
    descriptor: (Lorg/graalvm/compiler/nodes/FixedNode;Lorg/graalvm/compiler/phases/graph/MergeableState;)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=3, locals=3, args_size=3
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.FixedNode x
        start local 2 // org.graalvm.compiler.phases.graph.MergeableState s
         0: .line 385
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 1
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeStates:Lorg/graalvm/util/EconomicMap;
            aload 1 /* x */
            invokeinterface org.graalvm.util.EconomicMap.containsKey:(Ljava/lang/Object;)Z
            ifeq 1
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         1: .line 386
      StackMap locals:
      StackMap stack:
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 2
            aload 1 /* x */
            instanceof org.graalvm.compiler.nodes.LoopBeginNode
            ifne 2
            aload 1 /* x */
            instanceof org.graalvm.compiler.nodes.LoopEndNode
            ifne 2
            aload 1 /* x */
            instanceof org.graalvm.compiler.nodes.EndNode
            ifne 2
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         2: .line 387
      StackMap locals:
      StackMap stack:
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 3
            aload 2 /* s */
            ifnonnull 3
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         3: .line 388
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeStates:Lorg/graalvm/util/EconomicMap;
            aload 1 /* x */
            aload 2 /* s */
            invokeinterface org.graalvm.util.EconomicMap.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         4: .line 389
            return
        end local 2 // org.graalvm.compiler.phases.graph.MergeableState s
        end local 1 // org.graalvm.compiler.nodes.FixedNode x
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    5     0  this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    5     1     x  Lorg/graalvm/compiler/nodes/FixedNode;
            0    5     2     s  TT;
    Signature: (Lorg/graalvm/compiler/nodes/FixedNode;TT;)V
    MethodParameters:
      Name  Flags
      x     
      s     

  private T pruneEntry(org.graalvm.compiler.nodes.FixedNode);
    descriptor: (Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/phases/graph/MergeableState;
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=2, locals=3, args_size=2
        start local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
        start local 1 // org.graalvm.compiler.nodes.FixedNode x
         0: .line 392
            aload 0 /* this */
            getfield org.graalvm.compiler.phases.graph.SinglePassNodeIterator.nodeStates:Lorg/graalvm/util/EconomicMap;
            aload 1 /* x */
            invokeinterface org.graalvm.util.EconomicMap.removeKey:(Ljava/lang/Object;)Ljava/lang/Object;
            checkcast org.graalvm.compiler.phases.graph.MergeableState
            astore 2 /* result */
        start local 2 // org.graalvm.compiler.phases.graph.MergeableState result
         1: .line 393
            getstatic org.graalvm.compiler.phases.graph.SinglePassNodeIterator.$assertionsDisabled:Z
            ifne 2
            aload 2 /* result */
            ifnonnull 2
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
         2: .line 394
      StackMap locals: org.graalvm.compiler.phases.graph.MergeableState
      StackMap stack:
            aload 2 /* result */
            areturn
        end local 2 // org.graalvm.compiler.phases.graph.MergeableState result
        end local 1 // org.graalvm.compiler.nodes.FixedNode x
        end local 0 // org.graalvm.compiler.phases.graph.SinglePassNodeIterator this
      LocalVariableTable:
        Start  End  Slot    Name  Signature
            0    3     0    this  Lorg/graalvm/compiler/phases/graph/SinglePassNodeIterator<TT;>;
            0    3     1       x  Lorg/graalvm/compiler/nodes/FixedNode;
            1    3     2  result  TT;
    Signature: (Lorg/graalvm/compiler/nodes/FixedNode;)TT;
    MethodParameters:
      Name  Flags
      x     
}
Signature: <T:Lorg/graalvm/compiler/phases/graph/MergeableState<TT;>;>Ljava/lang/Object;
SourceFile: "SinglePassNodeIterator.java"
NestMembers:
  org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart
InnerClasses:
  private final PathStart = org.graalvm.compiler.phases.graph.SinglePassNodeIterator$PathStart of org.graalvm.compiler.phases.graph.SinglePassNodeIterator
/

java/ 10/ jdk.internal.vm.compiler/org/graalvm/compiler/phases/graph/SinglePassNodeIterator.class
