Searched defs:eItr (Results 1 - 4 of 4) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | HeuristicBase.h | 201 /// @param eItr Edge iterator. 202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { argument 207 /// @param eItr Edge iterator. 208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) { argument 213 /// @param eItr Edge iterator for the added edge. 214 void handleAddEdge(Graph::EdgeItr eItr) { argument 219 /// @param eItr Edge iterator for edge being disconnected. 225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { argument
|
H A D | Graph.h | 114 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; } argument 115 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; } 217 /// @param eItr Edge iterator. 219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } argument 222 /// @param eItr Edge iterator. 224 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const { 225 return getEdge(eItr) 233 setEdgeData(EdgeItr eItr, void *data) argument 238 getEdgeData(EdgeItr eItr) argument 282 getEdgeNode1(EdgeItr eItr) argument 289 getEdgeNode2(EdgeItr eItr) argument 297 getEdgeOtherNode(EdgeItr eItr, NodeItr nItr) argument 326 EdgeItr eItr = *itr; local 336 removeEdge(EdgeItr eItr) argument [all...] |
H A D | HeuristicSolver.h | 58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) { argument 60 return solverEdges.insert(solverEdges.end(), eItr); 135 /// @param eItr Edge iterator. 137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { argument 138 return getSolverEdgeData(eItr).getHeuristicData(); 160 /// @param eItr Edge iterator for edge to be removed. 164 void removeSolverEdge(Graph::EdgeItr eItr) { argument 165 EdgeData &eData = getSolverEdgeData(eItr); 166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), 167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); 242 Graph::EdgeItr eItr = *nd.solverEdgesBegin(); local 398 getSolverEdgeData(Graph::EdgeItr eItr) argument 402 addSolverEdge(Graph::EdgeItr eItr) argument 452 Graph::EdgeItr eItr = *aeItr; local 495 tryToEliminateEdge(Graph::EdgeItr eItr) argument 503 tryNormaliseEdgeMatrix(Graph::EdgeItr &eItr) argument [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 183 /// @param eItr Edge iterator. 184 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { argument 186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), 187 n2Itr = g.getEdgeNode2(eItr); 192 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr)); 194 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr)); 196 EdgeData &ed = getHeuristicEdgeData(eItr); 201 /// @param eItr Edg 202 postUpdateEdgeCosts(Graph::EdgeItr eItr) argument 214 handleAddEdge(Graph::EdgeItr eItr) argument 260 handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument 302 getHeuristicEdgeData(Graph::EdgeItr eItr) argument 308 computeEdgeContributions(Graph::EdgeItr eItr) argument 356 addEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument 383 subtractEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) argument 436 Graph::EdgeItr eItr = *aeItr; local [all...] |
Completed in 261 milliseconds