Searched refs:NodeItr (Results 1 – 8 of 8) sorted by relevance
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 39 typedef NodeList::iterator NodeItr; typedef
82 NodeItr node1, node2;
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) in EdgeEntry()
89 NodeItr getNode1() const { return node1; } in getNode1()
90 NodeItr getNode2() const { return node2; } in getNode2()
111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } in getNode()
117 NodeItr addConstructedNode(const NodeEntry &n) { in addConstructedNode()
168 NodeItr addNode(const Vector &costs) { in addNode()
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, in addEdge()
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts()
[all …]
|
| D | HeuristicBase.h | 55 typedef std::list<Graph::NodeItr> OptimalList;
66 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()
153 Graph::NodeItr nItr = optimalList.front(); in optimalReduce()
188 void addToHeuristicList(Graph::NodeItr nItr) { in addToHeuristicList()
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge()
|
| D | HeuristicSolver.h | 107 std::vector<Graph::NodeItr> stack;
130 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()
214 Graph::NodeItr anItr(g.getEdgeOtherNode(eItr, nItr)); in setSolution()
223 void applyR0(Graph::NodeItr nItr) { in applyR0()
237 void applyR1(Graph::NodeItr xnItr) { in applyR1()
[all …]
|
| D | Solution.h | 77 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()
81 typedef std::list<Graph::NodeItr> RNAllocableList;
84 typedef std::list<Graph::NodeItr> RNUnallocableList;
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce()
137 void addToHeuristicReduceList(Graph::NodeItr nItr) { in addToHeuristicReduceList()
163 Graph::NodeItr nItr = *rnaItr; in heuristicReduce()
172 Graph::NodeItr nItr = *rnuItr; in heuristicReduce()
186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in preUpdateEdgeCosts()
216 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in handleAddEdge()
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 245 class NodeItr {
253 NodeItr(NodeId CurNId, const Graph &G) in NodeItr() function
258 bool operator==(const NodeItr &O) const { return CurNId == O.CurNId; }
259 bool operator!=(const NodeItr &O) const { return !(*this == O); }
260 NodeItr& operator++() { CurNId = findNextInUse(++CurNId); return *this; }
306 NodeItr begin() const { return NodeItr(0, G); } in begin()
307 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node, in recordVReg()
69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const;
96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 119 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
169 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const { in getNodeForVReg()
273 PBQP::Graph::NodeItr node = in build()
391 PBQP::Graph::NodeItr node = p->getNodeForVReg(src); in build()
397 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); in build()
398 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); in build()
|