Home
last modified time | relevance | path

Searched refs:xnItr (Results 1 – 2 of 2) sorted by relevance

/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h237 void applyR1(Graph::NodeItr xnItr) { in applyR1() argument
238 NodeData &nd = getSolverNodeData(xnItr); in applyR1()
245 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR1()
248 if (xnItr == g.getEdgeNode1(eItr)) { in applyR1()
278 pushToStack(xnItr); in applyR1()
286 void applyR2(Graph::NodeItr xnItr) { in applyR2() argument
287 assert(getSolverNodeData(xnItr).getSolverDegree() == 2 && in applyR2()
290 NodeData &nd = getSolverNodeData(xnItr); in applyR2()
291 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR2()
297 Graph::NodeItr ynItr = g.getEdgeOtherNode(yxeItr, xnItr), in applyR2()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
DBriggs.h439 void handleRemoveNode(Graph::NodeItr xnItr) { in handleRemoveNode() argument
442 for (SolverEdgeItr aeItr = getSolver().solverEdgesBegin(xnItr), in handleRemoveNode()
443 aeEnd = getSolver().solverEdgesEnd(xnItr); in handleRemoveNode()
445 Graph::NodeItr ynItr = getGraph().getEdgeOtherNode(*aeItr, xnItr); in handleRemoveNode()