Lines Matching refs:PredCases

754   std::vector<ValueEqualityComparisonCase> PredCases;
756       GetValueEqualityComparisonCases(Pred->getTerminator(), PredCases);
757   EliminateBlockCases(PredDef, PredCases); // Remove default from cases.
768     // PredCases.  If there are any cases in ThisCases that are in PredCases, we
770     if (!ValuesOverlap(PredCases, ThisCases))
795     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
796       DeadCases.insert(PredCases[i].Value);
835   for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
836     if (PredCases[i].Dest == TIBB) {
839       TIV = PredCases[i].Value;
962       std::vector<ValueEqualityComparisonCase> PredCases;
963       BasicBlock *PredDefault = GetValueEqualityComparisonCases(PTI, PredCases);
966       // PredCases and PredDefault with the new switch cases we would like to
978         if (Weights.size() != 1 + PredCases.size())
984         Weights.assign(1 + PredCases.size(), 1);
999         for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1000           if (PredCases[i].Dest != BB)
1001             PTIHandled.insert(PredCases[i].Value);
1004             std::swap(PredCases[i], PredCases.back());
1013             PredCases.pop_back();
1030             PredCases.push_back(BBCases[i]);
1055         for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1056           if (PredCases[i].Dest == BB) {
1057             PTIHandled.insert(PredCases[i].Value);
1060               WeightsForHandled[PredCases[i].Value] = Weights[i + 1];
1065             std::swap(PredCases[i], PredCases.back());
1066             PredCases.pop_back();
1078             PredCases.push_back(BBCases[i]);
1089           PredCases.push_back(ValueEqualityComparisonCase(I, BBDefault));
1109           Builder.CreateSwitch(CV, PredDefault, PredCases.size());
1111       for (ValueEqualityComparisonCase &V : PredCases)