Lines Matching refs:CaseVals
792 CaseValsTy CaseVals;
861 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
870 CaseVals.push_back(std::make_pair(LoVal, CS));
889 std::stable_sort(CaseVals.begin(), CaseVals.end(), CmpCaseVals);
891 if (!CaseVals.empty()) {
892 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
894 CaseVals[i].first == ConstantCondValue)
897 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
901 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
902 Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
910 CaseVals
913 Diag(CaseVals[i].second->getLHS()->getLocStart(),
917 Diag(CaseVals[i].second->getLHS()->getLocStart(),
923 Diag(CaseVals[i-1].second->getLHS()->getLocStart(),
1010 CaseValsTy::iterator I = std::lower_bound(CaseVals.begin(),
1011 CaseVals.end(), CRLo,
1013 if (I != CaseVals.end() && I->first < CRHi) {
1019 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
1020 if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1067 // allowing easier comparison with CaseVals.
1078 for (CaseValsTy::const_iterator CI = CaseVals.begin();
1079 CI != CaseVals.end(); CI++) {
1109 auto CI = CaseVals.begin();
1117 while (CI != CaseVals.end() && CI->first < EI->first)
1120 if (CI != CaseVals.end() && CI->first == EI->first)
