Home
last modified time | relevance | path

Searched defs:nItr (Results 1 – 5 of 5) sorted by relevance

/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicBase.h66 void addToOptimalReductionList(Graph::NodeItr nItr) { in addToOptimalReductionList()
108 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
121 void addToOptimalReduceList(Graph::NodeItr nItr) { in addToOptimalReduceList()
133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); in setup() local
153 Graph::NodeItr nItr = optimalList.front(); in optimalReduce() local
188 void addToHeuristicList(Graph::NodeItr nItr) { in addToHeuristicList()
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge()
DGraph.h111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } in getNode()
112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; } in getNode()
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts()
200 const Vector& getNodeCosts(ConstNodeItr nItr) const { in getNodeCosts()
209 void setNodeData(NodeItr nItr, void *data) { getNode(nItr).setData(data); } in setNodeData()
214 void* getNodeData(NodeItr nItr) { return getNode(nItr).getData(); } in getNodeData()
243 unsigned getNodeDegree(NodeItr nItr) const { in getNodeDegree()
268 AdjEdgeItr adjEdgesBegin(NodeItr nItr) { in adjEdgesBegin()
275 AdjEdgeItr adjEdgesEnd(NodeItr nItr) { in adjEdgesEnd()
297 NodeItr getEdgeOtherNode(EdgeItr eItr, NodeItr nItr) { in getEdgeOtherNode()
[all …]
DHeuristicSolver.h130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) { in getHeuristicNodeData()
146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) { in solverEdgesBegin()
155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) { in solverEdgesEnd()
192 void pushToStack(Graph::NodeItr nItr) { in pushToStack()
200 unsigned getSolverDegree(Graph::NodeItr nItr) { in getSolverDegree()
207 void setSolution(const Graph::NodeItr &nItr, unsigned selection) { in setSolution()
223 void applyR0(Graph::NodeItr nItr) { in applyR0()
394 NodeData& getSolverNodeData(Graph::NodeItr nItr) { in getSolverNodeData()
417 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); in setup() local
441 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); in disconnectTrivialNodes() local
[all …]
DSolution.h77 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection()
84 unsigned getSelection(Graph::ConstNodeItr nItr) const { in getSelection()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
DBriggs.h127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
137 void addToHeuristicReduceList(Graph::NodeItr nItr) { in addToHeuristicReduceList()
163 Graph::NodeItr nItr = *rnaItr; in heuristicReduce() local
172 Graph::NodeItr nItr = *rnuItr; in heuristicReduce() local
260 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge()
298 NodeData& getHeuristicNodeData(Graph::NodeItr nItr) { in getHeuristicNodeData()
356 void addEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in addEdgeContributions()
383 void subtractEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in subtractEdgeContributions()
406 void updateAllocability(Graph::NodeItr nItr) { in updateAllocability()
412 void initializeNode(Graph::NodeItr nItr) { in initializeNode()