Searched refs:nItr (Results 1 - 5 of 5) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h66 void addToOptimalReductionList(Graph::NodeItr nItr) { argument
67 optimalList.insert(optimalList.end(), nItr);
108 bool shouldOptimallyReduce(Graph::NodeItr nItr) { argument
109 if (g.getNodeDegree(nItr) < 3)
116 /// @return nItr Node iterator to be added.
121 void addToOptimalReduceList(Graph::NodeItr nItr) { argument
122 optimalList.push_back(nItr);
133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd();
134 nItr != nEnd; ++nItr) {
188 addToHeuristicList(Graph::NodeItr nItr) argument
225 handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument
[all...]
H A DSolution.h75 /// @param nItr Node iterator.
76 /// @param selection Selection for nItr.
77 void setSelection(Graph::NodeItr nItr, unsigned selection) { argument
78 selections[nItr] = selection;
82 /// @param nItr Node iterator.
83 /// @return The selection for nItr;
84 unsigned getSelection(Graph::ConstNodeItr nItr) const {
85 SelectionsMap::const_iterator sItr = selections.find(nItr);
H A DGraph.h111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } argument
112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; }
193 /// @param nItr Node iterator.
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } argument
198 /// @param nItr Node iterator.
200 const Vector& getNodeCosts(ConstNodeItr nItr) const {
201 return getNode(nItr)
209 setNodeData(NodeItr nItr, void *data) argument
214 getNodeData(NodeItr nItr) argument
268 adjEdgesBegin(NodeItr nItr) argument
275 adjEdgesEnd(NodeItr nItr) argument
297 getEdgeOtherNode(EdgeItr eItr, NodeItr nItr) argument
323 removeNode(NodeItr nItr) argument
[all...]
H A DHeuristicSolver.h128 /// @param nItr Node iterator.
130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) { argument
131 return getSolverNodeData(nItr).getHeuristicData();
143 /// @param nItr Node iterator.
146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) { argument
147 return getSolverNodeData(nItr).solverEdgesBegin();
152 /// @param nItr Node iterator.
155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) { argument
156 return getSolverNodeData(nItr).solverEdgesEnd();
191 /// @param nItr Nod
192 pushToStack(Graph::NodeItr nItr) argument
200 getSolverDegree(Graph::NodeItr nItr) argument
207 setSolution(const Graph::NodeItr &nItr, unsigned selection) argument
223 applyR0(Graph::NodeItr nItr) argument
394 getSolverNodeData(Graph::NodeItr nItr) argument
557 computeSolution(Graph::NodeItr nItr) argument
[all...]
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h118 /// @param nItr Node iterator to be considered.
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { argument
128 if (getSolver().getSolverDegree(nItr) < 3) {
136 /// @param nItr Node iterator to add to the heuristic reduce list.
137 void addToHeuristicReduceList(Graph::NodeItr nItr) { argument
138 NodeData &nd = getHeuristicNodeData(nItr);
139 initializeNode(nItr);
142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr);
144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr);
163 Graph::NodeItr nItr local
172 Graph::NodeItr nItr = *rnuItr; local
260 handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument
298 getHeuristicNodeData(Graph::NodeItr nItr) argument
356 addEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument
383 subtractEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument
406 updateAllocability(Graph::NodeItr nItr) argument
412 initializeNode(Graph::NodeItr nItr) argument
[all...]

Completed in 106 milliseconds