Searched defs:eId (Results 1 - 4 of 4) sorted by relevance

/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h203 void preUpdateEdgeCosts(Graph::EdgeId eId) { argument
209 void postUpdateEdgeCostts(Graph::EdgeId eId) { argument
215 void handleAddEdge(Graph::EdgeId eId) { argument
226 void handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) { argument
H A DGraph.h107 EdgeEntry& getEdge(EdgeId eId) { return edges[eId]; } argument
263 Matrix& getEdgeCosts(EdgeId eId) { return getEdge(eId).getCosts(); } argument
277 setEdgeData(EdgeId eId, void *data) argument
282 getEdgeData(EdgeId eId) argument
320 getEdgeNode1(EdgeId eId) argument
327 getEdgeNode2(EdgeId eId) argument
335 getEdgeOtherNode(EdgeId eId, NodeId nId) argument
368 EdgeId eId = *itr; local
376 removeEdge(EdgeId eId) argument
[all...]
H A DHeuristicSolver.h58 SolverEdgeItr addSolverEdge(Graph::EdgeId eId) { argument
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeId eId) { argument
164 void removeSolverEdge(Graph::EdgeId eId) { argument
242 Graph::EdgeId eId = *nd.solverEdgesBegin(); local
398 getSolverEdgeData(Graph::EdgeId eId) argument
402 addSolverEdge(Graph::EdgeId eId) argument
454 Graph::EdgeId eId = *aeItr; local
497 tryToEliminateEdge(Graph::EdgeId eId) argument
505 tryNormaliseEdgeMatrix(Graph::EdgeId &eId) argument
[all...]
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h183 void preUpdateEdgeCosts(Graph::EdgeId eId) { argument
201 postUpdateEdgeCosts(Graph::EdgeId eId) argument
213 handleAddEdge(Graph::EdgeId eId) argument
259 handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) argument
301 getHeuristicEdgeData(Graph::EdgeId eId) argument
307 computeEdgeContributions(Graph::EdgeId eId) argument
355 addEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) argument
382 subtractEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) argument
435 Graph::EdgeId eId = *aeItr; local
[all...]

Completed in 105 milliseconds