Searched refs:n2Id (Results 1 - 2 of 2) sorted by relevance

/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h50 bool operator()(Graph::NodeId n1Id, Graph::NodeId n2Id) const {
51 if (s->getSolverDegree(n1Id) > s->getSolverDegree(n2Id))
63 bool operator()(Graph::NodeId n1Id, Graph::NodeId n2Id) const {
65 const PBQP::Vector &cv2 = g->getNodeCosts(n2Id);
68 PBQPNum cost2 = cv2[0] / s->getSolverDegree(n2Id);
186 n2Id = g.getEdgeNode2(eId); local
188 &n2 = getHeuristicNodeData(n2Id);
216 n2Id = g.getEdgeNode2(eId); local
218 &n2 = getHeuristicNodeData(n2Id);
243 addEdgeContributions(eId, n2Id);
[all...]
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h219 /// @param n2Id Second node.
221 EdgeId addEdge(NodeId n1Id, NodeId n2Id, const Matrix &costs) { argument
223 getNodeCosts(n2Id).getLength() == costs.getCols() &&
225 return addConstructedEdge(EdgeEntry(n1Id, n2Id, costs));
349 /// @param n2Id Second node id.
350 /// @return An id for edge (n1Id, n2Id) if such an edge exists,
352 EdgeId findEdge(NodeId n1Id, NodeId n2Id) { argument
355 if ((getEdgeNode1(*aeItr) == n2Id) ||
356 (getEdgeNode2(*aeItr) == n2Id)) {

Completed in 42 milliseconds