Searched refs:NodeItr (Results 1 - 8 of 8) sorted by relevance
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
H A D | HeuristicBase.h | 25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the 34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the 55 typedef std::list<Graph::NodeItr> OptimalList; 66 void addToOptimalReductionList(Graph::NodeItr nItr) { 108 bool shouldOptimallyReduce(Graph::NodeItr nItr) { 121 void addToOptimalReduceList(Graph::NodeItr nItr) { 133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); 153 Graph::NodeItr nItr = optimalList.front(); 188 void addToHeuristicList(Graph::NodeItr nItr) { 225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nIt [all...] |
H A D | Graph.h | 39 typedef NodeList::iterator NodeItr; typedef in class:PBQP::Graph 82 NodeItr node1, node2; 87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) 89 NodeItr getNode1() const { return node1; } 90 NodeItr getNode2() const { return node2; } 111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } 117 NodeItr addConstructedNode(const NodeEntry &n) { 168 NodeItr addNode(const Vector &costs) { 176 EdgeItr addEdge(Graph::NodeItr n1It [all...] |
H A D | HeuristicSolver.h | 107 std::vector<Graph::NodeItr> stack; 130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) { 146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) { 155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) { 192 void pushToStack(Graph::NodeItr nItr) { 200 unsigned getSolverDegree(Graph::NodeItr nItr) { 207 void setSolution(const Graph::NodeItr &nItr, unsigned selection) { 214 Graph::NodeItr anItr(g.getEdgeOtherNode(eItr, nItr)); 223 void applyR0(Graph::NodeItr nItr) { 237 void applyR1(Graph::NodeItr xnIt [all...] |
H A D | Solution.h | 77 void setSelection(Graph::NodeItr nItr, unsigned selection) {
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { 64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { 81 typedef std::list<Graph::NodeItr> RNAllocableList; 84 typedef std::list<Graph::NodeItr> RNUnallocableList; 127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { 137 void addToHeuristicReduceList(Graph::NodeItr nItr) { 163 Graph::NodeItr nItr = *rnaItr; 172 Graph::NodeItr nIt [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 54 void recordVReg(unsigned vreg, PBQP::Graph::NodeItr node, 69 PBQP::Graph::NodeItr getNodeForVReg(unsigned vreg) const; 96 typedef DenseMap<unsigned, PBQP::Graph::NodeItr> VReg2Node;
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 245 class NodeItr { 253 NodeItr(NodeId CurNId, const Graph &G) 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); } 307 NodeItr end() const { return NodeItr(G.Nodes.size(), G); }
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 119 typedef std::vector<PBQP::Graph::NodeItr> NodeVector; 169 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const { 273 PBQP::Graph::NodeItr node = 391 PBQP::Graph::NodeItr node = p->getNodeForVReg(src); 397 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); 398 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src);
|
Completed in 1641 milliseconds