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

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr));
249 Graph::NodeItr ynItr = g.getEdgeNode2(eItr);
405 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr));
455 Graph::NodeItr otherNodeItr = g.getEdgeNode2(eItr);
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr));
572 Graph::NodeItr adjNode(g.getEdgeNode2(eItr));
Graph.h 289 NodeItr getEdgeNode2(EdgeItr eItr) {
314 (getEdgeNode2(*aeItr) == n2Itr)) {
373 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr));
410 << " -- node" << getEdgeNode2(edgeItr)
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 187 n2Itr = g.getEdgeNode2(eItr);
194 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr));
217 n2Itr = g.getEdgeNode2(eItr);

Completed in 461 milliseconds