Lines Matching defs:Case
1281 /// If Case is non-null, then we are looking for the specified case, checking
1282 /// that nothing we jump over contains labels. If Case is null, then we found
1285 /// If the recursive walk actually finds our Case, then we set FoundCase to
1290 const SwitchCase *Case,
1295 return Case ? CSFC_Success : CSFC_FallThrough;
1300 if (S == Case) {
1307 return CollectStatementsForCase(SC->getSubStmt(), Case, FoundCase,
1313 if (!Case && isa<BreakStmt>(S))
1322 if (Case) {
1330 for (; Case && I != E; ++I) {
1333 switch (CollectStatementsForCase(*I, Case, FoundCase, ResultStmts)) {
1357 // We recursively found Case, so we're not looking for it anymore.
1358 Case = nullptr;
1389 return Case ? CSFC_Success : CSFC_FallThrough;
1395 if (Case) {
1422 const SwitchCase *Case = S.getSwitchCaseList();
1425 for (; Case; Case = Case->getNextSwitchCase()) {
1428 if (const DefaultStmt *DS = dyn_cast<DefaultStmt>(Case)) {
1434 const CaseStmt *CS = cast<CaseStmt>(Case);
1445 if (!Case) {
1450 Case = DefaultCase;
1462 ResultCase = Case;
1463 return CollectStatementsForCase(S.getBody(), Case, FoundCase,
1479 const SwitchCase *Case = nullptr;
1481 getContext(), Case)) {
1482 if (Case) {
1483 RegionCounter CaseCnt = getPGORegionCounter(Case);
1530 for (const SwitchCase *Case = S.getSwitchCaseList();
1531 Case;
1532 Case = Case->getNextSwitchCase()) {
1533 if (isa<DefaultStmt>(Case))
1534 DefaultCount = getPGORegionCounter(Case).getCount();