228   explicit HFSortPlus(const CallGraph &Cg) : Cg(Cg) { initialize(); }  in HFSortPlus()  argument
239            << Cg.numNodes() << " to " << HotChains.size() << "\n";  in run()
255       Clusters.emplace_back(Cluster(Chain->Nodes, Cg));  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()
272       AllChains.emplace_back(F, F, Cg.samples(F), Cg.size(F));  in initialize()
275       TotalSamples += Cg.samples(F);  in initialize()
276       for (NodeId Succ : Cg.successors(F)) {  in initialize()
279         const Arc &Arc = *Cg.findArc(F, Succ);  in initialize()
285     AllEdges.reserve(Cg.numArcs());  in initialize()
286     for (NodeId F = 0; F < Cg.numNodes(); ++F) {  in initialize()
287       for (NodeId Succ : Cg.successors(F)) {  in initialize()
290         const Arc &Arc = *Cg.findArc(F, Succ);  in initialize()
428       for (NodeId Succ : Cg.successors(F)) {  in runPassOne()
432         const Arc &Arc = *Cg.findArc(F, Succ);  in runPassOne()
558       CurAddr += Cg.size(F);  in mergeChains()
575   const CallGraph &Cg;  member in llvm::bolt::__anonbf028ece0111::HFSortPlus
603 std::vector<Cluster> hfsortPlus(CallGraph &Cg) {  in hfsortPlus()  argument
607   Cg.adjustArcWeights();  in hfsortPlus()
608   return HFSortPlus(Cg).run();  in hfsortPlus()