| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 57 assert(Clusters[i - 1].High->getValue().slt(Clusters[i].Low->getValue())); in findJumpTables()
92 Clusters.resize(1); in findJumpTables()
184 std::memmove(&Clusters[DstIndex++], &Clusters[I], sizeof(Clusters[I])); in findJumpTables()
223 JTProbs[Clusters[I].MBB] += Clusters[I].Prob; in buildJumpTable()
260 JTCluster = CaseCluster::jumpTable(Clusters[First].Low, Clusters[Last].High, in buildJumpTable()
273 assert(Clusters[0].Kind == CC_Range || Clusters[0].Kind == CC_JumpTable); in findBitTestClusters()
277 assert(Clusters[i-1].High->getValue().slt(Clusters[i].Low->getValue())); in findBitTestClusters()
356 std::memmove(&Clusters[DstIndex], &Clusters[First], in findBitTestClusters()
377 NumCmps += (Clusters[I].Low == Clusters[I].High) ? 1 : 2; in buildBitTests()
459 BTCluster = CaseCluster::bitTests(Clusters[First].Low, Clusters[Last].High, in buildBitTests()
[all …]
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | HFSort.cpp | 90 for (Cluster &C : Clusters) { in freezeClusters()
136 std::vector<Cluster> Clusters; in clusterize() local
137 Clusters.reserve(Cg.numNodes()); in clusterize()
146 freezeClusters(Cg, Clusters); in clusterize()
243 std::vector<Cluster> Clusters; in randomClusters() local
260 Clusters[Idx].size() + Clusters[MaxIdx].size() <= MaxClusterSize) in randomClusters()
265 assert(Clusters[MergeIdx].size() + Clusters[Idx].size() <= in randomClusters()
269 return Clusters.size(); in randomClusters()
278 Clusters[Idx].merge(Clusters[MergeIdx]); in randomClusters()
279 Clusters.erase(Clusters.begin() + MergeIdx); in randomClusters()
[all …]
|
| H A D | ReorderAlgorithm.cpp | 74 AvgFreq.resize(Clusters.size(), 0.0); in computeClusterAverageFrequency()
106 Clusters.clear(); in reset()
144 uint32_t I = Clusters.size(); in clusterBasicBlocks()
145 Clusters.emplace_back(); in clusterBasicBlocks()
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()
636 std::vector<ClusterAlgorithm::ClusterTy> &Clusters = CAlgo->Clusters; in reorderBasicBlocks() local
650 if (!Clusters[I].empty()) in reorderBasicBlocks()
697 std::vector<ClusterAlgorithm::ClusterTy> &Clusters = CAlgo->Clusters; in reorderBasicBlocks() local
[all …]
|
| H A D | ReorderFunctions.cpp | 116 void ReorderFunctions::reorder(std::vector<Cluster> &&Clusters, in reorder() argument
123 for (const Cluster &Cluster : Clusters) { in reorder()
166 for (Cluster &Cluster : Clusters) { in reorder()
231 Hotfuncs, Clusters.size()) in reorder()
286 std::vector<Cluster> Clusters; in runOnFunctions() local
321 Clusters = clusterize(Cg); in runOnFunctions()
324 Clusters = hfsortPlus(Cg); in runOnFunctions()
327 Clusters = pettisAndHansen(Cg); in runOnFunctions()
331 Clusters = randomClusters(Cg); in runOnFunctions()
384 reorder(std::move(Clusters), BFs); in runOnFunctions()
|
| H A D | PettisAndHansen.cpp | 100 std::vector<Cluster> Clusters; in pettisAndHansen() local
103 Clusters.reserve(Cg.numNodes()); in pettisAndHansen()
108 Clusters.emplace_back(F, Cg.getNode(F)); in pettisAndHansen()
109 FuncCluster[F] = &Clusters.back(); in pettisAndHansen()
|
| H A D | HFSortPlus.cpp | 252 std::vector<Cluster> Clusters; in run() local
253 Clusters.reserve(HotChains.size()); in run()
255 Clusters.emplace_back(Cluster(Chain->Nodes, Cg)); in run()
256 return Clusters; in run()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | SwitchLoweringUtils.h | 90 void sortAndRangeify(CaseClusterVector &Clusters);
232 uint64_t getJumpTableRange(const CaseClusterVector &Clusters, unsigned First,
272 void findJumpTables(CaseClusterVector &Clusters, const SwitchInst *SI,
276 bool buildJumpTable(const CaseClusterVector &Clusters, unsigned First,
281 void findBitTestClusters(CaseClusterVector &Clusters, const SwitchInst *SI);
285 bool buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last,
|
| /llvm-project-15.0.7/bolt/include/bolt/Passes/ |
| H A D | ReorderUtils.h | 32 void initialize(std::vector<Cluster *> &_Clusters) { Clusters = _Clusters; } in initialize()
40 Func(Clusters[I]); in forAllAdjacent()
65 std::vector<Cluster *> Clusters; variable
|
| H A D | ReorderFunctions.h | 23 void reorder(std::vector<Cluster> &&Clusters,
|
| H A D | ReorderAlgorithm.h | 34 std::vector<ClusterTy> Clusters; variable
|
| /llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/ |
| H A D | Analysis.cpp | 302 const std::vector<SchedClassCluster> &Clusters, in printSchedClassClustersHtml() argument
307 assert(!Clusters.empty()); in printSchedClassClustersHtml()
309 Points[Clusters[0].getPointIds()[0]].Measurements) { in printSchedClassClustersHtml()
315 for (const SchedClassCluster &Cluster : Clusters) { in printSchedClassClustersHtml()
|
| H A D | Analysis.h | 93 printSchedClassClustersHtml(const std::vector<SchedClassCluster> &Clusters,
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/GlobalISel/ |
| H A D | IRTranslator.cpp | 688 CaseClusterVector Clusters; in translateSwitch() local
689 Clusters.reserve(SI.getNumCases()); in translateSwitch()
697 Clusters.push_back(CaseCluster::range(CaseVal, CaseVal, Succ, Prob)); in translateSwitch()
705 sortAndRangeify(Clusters); in translateSwitch()
710 if (Clusters.empty()) { in translateSwitch()
717 SL->findJumpTables(Clusters, &SI, DefaultMBB, nullptr, nullptr); in translateSwitch()
718 SL->findBitTestClusters(Clusters, &SI); in translateSwitch()
722 for (const CaseCluster &C : Clusters) { in translateSwitch()
738 assert(!Clusters.empty()); in translateSwitch()
740 CaseClusterIt First = Clusters.begin(); in translateSwitch()
[all …]
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.cpp | 11156 CaseCluster &CC = Clusters[Index]; in peelDominantCaseCluster()
11182 Clusters.erase(PeeledCaseIt); in peelDominantCaseCluster()
11183 for (CaseCluster &CC : Clusters) { in peelDominantCaseCluster()
11197 CaseClusterVector Clusters; in visitSwitch() local
11198 Clusters.reserve(SI.getNumCases()); in visitSwitch()
11213 sortAndRangeify(Clusters); in visitSwitch()
11222 if (Clusters.empty()) { in visitSwitch()
11233 SL->findBitTestClusters(Clusters, &SI); in visitSwitch()
11253 assert(!Clusters.empty()); in visitSwitch()
11255 CaseClusterIt First = Clusters.begin(); in visitSwitch()
[all …]
|
| H A D | SelectionDAGBuilder.h | 181 SwitchCG::CaseClusterVector &Clusters,
|