Lines Matching refs:CaseVals
754 CaseValsTy CaseVals;
825 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
834 CaseVals.push_back(std::make_pair(LoVal, CS));
854 std::stable_sort(CaseVals.begin(), CaseVals.end(), CmpCaseVals);
856 if (!CaseVals.empty()) {
857 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
859 CaseVals[i].first == ConstantCondValue)
862 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
866 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
867 Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
875 CaseVals[i-1].first.toString(CaseValStr);
878 Diag(CaseVals[i].second->getLHS()->getLocStart(),
882 Diag(CaseVals[i].second->getLHS()->getLocStart(),
888 Diag(CaseVals[i-1].second->getLHS()->getLocStart(),
972 CaseValsTy::iterator I = std::lower_bound(CaseVals.begin(),
973 CaseVals.end(), CRLo,
975 if (I != CaseVals.end() && I->first < CRHi) {
981 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
982 if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1031 // allowing easier comparison with CaseVals.
1043 for (CaseValsTy::const_iterator CI = CaseVals.begin();
1044 CI != CaseVals.end(); CI++) {
1082 CaseValsTy::const_iterator CI = CaseVals.begin();
1090 while (CI != CaseVals.end() && CI->first < EI->first)
1093 if (CI != CaseVals.end() && CI->first == EI->first)
