199     for (auto NId : G.nodeIds()) {  in apply()  local
201           LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight();  in apply()
206       PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId));  in apply()
208       G.setNodeCosts(NId, std::move(NodeCosts));  in apply()
223   bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,  in haveDisjointAllowedRegs()  argument
226     const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();  in haveDisjointAllowedRegs()
238   void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,  in setDisjointAllowedRegs()  argument
241     const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();  in setDisjointAllowedRegs()
332     for (auto NId : G.nodeIds()) {  in apply()  local
333       Register VReg = G.getNodeMetadata(NId).getVReg();  in apply()
336       Inactive.push(std::make_tuple(&LI, 0, NId));  in apply()
364       PBQP::GraphBase::NodeId NId = getNodeId(Cur);  in apply()  local
370         if (haveDisjointAllowedRegs(G, NId, MId, D))  in apply()
374         IEdgeKey EK(std::min(NId, MId), std::max(NId, MId));  in apply()
379         if (!createInterferenceEdge(G, NId, MId, C))  in apply()
380           setDisjointAllowedRegs(G, NId, MId, D);  in apply()
397                               PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId,  in createInterferenceEdge()  argument
401     const auto &NRegs = G.getNodeMetadata(NId).getAllowedRegs();  in createInterferenceEdge()
408       G.addEdgeBypassingCostAllocator(NId, MId, I->second);  in createInterferenceEdge()
428     PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M));  in createInterferenceEdge()
459           PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg);  in apply()  local
462             G.getNodeMetadata(NId).getAllowedRegs();  in apply()
469             PBQPRAGraph::RawVector NewCosts(G.getNodeCosts(NId));  in apply()
471             G.setNodeCosts(NId, std::move(NewCosts));  in apply()
682     PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts));  in initializeGraph()  local
683     G.getNodeMetadata(NId).setVReg(VReg);  in initializeGraph()
684     G.getNodeMetadata(NId).setAllowedRegs(  in initializeGraph()
686     G.getMetadata().setNodeIdForVReg(VReg, NId);  in initializeGraph()
733   for (auto NId : G.nodeIds()) {  in mapPBQPToRegAlloc()  local
734     Register VReg = G.getNodeMetadata(NId).getVReg();  in mapPBQPToRegAlloc()
735     unsigned AllocOpt = Solution.getSelection(NId);  in mapPBQPToRegAlloc()
738       MCRegister PReg = G.getNodeMetadata(NId).getAllowedRegs()[AllocOpt - 1];  in mapPBQPToRegAlloc()
888 static Printable PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId,  in PrintNodeInfo()  argument
890   return Printable([NId, &G](raw_ostream &OS) {  in PrintNodeInfo()
893     Register VReg = G.getNodeMetadata(NId).getVReg();  in PrintNodeInfo()
895     OS << NId << " (" << RegClassName << ':' << printReg(VReg, TRI) << ')';  in PrintNodeInfo()
901   for (auto NId : nodeIds()) {  in dump()  local
902     const Vector &Costs = getNodeCosts(NId);  in dump()
904     OS << PrintNodeInfo(NId, *this) << ": " << Costs << '\n';  in dump()
928   for (auto NId : nodeIds()) {  in printDot()  local
929     OS << "  node" << NId << " [ label=\""  in printDot()
930        << PrintNodeInfo(NId, *this) << "\\n"  in printDot()
931        << getNodeCosts(NId) << "\" ]\n";  in printDot()