Lines Matching defs:graph
23 * Create a simple control-flow graph composed of two blocks:
31 HGraph* graph = CreateGraph(allocator);
32 HBasicBlock* entry_block = new (allocator) HBasicBlock(graph);
34 graph->AddBlock(entry_block);
35 graph->SetEntryBlock(entry_block);
36 HBasicBlock* exit_block = new (allocator) HBasicBlock(graph);
38 graph->AddBlock(exit_block);
39 graph->SetExitBlock(exit_block);
41 graph->BuildDominatorTree();
42 return graph;
48 HGraph* graph = CreateCFG(&allocator, data);
49 ASSERT_NE(graph, nullptr);
51 GraphChecker graph_checker(graph);
93 // Test case with an invalid graph containing inconsistent
99 HGraph* graph = CreateSimpleCFG(&allocator);
100 GraphChecker graph_checker(graph);
106 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock());
111 // Test case with an invalid graph containing a non-branch last
117 HGraph* graph = CreateSimpleCFG(&allocator);
118 GraphChecker graph_checker(graph);
125 HBasicBlock* exit_block = graph->GetExitBlock();