Home
last modified time | relevance | path

Searched refs:getEdgeNode2 (Results 1 – 3 of 3) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); in removeSolverEdge()
249 Graph::NodeItr ynItr = g.getEdgeNode2(eItr); in applyR1()
405 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); in addSolverEdge()
455 Graph::NodeItr otherNodeItr = g.getEdgeNode2(eItr); in disconnectTrivialNodes()
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr)); in tryNormaliseEdgeMatrix()
572 Graph::NodeItr adjNode(g.getEdgeNode2(eItr)); in computeSolution()
DGraph.h289 NodeItr getEdgeNode2(EdgeItr eItr) { in getEdgeNode2() function
314 (getEdgeNode2(*aeItr) == n2Itr)) { in findEdge()
373 << " -- node" << getEdgeNode2(edgeItr) in printDot()
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
DBriggs.h187 n2Itr = g.getEdgeNode2(eItr); in preUpdateEdgeCosts()
194 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr)); in preUpdateEdgeCosts()
217 n2Itr = g.getEdgeNode2(eItr); in handleAddEdge()