Home
last modified time | relevance | path

Searched defs:NId (Results 1 – 4 of 4) sorted by relevance

/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
180 NodeEntry &getNode(NodeId NId) { in getNode()
184 const NodeEntry &getNode(NodeId NId) const { in getNode()
193 NodeId NId = 0; in addConstructedNode() local
249 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
359 for (auto NId : nodeIds()) in setSolver() local
378 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); in addNode() local
397 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator() local
452 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); } in adjEdgeIds()
[all …]
H A DReductionRules.h30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
188 NodeId NId = stack.back(); in backpropagate() local
/llvm-project/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
301 void handleAddNode(NodeId NId) { in handleAddNode()
307 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
308 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
315 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
322 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
353 void promote(NodeId NId, NodeMetadata& NMd) { in promote()
365 void removeFromCurrentSet(NodeId NId) { in removeFromCurrentSet()
389 void moveToOptimallyReducibleNodes(NodeId NId) { in moveToOptimallyReducibleNodes()
396 void moveToConservativelyAllocatableNodes(NodeId NId) { in moveToConservativelyAllocatableNodes()
[all …]
/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp332 Register VReg = G.getNodeMetadata(NId) in apply() local
199 for (auto NId : G.nodeIds()) { apply() local
223 haveDisjointAllowedRegs(const PBQPRAGraph & G,PBQPRAGraph::NodeId NId,PBQPRAGraph::NodeId MId,const DisjointAllowedRegsCache & D) const haveDisjointAllowedRegs() argument
238 setDisjointAllowedRegs(const PBQPRAGraph & G,PBQPRAGraph::NodeId NId,PBQPRAGraph::NodeId MId,DisjointAllowedRegsCache & D) setDisjointAllowedRegs() argument
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur); apply() local
397 createInterferenceEdge(PBQPRAGraph & G,PBQPRAGraph::NodeId NId,PBQPRAGraph::NodeId MId,IMatrixCache & C) createInterferenceEdge() argument
459 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); apply() local
682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); initializeGraph() local
733 for (auto NId : G.nodeIds()) { mapPBQPToRegAlloc() local
888 PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId,const PBQP::RegAlloc::PBQPRAGraph & G) PrintNodeInfo() argument
901 for (auto NId : nodeIds()) { dump() local
928 for (auto NId : nodeIds()) { printDot() local
[all...]