Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
157 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
193 NodeEntry &getNode(NodeId NId) { in getNode()
197 const NodeEntry &getNode(NodeId NId) const { in getNode()
206 NodeId NId = 0; in addConstructedNode() local
264 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
365 for (auto NId : nodeIds()) in setSolver() local
384 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); in addNode() local
403 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator() local
[all …]
DReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
187 NodeId NId = stack.back(); in backpropagate() local
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
358 void handleAddNode(NodeId NId) { in handleAddNode()
363 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
364 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
383 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
415 void promote(NodeId NId, NodeMetadata& NMd) { in promote()
427 void removeFromCurrentSet(NodeId NId) { in removeFromCurrentSet()
451 void moveToOptimallyReducibleNodes(NodeId NId) { in moveToOptimallyReducibleNodes()
458 void moveToConservativelyAllocatableNodes(NodeId NId) { in moveToConservativelyAllocatableNodes()
[all …]
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp162 for (auto NId : G.nodeIds()) { in apply() local
187 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
202 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
296 for (auto NId : G.nodeIds()) { in apply() local
328 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply() local
362 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
428 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
619 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph() local
671 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc() local
815 PrintNodeInfo(NodeId NId, const Graph &G) : G(G), NId(NId) {} in PrintNodeInfo()
[all …]