reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
254 segments.push_back(Segment(S.start, S.end, valnos[S.valno->id])); 317 return VNI && VNI->id < getNumValNums() && VNI == getValNumInfo(VNI->id); 317 return VNI && VNI->id < getNumValNums() && VNI == getValNumInfo(VNI->id); 979 unsigned getEqClass(const VNInfo *VNI) const { return EqClass[VNI->id]; }lib/CodeGen/InlineSpiller.cpp
394 LLVM_DEBUG(dbgs() << "\tmerged orig valno " << OrigVNI->id << ": " 435 LLVM_DEBUG(dbgs() << "Checking redundant spills for " << VNI->id << '@' 1476 dbgs() << "\nFor Slot" << Slot << " and VN" << OrigVNI->id << ":\n"lib/CodeGen/LiveDebugVariables.cpp
821 << DstVNI->id << " in " << *DstLI << '\n');
lib/CodeGen/LiveInterval.cpp520 if (ValNo->id == getNumValNums()-1) { 539 VNI->id = (unsigned)valnos.size(); 666 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]]; 668 VNInfo* nextValNo = NewVNInfo[LHSValNoAssignments[I->valno->id]]; 696 S.valno = NewVNInfo[RHSValNoAssignments[S.valno->id]]; 708 VNI->id = NumValNos++; // Renumber val#. 758 if (V1->id < V2->id) { 758 if (V1->id < V2->id) { 992 return OS << '[' << S.start << ',' << S.end << ':' << S.valno->id << ')'; 1007 assert(S.valno == getValNumInfo(S.valno->id) && "Bad VNInfo"); 1066 assert(I->valno->id < valnos.size()); 1067 assert(I->valno == valnos[I->valno->id]); 1321 EqClass.join(unused->id, VNI->id); 1321 EqClass.join(unused->id, VNI->id); 1333 EqClass.join(VNI->id, PVNI->id); 1333 EqClass.join(VNI->id, PVNI->id); 1340 EqClass.join(VNI->id, UVNI->id); 1340 EqClass.join(VNI->id, UVNI->id); 1346 EqClass.join(used->id, unused->id); 1346 EqClass.join(used->id, unused->id);lib/CodeGen/LiveIntervals.cpp
338 LLVM_DEBUG(dbgs() << ' ' << printRegUnit(Unit, TRI) << '#' << VNI->id);
lib/CodeGen/LiveRangeUtils.h30 while (J != E && VNIClasses[J->valno->id] == 0) 33 if (unsigned eq = VNIClasses[I->valno->id]) { 49 VNI->id = SplitLRs[eq-1]->getNumValNums(); 52 VNI->id = j;lib/CodeGen/MachineVerifier.cpp
539 errs() << "- ValNo: " << VNI.id << " (def " << VNI.def << ")\n"; 2464 if (VNI->id >= LR.getNumValNums() || VNI != LR.getValNumInfo(VNI->id)) { 2464 if (VNI->id >= LR.getNumValNums() || VNI != LR.getValNumInfo(VNI->id)) { 2659 errs() << "Valno #" << PVNI->id << " live out of " 2661 << VNI->id << " live into " << printMBBReference(*MFI) << '@' 2719 errs() << ' ' << (*I)->id;lib/CodeGen/RegisterCoalescer.cpp
2532 computeAssignment(V.RedefVNI->id, Other); 2533 V.ValidLanes |= Vals[V.RedefVNI->id].ValidLanes; 2563 Other.computeAssignment(OtherVNI->id, *this); 2571 Val &OtherV = Other.Vals[OtherVNI->id]; 2597 Other.computeAssignment(V.OtherVNI->id, *this); 2598 Val &OtherV = Other.Vals[V.OtherVNI->id]; 2733 assert(Other.Vals[V.OtherVNI->id].isAnalyzed() && "Missing recursion"); 2734 Assignments[ValNo] = Other.Assignments[V.OtherVNI->id]; 2737 << printReg(Other.Reg) << ':' << V.OtherVNI->id << '@' 2745 Val &OtherV = Other.Vals[V.OtherVNI->id]; 2799 << OtherI->valno->id << '@' << OtherI->start << '\n'); 2803 << OtherI->valno->id << '@' << OtherI->start << " to " 2815 const Val &OV = Other.Vals[OtherI->valno->id]; 2853 const Val &OtherV = Other.Vals[V.OtherVNI->id]; 2915 V.Pruned = Other.isPrunedValue(V.OtherVNI->id, *this); 2934 Val &OtherV = Other.Vals[Vals[i].OtherVNI->id];lib/CodeGen/SplitKit.cpp
472 Values.insert(std::make_pair(std::make_pair(RegIdx, ParentVNI->id), FP)); 494 ValueForcePair &VFP = Values[std::make_pair(RegIdx, ParentVNI.id)]; 701 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n'); 718 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n'); 738 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id); 769 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n'); 800 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n'); 959 EqualVNs[ParentVNI->id].insert(VNI); 966 if (!NotToHoistSet.count(ParentVNI->id)) 968 SmallPtrSetIterator<VNInfo *> It1 = EqualVNs[ParentVNI->id].begin(); 970 for (; It1 != EqualVNs[ParentVNI->id].end(); ++It1) { 972 for (++It2; It2 != EqualVNs[ParentVNI->id].end(); ++It2) { 1032 DomPair &Dom = NearestDom[ParentVNI->id]; 1044 if (Values.lookup(std::make_pair(0, ParentVNI->id)).getPointer()) { 1066 Costs[ParentVNI->id] += MBFI.getBlockFreq(ValMBB); 1069 LLVM_DEBUG(dbgs() << "Multi-mapped complement " << VNI->id << '@' 1070 << VNI->def << " for parent " << ParentVNI->id << '@' 1087 MBFI.getBlockFreq(Dom.first) > Costs[ParentVNI->id]) { 1088 NotToHoistSet.insert(ParentVNI->id); 1104 const DomPair &Dom = NearestDom[ParentVNI->id]; 1106 NotToHoistSet.count(ParentVNI->id)) 1153 ValueForcePair VFP = Values.lookup(std::make_pair(RegIdx, ParentVNI->id)); 1155 LLVM_DEBUG(dbgs() << ':' << VNI->id); 1182 LLVM_DEBUG(dbgs() << ':' << VNI->id << "*" << printMBBReference(*MBB));