diff options
| author | 2014-10-16 13:26:29 +0000 | |
|---|---|---|
| committer | 2014-10-16 13:26:29 +0000 | |
| commit | ec2ea6ff6e3d7816df889454866a28b58ce6e6f5 (patch) | |
| tree | 41ec0fcacce25807fbc28965fb5e93d6c176c55e /compiler/optimizing/graph_checker_test.cc | |
| parent | c15c4066233b644f3086eef80007a7cf878d4867 (diff) | |
| parent | 633021e6ff6b9a57a374a994e74cfd69275ce100 (diff) | |
Merge "Implement default traversals in CFG & SSA graph checkers."
Diffstat (limited to 'compiler/optimizing/graph_checker_test.cc')
| -rw-r--r-- | compiler/optimizing/graph_checker_test.cc | 12 | 
1 files changed, 6 insertions, 6 deletions
diff --git a/compiler/optimizing/graph_checker_test.cc b/compiler/optimizing/graph_checker_test.cc index ea0692088d..39def82007 100644 --- a/compiler/optimizing/graph_checker_test.cc +++ b/compiler/optimizing/graph_checker_test.cc @@ -51,7 +51,7 @@ static void TestCode(const uint16_t* data) {    ASSERT_NE(graph, nullptr);    GraphChecker graph_checker(&allocator, graph); -  graph_checker.VisitInsertionOrder(); +  graph_checker.Run();    ASSERT_TRUE(graph_checker.IsValid());  } @@ -65,7 +65,7 @@ static void TestCodeSSA(const uint16_t* data) {    graph->TransformToSSA();    SSAChecker ssa_checker(&allocator, graph); -  ssa_checker.VisitInsertionOrder(); +  ssa_checker.Run();    ASSERT_TRUE(ssa_checker.IsValid());  } @@ -113,13 +113,13 @@ TEST(GraphChecker, InconsistentPredecessorsAndSuccessors) {    HGraph* graph = CreateSimpleCFG(&allocator);    GraphChecker graph_checker(&allocator, graph); -  graph_checker.VisitInsertionOrder(); +  graph_checker.Run();    ASSERT_TRUE(graph_checker.IsValid());    // Remove the entry block from the exit block's predecessors, to create an    // inconsistent successor/predecessor relation.    graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); -  graph_checker.VisitInsertionOrder(); +  graph_checker.Run();    ASSERT_FALSE(graph_checker.IsValid());  } @@ -131,7 +131,7 @@ TEST(GraphChecker, BlockEndingWithNonBranchInstruction) {    HGraph* graph = CreateSimpleCFG(&allocator);    GraphChecker graph_checker(&allocator, graph); -  graph_checker.VisitInsertionOrder(); +  graph_checker.Run();    ASSERT_TRUE(graph_checker.IsValid());    // Remove the sole instruction of the exit block (composed of a @@ -141,7 +141,7 @@ TEST(GraphChecker, BlockEndingWithNonBranchInstruction) {    HInstruction* last_inst = exit_block->GetLastInstruction();    exit_block->RemoveInstruction(last_inst); -  graph_checker.VisitInsertionOrder(); +  graph_checker.Run();    ASSERT_FALSE(graph_checker.IsValid());  }  |