Lines Matching refs:NId

170     for (auto NId : G.nodeIds()) {  in apply()  local
172 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
177 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
179 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
195 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
198 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
210 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
213 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in setDisjointAllowedRegs()
304 for (auto NId : G.nodeIds()) { in apply() local
305 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in apply()
308 Inactive.push(std::make_tuple(&LI, 0, NId)); in apply()
336 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply() local
342 if (haveDisjointAllowedRegs(G, NId, MId, D)) in apply()
346 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId)); in apply()
351 if (!createInterferenceEdge(G, NId, MId, C)) in apply()
352 setDisjointAllowedRegs(G, NId, MId, D); in apply()
370 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge() argument
375 const auto &NRegs = G.getNodeMetadata(NId).getAllowedRegs(); in createInterferenceEdge()
382 G.addEdgeBypassingCostAllocator(NId, MId, I->second); in createInterferenceEdge()
402 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
436 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
439 G.getNodeMetadata(NId).getAllowedRegs(); in apply()
446 PBQPRAGraph::RawVector NewCosts(G.getNodeCosts(NId)); in apply()
448 G.setNodeCosts(NId, std::move(NewCosts)); in apply()
627 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph() local
628 G.getNodeMetadata(NId).setVReg(VReg); in initializeGraph()
629 G.getNodeMetadata(NId).setAllowedRegs( in initializeGraph()
631 G.getMetadata().setNodeIdForVReg(VReg, NId); in initializeGraph()
680 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc() local
681 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in mapPBQPToRegAlloc()
682 unsigned AllocOption = Solution.getSelection(NId); in mapPBQPToRegAlloc()
685 unsigned PReg = G.getNodeMetadata(NId).getAllowedRegs()[AllocOption - 1]; in mapPBQPToRegAlloc()
829 static Printable PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId, in PrintNodeInfo() argument
831 return Printable([NId, &G](raw_ostream &OS) { in PrintNodeInfo()
834 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in PrintNodeInfo()
836 OS << NId << " (" << RegClassName << ':' << PrintReg(VReg, TRI) << ')'; in PrintNodeInfo()
841 for (auto NId : nodeIds()) { in dump() local
842 const Vector &Costs = getNodeCosts(NId); in dump()
844 OS << PrintNodeInfo(NId, *this) << ": " << Costs << '\n'; in dump()
865 for (auto NId : nodeIds()) { in printDot() local
866 OS << " node" << NId << " [ label=\"" in printDot()
867 << PrintNodeInfo(NId, *this) << "\\n" in printDot()
868 << getNodeCosts(NId) << "\" ]\n"; in printDot()