Searched refs:getGraph (Results 1 – 10 of 10) sorted by relevance
63 : s(&s), g(&s.getGraph()) {} in SpillCostComparator()185 Graph &g = getGraph(); in preUpdateEdgeCosts()192 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr)); in preUpdateEdgeCosts()194 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr)); in preUpdateEdgeCosts()215 Graph &g = getGraph(); in handleAddEdge()314 Matrix &eCosts = getGraph().getEdgeCosts(eItr); in computeEdgeContributions()362 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in addEdgeContributions()364 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr); in addEdgeContributions()389 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in subtractEdgeContributions()391 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr); 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
43 PBQP::Graph& getGraph() { return graph; } in getGraph() function45 const PBQP::Graph& getGraph() const { return graph; } in getGraph() function
200 PBQP::Graph &g = p->getGraph(); in build()324 PBQP::Graph &g = p->getGraph(); in build()477 const PBQP::Graph &g = problem.getGraph(); in mapPBQPToRegAlloc()600 problem->getGraph().dump(os); in runOnMachineFunction()606 problem->getGraph()); in runOnMachineFunction()
457 ExplodedGraph &getGraph();483 ExplodedGraph &getGraph() { return BR.getGraph(); }
155 ExplodedGraph& getGraph() { return G; } in getGraph() function156 const ExplodedGraph& getGraph() const { return G; } in getGraph() function
115 ExplodedGraph& getGraph() { return *G.get(); } in getGraph() function
1565 ExplodedGraph &GRBugReporter::getGraph() { return Eng.getGraph(); } in getGraph() function in GRBugReporter1867 GPair = MakeReportGraph(&getGraph(), errorNodes); in GeneratePathDiagnostic()
63 G(Engine.getGraph()), in ExprEngine()