Searched defs:NId (Results 1 – 4 of 4) sorted by relevance
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
180 NodeEntry &getNode(NodeId NId) { in getNode()
184 const NodeEntry &getNode(NodeId NId) const { in getNode()
193 NodeId NId = 0; in addConstructedNode() local
249 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
359 for (auto NId : nodeIds()) in setSolver() local
378 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); in addNode() local
397 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator() local
452 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); } in adjEdgeIds()
[all …]
|
| H A D | ReductionRules.h | 30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
188 NodeId NId = stack.back(); in backpropagate() local
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RegAllocPBQP.h | 148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) { in setNodeIdForVReg() argument
301 void handleAddNode(NodeId NId) { in handleAddNode() argument
307 void handleRemoveNode(NodeId NId) {} in handleRemoveNode() argument
308 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts() argument
315 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
322 handleReconnectEdge(EdgeId EId,NodeId NId) handleReconnectEdge() argument
353 promote(NodeId NId,NodeMetadata & NMd) promote() argument
365 removeFromCurrentSet(NodeId NId) removeFromCurrentSet() argument
389 moveToOptimallyReducibleNodes(NodeId NId) moveToOptimallyReducibleNodes() argument
396 moveToConservativelyAllocatableNodes(NodeId NId) moveToConservativelyAllocatableNodes() argument
403 moveToNotProvablyAllocatableNodes(NodeId NId) moveToNotProvablyAllocatableNodes() argument
412 for (auto NId : G.nodeIds()) { setup() local
438 NodeId NId = *NItr; reduce() local
460 NodeId NId = *NItr; reduce() local
469 NodeId NId = *NItr; reduce() local
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 199 for (auto NId : G.nodeIds()) { in apply() local
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs() argument
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs() argument
332 for (auto NId : G.nodeIds()) { in apply() local
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur); apply() local
397 createInterferenceEdge(PBQPRAGraph & G,PBQPRAGraph::NodeId NId,PBQPRAGraph::NodeId MId,IMatrixCache & C) createInterferenceEdge() argument
459 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); apply() local
682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); initializeGraph() local
733 for (auto NId : G.nodeIds()) { mapPBQPToRegAlloc() local
888 PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId,const PBQP::RegAlloc::PBQPRAGraph & G) PrintNodeInfo() argument
901 for (auto NId : nodeIds()) { dump() local
928 for (auto NId : nodeIds()) { printDot() local
[all...] |