Lines Matching defs:graph
29 * Create a simple control-flow graph composed of two blocks:
37 HGraph* graph = CreateGraph();
38 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph);
40 graph->AddBlock(entry_block);
41 graph->SetEntryBlock(entry_block);
42 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph);
44 graph->AddBlock(exit_block);
45 graph->SetExitBlock(exit_block);
47 graph->BuildDominatorTree();
48 return graph;
52 HGraph* graph = CreateCFG(data);
53 ASSERT_NE(graph, nullptr);
55 GraphChecker graph_checker(graph);
95 // Test case with an invalid graph containing inconsistent
98 HGraph* graph = CreateSimpleCFG();
99 GraphChecker graph_checker(graph);
105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock());
110 // Test case with an invalid graph containing a non-branch last
113 HGraph* graph = CreateSimpleCFG();
114 GraphChecker graph_checker(graph);
121 HBasicBlock* exit_block = graph->GetExitBlock();
