Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DRegAllocSolver.h161 void handleAddNode(NodeId NId) { in handleAddNode() argument
162 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
164 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
165 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
177 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
178 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
180 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
181 if (G.getNodeDegree(NId) == 3) { in handleDisconnectEdge()
183 moveToOptimallyReducibleNodes(NId); in handleDisconnectEdge()
188 moveToConservativelyAllocatableNodes(NId); in handleDisconnectEdge()
[all …]
DGraph.h124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo() argument
125 if (NId == NIds[0]) in connectTo()
128 assert(NId == NIds[1] && "Edge does not connect NId."); in connectTo()
138 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx() argument
139 if (NId == NIds[0]) in setAdjEdgeIdx()
142 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
155 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom() argument
156 if (NId == NIds[0]) in disconnectFrom()
159 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
190 NodeEntry& getNode(NodeId NId) { return Nodes[NId]; } in getNode() argument
[all …]
DReductionRules.h28 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
35 assert(G.getNodeDegree(NId) == 1 && in applyR1()
38 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
39 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
42 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
46 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
72 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2() argument
79 assert(G.getNodeDegree(NId) == 2 && in applyR2()
82 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
84 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin(); in applyR2()
[all …]
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp471 for (auto NId : g.nodeIds()) { in mapPBQPToRegAlloc() local
472 unsigned vreg = problem.getVRegForNode(NId); in mapPBQPToRegAlloc()
473 unsigned alloc = solution.getSelection(NId); in mapPBQPToRegAlloc()