Home
last modified time | relevance | path

Searched refs:numNodes (Results 1 – 7 of 7) sorted by relevance

/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSort.cpp135 std::vector<Cluster *> FuncCluster(Cg.numNodes(), nullptr); in clusterize()
137 Clusters.reserve(Cg.numNodes()); in clusterize()
139 for (NodeId F = 0; F < Cg.numNodes(); F++) { in clusterize()
242 std::vector<NodeId> FuncIds(Cg.numNodes(), 0); in randomClusters()
244 Clusters.reserve(Cg.numNodes()); in randomClusters()
246 for (NodeId F = 0; F < Cg.numNodes(); F++) { in randomClusters()
H A DHFSortPlus.cpp239 << Cg.numNodes() << " to " << HotChains.size() << "\n"; in run()
263 OutWeight.resize(Cg.numNodes(), 0); in initialize()
264 InWeight.resize(Cg.numNodes(), 0); in initialize()
265 AllChains.reserve(Cg.numNodes()); in initialize()
266 HotChains.reserve(Cg.numNodes()); in initialize()
267 NodeChain.resize(Cg.numNodes(), nullptr); in initialize()
268 Addr.resize(Cg.numNodes(), 0); in initialize()
271 for (NodeId F = 0; F < Cg.numNodes(); ++F) { in initialize()
286 for (NodeId F = 0; F < Cg.numNodes(); ++F) { in initialize()
H A DPettisAndHansen.cpp99 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()
H A DCallGraph.cpp99 for (NodeId FuncId = 0; FuncId < numNodes(); ++FuncId) { in normalizeArcWeights()
113 for (NodeId FuncId = 0; FuncId < numNodes(); ++FuncId) { in adjustArcWeights()
H A DBinaryFunctionCallGraph.cpp269 Cg.numNodes(), TotalCallsites, RecursiveCallsites, in buildCallGraph()
H A DReorderFunctions.cpp118 std::vector<uint64_t> FuncAddr(Cg.numNodes()); // Just for computing stats in reorder()
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DCallGraph.h102 size_t numNodes() const { return Nodes.size(); } in numNodes() function