Searched refs:NId (Results 1 – 5 of 5) sorted by relevance
149 VRegToNodeId[VReg.id()] = NId; in setNodeIdForVReg()304 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()319 promote(NId, NMd); in handleDisconnectEdge()390 removeFromCurrentSet(NId); in moveToOptimallyReducibleNodes()397 removeFromCurrentSet(NId); in moveToConservativelyAllocatableNodes()404 removeFromCurrentSet(NId); in moveToNotProvablyAllocatableNodes()438 NodeId NId = *NItr; in reduce() local445 applyR1(G, NId); in reduce()448 applyR2(G, NId); in reduce()460 NodeId NId = *NItr; in reduce() local[all …]
857 int NId = N->getNodeId();859 if (NId < -1)860 NId = -(NId + 1);866 if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (NId > 0) &&867 (MId > 0) && (MId < NId)) {
124 if (NId == NIds[0]) in setAdjEdgeIdx()182 return Nodes[NId]; in getNode()186 return Nodes[NId]; in getNode()193 NodeId NId = 0; in addConstructedNode() local202 return NId; in addConstructedNode()250 while (NId < EndNId && is_contained(FreeNodeIds, NId)) { in findNextInUse()251 ++NId; in findNextInUse()253 return NId; in findNextInUse()381 return NId; in addNode()400 return NId; in addNodeBypassingCostAllocator()[all …]
37 assert(G.getNodeDegree(NId) == 1 && in applyR1()40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()81 assert(G.getNodeDegree(NId) == 2 && in applyR2()188 NodeId NId = stack.back(); in backpropagate() local191 RawVector v = G.getNodeCosts(NId); in backpropagate()202 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate()204 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()[all …]
199 for (auto NId : G.nodeIds()) { in apply() local332 for (auto NId : G.nodeIds()) { in apply() local374 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId)); in apply()683 G.getNodeMetadata(NId).setVReg(VReg); in initializeGraph()684 G.getNodeMetadata(NId).setAllowedRegs( in initializeGraph()733 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc() local901 for (auto NId : nodeIds()) { in dump() local902 const Vector &Costs = getNodeCosts(NId); in dump()928 for (auto NId : nodeIds()) { in printDot() local929 OS << " node" << NId << " [ label=\"" in printDot()[all …]