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

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)),
248 if (xnItr == g.getEdgeNode1(eItr)) {
262 Graph::NodeItr ynItr = g.getEdgeNode1(eItr);
300 bool flipEdge1 = (g.getEdgeNode1(yxeItr) == xnItr),
301 flipEdge2 = (g.getEdgeNode1(zxeItr) == xnItr);
345 if (ynItr == g.getEdgeNode1(yzeItr)) {
404 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)),
454 if (g.getEdgeNode1(eItr) == nItr) {
460 Graph::NodeItr otherNodeItr = g.getEdgeNode1(eItr);
508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr))
    [all...]
Graph.h 282 NodeItr getEdgeNode1(EdgeItr eItr) {
313 if ((getEdgeNode1(*aeItr) == n2Itr) ||
372 os << " node" << getEdgeNode1(edgeItr)
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr),
192 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr));
216 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr),
364 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
391 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 405 if (g.getEdgeNode1(edge) == node2) {

Completed in 34 milliseconds