reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
32 static NodeId invalidNodeId() { 33 return std::numeric_limits<NodeId>::max(); 80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { 103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) 103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) 123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { 140 void disconnectFrom(Graph &G, NodeId NId) { 149 NodeId getN1Id() const { return NIds[0]; } 150 NodeId getN2Id() const { return NIds[1]; } 156 NodeId NIds[2]; 167 using FreeNodeVector = std::vector<NodeId>; 180 NodeEntry &getNode(NodeId NId) { 184 const NodeEntry &getNode(NodeId NId) const { 192 NodeId addConstructedNode(NodeEntry N) { 193 NodeId NId = 0; 233 using value_type = NodeId; 235 using pointer = NodeId *; 236 using reference = NodeId &; 238 NodeItr(NodeId CurNId, const Graph &G) 246 NodeId operator*() const { return CurNId; } 249 NodeId findNextInUse(NodeId NId) const { 249 NodeId findNextInUse(NodeId NId) const { 256 NodeId CurNId, EndNId; 375 NodeId addNode(OtherVectorT Costs) { 378 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); 396 NodeId addNodeBypassingCostAllocator(OtherVectorPtrT Costs) { 397 NodeId NId = addConstructedNode(NodeEntry(Costs)); 409 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { 409 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { 434 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, 434 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, 434 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, 452 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); } 466 void setNodeCosts(NodeId NId, OtherVectorT Costs) { 481 const VectorPtr& getNodeCostsPtr(NodeId NId) const { 488 const Vector& getNodeCosts(NodeId NId) const { 492 NodeMetadata& getNodeMetadata(NodeId NId) { 496 const NodeMetadata& getNodeMetadata(NodeId NId) const { 500 typename NodeEntry::AdjEdgeList::size_type getNodeDegree(NodeId NId) const { 545 NodeId getEdgeNode1Id(EdgeId EId) const { 552 NodeId getEdgeNode2Id(EdgeId EId) const { 560 NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) { 560 NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) { 573 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { 573 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { 585 void removeNode(NodeId NId) { 625 void disconnectEdge(EdgeId EId, NodeId NId) { 635 void disconnectAllNeighborsFromNode(NodeId NId) { 644 void reconnectEdge(EdgeId EId, NodeId NId) {include/llvm/CodeGen/PBQP/ReductionRules.h
30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { 31 using NodeId = typename GraphT::NodeId; 74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { 75 using NodeId = typename GraphT::NodeId; 181 using NodeId = GraphBase::NodeId;include/llvm/CodeGen/PBQP/Solution.h
28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>; 38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { 45 unsigned getSelection(GraphBase::NodeId nodeId) const {include/llvm/CodeGen/RegAllocPBQP.h
146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { 150 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { 162 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId; 278 using NodeId = GraphBase::NodeId; 425 std::vector<GraphBase::NodeId> reduce() { 428 using NodeId = GraphBase::NodeId;lib/CodeGen/RegAllocPBQP.cpp
221 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>; 221 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>; 224 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, 225 PBQPRAGraph::NodeId MId, 239 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, 240 PBQPRAGraph::NodeId MId, 258 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>; 268 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { 365 PBQP::GraphBase::NodeId NId = getNodeId(Cur); 367 PBQP::GraphBase::NodeId MId = getNodeId(A); 398 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, 398 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, 461 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); 476 PBQPRAGraph::NodeId N1Id = G.getMetadata().getNodeIdForVReg(DstReg); 477 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); 668 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); 876 static Printable PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId, 897 NodeId N1Id = getEdgeNode1Id(EId); 898 NodeId N2Id = getEdgeNode2Id(EId);lib/Target/AArch64/AArch64PBQPRegAlloc.cpp
173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); 260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); 273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r);