Lines Matching defs:PredCases

909   std::vector<ValueEqualityComparisonCase> PredCases;
911       GetValueEqualityComparisonCases(Pred->getTerminator(), PredCases);
912   EliminateBlockCases(PredDef, PredCases); // Remove default from cases.
923     // PredCases.  If there are any cases in ThisCases that are in PredCases, we
925     if (!ValuesOverlap(PredCases, ThisCases))
955     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
956       DeadCases.insert(PredCases[i].Value);
991   for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
992     if (PredCases[i].Dest == TIBB) {
995       TIV = PredCases[i].Value;
1174   std::vector<ValueEqualityComparisonCase> PredCases;
1175   BasicBlock *PredDefault = GetValueEqualityComparisonCases(PTI, PredCases);
1178   // PredCases and PredDefault with the new switch cases we would like to
1190     if (Weights.size() != 1 + PredCases.size())
1196     Weights.assign(1 + PredCases.size(), 1);
1211     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1212       if (PredCases[i].Dest != BB)
1213         PTIHandled.insert(PredCases[i].Value);
1216         std::swap(PredCases[i], PredCases.back());
1225         PredCases.pop_back();
1243         PredCases.push_back(BBCases[i]);
1268     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1269       if (PredCases[i].Dest == BB) {
1270         PTIHandled.insert(PredCases[i].Value);
1273           WeightsForHandled[PredCases[i].Value] = Weights[i + 1];
1278         std::swap(PredCases[i], PredCases.back());
1279         PredCases.pop_back();
1291         PredCases.push_back(BBCases[i]);
1301       PredCases.push_back(ValueEqualityComparisonCase(I, BBDefault));
1332   SwitchInst *NewSI = Builder.CreateSwitch(CV, PredDefault, PredCases.size());
1334   for (ValueEqualityComparisonCase &V : PredCases)