HomeSort by: relevance | last modified time | path
    Searched refs:Clusters (Results 1 - 7 of 7) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
SwitchLoweringUtils.cpp 23 uint64_t SwitchCG::getJumpTableRange(const CaseClusterVector &Clusters,
26 const APInt &LowCase = Clusters[First].Low->getValue();
27 const APInt &HighCase = Clusters[Last].High->getValue();
46 void SwitchCG::SwitchLowering::findJumpTables(CaseClusterVector &Clusters,
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[i].Low->getValue()))
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
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,
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
Analysis.h 92 printSchedClassClustersHtml(const std::vector<SchedClassCluster> &Clusters,
Analysis.cpp 299 const std::vector<SchedClassCluster> &Clusters,
302 OS << "<table class=\"sched-class-clusters\">";
304 assert(!Clusters.empty());
306 Points[Clusters[0].getPointIds()[0]].Measurements) {
312 for (const SchedClassCluster &Cluster : Clusters) {
444 OS << "<table class=\"sched-class-clusters\">";
503 table.sched-class-clusters td {
553 // Bucket sched class points into sched class clusters.
560 continue; // Either display stable or unstable clusters only.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
IRTranslator.cpp 678 CaseClusterVector Clusters;
679 Clusters.reserve(SI.getNumCases());
687 Clusters.push_back(CaseCluster::range(CaseVal, CaseVal, Succ, Prob));
694 // if there are many clusters.
695 sortAndRangeify(Clusters);
700 if (Clusters.empty()) {
707 SL->findJumpTables(Clusters, &SI, DefaultMBB, nullptr, nullptr);
708 SL->findBitTestClusters(Clusters, &SI);
711 dbgs() << "Case clusters: ";
712 for (const CaseCluster &C : Clusters) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 10551 // checked first. However, two clusters can have the same probability in
10553 // as a tie-breaker as clusters are guaranteed to never overlap.
10734 "Clusters not sorted?");
10747 // find a partitioning of the clusters which balances the probability on both
10769 // If one side has less than 3 clusters, and the other has more than 3,
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]
    [all...]
SelectionDAGBuilder.h 180 SwitchCG::CaseClusterVector &Clusters,

Completed in 30 milliseconds