| /arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/ |
| H A D | interference_graph.cpp | 63 bool InterferenceGraph::HasEdge(unsigned a, unsigned b) const in HasEdge() function in panda::compiler::InterferenceGraph
65 return matrix_.HasEdge(a, b); in HasEdge()
122 [id, &out, this](unsigned val) { return HasEdge(id, out[val]); }); in LexBFS()
147 if (HasEdge(peo[i], peo[j])) {
155 if (nbr1 != nbr2 && !HasEdge(peo[nbr1], peo[nbr2])) {
173 if (i != j && ig.HasEdge(i, j) && ig.GetNode(j).IsPhysical()) {
220 if (!(skip_physical && GetNode(j).IsPhysical()) && HasEdge(node_num, j)) {
|
| H A D | interference_graph.h | 132 bool HasEdge(unsigned a, unsigned b) const in HasEdge() function in panda::compiler::GraphMatrix
239 bool HasEdge(unsigned a, unsigned b) const;
319 if (nbr_node.GetColor() != INVALID_REG && HasEdge(id, nbr_id)) {
322 } else if (nbr_id != id && nbr_node.HasBias() && HasEdge(id, nbr_id)) {
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/ |
| H A D | interference_graph.cpp | 49 bool InterferenceGraph::HasEdge(unsigned a, unsigned b) const in HasEdge() function in ark::compiler::InterferenceGraph
51 return matrix_.HasEdge(a, b); in HasEdge()
108 [id, &out, this](unsigned val) { return HasEdge(id, out[val]); }); in LexBFS()
144 if (nbr1 != nbr2 && !HasEdge(peo[nbr1], peo[nbr2])) {
162 if (HasEdge(peo[i], peo[j])) {
185 if (i != j && ig.HasEdge(i, j) && ig.GetNode(j).IsPhysical()) {
232 bool check = !(skipPhysical && GetNode(j).IsPhysical()) && HasEdge(nodeNum, j);
|
| H A D | interference_graph.h | 171 bool HasEdge(unsigned a, unsigned b) const in HasEdge() function in ark::compiler::GraphMatrix
270 bool HasEdge(unsigned a, unsigned b) const;
369 if (nbrNode.GetColor() != INVALID_REG && HasEdge(id, nbrId)) { in MakeBusyBitmap()
372 } else if (nbrId != id && nbrNode.HasBias() && HasEdge(id, nbrId)) { in MakeBusyBitmap()
|
| H A D | reg_alloc_graph_coloring.cpp | 195 [ig, tryIndex](auto id) { return ig->HasEdge(id, tryIndex); }); in WalkNodes()
|
| /arkcompiler/runtime_core/compiler/tests/ |
| H A D | reg_alloc_interference_graph_test.cpp | 46 ASSERT_EQ(matrix.HasEdge(i, j), IsInSet(i, j)); in TEST_F()
|
| H A D | reg_alloc_interference_graph_new_test.cpp | 101 EXPECT_EQ(matrix.HasEdge(i, j), IsInSet(test_edges, 2, i, j)); in HWTEST_F()
|
| H A D | compiler_regalloc_test.cpp | 174 * @tc.desc: Verify the HasEdge function.
198 EXPECT_EQ(matrix.HasEdge(i, j), is_in_set(i, j)); in HWTEST_F()
|
| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| H A D | reg_alloc_interference_graph_test.cpp | 54 ASSERT_EQ(matrix.HasEdge(i, j), g_isInSet(i, j)); in TEST_F()
|
| /arkcompiler/ets_runtime/ecmascript/ |
| H A D | dump.cpp | 48 static bool HasEdge(std::vector<Reference> &vec, JSTaggedValue toValue) in HasEdge() function
75 if (HasEdge(vec, toValue)) { in AddAnonymousEdge()
|