190     InterferenceCache::Cursor Intf;  member
199       Intf.setPhysReg(Cache, Reg);  in reset()
543       LiveInterval *Intf = Q.interferingVRegs()[i - 1];  in canEvictInterference()  local
544       if (TargetRegisterInfo::isPhysicalRegister(Intf->reg))  in canEvictInterference()
547       if (getStage(*Intf) == RS_Done)  in canEvictInterference()
552       bool Urgent = !VirtReg.isSpillable() && Intf->isSpillable();  in canEvictInterference()
554       unsigned IntfCascade = ExtraRegInfo[Intf->reg].Cascade;  in canEvictInterference()
563       bool BreaksHint = VRM->hasPreferredPhys(Intf->reg);  in canEvictInterference()
566       Cost.MaxWeight = std::max(Cost.MaxWeight, Intf->weight);  in canEvictInterference()
571       if (!Urgent && !shouldEvict(VirtReg, IsHint, *Intf, BreaksHint))  in canEvictInterference()
597       LiveInterval *Intf = Q.interferingVRegs()[i];  in evictInterference()  local
598       unassign(*Intf, VRM->getPhys(Intf->reg));  in evictInterference()
599       assert((ExtraRegInfo[Intf->reg].Cascade < Cascade ||  in evictInterference()
600               VirtReg.isSpillable() < Intf->isSpillable()) &&  in evictInterference()
602       ExtraRegInfo[Intf->reg].Cascade = Cascade;  in evictInterference()
604       NewVRegs.push_back(Intf);  in evictInterference()
672 bool RAGreedy::addSplitConstraints(InterferenceCache::Cursor Intf,  in addSplitConstraints()  argument
684     Intf.moveToBlock(BC.Number);  in addSplitConstraints()
689     if (!Intf.hasInterference())  in addSplitConstraints()
697       if (Intf.first() <= Indexes->getMBBStartIdx(BC.Number))  in addSplitConstraints()
699       else if (Intf.first() < BI.FirstInstr)  in addSplitConstraints()
701       else if (Intf.first() < BI.LastInstr)  in addSplitConstraints()
707       if (Intf.last() >= SA->getLastSplitPoint(BC.Number))  in addSplitConstraints()
709       else if (Intf.last() > BI.LastInstr)  in addSplitConstraints()
711       else if (Intf.last() > BI.FirstInstr)  in addSplitConstraints()
730 void RAGreedy::addThroughConstraints(InterferenceCache::Cursor Intf,  in addThroughConstraints()  argument
739     Intf.moveToBlock(Number);  in addThroughConstraints()
741     if (!Intf.hasInterference()) {  in addThroughConstraints()
755     if (Intf.first() <= Indexes->getMBBStartIdx(Number))  in addThroughConstraints()
761     if (Intf.last() >= SA->getLastSplitPoint(Number))  in addThroughConstraints()
815       addThroughConstraints(Cand.Intf, NewBlocks);  in growRegion()
851   if (!addSplitConstraints(Cand.Intf, Cost)) {  in calcCompactRegion()
922       Cand.Intf.moveToBlock(Number);  in calcGlobalSplitCost()
923       if (Cand.Intf.hasInterference())  in calcGlobalSplitCost()
971         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
972         IntfIn = Cand.Intf.first();  in splitAroundRegion()
980         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
981         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1020         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1021         IntfIn = Cand.Intf.first();  in splitAroundRegion()
1028         Cand.Intf.moveToBlock(Number);  in splitAroundRegion()
1029         IntfOut = Cand.Intf.last();  in splitAroundRegion()
1130     if (!addSplitConstraints(Cand.Intf, Cost)) {  in tryRegionSplit()