Home
last modified time | relevance | path

Searched refs:adj (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dregister_allocator_graph_color.cc1555 for (InterferenceNode* adj : node->GetAdjacentNodes()) { in PruneNode()
1556 DCHECK_NE(adj->stage, NodeStage::kPruned) << "Should be no interferences with pruned nodes"; in PruneNode()
1558 if (adj->IsPrecolored()) { in PruneNode()
1562 bool was_high_degree = IsHighDegreeNode(adj, num_regs_); in PruneNode()
1563 DCHECK(adj->ContainsInterference(node)) in PruneNode()
1565 adj->RemoveInterference(node); in PruneNode()
1568 if (was_high_degree && IsLowDegreeNode(adj, num_regs_)) { in PruneNode()
1569 EnableCoalesceOpportunities(adj); in PruneNode()
1570 for (InterferenceNode* adj_adj : adj->GetAdjacentNodes()) { in PruneNode()
1574 DCHECK_EQ(adj->stage, NodeStage::kSpillWorklist); in PruneNode()
[all …]
Dload_store_analysis_test.cc48 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList() argument
49 return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj); in SetupFromAdjacencyList()
59 void CheckReachability(const AdjacencyListGraph& adj,
718 void LoadStoreAnalysisTest::CheckReachability(const AdjacencyListGraph& adj, in CheckReachability() argument
722 if (adj.HasBlock(blk)) { in CheckReachability()
727 if (adj.HasBlock(other)) { in CheckReachability()
731 AdjacencyListGraph::Edge { adj.GetName(blk), adj.GetName(other) }) != in CheckReachability()
735 EXPECT_TRUE(contains_edge) << "Unexpected edge found between " << adj.GetName(blk) in CheckReachability()
736 << " and " << adj.GetName(other); in CheckReachability()
738 EXPECT_FALSE(contains_edge) << "Expected edge not found between " << adj.GetName(blk) in CheckReachability()
[all …]
Doptimizing_unit_test.h149 const std::vector<Edge>& adj) : graph_(graph) { in AdjacencyListGraph() argument
161 for (const auto& [src, dest] : adj) { in AdjacencyListGraph()
400 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList() argument
401 return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj); in SetupFromAdjacencyList()
Dexecution_subgraph_test.cc85 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList() argument
86 return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj); in SetupFromAdjacencyList()