Searched refs:getGraph (Results 1 – 10 of 10) sorted by relevance
62 : s(&s), g(&s.getGraph()) {} in SpillCostComparator()184 Graph &g = getGraph(); in preUpdateEdgeCosts()191 subtractEdgeContributions(eId, getGraph().getEdgeNode1(eId)); in preUpdateEdgeCosts()193 subtractEdgeContributions(eId, getGraph().getEdgeNode2(eId)); in preUpdateEdgeCosts()214 Graph &g = getGraph(); in handleAddEdge()313 Matrix &eCosts = getGraph().getEdgeCosts(eId); in computeEdgeContributions()361 unsigned numRegs = getGraph().getNodeCosts(nId).getLength() - 1; in addEdgeContributions()363 bool nIsNode1 = nId == getGraph().getEdgeNode1(eId); in addEdgeContributions()388 unsigned numRegs = getGraph().getNodeCosts(nId).getLength() - 1; in subtractEdgeContributions()390 bool nIsNode1 = nId == getGraph().getEdgeNode1(eId); in subtractEdgeContributions()[all …]
75 : s(solver), g(s.getGraph()) { } in HeuristicBase()86 Graph& getGraph() { return g; } in getGraph() function
125 Graph& getGraph() { return g; } in getGraph() function
44 PBQP::Graph& getGraph() { return graph; } in getGraph() function46 const PBQP::Graph& getGraph() const { return graph; } in getGraph() function
198 PBQP::Graph &g = p->getGraph(); in build()319 PBQP::Graph &g = p->getGraph(); in build()475 const PBQP::Graph &g = problem.getGraph(); in mapPBQPToRegAlloc()602 problem->getGraph().dump(os); in runOnMachineFunction()608 problem->getGraph()); in runOnMachineFunction()
494 ExplodedGraph &getGraph();528 ExplodedGraph &getGraph() { return BR.getGraph(); }
160 ExplodedGraph& getGraph() { return G; } in getGraph() function161 const ExplodedGraph& getGraph() const { return G; } in getGraph() function
119 ExplodedGraph& getGraph() { return *G.get(); } in getGraph() function
2761 ExplodedGraph &GRBugReporter::getGraph() { return Eng.getGraph(); } in getGraph() function in GRBugReporter3117 TrimmedGraph TrimG(&getGraph(), errorNodes); in generatePathDiagnostic()
65 G(Engine.getGraph()), in ExprEngine()