269     InterferenceCache::Cursor Intf;  member
278       Intf.setPhysReg(Cache, Reg);  in reset()
753       LiveInterval *Intf = Q.interferingVRegs()[i - 1];  in canEvictInterference()  local
754       assert(TargetRegisterInfo::isVirtualRegister(Intf->reg) &&  in canEvictInterference()
757       if (getStage(*Intf) == RS_Done)  in canEvictInterference()
766         (Intf->isSpillable() ||  in canEvictInterference()
768          RegClassInfo.getNumAllocatableRegs(MRI->getRegClass(Intf->reg)));  in canEvictInterference()
770       unsigned IntfCascade = ExtraRegInfo[Intf->reg].Cascade;  in canEvictInterference()
779       bool BreaksHint = VRM->hasPreferredPhys(Intf->reg);  in canEvictInterference()
782       Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight);  in canEvictInterference()
789       if (!shouldEvict(VirtReg, IsHint, *Intf, BreaksHint))  in canEvictInterference()
794       if (!MaxCost.isMax() && IsLocal && LIS->intervalIsInOneMBB(*Intf) &&  in canEvictInterference()
795           (!EnableLocalReassign || !canReassign(*Intf, PhysReg))) {  in canEvictInterference()
830     LiveInterval *Intf = Intfs[i];  in evictInterference()  local
832     if (!VRM->hasPhys(Intf->reg))  in evictInterference()
834     Matrix->unassign(*Intf);  in evictInterference()
835     assert((ExtraRegInfo[Intf->reg].Cascade < Cascade ||  in evictInterference()
836             VirtReg.isSpillable() < Intf->isSpillable()) &&  in evictInterference()
838     ExtraRegInfo[Intf->reg].Cascade = Cascade;  in evictInterference()
840     NewVRegs.push_back(Intf->reg);  in evictInterference()
934 bool RAGreedy::addSplitConstraints(InterferenceCache::Cursor Intf,  in addSplitConstraints()  argument
946     Intf.moveToBlock(BC.Number);  in addSplitConstraints()
951     if (!Intf.hasInterference())  in addSplitConstraints()
959       if (Intf.first() <= Indexes->getMBBStartIdx(BC.Number)) {  in addSplitConstraints()
962       } else if (Intf.first() < BI.FirstInstr) {  in addSplitConstraints()
965       } else if (Intf.first() < BI.LastInstr) {  in addSplitConstraints()
972       if (Intf.last() >= SA->getLastSplitPoint(BC.Number)) {  in addSplitConstraints()
975       } else if (Intf.last() > BI.LastInstr) {  in addSplitConstraints()
978       } else if (Intf.last() > BI.FirstInstr) {  in addSplitConstraints()
998 void RAGreedy::addThroughConstraints(InterferenceCache::Cursor Intf,  in addThroughConstraints()  argument
1007     Intf.moveToBlock(Number);  in addThroughConstraints()
1009     if (!Intf.hasInterference()) {  in addThroughConstraints()
1023     if (Intf.first() <= Indexes->getMBBStartIdx(Number))  in addThroughConstraints()
1029     if (Intf.last() >= SA->getLastSplitPoint(Number))  in addThroughConstraints()
1081       addThroughConstraints(Cand.Intf, NewBlocks);  in growRegion()
1117   if (!addSplitConstraints(Cand.Intf, Cost)) {  in calcCompactRegion()
1188       Cand.Intf.moveToBlock(Number);  in calcGlobalSplitCost()
1189       if (Cand.Intf.hasInterference()) {  in calcGlobalSplitCost()
1239         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1240         IntfIn = Cand.Intf.first();  in splitAroundRegion()
1248         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1249         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1288         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1289         IntfIn = Cand.Intf.first();  in splitAroundRegion()
1296         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1297         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1421     if (!addSplitConstraints(Cand.Intf, Cost)) {  in calculateRegionSplitCost()
2025       LiveInterval *Intf = Q.interferingVRegs()[i - 1];  in mayRecolorAllInterferences()  local
2028       if ((getStage(*Intf) == RS_Done &&  in mayRecolorAllInterferences()
2029            MRI->getRegClass(Intf->reg) == CurRC) ||  in mayRecolorAllInterferences()
2030           FixedRegisters.count(Intf->reg)) {  in mayRecolorAllInterferences()
2034       RecoloringCandidates.insert(Intf);  in mayRecolorAllInterferences()