Searched defs:NId (Results 1 - 3 of 3) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h28 void applyR1(GraphT &G, typename GraphT::NodeId NId) { argument
35 assert(G.getNodeDegree(NId) == 1 &&
38 EdgeId EId = *G.adjEdgeIds(NId).begin();
39 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
42 const Vector &XCosts = G.getNodeCosts(NId);
46 if (NId == G.getEdgeNode1Id(EId)) {
72 void applyR2(GraphT &G, typename GraphT::NodeId NId) { argument
79 assert(G.getNodeDegree(NId) == 2 &&
82 const Vector &XCosts = G.getNodeCosts(NId);
84 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId)
167 NodeId NId = stack.back(); local
[all...]
H A DRegAllocSolver.h161 void handleAddNode(NodeId NId) { argument
162 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
164 void handleRemoveNode(NodeId NId) {} argument
165 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} argument
177 void handleDisconnectEdge(EdgeId EId, NodeId NId) { argument
178 NodeMetadata& NMd = G.getNodeMetadata(NId);
180 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId));
181 if (G.getNodeDegree(NId) == 3) {
183 moveToOptimallyReducibleNodes(NId);
192 handleReconnectEdge(EdgeId EId, NodeId NId) argument
212 removeFromCurrentSet(NodeId NId) argument
236 moveToOptimallyReducibleNodes(NodeId NId) argument
243 moveToConservativelyAllocatableNodes(NodeId NId) argument
250 moveToNotProvablyAllocatableNodes(NodeId NId) argument
285 NodeId NId = *NItr; local
307 NodeId NId = *NItr; local
317 NodeId NId = *NItr; local
[all...]
H A DGraph.h124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { argument
125 if (NId == NIds[0])
128 assert(NId == NIds[1] && "Edge does not connect NId.");
138 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { argument
139 if (NId == NIds[0])
142 assert(NId == NIds[1] && "Edge not connected to NId");
155 void disconnectFrom(Graph &G, NodeId NId) { argument
156 if (NId
190 getNode(NodeId NId) argument
197 NodeId NId = 0; local
360 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts)); local
389 adjEdgeIds(NodeId NId) argument
403 setNodeCosts(NodeId NId, OtherVectorT Costs) argument
417 getNodeMetadata(NodeId NId) argument
445 getEdgeMetadata(EdgeId NId) argument
471 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
496 removeNode(NodeId NId) argument
536 disconnectEdge(EdgeId EId, NodeId NId) argument
546 disconnectAllNeighborsFromNode(NodeId NId) argument
555 reconnectEdge(EdgeId EId, NodeId NId) argument
[all...]

Completed in 295 milliseconds