Searched refs:EdgeItr (Results 1 – 6 of 6) sorted by relevance
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 42 typedef EdgeList::iterator EdgeItr; typedef
47 typedef std::list<EdgeItr> AdjEdgeList;
68 AdjEdgeItr addEdge(EdgeItr e) { in addEdge()
114 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; } in getEdge()
122 EdgeItr addConstructedEdge(const EdgeEntry &e) { in addConstructedEdge()
126 EdgeItr edgeItr = edges.insert(edges.end(), e); in addConstructedEdge()
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, in addEdge()
219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } in getEdgeCosts()
233 void setEdgeData(EdgeItr eItr, void *data) { getEdge(eItr).setData(data); } in setEdgeData()
238 void* getEdgeData(EdgeItr eItr) { return getEdge(eItr).getData(); } in getEdgeData()
[all …]
|
| D | HeuristicSolver.h | 43 typedef std::list<Graph::EdgeItr> SolverEdges;
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge()
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { in getHeuristicEdgeData()
164 void removeSolverEdge(Graph::EdgeItr eItr) { in removeSolverEdge()
213 Graph::EdgeItr eItr(*aeItr); in setSolution()
242 Graph::EdgeItr eItr = *nd.solverEdgesBegin(); in applyR1()
294 Graph::EdgeItr yxeItr = *aeItr, in applyR2()
336 Graph::EdgeItr yzeItr = g.findEdge(ynItr, znItr); in applyR2()
398 EdgeData& getSolverEdgeData(Graph::EdgeItr eItr) { in getSolverEdgeData()
402 void addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge()
[all …]
|
| D | HeuristicBase.h | 202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts()
208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) { in postUpdateEdgeCostts()
214 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge()
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 184 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts()
202 void postUpdateEdgeCosts(Graph::EdgeItr eItr) { in postUpdateEdgeCosts()
214 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge()
260 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge()
302 EdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { in getHeuristicEdgeData()
308 void computeEdgeContributions(Graph::EdgeItr eItr) { in computeEdgeContributions()
356 void addEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in addEdgeContributions()
383 void subtractEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in subtractEdgeContributions()
430 Graph::EdgeItr eItr = *aeItr; in initializeNode()
441 std::vector<Graph::EdgeItr> edgesToRemove; in handleRemoveNode()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 277 class EdgeItr {
279 EdgeItr(EdgeId CurEId, const Graph &G) in EdgeItr() function
284 bool operator==(const EdgeItr &O) const { return CurEId == O.CurEId; }
285 bool operator!=(const EdgeItr &O) const { return !(*this == O); }
286 EdgeItr& operator++() { CurEId = findNextInUse(++CurEId); return *this; }
319 EdgeItr begin() const { return EdgeItr(0, G); } in begin()
320 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 299 PBQP::Graph::EdgeItr edge = in build()
399 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2); in build()
|