HomeSort by relevance Sort by last modified time
    Searched refs:N1Id (Results 1 - 3 of 3) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
107 NIds[0] = N1Id;
411 /// @param N1Id First node.
416 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
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,
443 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() &&
447 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs))
    [all...]
  /external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 390 NodeId N1Id = G.getEdgeNode1Id(EId);
392 NodeMetadata& N1Md = G.getNodeMetadata(N1Id);
394 bool Transpose = N1Id != G.getEdgeNode1Id(EId);
409 promote(N1Id, N1Md);
546 bool operator()(NodeId N1Id, NodeId N2Id) {
547 PBQPNum N1SC = G.getNodeCosts(N1Id)[0];
550 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id);
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 444 PBQPRAGraph::NodeId N1Id = G.getMetadata().getNodeIdForVReg(DstReg);
447 &G.getNodeMetadata(N1Id).getAllowedRegs();
451 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id);
456 G.addEdge(N1Id, N2Id, std::move(Costs));
459 std::swap(N1Id, N2Id);
830 NodeId N1Id = getEdgeNode1Id(EId);
832 assert(N1Id != N2Id && "PBQP graphs should not have self-edges.");
836 OS << PrintNodeInfo(N1Id, *this) << ' ' << M.getRows() << " rows / ";

Completed in 810 milliseconds