@@ -605,8 +605,8 @@ private static void sortIntoList(NodeStack stack, Node n, HIRBlock b, ArrayList<
605
605
assert unprocessed .isMarked (n ) : Assertions .errorMessage (n );
606
606
assert nodeMap .get (n ) == b : Assertions .errorMessage (n );
607
607
assert stack .isEmpty () : "Node stack must be pre-allocated, but empty." ;
608
- assert !(n instanceof PhiNode );
609
- assert !(n instanceof ProxyNode );
608
+ assert !(n instanceof PhiNode ) : "Phi nodes will never be sorted into the list." ;
609
+ assert !(n instanceof ProxyNode ) : "Proxy nodes will never be sorted into the list." ;
610
610
611
611
unprocessed .clear (n );
612
612
@@ -633,8 +633,8 @@ private static int pushUnprocessedInputs(Node n, HIRBlock b, NodeMap<HIRBlock> n
633
633
int pushCount = 0 ;
634
634
for (Node input : n .inputs ()) {
635
635
if (nodeMap .get (input ) == b && unprocessed .isMarked (input )) {
636
- assert !(input instanceof PhiNode );
637
- assert !(input instanceof ProxyNode );
636
+ assert !(input instanceof PhiNode ) : "Phi nodes will always be already unmarked in the bitmap." ;
637
+ assert !(input instanceof ProxyNode ) : "Proxy nodes will always be already unmarked in the bitmap." ;
638
638
stack .push (input );
639
639
pushCount ++;
640
640
}
@@ -843,18 +843,9 @@ public void add(Node node) {
843
843
* Number of nodes in this micro block.
844
844
*/
845
845
public int getNodeCount () {
846
- assert getActualNodeCount () == nodeCount ;
847
846
return nodeCount ;
848
847
}
849
848
850
- private int getActualNodeCount () {
851
- int count = 0 ;
852
- for (NodeEntry e = head ; e != null ; e = e .next ) {
853
- count ++;
854
- }
855
- return count ;
856
- }
857
-
858
849
/**
859
850
* The id of the micro block, with a block always associated with a lower id than its
860
851
* successors.
0 commit comments