471   for (const LiveInterval *Intf : Intfs) {  in evictInterference()  local
473     if (!VRM->hasPhys(Intf->reg()))  in evictInterference()
476     Matrix->unassign(*Intf);  in evictInterference()
477     assert((ExtraInfo->getCascade(Intf->reg()) < Cascade ||  in evictInterference()
478             VirtReg.isSpillable() < Intf->isSpillable()) &&  in evictInterference()
480     ExtraInfo->setCascade(Intf->reg(), Cascade);  in evictInterference()
482     NewVRegs.push_back(Intf->reg());  in evictInterference()
567 bool RAGreedy::addSplitConstraints(InterferenceCache::Cursor Intf,  in addSplitConstraints()  argument
579     Intf.moveToBlock(BC.Number);  in addSplitConstraints()
587     if (!Intf.hasInterference())  in addSplitConstraints()
595       if (Intf.first() <= Indexes->getMBBStartIdx(BC.Number)) {  in addSplitConstraints()
598       } else if (Intf.first() < BI.FirstInstr) {  in addSplitConstraints()
601       } else if (Intf.first() < BI.LastInstr) {  in addSplitConstraints()
615       if (Intf.last() >= SA->getLastSplitPoint(BC.Number)) {  in addSplitConstraints()
618       } else if (Intf.last() > BI.LastInstr) {  in addSplitConstraints()
621       } else if (Intf.last() > BI.FirstInstr) {  in addSplitConstraints()
640 bool RAGreedy::addThroughConstraints(InterferenceCache::Cursor Intf,  in addThroughConstraints()  argument
648     Intf.moveToBlock(Number);  in addThroughConstraints()
650     if (!Intf.hasInterference()) {  in addThroughConstraints()
671     if (Intf.first() <= Indexes->getMBBStartIdx(Number))  in addThroughConstraints()
677     if (Intf.last() >= SA->getLastSplitPoint(Number))  in addThroughConstraints()
732       if (!addThroughConstraints(Cand.Intf, NewBlocks))  in growRegion()
770   if (!addSplitConstraints(Cand.Intf, Cost)) {  in calcCompactRegion()
828     Cand.Intf.moveToBlock(BC.Number);  in calcGlobalSplitCost()
845       Cand.Intf.moveToBlock(Number);  in calcGlobalSplitCost()
846       if (Cand.Intf.hasInterference()) {  in calcGlobalSplitCost()
896         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
897         IntfIn = Cand.Intf.first();  in splitAroundRegion()
905         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
906         IntfOut = Cand.Intf.last();  in splitAroundRegion()
944         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
945         IntfIn = Cand.Intf.first();  in splitAroundRegion()
952         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
953         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1079     if (!addSplitConstraints(Cand.Intf, Cost)) {  in calculateRegionSplitCost()
1665                                          const LiveInterval &Intf) {  in assignedRegPartiallyOverlaps()  argument
1666   MCRegister AssignedReg = VRM.getPhys(Intf.reg());  in assignedRegPartiallyOverlaps()
1696     for (const LiveInterval *Intf : reverse(Q.interferingVRegs())) {  in mayRecolorAllInterferences()  local
1708       if (((ExtraInfo->getStage(*Intf) == RS_Done &&  in mayRecolorAllInterferences()
1709             MRI->getRegClass(Intf->reg()) == CurRC &&  in mayRecolorAllInterferences()
1710             !assignedRegPartiallyOverlaps(*TRI, *VRM, PhysReg, *Intf)) &&  in mayRecolorAllInterferences()
1712              !hasTiedDef(MRI, Intf->reg()))) ||  in mayRecolorAllInterferences()
1713           FixedRegisters.count(Intf->reg())) {  in mayRecolorAllInterferences()
1718       RecoloringCandidates.insert(Intf);  in mayRecolorAllInterferences()