Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dregister_allocator_graph_color.cc287 size_t GetOutDegree() const { in GetOutDegree() function in art::InterferenceNode
1454 return node->GetOutDegree() < num_regs; in IsLowDegreeNode()
1502 DCHECK_LT(node->GetOutDegree(), num_regs_) << "Nodes in simplify list should be low degree"; in PruneInterferenceGraph()
1517 DCHECK_LT(node->GetOutDegree(), num_regs_) << "Nodes in freeze list should be low degree"; in PruneInterferenceGraph()
1528 DCHECK_GE(node->GetOutDegree(), num_regs_) << "Nodes in spill list should be high degree"; in PruneInterferenceGraph()
1651 if (from->GetOutDegree() + into->GetOutDegree() > 2 * num_regs_) { in UncoloredHeuristic()
1671 if (adj->GetOutDegree() - into->EdgeWeightWith(adj) < num_regs_) { in UncoloredHeuristic()
1811 DCHECK(false) << node->GetOutDegree() << " " << alias->GetOutDegree() << " " in ColorInterferenceGraph()