Searched refs:Cg (Results 1 – 7 of 7) sorted by relevance
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | HFSort.cpp | 64 Samples += Cg.samples(TargetId); in Cluster()
65 Size += Cg.size(TargetId); in Cluster()
99 Fid, Cg.size(Fid), Cg.samples(Fid));); in freezeClusters()
137 Clusters.reserve(Cg.numNodes()); in clusterize()
140 if (Cg.samples(F) == 0) in clusterize()
142 Clusters.emplace_back(F, Cg.getNode(F)); in clusterize()
146 freezeClusters(Cg, Clusters); in clusterize()
172 const Arc &Arc = *Cg.findArc(Src, Fid); in clusterize()
244 Clusters.reserve(Cg.numNodes()); in randomClusters()
247 if (Cg.samples(F) == 0) in randomClusters()
[all …]
|
| H A D | HFSortPlus.cpp | 228 explicit HFSortPlus(const CallGraph &Cg) : Cg(Cg) { initialize(); } in HFSortPlus() argument
265 AllChains.reserve(Cg.numNodes()); in initialize()
266 HotChains.reserve(Cg.numNodes()); in initialize()
268 Addr.resize(Cg.numNodes(), 0); in initialize()
272 AllChains.emplace_back(F, F, Cg.samples(F), Cg.size(F)); in initialize()
275 TotalSamples += Cg.samples(F); in initialize()
285 AllEdges.reserve(Cg.numArcs()); in initialize()
558 CurAddr += Cg.size(F); in mergeChains()
575 const CallGraph &Cg; member in llvm::bolt::__anonbf028ece0111::HFSortPlus
607 Cg.adjustArcWeights(); in hfsortPlus()
[all …]
|
| H A D | ReorderFunctions.cpp | 125 Cg.nodeIdToFunc(FuncId)->setIndex(Index++); in reorder()
127 TotalSize += Cg.size(FuncId); in reorder()
173 if (Cg.samples(FuncId) > 0) { in reorder()
178 << Cg.size(FuncId) << ")\n"; in reorder()
212 TotalSize += Cg.size(FuncId); in reorder()
269 Cg = buildCallGraph(BC, in runOnFunctions()
283 Cg.normalizeArcWeights(); in runOnFunctions()
321 Clusters = clusterize(Cg); in runOnFunctions()
324 Clusters = hfsortPlus(Cg); in runOnFunctions()
327 Clusters = pettisAndHansen(Cg); in runOnFunctions()
[all …]
|
| H A D | PettisAndHansen.cpp | 54 void orderFuncs(const CallGraph &Cg, Cluster *C1, Cluster *C2) { in orderFuncs() argument
65 for (const Arc &Arc : Cg.arcs()) { in orderFuncs()
97 std::vector<Cluster> pettisAndHansen(const CallGraph &Cg) { in pettisAndHansen() argument
99 std::vector<Cluster *> FuncCluster(Cg.numNodes(), nullptr); in pettisAndHansen()
103 Clusters.reserve(Cg.numNodes()); in pettisAndHansen()
105 for (NodeId F = 0; F < Cg.numNodes(); F++) { in pettisAndHansen()
106 if (Cg.samples(F) == 0) in pettisAndHansen()
108 Clusters.emplace_back(F, Cg.getNode(F)); in pettisAndHansen()
123 for (const Arc &Arc : Cg.arcs()) { in pettisAndHansen()
166 orderFuncs(Cg, C1, C2); in pettisAndHansen()
|
| H A D | BinaryFunctionCallGraph.cpp | 88 BinaryFunctionCallGraph Cg; in buildCallGraph() local
101 const CallGraph::NodeId Id = Cg.maybeGetNodeId(Function); in buildCallGraph()
116 return Cg.addNode(Function, Size, Function->getKnownExecutionCount()); in buildCallGraph()
155 Cg.incArcWeight(SrcId, DstId, AdjCount, Offset); in buildCallGraph()
269 Cg.numNodes(), TotalCallsites, RecursiveCallsites, in buildCallGraph()
270 Cg.density(), NotProcessed, NoProfileCallsites, in buildCallGraph()
273 return Cg; in buildCallGraph()
|
| /llvm-project-15.0.7/bolt/include/bolt/Passes/ |
| H A D | HFSort.h | 34 Cluster(const std::vector<CallGraph::NodeId> &Nodes, const CallGraph &Cg);
82 std::vector<Cluster> clusterize(const CallGraph &Cg);
87 std::vector<Cluster> hfsortPlus(CallGraph &Cg);
94 std::vector<Cluster> pettisAndHansen(const CallGraph &Cg);
97 std::vector<Cluster> randomClusters(const CallGraph &Cg);
|
| H A D | ReorderFunctions.h | 21 BinaryFunctionCallGraph Cg; variable
|