Lines Matching refs:CaseVals
1225 CaseValsTy CaseVals;
1279 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
1287 CaseVals.push_back(std::make_pair(LoVal, CS));
1309 llvm::stable_sort(CaseVals, CmpCaseVals);
1311 if (!CaseVals.empty()) {
1312 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
1314 CaseVals[i].first == ConstantCondValue)
1317 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
1321 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
1322 CaseVals[i].second->getLHS()->IgnoreParenCasts();
1330 CaseVals[i-1].first.toString(CaseValStr);
1333 Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1337 Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1343 Diag(CaseVals[i - 1].second->getLHS()->getBeginLoc(),
1412 llvm::lower_bound(CaseVals, CRLo, CaseCompareFunctor());
1413 if (I != CaseVals.end() && I->first < CRHi) {
1419 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
1420 if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1469 // allowing easier comparison with CaseVals.
1480 for (CaseValsTy::const_iterator CI = CaseVals.begin();
1481 CI != CaseVals.end(); CI++) {
1511 auto CI = CaseVals.begin();
1536 while (CI != CaseVals.end() && CI->first < EI->first)
1539 if (CI != CaseVals.end() && CI->first == EI->first)