Lines Matching refs:PredCases

637   std::vector<ValueEqualityComparisonCase> PredCases;  in SimplifyEqualityComparisonWithOnlyPredecessor()  local
639 PredCases); in SimplifyEqualityComparisonWithOnlyPredecessor()
640 EliminateBlockCases(PredDef, PredCases); // Remove default from cases. in SimplifyEqualityComparisonWithOnlyPredecessor()
653 if (!ValuesOverlap(PredCases, ThisCases)) in SimplifyEqualityComparisonWithOnlyPredecessor()
677 for (unsigned i = 0, e = PredCases.size(); i != e; ++i) in SimplifyEqualityComparisonWithOnlyPredecessor()
678 DeadCases.insert(PredCases[i].Value); in SimplifyEqualityComparisonWithOnlyPredecessor()
717 for (unsigned i = 0, e = PredCases.size(); i != e; ++i) in SimplifyEqualityComparisonWithOnlyPredecessor()
718 if (PredCases[i].Dest == TIBB) { in SimplifyEqualityComparisonWithOnlyPredecessor()
721 TIV = PredCases[i].Value; in SimplifyEqualityComparisonWithOnlyPredecessor()
844 std::vector<ValueEqualityComparisonCase> PredCases; in FoldValueComparisonIntoPredecessors() local
845 BasicBlock *PredDefault = GetValueEqualityComparisonCases(PTI, PredCases); in FoldValueComparisonIntoPredecessors()
860 if (Weights.size() != 1 + PredCases.size()) in FoldValueComparisonIntoPredecessors()
866 Weights.assign(1 + PredCases.size(), 1); in FoldValueComparisonIntoPredecessors()
881 for (unsigned i = 0, e = PredCases.size(); i != e; ++i) in FoldValueComparisonIntoPredecessors()
882 if (PredCases[i].Dest != BB) in FoldValueComparisonIntoPredecessors()
883 PTIHandled.insert(PredCases[i].Value); in FoldValueComparisonIntoPredecessors()
886 std::swap(PredCases[i], PredCases.back()); in FoldValueComparisonIntoPredecessors()
895 PredCases.pop_back(); in FoldValueComparisonIntoPredecessors()
911 PredCases.push_back(BBCases[i]); in FoldValueComparisonIntoPredecessors()
936 for (unsigned i = 0, e = PredCases.size(); i != e; ++i) in FoldValueComparisonIntoPredecessors()
937 if (PredCases[i].Dest == BB) { in FoldValueComparisonIntoPredecessors()
938 PTIHandled.insert(PredCases[i].Value); in FoldValueComparisonIntoPredecessors()
941 WeightsForHandled[PredCases[i].Value] = Weights[i+1]; in FoldValueComparisonIntoPredecessors()
946 std::swap(PredCases[i], PredCases.back()); in FoldValueComparisonIntoPredecessors()
947 PredCases.pop_back(); in FoldValueComparisonIntoPredecessors()
958 PredCases.push_back(BBCases[i]); in FoldValueComparisonIntoPredecessors()
970 PredCases.push_back(ValueEqualityComparisonCase(*I, BBDefault)); in FoldValueComparisonIntoPredecessors()
990 PredCases.size()); in FoldValueComparisonIntoPredecessors()
992 for (unsigned i = 0, e = PredCases.size(); i != e; ++i) in FoldValueComparisonIntoPredecessors()
993 NewSI->addCase(PredCases[i].Value, PredCases[i].Dest); in FoldValueComparisonIntoPredecessors()