Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo() argument
128 if (NId == NIds[0]) in connectTo()
131 assert(NId == NIds[1] && "Edge does not connect NId."); in connectTo()
141 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx() argument
142 if (NId == NIds[0]) in setAdjEdgeIdx()
145 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
158 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom() argument
159 if (NId == NIds[0]) in disconnectFrom()
162 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
194 NodeEntry &getNode(NodeId NId) { in getNode() argument
[all …]
DReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
36 assert(G.getNodeDegree(NId) == 1 && in applyR1()
39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
43 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
47 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2() argument
80 assert(G.getNodeDegree(NId) == 2 && in applyR2()
83 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin(); in applyR2()
[all …]
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg() argument
155 VRegToNodeId[VReg] = NId; in setNodeIdForVReg()
358 void handleAddNode(NodeId NId) { in handleAddNode() argument
359 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
361 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
363 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
364 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
377 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
379 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
[all …]
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp163 for (auto NId : G.nodeIds()) { in apply() local
165 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
170 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
172 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
188 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
191 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
203 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
206 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in setDisjointAllowedRegs()
297 for (auto NId : G.nodeIds()) { in apply() local
298 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in apply()
[all …]