| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo() argument
127 if (NId == NIds[0]) in connectTo()
130 assert(NId == NIds[1] && "Edge does not connect NId."); in connectTo()
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx() argument
141 if (NId == NIds[0]) in setAdjEdgeIdx()
144 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
157 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom() argument
158 if (NId == NIds[0]) in disconnectFrom()
161 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
193 NodeEntry &getNode(NodeId NId) { in getNode() argument
[all …]
|
| D | ReductionRules.h | 29 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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg() argument
148 VRegToNodeId[VReg] = NId; in setNodeIdForVReg()
299 void handleAddNode(NodeId NId) { in handleAddNode() argument
300 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
305 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
314 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
316 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
[all …]
|
| D | SelectionDAGNodes.h | 854 int NId = N->getNodeId();
856 if (NId < -1)
857 NId = -(NId + 1);
863 if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (NId > 0) &&
864 (MId > 0) && (MId < NId)) {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 124 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx() argument
125 if (NId == NIds[0]) in setAdjEdgeIdx()
128 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
141 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom() argument
142 if (NId == NIds[0]) in disconnectFrom()
145 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
181 NodeEntry &getNode(NodeId NId) { in getNode() argument
182 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
183 return Nodes[NId]; in getNode()
185 const NodeEntry &getNode(NodeId NId) const { in getNode() argument
[all …]
|
| D | ReductionRules.h | 31 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
38 assert(G.getNodeDegree(NId) == 1 && in applyR1()
41 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
45 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
49 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2() argument
82 assert(G.getNodeDegree(NId) == 2 && in applyR2()
85 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
87 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin(); in applyR2()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg() argument
156 VRegToNodeId[VReg] = NId; in setNodeIdForVReg()
359 void handleAddNode(NodeId NId) { in handleAddNode() argument
360 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
362 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
364 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
365 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
378 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
380 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 201 for (auto NId : G.nodeIds()) { in apply() local
203 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
208 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
210 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
225 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
228 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
240 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
243 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in setDisjointAllowedRegs()
334 for (auto NId : G.nodeIds()) { in apply() local
335 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in apply()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 170 for (auto NId : G.nodeIds()) { in apply() local
172 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
177 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
179 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
195 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
198 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
210 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
213 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in setDisjointAllowedRegs()
304 for (auto NId : G.nodeIds()) { in apply() local
305 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in apply()
[all …]
|