HomeSort by relevance Sort by last modified time
    Searched refs:EdgeItr (Results 1 - 5 of 5) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 42 typedef EdgeList::iterator EdgeItr;
47 typedef std::list<EdgeItr> AdjEdgeList;
68 AdjEdgeItr addEdge(EdgeItr e) {
114 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; }
122 EdgeItr addConstructedEdge(const EdgeEntry &e) {
126 EdgeItr edgeItr = edges.insert(edges.end(), e);
127 EdgeEntry &ne = getEdge(edgeItr);
134 ne.setNode1AEItr(n1.addEdge(edgeItr));
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
    [all...]
HeuristicBase.h 28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) {
208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) {
214 void handleAddEdge(Graph::EdgeItr eItr) {
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
HeuristicSolver.h 43 typedef std::list<Graph::EdgeItr> SolverEdges;
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) {
164 void removeSolverEdge(Graph::EdgeItr eItr) {
213 Graph::EdgeItr eItr(*aeItr);
242 Graph::EdgeItr eItr = *nd.solverEdgesBegin();
294 Graph::EdgeItr yxeItr = *aeItr,
336 Graph::EdgeItr yzeItr = g.findEdge(ynItr, znItr);
398 EdgeData& getSolverEdgeData(Graph::EdgeItr eItr) {
402 void addSolverEdge(Graph::EdgeItr eItr)
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 184 void preUpdateEdgeCosts(Graph::EdgeItr eItr) {
202 void postUpdateEdgeCosts(Graph::EdgeItr eItr) {
214 void handleAddEdge(Graph::EdgeItr eItr) {
260 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
302 EdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) {
308 void computeEdgeContributions(Graph::EdgeItr eItr) {
356 void addEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
383 void subtractEdgeContributions(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
430 Graph::EdgeItr eItr = *aeItr;
441 std::vector<Graph::EdgeItr> edgesToRemove
    [all...]
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 299 PBQP::Graph::EdgeItr edge =
399 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);

Completed in 46 milliseconds