Home
last modified time | relevance | path

Searched refs:AddEdge (Results 1 - 10 of 10) sorted by relevance

/arkcompiler/runtime_core/compiler/tests/
H A Dreg_alloc_interference_graph_test.cpp42 EXPECT_FALSE(matrix.AddEdge(0, 1)); in TEST_F()
43 EXPECT_FALSE(matrix.AddEdge(7, 4)); in TEST_F()
98 gr.AddEdge(0, 1); in TEST_F()
101 gr.AddEdge(1, 2); in TEST_F()
104 gr.AddEdge(0, 2); in TEST_F()
110 gr.AddEdge(3, 2); in TEST_F()
111 gr.AddEdge(3, 4); in TEST_F()
112 gr.AddEdge(0, 4); in TEST_F()
138 gr.AddEdge(x, y); in BuildSubgraph()
152 gr.AddEdge( in TEST_F()
[all...]
H A Dreg_alloc_interference_graph_new_test.cpp77 ig.AddEdge(x, y); in BuildSubgraph()
86 * @tc.desc: Verify the AddEdge function of GraphMatrix.
97 EXPECT_FALSE(matrix.AddEdge(0, 1)); in HWTEST_F()
98 EXPECT_FALSE(matrix.AddEdge(7, 4)); in HWTEST_F()
285 ig.AddEdge(0, 1); in HWTEST_F()
316 ig.AddEdge(x, y); in HWTEST_F()
352 ig.AddEdge(x, y); in HWTEST_F()
400 ig.AddEdge(x, y); in HWTEST_F()
494 ig.AddEdge(x, y); in HWTEST_F()
609 ig.AddEdge( in HWTEST_F()
[all...]
H A Dcompiler_regalloc_test.cpp192 EXPECT_FALSE(matrix.AddEdge(0, 1)); in HWTEST_F()
195 EXPECT_FALSE(matrix.AddEdge(a, b)); in HWTEST_F()
267 * @tc.desc: Verify the AddEdge function.
290 gr.AddEdge(0, 1); in HWTEST_F()
293 gr.AddEdge(1, 2); in HWTEST_F()
296 gr.AddEdge(0, 2); in HWTEST_F()
302 gr.AddEdge(3, 2); in HWTEST_F()
303 gr.AddEdge(3, 4); in HWTEST_F()
304 gr.AddEdge(0, 4); in HWTEST_F()
332 gr.AddEdge( in HWTEST_F()
[all...]
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dreg_alloc_interference_graph_test.cpp50 EXPECT_FALSE(matrix.AddEdge(0U, 1U)); in TEST_F()
51 EXPECT_FALSE(matrix.AddEdge(7U, 4U)); in TEST_F()
106 gr.AddEdge(0U, 1U); in TEST_F()
109 gr.AddEdge(1U, 2U); in TEST_F()
112 gr.AddEdge(0U, 2U); in TEST_F()
118 gr.AddEdge(3U, 2U); in TEST_F()
119 gr.AddEdge(3U, 4U); in TEST_F()
120 gr.AddEdge(0U, 4U); in TEST_F()
140 gr.AddEdge(0U, 1U); in TEST_F()
164 gr.AddEdge( in BuildSubgraph()
[all...]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dinterference_graph.cpp21 bool GraphMatrix::AddEdge(unsigned a, unsigned b) in AddEdge() function in panda::compiler::GraphMatrix
58 void InterferenceGraph::AddEdge(unsigned a, unsigned b) in AddEdge() function in panda::compiler::InterferenceGraph
60 matrix_.AddEdge(a, b); in AddEdge()
H A Dinterference_graph.h130 bool AddEdge(unsigned a, unsigned b);
238 void AddEdge(unsigned a, unsigned b);
H A Dreg_alloc_graph_coloring.cpp50 ig->AddEdge(node->GetNumber(), active_node->GetNumber()); in BuildIG()
65 ig->AddEdge(node->GetNumber(), physical_node->GetNumber()); in BuildIG()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dinterference_graph.cpp44 void InterferenceGraph::AddEdge(unsigned a, unsigned b) in AddEdge() function in ark::compiler::InterferenceGraph
46 matrix_.AddEdge(a, b); in AddEdge()
H A Dreg_alloc_graph_coloring.cpp75 ig->AddEdge(node->GetNumber(), activeNode->GetNumber()); in BuildIG()
82 ig->AddEdge(node->GetNumber(), physicalNode->GetNumber()); in BuildIG()
92 ig->AddEdge(node->GetNumber(), physicalNode->GetNumber()); in BuildIG()
H A Dinterference_graph.h151 bool AddEdge(unsigned a, unsigned b) in AddEdge() function in ark::compiler::GraphMatrix
269 void AddEdge(unsigned a, unsigned b);

Completed in 7 milliseconds