267     InterferenceCache::Cursor Intf;  member
276       Intf.setPhysReg(Cache, Reg);  in reset()
751       LiveInterval *Intf = Q.interferingVRegs()[i - 1];  in canEvictInterference()  local
752       assert(TargetRegisterInfo::isVirtualRegister(Intf->reg) &&  in canEvictInterference()
755       if (getStage(*Intf) == RS_Done)  in canEvictInterference()
764         (Intf->isSpillable() ||  in canEvictInterference()
766          RegClassInfo.getNumAllocatableRegs(MRI->getRegClass(Intf->reg)));  in canEvictInterference()
768       unsigned IntfCascade = ExtraRegInfo[Intf->reg].Cascade;  in canEvictInterference()
777       bool BreaksHint = VRM->hasPreferredPhys(Intf->reg);  in canEvictInterference()
780       Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight);  in canEvictInterference()
787       if (!shouldEvict(VirtReg, IsHint, *Intf, BreaksHint))  in canEvictInterference()
792       if (!MaxCost.isMax() && IsLocal && LIS->intervalIsInOneMBB(*Intf) &&  in canEvictInterference()
793           (!EnableLocalReassign || !canReassign(*Intf, PhysReg))) {  in canEvictInterference()
828     LiveInterval *Intf = Intfs[i];  in evictInterference()  local
830     if (!VRM->hasPhys(Intf->reg))  in evictInterference()
832     Matrix->unassign(*Intf);  in evictInterference()
833     assert((ExtraRegInfo[Intf->reg].Cascade < Cascade ||  in evictInterference()
834             VirtReg.isSpillable() < Intf->isSpillable()) &&  in evictInterference()
836     ExtraRegInfo[Intf->reg].Cascade = Cascade;  in evictInterference()
838     NewVRegs.push_back(Intf->reg);  in evictInterference()
932 bool RAGreedy::addSplitConstraints(InterferenceCache::Cursor Intf,  in addSplitConstraints()  argument
944     Intf.moveToBlock(BC.Number);  in addSplitConstraints()
949     if (!Intf.hasInterference())  in addSplitConstraints()
957       if (Intf.first() <= Indexes->getMBBStartIdx(BC.Number))  in addSplitConstraints()
959       else if (Intf.first() < BI.FirstInstr)  in addSplitConstraints()
961       else if (Intf.first() < BI.LastInstr)  in addSplitConstraints()
967       if (Intf.last() >= SA->getLastSplitPoint(BC.Number))  in addSplitConstraints()
969       else if (Intf.last() > BI.LastInstr)  in addSplitConstraints()
971       else if (Intf.last() > BI.FirstInstr)  in addSplitConstraints()
990 void RAGreedy::addThroughConstraints(InterferenceCache::Cursor Intf,  in addThroughConstraints()  argument
999     Intf.moveToBlock(Number);  in addThroughConstraints()
1001     if (!Intf.hasInterference()) {  in addThroughConstraints()
1015     if (Intf.first() <= Indexes->getMBBStartIdx(Number))  in addThroughConstraints()
1021     if (Intf.last() >= SA->getLastSplitPoint(Number))  in addThroughConstraints()
1073       addThroughConstraints(Cand.Intf, NewBlocks);  in growRegion()
1109   if (!addSplitConstraints(Cand.Intf, Cost)) {  in calcCompactRegion()
1180       Cand.Intf.moveToBlock(Number);  in calcGlobalSplitCost()
1181       if (Cand.Intf.hasInterference()) {  in calcGlobalSplitCost()
1231         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1232         IntfIn = Cand.Intf.first();  in splitAroundRegion()
1240         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1241         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1280         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1281         IntfIn = Cand.Intf.first();  in splitAroundRegion()
1288         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1289         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1411     if (!addSplitConstraints(Cand.Intf, Cost)) {  in calculateRegionSplitCost()
2015       LiveInterval *Intf = Q.interferingVRegs()[i - 1];  in mayRecolorAllInterferences()  local
2018       if ((getStage(*Intf) == RS_Done &&  in mayRecolorAllInterferences()
2019            MRI->getRegClass(Intf->reg) == CurRC) ||  in mayRecolorAllInterferences()
2020           FixedRegisters.count(Intf->reg)) {  in mayRecolorAllInterferences()
2024       RecoloringCandidates.insert(Intf);  in mayRecolorAllInterferences()