Searched refs:Clusters (Results 1 - 7 of 7) sorted by relevance
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 23 uint64_t SwitchCG::getJumpTableRange(const CaseClusterVector &Clusters, argument
26 const APInt &LowCase = Clusters[First].Low->getValue();
27 const APInt &HighCase = Clusters[Last].High->getValue();
46 void SwitchCG::SwitchLowering::findJumpTables(CaseClusterVector &Clusters, argument
52 // Clusters must be non-empty, sorted, and only contain Range clusters.
53 assert(!Clusters.empty());
54 for (CaseCluster &C : Clusters)
56 for (unsigned i = 1, e = Clusters.size(); i < e; ++i)
57 assert(Clusters[i - 1].High->getValue().slt(Clusters[
190 buildJumpTable(const CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, MachineBasicBlock *DefaultMBB, CaseCluster &JTCluster) argument
265 findBitTestClusters(CaseClusterVector &Clusters, const SwitchInst *SI) argument
364 buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, CaseCluster &BTCluster) argument
464 sortAndRangeify(CaseClusterVector &Clusters) argument
[all...] |
| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | SwitchLoweringUtils.h | 89 /// Sort Clusters and merge adjacent cases.
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);
283 /// Build a bit test cluster from Clusters[First..Last]. Returns false if it
285 bool buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last,
|
| /netbsd-current/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/ |
| H A D | Analysis.h | 92 printSchedClassClustersHtml(const std::vector<SchedClassCluster> &Clusters,
|
| H A D | Analysis.cpp | 299 const std::vector<SchedClassCluster> &Clusters,
304 assert(!Clusters.empty());
306 Points[Clusters[0].getPointIds()[0]].Measurements) {
312 for (const SchedClassCluster &Cluster : Clusters) {
298 printSchedClassClustersHtml( const std::vector<SchedClassCluster> &Clusters, const ResolvedSchedClass &RSC, raw_ostream &OS) const argument
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| H A D | IRTranslator.cpp | 678 CaseClusterVector Clusters; local
679 Clusters.reserve(SI.getNumCases());
687 Clusters.push_back(CaseCluster::range(CaseVal, CaseVal, Succ, Prob));
695 sortAndRangeify(Clusters);
700 if (Clusters.empty()) {
707 SL->findJumpTables(Clusters, &SI, DefaultMBB, nullptr, nullptr);
708 SL->findBitTestClusters(Clusters, &SI);
712 for (const CaseCluster &C : Clusters) {
728 assert(!Clusters.empty());
730 CaseClusterIt First = Clusters
[all...] |
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.cpp | 10734 "Clusters not sorted?");
10879 // for the peeled switch statement. Also update Clusters to remove the peeled
10882 const SwitchInst &SI, CaseClusterVector &Clusters,
10886 if (SwitchPeelThreshold > 100 || !FuncInfo.BPI || Clusters.size() < 2 ||
10894 for (unsigned Index = 0; Index < Clusters.size(); ++Index) {
10895 CaseCluster &CC = Clusters[Index];
10916 auto PeeledCaseIt = Clusters.begin() + PeeledCaseIndex;
10921 Clusters.erase(PeeledCaseIt);
10922 for (CaseCluster &CC : Clusters) {
10936 CaseClusterVector Clusters; local
10881 peelDominantCaseCluster( const SwitchInst &SI, CaseClusterVector &Clusters, BranchProbability &PeeledCaseProb) argument
[all...] |
| H A D | SelectionDAGBuilder.h | 180 SwitchCG::CaseClusterVector &Clusters,
|
Completed in 357 milliseconds