30 using NodeId = CallGraph::NodeId;  typedef
53 Cluster::Cluster(NodeId Id, const Node &Func)  in Cluster()
59 Cluster::Cluster(const std::vector<NodeId> &Nodes, const CallGraph &Cg) {  in Cluster()
62   for (NodeId TargetId : Nodes) {  in Cluster()
75   for (const NodeId &Target : Targets) {  in toString()
96     LLVM_DEBUG(NodeId Fid = C.target(0);  in freezeClusters()
115                     const std::vector<CallGraph::NodeId> &Targets_) {  in merge()
132   std::vector<NodeId> SortedFuncs;  in clusterize()
139   for (NodeId F = 0; F < Cg.numNodes(); F++) {  in clusterize()
153   llvm::sort(SortedFuncs, [&](const NodeId F1, const NodeId F2) {  in clusterize()
162   for (const NodeId Fid : SortedFuncs) {  in clusterize()
168     NodeId BestPred = CallGraph::InvalidId;  in clusterize()
171     for (const NodeId Src : Cg.predecessors(Fid)) {  in clusterize()
216     for (NodeId F : Cluster->targets())  in clusterize()
227   for (const NodeId Func : SortedFuncs) {  in clusterize()
242   std::vector<NodeId> FuncIds(Cg.numNodes(), 0);  in randomClusters()
246   for (NodeId F = 0; F < Cg.numNodes(); F++) {  in randomClusters()