Searched defs:xnItr (Results 1 - 2 of 2) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h445 void handleRemoveNode(Graph::NodeItr xnItr) { argument
448 for (SolverEdgeItr aeItr = getSolver().solverEdgesBegin(xnItr),
449 aeEnd = getSolver().solverEdgesEnd(xnItr);
451 Graph::NodeItr ynItr = getGraph().getEdgeOtherNode(*aeItr, xnItr);
/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h234 /// @param xnItr Node iterator for node to apply R1 to.
237 void applyR1(Graph::NodeItr xnItr) { argument
238 NodeData &nd = getSolverNodeData(xnItr);
245 const Vector &xCosts = g.getNodeCosts(xnItr);
248 if (xnItr == g.getEdgeNode1(eItr)) {
278 pushToStack(xnItr);
283 /// @param xnItr Node iterator for node to apply R2 to.
286 void applyR2(Graph::NodeItr xnItr) { argument
287 assert(getSolverNodeData(xnItr).getSolverDegree() == 2 &&
290 NodeData &nd = getSolverNodeData(xnItr);
[all...]

Completed in 101 milliseconds