Searched refs:N1Id (Results 1 - 3 of 3) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) argument
106 NIds[0] = N1Id;
411 /// @param N1Id First node.
416 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { argument
417 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() &&
422 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts));
429 /// @param N1Id First node.
441 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, argument
443 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() &&
447 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2I
580 findEdge(NodeId N1Id, NodeId N2Id) argument
[all...]
/external/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h391 NodeId N1Id = G.getEdgeNode1Id(EId); local
393 NodeMetadata& N1Md = G.getNodeMetadata(N1Id);
395 bool Transpose = N1Id != G.getEdgeNode1Id(EId);
410 promote(N1Id, N1Md);
547 bool operator()(NodeId N1Id, NodeId N2Id) { argument
548 PBQPNum N1SC = G.getNodeCosts(N1Id)[0];
551 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id);
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp451 PBQPRAGraph::NodeId N1Id = G.getMetadata().getNodeIdForVReg(DstReg); variable
454 &G.getNodeMetadata(N1Id).getAllowedRegs();
458 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id);
463 G.addEdge(N1Id, N2Id, std::move(Costs));
466 std::swap(N1Id, N2Id);
849 NodeId N1Id = getEdgeNode1Id(EId);
851 assert(N1Id != N2Id && "PBQP graphs should not have self-edges.");
855 OS << PrintNodeInfo(N1Id, *this) << ' ' << M.getRows() << " rows / ";

Completed in 107 milliseconds