Lines Matching refs:Clusters

74   AvgFreq.resize(Clusters.size(), 0.0);  in computeClusterAverageFrequency()
75 for (uint32_t I = 0, E = Clusters.size(); I < E; ++I) { in computeClusterAverageFrequency()
78 for (BinaryBasicBlock *BB : Clusters[I]) { in computeClusterAverageFrequency()
91 for (uint32_t I = 0, E = Clusters.size(); I < E; ++I) { in printClusters()
93 if (AvgFreq.size() == Clusters.size()) in printClusters()
97 for (BinaryBasicBlock *BB : Clusters[I]) { in printClusters()
106 Clusters.clear(); in reset()
144 uint32_t I = Clusters.size(); in clusterBasicBlocks()
145 Clusters.emplace_back(); in clusterBasicBlocks()
146 std::vector<BinaryBasicBlock *> &Cluster = Clusters.back(); in clusterBasicBlocks()
189 std::vector<BinaryBasicBlock *> &ClusterA = Clusters[I]; in clusterBasicBlocks()
190 std::vector<BinaryBasicBlock *> &ClusterB = Clusters[J]; in clusterBasicBlocks()
352 std::vector<BinaryBasicBlock *> &ClusterA = Clusters[I]; in adjustQueue()
353 std::vector<BinaryBasicBlock *> &ClusterB = Clusters[J]; in adjustQueue()
516 for (ClusterAlgorithm::ClusterTy &Cluster : CAlgo->Clusters) in reorderBasicBlocks()
527 std::vector<ClusterAlgorithm::ClusterTy> &Clusters = CAlgo->Clusters; in reorderBasicBlocks() local
546 Status.resize(Clusters.size(), 0); in reorderBasicBlocks()
547 Parent.resize(Clusters.size(), 0); in reorderBasicBlocks()
565 !Clusters[Target.first].empty()) { in reorderBasicBlocks()
583 for (uint32_t I = 0, E = Clusters.size(); I < E; ++I) in reorderBasicBlocks()
584 if (!(Status[I] & VISITED) && !Clusters[I].empty()) in reorderBasicBlocks()
620 ClusterAlgorithm::ClusterTy &Cluster = Clusters[ClusterIndex]; in reorderBasicBlocks()
636 std::vector<ClusterAlgorithm::ClusterTy> &Clusters = CAlgo->Clusters; in reorderBasicBlocks() local
649 for (uint32_t I = 0, E = Clusters.size(); I < E; ++I) in reorderBasicBlocks()
650 if (!Clusters[I].empty()) in reorderBasicBlocks()
669 ClusterAlgorithm::ClusterTy &Cluster = Clusters[ClusterIndex]; in reorderBasicBlocks()
697 std::vector<ClusterAlgorithm::ClusterTy> &Clusters = CAlgo->Clusters; in reorderBasicBlocks() local
706 for (uint32_t I = 0, E = Clusters.size(); I < E; ++I) in reorderBasicBlocks()
707 if (!Clusters[I].empty()) in reorderBasicBlocks()
725 ClusterAlgorithm::ClusterTy &Cluster = Clusters[ClusterIndex]; in reorderBasicBlocks()