diff options
| -rw-r--r-- | compiler/optimizing/dominator_test.cc | 5 | ||||
| -rw-r--r-- | compiler/optimizing/graph_test.cc | 4 |
2 files changed, 4 insertions, 5 deletions
diff --git a/compiler/optimizing/dominator_test.cc b/compiler/optimizing/dominator_test.cc index feb8b2092a..91e4a997fd 100644 --- a/compiler/optimizing/dominator_test.cc +++ b/compiler/optimizing/dominator_test.cc @@ -133,9 +133,8 @@ TEST(OptimizerTest, CFG4) { const uint32_t dominators[] = { kInvalidBlockId, - 3, - kInvalidBlockId, - 0 + 0, + kInvalidBlockId }; TestCode(data1, dominators, sizeof(dominators) / sizeof(int)); diff --git a/compiler/optimizing/graph_test.cc b/compiler/optimizing/graph_test.cc index d5305646a8..d4b9b71952 100644 --- a/compiler/optimizing/graph_test.cc +++ b/compiler/optimizing/graph_test.cc @@ -164,7 +164,7 @@ TEST(GraphTest, IfSuccessorMultipleBackEdges1) { // Ensure there is only one back edge. ASSERT_EQ(if_block->GetPredecessors().size(), 2u); - ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); + ASSERT_EQ(if_block->GetPredecessors()[0], entry_block); ASSERT_NE(if_block->GetPredecessors()[1], if_block); // Ensure the new block is the back edge. @@ -199,7 +199,7 @@ TEST(GraphTest, IfSuccessorMultipleBackEdges2) { // Ensure there is only one back edge. ASSERT_EQ(if_block->GetPredecessors().size(), 2u); - ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); + ASSERT_EQ(if_block->GetPredecessors()[0], entry_block); ASSERT_NE(if_block->GetPredecessors()[1], if_block); // Ensure the new block is the back edge. |