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

  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
52 if (s->getSolverDegree(n1Itr) > s->getSolverDegree(n2Itr))
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const {
66 const PBQP::Vector &cv2 = g->getNodeCosts(n2Itr);
69 PBQPNum cost2 = cv2[0] / s->getSolverDegree(n2Itr);
187 n2Itr = g.getEdgeNode2(eItr);
189 &n2 = getHeuristicNodeData(n2Itr);
217 n2Itr = g.getEdgeNode2(eItr);
219 &n2 = getHeuristicNodeData(n2Itr);
244 addEdgeContributions(eItr, n2Itr);
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 174 /// @param n2Itr Second node.
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr,
179 getNodeCosts(n2Itr).getLength() == costs.getCols() &&
181 return addConstructedEdge(EdgeEntry(n1Itr, n2Itr, costs));
307 /// @param n2Itr Second node iterator.
308 /// @return An iterator for edge (n1Itr, n2Itr) if such an edge exists,
310 EdgeItr findEdge(NodeItr n1Itr, NodeItr n2Itr) {
313 if ((getEdgeNode1(*aeItr) == n2Itr) ||
314 (getEdgeNode2(*aeItr) == n2Itr)) {

Completed in 17 milliseconds