public class org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase extends org.graalvm.compiler.phases.Phase
  minor version: 0
  major version: 59
  flags: flags: (0x0021) ACC_PUBLIC, ACC_SUPER
  this_class: org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase
  super_class: org.graalvm.compiler.phases.Phase
{
  private static final org.graalvm.compiler.debug.DebugCounter counterGuardsAnchorOptimized;
    descriptor: Lorg/graalvm/compiler/debug/DebugCounter;
    flags: (0x001a) ACC_PRIVATE, ACC_STATIC, ACC_FINAL

  private static final org.graalvm.compiler.debug.DebugCounter counterGuardsOptimizedAtSplit;
    descriptor: Lorg/graalvm/compiler/debug/DebugCounter;
    flags: (0x001a) ACC_PRIVATE, ACC_STATIC, ACC_FINAL

  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 44
            ldc Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase;
            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.common.OptimizeGuardAnchorsPhase.$assertionsDisabled:Z
         3: .line 45
            ldc "GuardsAnchorOptimized"
            invokestatic org.graalvm.compiler.debug.Debug.counter:(Ljava/lang/CharSequence;)Lorg/graalvm/compiler/debug/DebugCounter;
            putstatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.counterGuardsAnchorOptimized:Lorg/graalvm/compiler/debug/DebugCounter;
         4: .line 46
            ldc "GuardsOptimizedAtSplit"
            invokestatic org.graalvm.compiler.debug.Debug.counter:(Ljava/lang/CharSequence;)Lorg/graalvm/compiler/debug/DebugCounter;
            putstatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.counterGuardsOptimizedAtSplit:Lorg/graalvm/compiler/debug/DebugCounter;
            return
      LocalVariableTable:
        Start  End  Slot  Name  Signature

  public void <init>();
    descriptor: ()V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=1, locals=1, args_size=1
        start local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase this
         0: .line 44
            aload 0 /* this */
            invokespecial org.graalvm.compiler.phases.Phase.<init>:()V
            return
        end local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase;

  protected void run(org.graalvm.compiler.nodes.StructuredGraph);
    descriptor: (Lorg/graalvm/compiler/nodes/StructuredGraph;)V
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=3, locals=9, args_size=2
        start local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase this
        start local 1 // org.graalvm.compiler.nodes.StructuredGraph graph
         0: .line 56
            aload 1 /* graph */
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph.getGuardsStage:()Lorg/graalvm/compiler/nodes/StructuredGraph$GuardsStage;
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph$GuardsStage.allowsFloatingGuards:()Z
            ifne 2
         1: .line 57
            return
         2: .line 59
      StackMap locals:
      StackMap stack:
            new org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG
            dup
            aload 1 /* graph */
            invokespecial org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG.<init>:(Lorg/graalvm/compiler/nodes/StructuredGraph;)V
            astore 2 /* cfg */
        start local 2 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
         3: .line 60
            aload 1 /* graph */
            getstatic org.graalvm.compiler.nodes.AbstractBeginNode.TYPE:Lorg/graalvm/compiler/graph/NodeClass;
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph.getNodes:(Lorg/graalvm/compiler/graph/NodeClass;)Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 4
            goto 15
      StackMap locals: org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase org.graalvm.compiler.nodes.StructuredGraph org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG top java.util.Iterator
      StackMap stack:
         4: aload 4
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.AbstractBeginNode
            astore 3 /* begin */
        start local 3 // org.graalvm.compiler.nodes.AbstractBeginNode begin
         5: .line 61
            aload 3 /* begin */
            instanceof org.graalvm.compiler.nodes.StartNode
            ifne 15
            aload 3 /* begin */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.predecessor:()Lorg/graalvm/compiler/graph/Node;
            instanceof org.graalvm.compiler.nodes.ControlSplitNode
            ifne 15
         6: .line 62
            aload 3 /* begin */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.guards:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            astore 5 /* guards */
        start local 5 // org.graalvm.compiler.graph.iterators.NodeIterable guards
         7: .line 63
            aload 5 /* guards */
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.isNotEmpty:()Z
            ifeq 15
         8: .line 64
            aload 2 /* cfg */
            invokevirtual org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG.get:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.cfg.ControlFlowGraph
            aload 3 /* begin */
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.computeOptimalAnchor:(Lorg/graalvm/compiler/nodes/cfg/ControlFlowGraph;Lorg/graalvm/compiler/nodes/AbstractBeginNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            astore 6 /* newAnchor */
        start local 6 // org.graalvm.compiler.nodes.AbstractBeginNode newAnchor
         9: .line 67
            aload 6 /* newAnchor */
            aload 3 /* begin */
            if_acmpeq 15
        10: .line 68
            aload 5 /* guards */
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.snapshot:()Ljava/util/List;
            invokeinterface java.util.List.iterator:()Ljava/util/Iterator;
            astore 8
            goto 13
      StackMap locals: org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase org.graalvm.compiler.nodes.StructuredGraph org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode java.util.Iterator org.graalvm.compiler.graph.iterators.NodeIterable org.graalvm.compiler.nodes.AbstractBeginNode top java.util.Iterator
      StackMap stack:
        11: aload 8
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.GuardNode
            astore 7 /* guard */
        start local 7 // org.graalvm.compiler.nodes.GuardNode guard
        12: .line 69
            aload 7 /* guard */
            aload 6 /* newAnchor */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.setAnchor:(Lorg/graalvm/compiler/nodes/extended/AnchoringNode;)V
        end local 7 // org.graalvm.compiler.nodes.GuardNode guard
        13: .line 68
      StackMap locals:
      StackMap stack:
            aload 8
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 11
        14: .line 71
            getstatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.counterGuardsAnchorOptimized:Lorg/graalvm/compiler/debug/DebugCounter;
            invokeinterface org.graalvm.compiler.debug.DebugCounter.increment:()V
        end local 6 // org.graalvm.compiler.nodes.AbstractBeginNode newAnchor
        end local 5 // org.graalvm.compiler.graph.iterators.NodeIterable guards
        end local 3 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        15: .line 60
      StackMap locals: org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase org.graalvm.compiler.nodes.StructuredGraph org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG top java.util.Iterator
      StackMap stack:
            aload 4
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 4
        16: .line 76
            aload 1 /* graph */
            getstatic org.graalvm.compiler.nodes.ControlSplitNode.TYPE:Lorg/graalvm/compiler/graph/NodeClass;
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph.getNodes:(Lorg/graalvm/compiler/graph/NodeClass;)Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 4
            goto 19
      StackMap locals:
      StackMap stack:
        17: aload 4
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.ControlSplitNode
            astore 3 /* controlSplit */
        start local 3 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
        18: .line 77
            aload 3 /* controlSplit */
            aload 2 /* cfg */
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.optimizeAtControlSplit:(Lorg/graalvm/compiler/nodes/ControlSplitNode;Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;)V
        end local 3 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
        19: .line 76
      StackMap locals:
      StackMap stack:
            aload 4
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 17
        20: .line 79
            return
        end local 2 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
        end local 1 // org.graalvm.compiler.nodes.StructuredGraph graph
        end local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase this
      LocalVariableTable:
        Start  End  Slot          Name  Signature
            0   21     0          this  Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase;
            0   21     1         graph  Lorg/graalvm/compiler/nodes/StructuredGraph;
            3   21     2           cfg  Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;
            5   15     3         begin  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            7   15     5        guards  Lorg/graalvm/compiler/graph/iterators/NodeIterable<Lorg/graalvm/compiler/nodes/GuardNode;>;
            9   15     6     newAnchor  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
           12   13     7         guard  Lorg/graalvm/compiler/nodes/GuardNode;
           18   19     3  controlSplit  Lorg/graalvm/compiler/nodes/ControlSplitNode;
    MethodParameters:
       Name  Flags
      graph  

  public static org.graalvm.compiler.nodes.AbstractBeginNode getOptimalAnchor(org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG, org.graalvm.compiler.nodes.AbstractBeginNode);
    descriptor: (Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;Lorg/graalvm/compiler/nodes/AbstractBeginNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
    flags: (0x0009) ACC_PUBLIC, ACC_STATIC
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
        start local 1 // org.graalvm.compiler.nodes.AbstractBeginNode begin
         0: .line 82
            aload 1 /* begin */
            instanceof org.graalvm.compiler.nodes.StartNode
            ifne 1
            aload 1 /* begin */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.predecessor:()Lorg/graalvm/compiler/graph/Node;
            instanceof org.graalvm.compiler.nodes.ControlSplitNode
            ifeq 2
         1: .line 83
      StackMap locals:
      StackMap stack:
            aload 1 /* begin */
            areturn
         2: .line 85
      StackMap locals:
      StackMap stack:
            aload 0 /* cfg */
            invokevirtual org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG.get:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.cfg.ControlFlowGraph
            aload 1 /* begin */
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.computeOptimalAnchor:(Lorg/graalvm/compiler/nodes/cfg/ControlFlowGraph;Lorg/graalvm/compiler/nodes/AbstractBeginNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            areturn
        end local 1 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        end local 0 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    3     0    cfg  Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;
            0    3     1  begin  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
    MethodParameters:
       Name  Flags
      cfg    
      begin  

  private static org.graalvm.compiler.nodes.AbstractBeginNode computeOptimalAnchor(org.graalvm.compiler.nodes.cfg.ControlFlowGraph, org.graalvm.compiler.nodes.AbstractBeginNode);
    descriptor: (Lorg/graalvm/compiler/nodes/cfg/ControlFlowGraph;Lorg/graalvm/compiler/nodes/AbstractBeginNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=2, locals=3, args_size=2
        start local 0 // org.graalvm.compiler.nodes.cfg.ControlFlowGraph cfg
        start local 1 // org.graalvm.compiler.nodes.AbstractBeginNode begin
         0: .line 89
            aload 0 /* cfg */
            aload 1 /* begin */
            invokevirtual org.graalvm.compiler.nodes.cfg.ControlFlowGraph.blockFor:(Lorg/graalvm/compiler/graph/Node;)Lorg/graalvm/compiler/nodes/cfg/Block;
            astore 2 /* anchor */
        start local 2 // org.graalvm.compiler.nodes.cfg.Block anchor
         1: .line 90
            goto 3
         2: .line 91
      StackMap locals: org.graalvm.compiler.nodes.cfg.Block
      StackMap stack:
            aload 2 /* anchor */
            invokevirtual org.graalvm.compiler.nodes.cfg.Block.getDominator:()Lorg/graalvm/compiler/core/common/cfg/AbstractBlockBase;
            checkcast org.graalvm.compiler.nodes.cfg.Block
            astore 2 /* anchor */
         3: .line 90
      StackMap locals:
      StackMap stack:
            aload 2 /* anchor */
            invokevirtual org.graalvm.compiler.nodes.cfg.Block.getDominator:()Lorg/graalvm/compiler/core/common/cfg/AbstractBlockBase;
            ifnull 4
            aload 2 /* anchor */
            invokevirtual org.graalvm.compiler.nodes.cfg.Block.getDominator:()Lorg/graalvm/compiler/core/common/cfg/AbstractBlockBase;
            checkcast org.graalvm.compiler.nodes.cfg.Block
            invokevirtual org.graalvm.compiler.nodes.cfg.Block.getPostdominator:()Lorg/graalvm/compiler/nodes/cfg/Block;
            aload 2 /* anchor */
            if_acmpeq 2
         4: .line 93
      StackMap locals:
      StackMap stack:
            aload 2 /* anchor */
            invokevirtual org.graalvm.compiler.nodes.cfg.Block.getBeginNode:()Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            areturn
        end local 2 // org.graalvm.compiler.nodes.cfg.Block anchor
        end local 1 // org.graalvm.compiler.nodes.AbstractBeginNode begin
        end local 0 // org.graalvm.compiler.nodes.cfg.ControlFlowGraph cfg
      LocalVariableTable:
        Start  End  Slot    Name  Signature
            0    5     0     cfg  Lorg/graalvm/compiler/nodes/cfg/ControlFlowGraph;
            0    5     1   begin  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            1    5     2  anchor  Lorg/graalvm/compiler/nodes/cfg/Block;
    MethodParameters:
       Name  Flags
      cfg    
      begin  

  private static void optimizeAtControlSplit(org.graalvm.compiler.nodes.ControlSplitNode, org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG);
    descriptor: (Lorg/graalvm/compiler/nodes/ControlSplitNode;Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;)V
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=9, locals=12, args_size=2
        start local 0 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
        start local 1 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
         0: .line 97
            aload 0 /* controlSplit */
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.findMinimumUsagesSuccessor:(Lorg/graalvm/compiler/nodes/ControlSplitNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            astore 2 /* successor */
        start local 2 // org.graalvm.compiler.nodes.AbstractBeginNode successor
         1: .line 98
            aload 0 /* controlSplit */
            invokevirtual org.graalvm.compiler.nodes.ControlSplitNode.successors:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.count:()I
            istore 3 /* successorCount */
        start local 3 // int successorCount
         2: .line 99
            aload 2 /* successor */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.guards:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.snapshot:()Ljava/util/List;
            invokeinterface java.util.List.iterator:()Ljava/util/Iterator;
            astore 5
            goto 29
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int top java.util.Iterator
      StackMap stack:
         3: aload 5
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.GuardNode
            astore 4 /* guard */
        start local 4 // org.graalvm.compiler.nodes.GuardNode guard
         4: .line 100
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.isDeleted:()Z
            ifne 29
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getCondition:()Lorg/graalvm/compiler/nodes/LogicNode;
            invokevirtual org.graalvm.compiler.nodes.LogicNode.getUsageCount:()I
            iload 3 /* successorCount */
            if_icmpge 6
         5: .line 101
            goto 29
         6: .line 103
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int org.graalvm.compiler.nodes.GuardNode java.util.Iterator
      StackMap stack:
            new java.util.ArrayList
            dup
            iload 3 /* successorCount */
            iconst_1
            isub
            invokespecial java.util.ArrayList.<init>:(I)V
            astore 6 /* otherGuards */
        start local 6 // java.util.List otherGuards
         7: .line 104
            new java.util.HashSet
            dup
            aload 0 /* controlSplit */
            invokevirtual org.graalvm.compiler.nodes.ControlSplitNode.successors:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.count:()I
            invokespecial java.util.HashSet.<init>:(I)V
            astore 7 /* successorsWithoutGuards */
        start local 7 // java.util.HashSet successorsWithoutGuards
         8: .line 105
            aload 0 /* controlSplit */
            invokevirtual org.graalvm.compiler.nodes.ControlSplitNode.successors:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            aload 7 /* successorsWithoutGuards */
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.snapshotTo:(Ljava/util/Collection;)V
         9: .line 106
            aload 7 /* successorsWithoutGuards */
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getAnchor:()Lorg/graalvm/compiler/nodes/extended/AnchoringNode;
            invokevirtual java.util.HashSet.remove:(Ljava/lang/Object;)Z
            pop
        10: .line 107
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getCondition:()Lorg/graalvm/compiler/nodes/LogicNode;
            invokevirtual org.graalvm.compiler.nodes.LogicNode.usages:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            ldc Lorg/graalvm/compiler/nodes/GuardNode;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.filter:(Ljava/lang/Class;)Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 9
            goto 17
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int org.graalvm.compiler.nodes.GuardNode java.util.Iterator java.util.List java.util.HashSet top java.util.Iterator
      StackMap stack:
        11: aload 9
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.GuardNode
            astore 8 /* conditonGuard */
        start local 8 // org.graalvm.compiler.nodes.GuardNode conditonGuard
        12: .line 108
            aload 8 /* conditonGuard */
            aload 4 /* guard */
            if_acmpeq 17
        13: .line 109
            aload 8 /* conditonGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getAnchor:()Lorg/graalvm/compiler/nodes/extended/AnchoringNode;
            astore 10 /* conditionGuardAnchor */
        start local 10 // org.graalvm.compiler.nodes.extended.AnchoringNode conditionGuardAnchor
        14: .line 110
            aload 10 /* conditionGuardAnchor */
            invokeinterface org.graalvm.compiler.nodes.extended.AnchoringNode.asNode:()Lorg/graalvm/compiler/nodes/ValueNode;
            invokevirtual org.graalvm.compiler.nodes.ValueNode.predecessor:()Lorg/graalvm/compiler/graph/Node;
            aload 0 /* controlSplit */
            if_acmpne 17
            aload 4 /* guard */
            aload 8 /* conditonGuard */
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.compatibleGuards:(Lorg/graalvm/compiler/nodes/GuardNode;Lorg/graalvm/compiler/nodes/GuardNode;)Z
            ifeq 17
        15: .line 111
            aload 6 /* otherGuards */
            aload 8 /* conditonGuard */
            invokeinterface java.util.List.add:(Ljava/lang/Object;)Z
            pop
        16: .line 112
            aload 7 /* successorsWithoutGuards */
            aload 10 /* conditionGuardAnchor */
            invokevirtual java.util.HashSet.remove:(Ljava/lang/Object;)Z
            pop
        end local 10 // org.graalvm.compiler.nodes.extended.AnchoringNode conditionGuardAnchor
        end local 8 // org.graalvm.compiler.nodes.GuardNode conditonGuard
        17: .line 107
      StackMap locals:
      StackMap stack:
            aload 9
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 11
        18: .line 117
            aload 7 /* successorsWithoutGuards */
            invokevirtual java.util.HashSet.isEmpty:()Z
            ifeq 28
        19: .line 118
            getstatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.$assertionsDisabled:Z
            ifne 20
            aload 6 /* otherGuards */
            invokeinterface java.util.List.size:()I
            iload 3 /* successorCount */
            iconst_1
            isub
            if_icmpge 20
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
        20: .line 119
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int org.graalvm.compiler.nodes.GuardNode java.util.Iterator java.util.List java.util.HashSet
      StackMap stack:
            aload 1 /* cfg */
            invokevirtual org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG.get:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.cfg.ControlFlowGraph
            aload 0 /* controlSplit */
            invokestatic org.graalvm.compiler.nodes.AbstractBeginNode.prevBegin:(Lorg/graalvm/compiler/nodes/FixedNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            invokestatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.computeOptimalAnchor:(Lorg/graalvm/compiler/nodes/cfg/ControlFlowGraph;Lorg/graalvm/compiler/nodes/AbstractBeginNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            astore 8 /* anchor */
        start local 8 // org.graalvm.compiler.nodes.AbstractBeginNode anchor
        21: .line 120
            aload 0 /* controlSplit */
            invokevirtual org.graalvm.compiler.nodes.ControlSplitNode.graph:()Lorg/graalvm/compiler/nodes/StructuredGraph;
            new org.graalvm.compiler.nodes.GuardNode
            dup
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getCondition:()Lorg/graalvm/compiler/nodes/LogicNode;
            aload 8 /* anchor */
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getReason:()Ljdk/vm/ci/meta/DeoptimizationReason;
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getAction:()Ljdk/vm/ci/meta/DeoptimizationAction;
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.isNegated:()Z
            aload 4 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getSpeculation:()Ljdk/vm/ci/meta/JavaConstant;
            invokespecial org.graalvm.compiler.nodes.GuardNode.<init>:(Lorg/graalvm/compiler/nodes/LogicNode;Lorg/graalvm/compiler/nodes/extended/AnchoringNode;Ljdk/vm/ci/meta/DeoptimizationReason;Ljdk/vm/ci/meta/DeoptimizationAction;ZLjdk/vm/ci/meta/JavaConstant;)V
            invokevirtual org.graalvm.compiler.nodes.StructuredGraph.unique:(Lorg/graalvm/compiler/graph/Node;)Lorg/graalvm/compiler/graph/Node;
            checkcast org.graalvm.compiler.nodes.GuardNode
            astore 9 /* newGuard */
        start local 9 // org.graalvm.compiler.nodes.GuardNode newGuard
        22: .line 121
            aload 6 /* otherGuards */
            invokeinterface java.util.List.iterator:()Ljava/util/Iterator;
            astore 11
            goto 25
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int org.graalvm.compiler.nodes.GuardNode java.util.Iterator java.util.List java.util.HashSet org.graalvm.compiler.nodes.AbstractBeginNode org.graalvm.compiler.nodes.GuardNode top java.util.Iterator
      StackMap stack:
        23: aload 11
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.GuardNode
            astore 10 /* otherGuard */
        start local 10 // org.graalvm.compiler.nodes.GuardNode otherGuard
        24: .line 122
            aload 10 /* otherGuard */
            aload 9 /* newGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.replaceAndDelete:(Lorg/graalvm/compiler/graph/Node;)V
        end local 10 // org.graalvm.compiler.nodes.GuardNode otherGuard
        25: .line 121
      StackMap locals:
      StackMap stack:
            aload 11
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 23
        26: .line 124
            aload 4 /* guard */
            aload 9 /* newGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.replaceAndDelete:(Lorg/graalvm/compiler/graph/Node;)V
        27: .line 125
            getstatic org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase.counterGuardsOptimizedAtSplit:Lorg/graalvm/compiler/debug/DebugCounter;
            invokeinterface org.graalvm.compiler.debug.DebugCounter.increment:()V
        end local 9 // org.graalvm.compiler.nodes.GuardNode newGuard
        end local 8 // org.graalvm.compiler.nodes.AbstractBeginNode anchor
        28: .line 127
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int org.graalvm.compiler.nodes.GuardNode java.util.Iterator java.util.List java.util.HashSet
      StackMap stack:
            aload 6 /* otherGuards */
            invokeinterface java.util.List.clear:()V
        end local 7 // java.util.HashSet successorsWithoutGuards
        end local 6 // java.util.List otherGuards
        end local 4 // org.graalvm.compiler.nodes.GuardNode guard
        29: .line 99
      StackMap locals: org.graalvm.compiler.nodes.ControlSplitNode org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG org.graalvm.compiler.nodes.AbstractBeginNode int top java.util.Iterator
      StackMap stack:
            aload 5
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 3
        30: .line 129
            return
        end local 3 // int successorCount
        end local 2 // org.graalvm.compiler.nodes.AbstractBeginNode successor
        end local 1 // org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG cfg
        end local 0 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
      LocalVariableTable:
        Start  End  Slot                     Name  Signature
            0   31     0             controlSplit  Lorg/graalvm/compiler/nodes/ControlSplitNode;
            0   31     1                      cfg  Lorg/graalvm/compiler/phases/common/OptimizeGuardAnchorsPhase$LazyCFG;
            1   31     2                successor  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            2   31     3           successorCount  I
            4   29     4                    guard  Lorg/graalvm/compiler/nodes/GuardNode;
            7   29     6              otherGuards  Ljava/util/List<Lorg/graalvm/compiler/nodes/GuardNode;>;
            8   29     7  successorsWithoutGuards  Ljava/util/HashSet<Lorg/graalvm/compiler/graph/Node;>;
           12   17     8            conditonGuard  Lorg/graalvm/compiler/nodes/GuardNode;
           14   17    10     conditionGuardAnchor  Lorg/graalvm/compiler/nodes/extended/AnchoringNode;
           21   28     8                   anchor  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
           22   28     9                 newGuard  Lorg/graalvm/compiler/nodes/GuardNode;
           24   25    10               otherGuard  Lorg/graalvm/compiler/nodes/GuardNode;
    MethodParameters:
              Name  Flags
      controlSplit  
      cfg           

  private static boolean compatibleGuards(org.graalvm.compiler.nodes.GuardNode, org.graalvm.compiler.nodes.GuardNode);
    descriptor: (Lorg/graalvm/compiler/nodes/GuardNode;Lorg/graalvm/compiler/nodes/GuardNode;)Z
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // org.graalvm.compiler.nodes.GuardNode guard
        start local 1 // org.graalvm.compiler.nodes.GuardNode conditonGuard
         0: .line 132
            aload 1 /* conditonGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.isNegated:()Z
            aload 0 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.isNegated:()Z
            if_icmpne 3
            aload 1 /* conditonGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getAction:()Ljdk/vm/ci/meta/DeoptimizationAction;
            aload 0 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getAction:()Ljdk/vm/ci/meta/DeoptimizationAction;
            if_acmpne 3
            aload 1 /* conditonGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getReason:()Ljdk/vm/ci/meta/DeoptimizationReason;
            aload 0 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getReason:()Ljdk/vm/ci/meta/DeoptimizationReason;
            if_acmpne 3
         1: .line 133
            aload 1 /* conditonGuard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getSpeculation:()Ljdk/vm/ci/meta/JavaConstant;
            aload 0 /* guard */
            invokevirtual org.graalvm.compiler.nodes.GuardNode.getSpeculation:()Ljdk/vm/ci/meta/JavaConstant;
            invokevirtual java.lang.Object.equals:(Ljava/lang/Object;)Z
            ifeq 3
         2: .line 132
            iconst_1
            ireturn
      StackMap locals:
      StackMap stack:
         3: iconst_0
            ireturn
        end local 1 // org.graalvm.compiler.nodes.GuardNode conditonGuard
        end local 0 // org.graalvm.compiler.nodes.GuardNode guard
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0    4     0          guard  Lorg/graalvm/compiler/nodes/GuardNode;
            0    4     1  conditonGuard  Lorg/graalvm/compiler/nodes/GuardNode;
    MethodParameters:
               Name  Flags
      guard          
      conditonGuard  

  private static org.graalvm.compiler.nodes.AbstractBeginNode findMinimumUsagesSuccessor(org.graalvm.compiler.nodes.ControlSplitNode);
    descriptor: (Lorg/graalvm/compiler/nodes/ControlSplitNode;)Lorg/graalvm/compiler/nodes/AbstractBeginNode;
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=2, locals=6, args_size=1
        start local 0 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
         0: .line 137
            aload 0 /* controlSplit */
            invokevirtual org.graalvm.compiler.nodes.ControlSplitNode.successors:()Lorg/graalvm/compiler/graph/iterators/NodeIterable;
            invokeinterface org.graalvm.compiler.graph.iterators.NodeIterable.iterator:()Ljava/util/Iterator;
            astore 1 /* successors */
        start local 1 // java.util.Iterator successors
         1: .line 138
            aload 1 /* successors */
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.AbstractBeginNode
            astore 2 /* min */
        start local 2 // org.graalvm.compiler.nodes.AbstractBeginNode min
         2: .line 139
            aload 2 /* min */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.getUsageCount:()I
            istore 3 /* minUsages */
        start local 3 // int minUsages
         3: .line 140
            goto 9
         4: .line 141
      StackMap locals: java.util.Iterator org.graalvm.compiler.nodes.AbstractBeginNode int
      StackMap stack:
            aload 1 /* successors */
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast org.graalvm.compiler.nodes.AbstractBeginNode
            astore 4 /* successor */
        start local 4 // org.graalvm.compiler.nodes.AbstractBeginNode successor
         5: .line 142
            aload 4 /* successor */
            invokevirtual org.graalvm.compiler.nodes.AbstractBeginNode.getUsageCount:()I
            istore 5 /* count */
        start local 5 // int count
         6: .line 143
            iload 5 /* count */
            iload 3 /* minUsages */
            if_icmpge 9
         7: .line 144
            iload 5 /* count */
            istore 3 /* minUsages */
         8: .line 145
            aload 4 /* successor */
            astore 2 /* min */
        end local 5 // int count
        end local 4 // org.graalvm.compiler.nodes.AbstractBeginNode successor
         9: .line 140
      StackMap locals:
      StackMap stack:
            aload 1 /* successors */
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 4
        10: .line 148
            aload 2 /* min */
            areturn
        end local 3 // int minUsages
        end local 2 // org.graalvm.compiler.nodes.AbstractBeginNode min
        end local 1 // java.util.Iterator successors
        end local 0 // org.graalvm.compiler.nodes.ControlSplitNode controlSplit
      LocalVariableTable:
        Start  End  Slot          Name  Signature
            0   11     0  controlSplit  Lorg/graalvm/compiler/nodes/ControlSplitNode;
            1   11     1    successors  Ljava/util/Iterator<Lorg/graalvm/compiler/graph/Node;>;
            2   11     2           min  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            3   11     3     minUsages  I
            5    9     4     successor  Lorg/graalvm/compiler/nodes/AbstractBeginNode;
            6    9     5         count  I
    MethodParameters:
              Name  Flags
      controlSplit  
}
SourceFile: "OptimizeGuardAnchorsPhase.java"
NestMembers:
  org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG
InnerClasses:
  public abstract ValueNumberable = org.graalvm.compiler.graph.Node$ValueNumberable of org.graalvm.compiler.graph.Node
  public final GuardsStage = org.graalvm.compiler.nodes.StructuredGraph$GuardsStage of org.graalvm.compiler.nodes.StructuredGraph
  public LazyCFG = org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase$LazyCFG of org.graalvm.compiler.phases.common.OptimizeGuardAnchorsPhase