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

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicBase.h 66 void addToOptimalReductionList(Graph::NodeItr nItr) {
67 optimalList.insert(optimalList.end(), nItr);
108 bool shouldOptimallyReduce(Graph::NodeItr nItr) {
109 if (g.getNodeDegree(nItr) < 3)
116 /// @return nItr Node iterator to be added.
121 void addToOptimalReduceList(Graph::NodeItr nItr) {
122 optimalList.push_back(nItr);
133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd();
134 nItr != nEnd; ++nItr) {
    [all...]
Solution.h 75 /// @param nItr Node iterator.
76 /// @param selection Selection for nItr.
77 void setSelection(Graph::NodeItr nItr, unsigned selection) {
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);
Graph.h 111 NodeEntry& getNode(NodeItr nItr) { return *nItr; }
112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; }
193 /// @param nItr Node iterator.
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); }
198 /// @param nItr Node iterator.
200 const Vector& getNodeCosts(ConstNodeItr nItr) const {
201 return getNode(nItr).getCosts()
    [all...]
HeuristicSolver.h 128 /// @param nItr Node iterator.
130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) {
131 return getSolverNodeData(nItr).getHeuristicData();
143 /// @param nItr Node iterator.
146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) {
147 return getSolverNodeData(nItr).solverEdgesBegin();
152 /// @param nItr Node iterator.
155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) {
156 return getSolverNodeData(nItr).solverEdgesEnd();
191 /// @param nItr Node iterator to add to the reduction stack
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 118 /// @param nItr Node iterator to be considered.
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) {
128 if (getSolver().getSolverDegree(nItr) < 3) {
136 /// @param nItr Node iterator to add to the heuristic reduce list.
137 void addToHeuristicReduceList(Graph::NodeItr nItr) {
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 = *rnaItr
    [all...]

Completed in 26 milliseconds