Lines Matching defs:CaseVals

1366   CaseValsTy CaseVals;
1423       // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
1431         CaseVals.push_back(std::make_pair(LoVal, CS));
1454     llvm::stable_sort(CaseVals, CmpCaseVals);
1456     if (!CaseVals.empty()) {
1457       for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
1459             CaseVals[i].first == ConstantCondValue)
1462         if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
1466           Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
1467           Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
1475           CaseVals[i-1].first.toString(CaseValStr);
1478             Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1482             Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1488           Diag(CaseVals[i - 1].second->getLHS()->getBeginLoc(),
1557             llvm::lower_bound(CaseVals, CRLo, CaseCompareFunctor());
1558         if (I != CaseVals.end() && I->first < CRHi) {
1564         I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
1565         if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1615       // allowing easier comparison with CaseVals.
1626       for (CaseValsTy::const_iterator CI = CaseVals.begin();
1627           CI != CaseVals.end(); CI++) {
1657       auto CI = CaseVals.begin();
1682         while (CI != CaseVals.end() && CI->first < EI->first)
1685         if (CI != CaseVals.end() && CI->first == EI->first)