Searched refs:NId (Results 1 - 4 of 4) sorted by relevance

/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { argument
128 if (NId == NIds[0])
131 assert(NId == NIds[1] && "Edge does not connect NId.");
141 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { argument
142 if (NId == NIds[0])
145 assert(NId == NIds[1] && "Edge not connected to NId");
158 void disconnectFrom(Graph &G, NodeId NId) { argument
159 if (NId
194 getNode(NodeId NId) argument
385 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); local
404 NodeId NId = addConstructedNode(NodeEntry(Costs)); local
459 adjEdgeIds(NodeId NId) argument
473 setNodeCosts(NodeId NId, OtherVectorT Costs) argument
499 getNodeMetadata(NodeId NId) argument
567 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
592 removeNode(NodeId NId) argument
632 disconnectEdge(EdgeId EId, NodeId NId) argument
642 disconnectAllNeighborsFromNode(NodeId NId) argument
651 reconnectEdge(EdgeId EId, NodeId NId) argument
[all...]
H A DReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { argument
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) { argument
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId)
187 NodeId NId = stack.back(); local
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { argument
155 VRegToNodeId[VReg] = NId;
358 void handleAddNode(NodeId NId) { argument
359 assert(G.getNodeCosts(NId).getLength() > 1 &&
361 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
363 void handleRemoveNode(NodeId NId) {} argument
364 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} argument
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { argument
377 NodeMetadata& NMd = G.getNodeMetadata(NId);
383 handleReconnectEdge(EdgeId EId, NodeId NId) argument
415 promote(NodeId NId, NodeMetadata& NMd) argument
427 removeFromCurrentSet(NodeId NId) argument
451 moveToOptimallyReducibleNodes(NodeId NId) argument
458 moveToConservativelyAllocatableNodes(NodeId NId) argument
465 moveToNotProvablyAllocatableNodes(NodeId NId) argument
500 NodeId NId = *NItr; local
522 NodeId NId = *NItr; local
532 NodeId NId = *NItr; local
[all...]
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp163 for (auto NId : G.nodeIds()) {
165 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight;
170 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId));
172 G.setNodeCosts(NId, std::move(NodeCosts));
188 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, argument
191 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();
203 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, argument
206 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();
297 for (auto NId : G.nodeIds()) {
298 unsigned VReg = G.getNodeMetadata(NId)
329 PBQP::GraphBase::NodeId NId = getNodeId(Cur); variable
362 createInterferenceEdge(PBQPRAGraph &G, PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, IMatrixCache &C) argument
429 PBQPRAGraph::NodeId NId = G.getMetadata().getNodeIdForVReg(SrcReg); variable
620 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); local
810 PrintNodeInfo(PBQP::RegAlloc::PBQPRAGraph::NodeId NId, const PBQP::RegAlloc::PBQPRAGraph &G) argument
[all...]

Completed in 54 milliseconds