Searched refs:NId (Results 1 – 5 of 5) sorted by relevance
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg() argument
147 VRegToNodeId[VReg] = NId; in setNodeIdForVReg()
298 void handleAddNode(NodeId NId) { in handleAddNode() argument
299 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
301 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
304 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
305 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
312 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
313 NodeMetadata& NMd = G.getNodeMetadata(NId); in handleDisconnectEdge()
315 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
[all …]
|
| D | SelectionDAGNodes.h | 886 int NId = N->getNodeId();
888 if (NId < -1)
889 NId = -(NId + 1);
895 if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (NId > 0) &&
896 (MId > 0) && (MId < NId)) {
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx() argument
124 if (NId == NIds[0]) in setAdjEdgeIdx()
127 assert(NId == NIds[1] && "Edge not connected to NId"); in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom() argument
141 if (NId == NIds[0]) in disconnectFrom()
144 assert(NId == NIds[1] && "Edge does not connect NId"); in disconnectFrom()
180 NodeEntry &getNode(NodeId NId) { in getNode() argument
181 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
182 return Nodes[NId]; in getNode()
184 const NodeEntry &getNode(NodeId NId) const { in getNode() argument
[all …]
|
| D | ReductionRules.h | 30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1() argument
37 assert(G.getNodeDegree(NId) == 1 && in applyR1()
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2() argument
81 assert(G.getNodeDegree(NId) == 2 && in applyR2()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
86 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin(); in applyR2()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 200 for (auto NId : G.nodeIds()) { in apply() local
202 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight; in apply()
207 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
209 G.setNodeCosts(NId, std::move(NodeCosts)); in apply()
224 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
227 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in haveDisjointAllowedRegs()
239 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
242 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs(); in setDisjointAllowedRegs()
333 for (auto NId : G.nodeIds()) { in apply() local
334 unsigned VReg = G.getNodeMetadata(NId).getVReg(); in apply()
[all …]
|