| /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()
141 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
181 NodeEntry &getNode(NodeId NId) { in getNode()
185 const NodeEntry &getNode(NodeId NId) const { in getNode()
194 NodeId NId = 0; in addConstructedNode() local
250 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
360 for (auto NId : nodeIds()) in setSolver() local
379 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); in addNode() local
398 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator() local
453 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); } in adjEdgeIds()
[all …]
|
| D | ReductionRules.h | 31 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
189 NodeId NId = stack.back(); in backpropagate() local
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 126 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()
366 for (auto NId : nodeIds()) in setSolver() local
385 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); in addNode() local
404 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator() local
[all …]
|
| D | ReductionRules.h | 29 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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
299 void handleAddNode(NodeId NId) { in handleAddNode()
305 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
320 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
351 void promote(NodeId NId, NodeMetadata& NMd) { in promote()
363 void removeFromCurrentSet(NodeId NId) { in removeFromCurrentSet()
387 void moveToOptimallyReducibleNodes(NodeId NId) { in moveToOptimallyReducibleNodes()
394 void moveToConservativelyAllocatableNodes(NodeId NId) { in moveToConservativelyAllocatableNodes()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
359 void handleAddNode(NodeId NId) { in handleAddNode()
364 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
365 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
384 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
416 void promote(NodeId NId, NodeMetadata& NMd) { in promote()
428 void removeFromCurrentSet(NodeId NId) { in removeFromCurrentSet()
452 void moveToOptimallyReducibleNodes(NodeId NId) { in moveToOptimallyReducibleNodes()
459 void moveToConservativelyAllocatableNodes(NodeId NId) { in moveToConservativelyAllocatableNodes()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 201 for (auto NId : G.nodeIds()) { in apply() local
225 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
240 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
334 for (auto NId : G.nodeIds()) { in apply() local
366 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply() local
399 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
462 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
669 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph() local
721 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc() local
877 static Printable PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId, in PrintNodeInfo()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 170 for (auto NId : G.nodeIds()) { in apply() local
195 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
210 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
304 for (auto NId : G.nodeIds()) { in apply() local
336 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply() local
370 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
436 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
627 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph() local
680 for (auto NId : G.nodeIds()) { in mapPBQPToRegAlloc() local
829 static Printable PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId, in PrintNodeInfo()
[all …]
|