reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

tools/clang/lib/Sema/SemaStmt.cpp
  957         CaseVals.push_back(std::make_pair(LoVal, CS));
  979     llvm::stable_sort(CaseVals, CmpCaseVals);
  981     if (!CaseVals.empty()) {
  982       for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
  984             CaseVals[i].first == ConstantCondValue)
  987         if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
  987         if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
  991           Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
  992           Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
 1000           CaseVals[i-1].first.toString(CaseValStr);
 1003             Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
 1007             Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
 1013           Diag(CaseVals[i - 1].second->getLHS()->getBeginLoc(),
 1082             llvm::lower_bound(CaseVals, CRLo, CaseCompareFunctor());
 1083         if (I != CaseVals.end() && I->first < CRHi) {
 1089         I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
 1090         if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
 1150       for (CaseValsTy::const_iterator CI = CaseVals.begin();
 1151           CI != CaseVals.end(); CI++) {
 1181       auto CI = CaseVals.begin();
 1206         while (CI != CaseVals.end() && CI->first < EI->first)
 1209         if (CI != CaseVals.end() && CI->first == EI->first)