Lines Matching defs:PredCases

920   std::vector<ValueEqualityComparisonCase> PredCases;
922       getValueEqualityComparisonCases(Pred->getTerminator(), PredCases);
923   eliminateBlockCases(PredDef, PredCases); // Remove default from cases.
934     // PredCases.  If there are any cases in ThisCases that are in PredCases, we
936     if (!valuesOverlap(PredCases, ThisCases))
966     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
967       DeadCases.insert(PredCases[i].Value);
1002   for (const auto &[Value, Dest] : PredCases)
1185   std::vector<ValueEqualityComparisonCase> PredCases;
1186   BasicBlock *PredDefault = getValueEqualityComparisonCases(PTI, PredCases);
1189   // PredCases and PredDefault with the new switch cases we would like to
1201     if (Weights.size() != 1 + PredCases.size())
1207     Weights.assign(1 + PredCases.size(), 1);
1222     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1223       if (PredCases[i].Dest != BB)
1224         PTIHandled.insert(PredCases[i].Value);
1227         std::swap(PredCases[i], PredCases.back());
1236         PredCases.pop_back();
1254         PredCases.push_back(BBCases[i]);
1279     for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
1280       if (PredCases[i].Dest == BB) {
1281         PTIHandled.insert(PredCases[i].Value);
1284           WeightsForHandled[PredCases[i].Value] = Weights[i + 1];
1289         std::swap(PredCases[i], PredCases.back());
1290         PredCases.pop_back();
1302         PredCases.push_back(BBCases[i]);
1312       PredCases.push_back(ValueEqualityComparisonCase(I, BBDefault));
1343   SwitchInst *NewSI = Builder.CreateSwitch(CV, PredDefault, PredCases.size());
1345   for (ValueEqualityComparisonCase &V : PredCases)