Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dregister_allocator_graph_color.cc1453 static bool IsLowDegreeNode(InterferenceNode* node, size_t num_regs) { in IsLowDegreeNode() function
1458 return !IsLowDegreeNode(node, num_regs); in IsHighDegreeNode()
1474 if (IsLowDegreeNode(node, num_regs_)) { in PruneInterferenceGraph()
1568 if (was_high_degree && IsLowDegreeNode(adj, num_regs_)) { in PruneNode()
1588 if (IsLowDegreeNode(node, num_regs_) && !node->IsMoveRelated()) { in CheckTransitionFromFreezeWorklist()
1607 DCHECK(IsLowDegreeNode(node, num_regs_)); in FreezeMoves()
1633 if (IsLowDegreeNode(adj, num_regs_) || adj->IsPrecolored() || adj->ContainsInterference(into)) { in PrecoloredHeuristic()
1689 bool was_low_degree = IsLowDegreeNode(adj, num_regs_); in Combine()
1709 if (IsLowDegreeNode(into, num_regs_)) { in Combine()