1 //===--- SemaStmt.cpp - Semantic Analysis for Statements ------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements semantic analysis for statements.
12 //===----------------------------------------------------------------------===//
14 #include "clang/Sema/SemaInternal.h"
15 #include "clang/AST/ASTContext.h"
16 #include "clang/AST/ASTDiagnostic.h"
17 #include "clang/AST/CharUnits.h"
18 #include "clang/AST/CXXInheritance.h"
19 #include "clang/AST/DeclObjC.h"
20 #include "clang/AST/EvaluatedExprVisitor.h"
21 #include "clang/AST/ExprCXX.h"
22 #include "clang/AST/ExprObjC.h"
23 #include "clang/AST/RecursiveASTVisitor.h"
24 #include "clang/AST/StmtCXX.h"
25 #include "clang/AST/StmtObjC.h"
26 #include "clang/AST/TypeLoc.h"
27 #include "clang/AST/TypeOrdering.h"
28 #include "clang/Basic/TargetInfo.h"
29 #include "clang/Lex/Preprocessor.h"
30 #include "clang/Sema/Initialization.h"
31 #include "clang/Sema/Lookup.h"
32 #include "clang/Sema/Scope.h"
33 #include "clang/Sema/ScopeInfo.h"
34 #include "llvm/ADT/ArrayRef.h"
35 #include "llvm/ADT/DenseMap.h"
36 #include "llvm/ADT/STLExtras.h"
37 #include "llvm/ADT/SmallPtrSet.h"
38 #include "llvm/ADT/SmallString.h"
39 #include "llvm/ADT/SmallVector.h"
41 using namespace clang;
44 StmtResult Sema::ActOnExprStmt(ExprResult FE) {
48 FE = ActOnFinishFullExpr(FE.get(), FE.get()->getExprLoc(),
49 /*DiscardedValue*/ true);
53 // C99 6.8.3p2: The expression in an expression statement is evaluated as a
54 // void expression for its side effects. Conversion to void allows any
55 // operand, even incomplete types.
57 // Same thing in for stmt first clause (when expr) and third clause.
58 return StmtResult(FE.getAs<Stmt>());
62 StmtResult Sema::ActOnExprStmtError() {
63 DiscardCleanupsInEvaluationContext();
67 StmtResult Sema::ActOnNullStmt(SourceLocation SemiLoc,
68 bool HasLeadingEmptyMacro) {
69 return new (Context) NullStmt(SemiLoc, HasLeadingEmptyMacro);
72 StmtResult Sema::ActOnDeclStmt(DeclGroupPtrTy dg, SourceLocation StartLoc,
73 SourceLocation EndLoc) {
74 DeclGroupRef DG = dg.get();
76 // If we have an invalid decl, just return an error.
77 if (DG.isNull()) return StmtError();
79 return new (Context) DeclStmt(DG, StartLoc, EndLoc);
82 void Sema::ActOnForEachDeclStmt(DeclGroupPtrTy dg) {
83 DeclGroupRef DG = dg.get();
85 // If we don't have a declaration, or we have an invalid declaration,
87 if (DG.isNull() || !DG.isSingleDecl())
90 Decl *decl = DG.getSingleDecl();
91 if (!decl || decl->isInvalidDecl())
94 // Only variable declarations are permitted.
95 VarDecl *var = dyn_cast<VarDecl>(decl);
97 Diag(decl->getLocation(), diag::err_non_variable_decl_in_for);
98 decl->setInvalidDecl();
102 // foreach variables are never actually initialized in the way that
103 // the parser came up with.
104 var->setInit(nullptr);
106 // In ARC, we don't need to retain the iteration variable of a fast
107 // enumeration loop. Rather than actually trying to catch that
108 // during declaration processing, we remove the consequences here.
109 if (getLangOpts().ObjCAutoRefCount) {
110 QualType type = var->getType();
112 // Only do this if we inferred the lifetime. Inferred lifetime
113 // will show up as a local qualifier because explicit lifetime
114 // should have shown up as an AttributedType instead.
115 if (type.getLocalQualifiers().getObjCLifetime() == Qualifiers::OCL_Strong) {
116 // Add 'const' and mark the variable as pseudo-strong.
117 var->setType(type.withConst());
118 var->setARCPseudoStrong(true);
123 /// \brief Diagnose unused comparisons, both builtin and overloaded operators.
124 /// For '==' and '!=', suggest fixits for '=' or '|='.
126 /// Adding a cast to void (or other expression wrappers) will prevent the
127 /// warning from firing.
128 static bool DiagnoseUnusedComparison(Sema &S, const Expr *E) {
130 bool IsNotEqual, CanAssign, IsRelational;
132 if (const BinaryOperator *Op = dyn_cast<BinaryOperator>(E)) {
133 if (!Op->isComparisonOp())
136 IsRelational = Op->isRelationalOp();
137 Loc = Op->getOperatorLoc();
138 IsNotEqual = Op->getOpcode() == BO_NE;
139 CanAssign = Op->getLHS()->IgnoreParenImpCasts()->isLValue();
140 } else if (const CXXOperatorCallExpr *Op = dyn_cast<CXXOperatorCallExpr>(E)) {
141 switch (Op->getOperator()) {
145 case OO_ExclaimEqual:
146 IsRelational = false;
150 case OO_GreaterEqual:
156 Loc = Op->getOperatorLoc();
157 IsNotEqual = Op->getOperator() == OO_ExclaimEqual;
158 CanAssign = Op->getArg(0)->IgnoreParenImpCasts()->isLValue();
160 // Not a typo-prone comparison.
164 // Suppress warnings when the operator, suspicious as it may be, comes from
165 // a macro expansion.
166 if (S.SourceMgr.isMacroBodyExpansion(Loc))
169 S.Diag(Loc, diag::warn_unused_comparison)
170 << (unsigned)IsRelational << (unsigned)IsNotEqual << E->getSourceRange();
172 // If the LHS is a plausible entity to assign to, provide a fixit hint to
173 // correct common typos.
174 if (!IsRelational && CanAssign) {
176 S.Diag(Loc, diag::note_inequality_comparison_to_or_assign)
177 << FixItHint::CreateReplacement(Loc, "|=");
179 S.Diag(Loc, diag::note_equality_comparison_to_assign)
180 << FixItHint::CreateReplacement(Loc, "=");
186 void Sema::DiagnoseUnusedExprResult(const Stmt *S) {
187 if (const LabelStmt *Label = dyn_cast_or_null<LabelStmt>(S))
188 return DiagnoseUnusedExprResult(Label->getSubStmt());
190 const Expr *E = dyn_cast_or_null<Expr>(S);
194 // If we are in an unevaluated expression context, then there can be no unused
195 // results because the results aren't expected to be used in the first place.
196 if (isUnevaluatedContext())
199 SourceLocation ExprLoc = E->IgnoreParenImpCasts()->getExprLoc();
200 // In most cases, we don't want to warn if the expression is written in a
201 // macro body, or if the macro comes from a system header. If the offending
202 // expression is a call to a function with the warn_unused_result attribute,
203 // we warn no matter the location. Because of the order in which the various
204 // checks need to happen, we factor out the macro-related test here.
205 bool ShouldSuppress =
206 SourceMgr.isMacroBodyExpansion(ExprLoc) ||
207 SourceMgr.isInSystemMacro(ExprLoc);
209 const Expr *WarnExpr;
212 if (!E->isUnusedResultAWarning(WarnExpr, Loc, R1, R2, Context))
215 // If this is a GNU statement expression expanded from a macro, it is probably
216 // unused because it is a function-like macro that can be used as either an
217 // expression or statement. Don't warn, because it is almost certainly a
219 if (isa<StmtExpr>(E) && Loc.isMacroID())
222 // Check if this is the UNREFERENCED_PARAMETER from the Microsoft headers.
223 // That macro is frequently used to suppress "unused parameter" warnings,
224 // but its implementation makes clang's -Wunused-value fire. Prevent this.
225 if (isa<ParenExpr>(E->IgnoreImpCasts()) && Loc.isMacroID()) {
226 SourceLocation SpellLoc = Loc;
227 if (findMacroSpelling(SpellLoc, "UNREFERENCED_PARAMETER"))
231 // Okay, we have an unused result. Depending on what the base expression is,
232 // we might want to make a more specific diagnostic. Check for one of these
234 unsigned DiagID = diag::warn_unused_expr;
235 if (const ExprWithCleanups *Temps = dyn_cast<ExprWithCleanups>(E))
236 E = Temps->getSubExpr();
237 if (const CXXBindTemporaryExpr *TempExpr = dyn_cast<CXXBindTemporaryExpr>(E))
238 E = TempExpr->getSubExpr();
240 if (DiagnoseUnusedComparison(*this, E))
244 if (const CallExpr *CE = dyn_cast<CallExpr>(E)) {
245 if (E->getType()->isVoidType())
248 // If the callee has attribute pure, const, or warn_unused_result, warn with
249 // a more specific message to make it clear what is happening. If the call
250 // is written in a macro body, only warn if it has the warn_unused_result
252 if (const Decl *FD = CE->getCalleeDecl()) {
253 if (const Attr *A = isa<FunctionDecl>(FD)
254 ? cast<FunctionDecl>(FD)->getUnusedResultAttr()
255 : FD->getAttr<WarnUnusedResultAttr>()) {
256 Diag(Loc, diag::warn_unused_result) << A << R1 << R2;
261 if (FD->hasAttr<PureAttr>()) {
262 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "pure";
265 if (FD->hasAttr<ConstAttr>()) {
266 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "const";
270 } else if (ShouldSuppress)
273 if (const ObjCMessageExpr *ME = dyn_cast<ObjCMessageExpr>(E)) {
274 if (getLangOpts().ObjCAutoRefCount && ME->isDelegateInitCall()) {
275 Diag(Loc, diag::err_arc_unused_init_message) << R1;
278 const ObjCMethodDecl *MD = ME->getMethodDecl();
280 if (const auto *A = MD->getAttr<WarnUnusedResultAttr>()) {
281 Diag(Loc, diag::warn_unused_result) << A << R1 << R2;
285 } else if (const PseudoObjectExpr *POE = dyn_cast<PseudoObjectExpr>(E)) {
286 const Expr *Source = POE->getSyntacticForm();
287 if (isa<ObjCSubscriptRefExpr>(Source))
288 DiagID = diag::warn_unused_container_subscript_expr;
290 DiagID = diag::warn_unused_property_expr;
291 } else if (const CXXFunctionalCastExpr *FC
292 = dyn_cast<CXXFunctionalCastExpr>(E)) {
293 const Expr *E = FC->getSubExpr();
294 if (const CXXBindTemporaryExpr *TE = dyn_cast<CXXBindTemporaryExpr>(E))
295 E = TE->getSubExpr();
296 if (isa<CXXTemporaryObjectExpr>(E))
298 if (const CXXConstructExpr *CE = dyn_cast<CXXConstructExpr>(E))
299 if (const CXXRecordDecl *RD = CE->getType()->getAsCXXRecordDecl())
300 if (!RD->getAttr<WarnUnusedAttr>())
303 // Diagnose "(void*) blah" as a typo for "(void) blah".
304 else if (const CStyleCastExpr *CE = dyn_cast<CStyleCastExpr>(E)) {
305 TypeSourceInfo *TI = CE->getTypeInfoAsWritten();
306 QualType T = TI->getType();
308 // We really do want to use the non-canonical type here.
309 if (T == Context.VoidPtrTy) {
310 PointerTypeLoc TL = TI->getTypeLoc().castAs<PointerTypeLoc>();
312 Diag(Loc, diag::warn_unused_voidptr)
313 << FixItHint::CreateRemoval(TL.getStarLoc());
318 if (E->isGLValue() && E->getType().isVolatileQualified()) {
319 Diag(Loc, diag::warn_unused_volatile) << R1 << R2;
323 DiagRuntimeBehavior(Loc, nullptr, PDiag(DiagID) << R1 << R2);
326 void Sema::ActOnStartOfCompoundStmt() {
330 void Sema::ActOnFinishOfCompoundStmt() {
334 sema::CompoundScopeInfo &Sema::getCurCompoundScope() const {
335 return getCurFunction()->CompoundScopes.back();
338 StmtResult Sema::ActOnCompoundStmt(SourceLocation L, SourceLocation R,
339 ArrayRef<Stmt *> Elts, bool isStmtExpr) {
340 const unsigned NumElts = Elts.size();
342 // If we're in C89 mode, check that we don't have any decls after stmts. If
343 // so, emit an extension diagnostic.
344 if (!getLangOpts().C99 && !getLangOpts().CPlusPlus) {
345 // Note that __extension__ can be around a decl.
347 // Skip over all declarations.
348 for (; i != NumElts && isa<DeclStmt>(Elts[i]); ++i)
351 // We found the end of the list or a statement. Scan for another declstmt.
352 for (; i != NumElts && !isa<DeclStmt>(Elts[i]); ++i)
356 Decl *D = *cast<DeclStmt>(Elts[i])->decl_begin();
357 Diag(D->getLocation(), diag::ext_mixed_decls_code);
360 // Warn about unused expressions in statements.
361 for (unsigned i = 0; i != NumElts; ++i) {
362 // Ignore statements that are last in a statement expression.
363 if (isStmtExpr && i == NumElts - 1)
366 DiagnoseUnusedExprResult(Elts[i]);
369 // Check for suspicious empty body (null statement) in `for' and `while'
370 // statements. Don't do anything for template instantiations, this just adds
372 if (NumElts != 0 && !CurrentInstantiationScope &&
373 getCurCompoundScope().HasEmptyLoopBodies) {
374 for (unsigned i = 0; i != NumElts - 1; ++i)
375 DiagnoseEmptyLoopBody(Elts[i], Elts[i + 1]);
378 return new (Context) CompoundStmt(Context, Elts, L, R);
382 Sema::ActOnCaseStmt(SourceLocation CaseLoc, Expr *LHSVal,
383 SourceLocation DotDotDotLoc, Expr *RHSVal,
384 SourceLocation ColonLoc) {
385 assert(LHSVal && "missing expression in case statement");
387 if (getCurFunction()->SwitchStack.empty()) {
388 Diag(CaseLoc, diag::err_case_not_in_switch);
393 CorrectDelayedTyposInExpr(LHSVal, [this](class Expr *E) {
394 if (!getLangOpts().CPlusPlus11)
395 return VerifyIntegerConstantExpression(E);
397 getCurFunction()->SwitchStack.back()->getCond()) {
398 QualType CondType = CondExpr->getType();
399 llvm::APSInt TempVal;
400 return CheckConvertedConstantExpression(E, CondType, TempVal,
409 if (!getLangOpts().CPlusPlus11) {
410 // C99 6.8.4.2p3: The expression shall be an integer constant.
411 // However, GCC allows any evaluatable integer expression.
412 if (!LHSVal->isTypeDependent() && !LHSVal->isValueDependent()) {
413 LHSVal = VerifyIntegerConstantExpression(LHSVal).get();
418 // GCC extension: The expression shall be an integer constant.
420 if (RHSVal && !RHSVal->isTypeDependent() && !RHSVal->isValueDependent()) {
421 RHSVal = VerifyIntegerConstantExpression(RHSVal).get();
422 // Recover from an error by just forgetting about it.
426 LHS = ActOnFinishFullExpr(LHSVal, LHSVal->getExprLoc(), false,
427 getLangOpts().CPlusPlus11);
431 auto RHS = RHSVal ? ActOnFinishFullExpr(RHSVal, RHSVal->getExprLoc(), false,
432 getLangOpts().CPlusPlus11)
437 CaseStmt *CS = new (Context)
438 CaseStmt(LHS.get(), RHS.get(), CaseLoc, DotDotDotLoc, ColonLoc);
439 getCurFunction()->SwitchStack.back()->addSwitchCase(CS);
443 /// ActOnCaseStmtBody - This installs a statement as the body of a case.
444 void Sema::ActOnCaseStmtBody(Stmt *caseStmt, Stmt *SubStmt) {
445 DiagnoseUnusedExprResult(SubStmt);
447 CaseStmt *CS = static_cast<CaseStmt*>(caseStmt);
448 CS->setSubStmt(SubStmt);
452 Sema::ActOnDefaultStmt(SourceLocation DefaultLoc, SourceLocation ColonLoc,
453 Stmt *SubStmt, Scope *CurScope) {
454 DiagnoseUnusedExprResult(SubStmt);
456 if (getCurFunction()->SwitchStack.empty()) {
457 Diag(DefaultLoc, diag::err_default_not_in_switch);
461 DefaultStmt *DS = new (Context) DefaultStmt(DefaultLoc, ColonLoc, SubStmt);
462 getCurFunction()->SwitchStack.back()->addSwitchCase(DS);
467 Sema::ActOnLabelStmt(SourceLocation IdentLoc, LabelDecl *TheDecl,
468 SourceLocation ColonLoc, Stmt *SubStmt) {
469 // If the label was multiply defined, reject it now.
470 if (TheDecl->getStmt()) {
471 Diag(IdentLoc, diag::err_redefinition_of_label) << TheDecl->getDeclName();
472 Diag(TheDecl->getLocation(), diag::note_previous_definition);
476 // Otherwise, things are good. Fill in the declaration and return it.
477 LabelStmt *LS = new (Context) LabelStmt(IdentLoc, TheDecl, SubStmt);
478 TheDecl->setStmt(LS);
479 if (!TheDecl->isGnuLocal()) {
480 TheDecl->setLocStart(IdentLoc);
481 if (!TheDecl->isMSAsmLabel()) {
482 // Don't update the location of MS ASM labels. These will result in
483 // a diagnostic, and changing the location here will mess that up.
484 TheDecl->setLocation(IdentLoc);
490 StmtResult Sema::ActOnAttributedStmt(SourceLocation AttrLoc,
491 ArrayRef<const Attr*> Attrs,
493 // Fill in the declaration and return it.
494 AttributedStmt *LS = AttributedStmt::Create(Context, AttrLoc, Attrs, SubStmt);
499 class CommaVisitor : public EvaluatedExprVisitor<CommaVisitor> {
500 typedef EvaluatedExprVisitor<CommaVisitor> Inherited;
503 CommaVisitor(Sema &SemaRef) : Inherited(SemaRef.Context), SemaRef(SemaRef) {}
504 void VisitBinaryOperator(BinaryOperator *E) {
505 if (E->getOpcode() == BO_Comma)
506 SemaRef.DiagnoseCommaOperator(E->getLHS(), E->getExprLoc());
507 EvaluatedExprVisitor<CommaVisitor>::VisitBinaryOperator(E);
513 Sema::ActOnIfStmt(SourceLocation IfLoc, bool IsConstexpr, Stmt *InitStmt,
514 ConditionResult Cond,
515 Stmt *thenStmt, SourceLocation ElseLoc,
517 if (Cond.isInvalid())
518 Cond = ConditionResult(
520 MakeFullExpr(new (Context) OpaqueValueExpr(SourceLocation(),
521 Context.BoolTy, VK_RValue),
525 Expr *CondExpr = Cond.get().second;
526 if (!Diags.isIgnored(diag::warn_comma_operator,
527 CondExpr->getExprLoc()))
528 CommaVisitor(*this).Visit(CondExpr);
531 DiagnoseEmptyStmtBody(CondExpr->getLocEnd(), thenStmt,
532 diag::warn_empty_if_body);
534 return BuildIfStmt(IfLoc, IsConstexpr, InitStmt, Cond, thenStmt, ElseLoc,
538 StmtResult Sema::BuildIfStmt(SourceLocation IfLoc, bool IsConstexpr,
539 Stmt *InitStmt, ConditionResult Cond,
540 Stmt *thenStmt, SourceLocation ElseLoc,
542 if (Cond.isInvalid())
545 if (IsConstexpr || isa<ObjCAvailabilityCheckExpr>(Cond.get().second))
546 getCurFunction()->setHasBranchProtectedScope();
548 DiagnoseUnusedExprResult(thenStmt);
549 DiagnoseUnusedExprResult(elseStmt);
552 IfStmt(Context, IfLoc, IsConstexpr, InitStmt, Cond.get().first,
553 Cond.get().second, thenStmt, ElseLoc, elseStmt);
557 struct CaseCompareFunctor {
558 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS,
559 const llvm::APSInt &RHS) {
560 return LHS.first < RHS;
562 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS,
563 const std::pair<llvm::APSInt, CaseStmt*> &RHS) {
564 return LHS.first < RHS.first;
566 bool operator()(const llvm::APSInt &LHS,
567 const std::pair<llvm::APSInt, CaseStmt*> &RHS) {
568 return LHS < RHS.first;
573 /// CmpCaseVals - Comparison predicate for sorting case values.
575 static bool CmpCaseVals(const std::pair<llvm::APSInt, CaseStmt*>& lhs,
576 const std::pair<llvm::APSInt, CaseStmt*>& rhs) {
577 if (lhs.first < rhs.first)
580 if (lhs.first == rhs.first &&
581 lhs.second->getCaseLoc().getRawEncoding()
582 < rhs.second->getCaseLoc().getRawEncoding())
587 /// CmpEnumVals - Comparison predicate for sorting enumeration values.
589 static bool CmpEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs,
590 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs)
592 return lhs.first < rhs.first;
595 /// EqEnumVals - Comparison preficate for uniqing enumeration values.
597 static bool EqEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs,
598 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs)
600 return lhs.first == rhs.first;
603 /// GetTypeBeforeIntegralPromotion - Returns the pre-promotion type of
604 /// potentially integral-promoted expression @p expr.
605 static QualType GetTypeBeforeIntegralPromotion(Expr *&expr) {
606 if (ExprWithCleanups *cleanups = dyn_cast<ExprWithCleanups>(expr))
607 expr = cleanups->getSubExpr();
608 while (ImplicitCastExpr *impcast = dyn_cast<ImplicitCastExpr>(expr)) {
609 if (impcast->getCastKind() != CK_IntegralCast) break;
610 expr = impcast->getSubExpr();
612 return expr->getType();
615 ExprResult Sema::CheckSwitchCondition(SourceLocation SwitchLoc, Expr *Cond) {
616 class SwitchConvertDiagnoser : public ICEConvertDiagnoser {
620 SwitchConvertDiagnoser(Expr *Cond)
621 : ICEConvertDiagnoser(/*AllowScopedEnumerations*/true, false, true),
624 SemaDiagnosticBuilder diagnoseNotInt(Sema &S, SourceLocation Loc,
625 QualType T) override {
626 return S.Diag(Loc, diag::err_typecheck_statement_requires_integer) << T;
629 SemaDiagnosticBuilder diagnoseIncomplete(
630 Sema &S, SourceLocation Loc, QualType T) override {
631 return S.Diag(Loc, diag::err_switch_incomplete_class_type)
632 << T << Cond->getSourceRange();
635 SemaDiagnosticBuilder diagnoseExplicitConv(
636 Sema &S, SourceLocation Loc, QualType T, QualType ConvTy) override {
637 return S.Diag(Loc, diag::err_switch_explicit_conversion) << T << ConvTy;
640 SemaDiagnosticBuilder noteExplicitConv(
641 Sema &S, CXXConversionDecl *Conv, QualType ConvTy) override {
642 return S.Diag(Conv->getLocation(), diag::note_switch_conversion)
643 << ConvTy->isEnumeralType() << ConvTy;
646 SemaDiagnosticBuilder diagnoseAmbiguous(Sema &S, SourceLocation Loc,
647 QualType T) override {
648 return S.Diag(Loc, diag::err_switch_multiple_conversions) << T;
651 SemaDiagnosticBuilder noteAmbiguous(
652 Sema &S, CXXConversionDecl *Conv, QualType ConvTy) override {
653 return S.Diag(Conv->getLocation(), diag::note_switch_conversion)
654 << ConvTy->isEnumeralType() << ConvTy;
657 SemaDiagnosticBuilder diagnoseConversion(
658 Sema &S, SourceLocation Loc, QualType T, QualType ConvTy) override {
659 llvm_unreachable("conversion functions are permitted");
661 } SwitchDiagnoser(Cond);
663 ExprResult CondResult =
664 PerformContextualImplicitConversion(SwitchLoc, Cond, SwitchDiagnoser);
665 if (CondResult.isInvalid())
668 // C99 6.8.4.2p5 - Integer promotions are performed on the controlling expr.
669 return UsualUnaryConversions(CondResult.get());
672 StmtResult Sema::ActOnStartOfSwitchStmt(SourceLocation SwitchLoc,
673 Stmt *InitStmt, ConditionResult Cond) {
674 if (Cond.isInvalid())
677 getCurFunction()->setHasBranchIntoScope();
679 SwitchStmt *SS = new (Context)
680 SwitchStmt(Context, InitStmt, Cond.get().first, Cond.get().second);
681 getCurFunction()->SwitchStack.push_back(SS);
685 static void AdjustAPSInt(llvm::APSInt &Val, unsigned BitWidth, bool IsSigned) {
686 Val = Val.extOrTrunc(BitWidth);
687 Val.setIsSigned(IsSigned);
690 /// Check the specified case value is in range for the given unpromoted switch
692 static void checkCaseValue(Sema &S, SourceLocation Loc, const llvm::APSInt &Val,
693 unsigned UnpromotedWidth, bool UnpromotedSign) {
694 // If the case value was signed and negative and the switch expression is
695 // unsigned, don't bother to warn: this is implementation-defined behavior.
696 // FIXME: Introduce a second, default-ignored warning for this case?
697 if (UnpromotedWidth < Val.getBitWidth()) {
698 llvm::APSInt ConvVal(Val);
699 AdjustAPSInt(ConvVal, UnpromotedWidth, UnpromotedSign);
700 AdjustAPSInt(ConvVal, Val.getBitWidth(), Val.isSigned());
701 // FIXME: Use different diagnostics for overflow in conversion to promoted
702 // type versus "switch expression cannot have this value". Use proper
703 // IntRange checking rather than just looking at the unpromoted type here.
705 S.Diag(Loc, diag::warn_case_value_overflow) << Val.toString(10)
706 << ConvVal.toString(10);
710 typedef SmallVector<std::pair<llvm::APSInt, EnumConstantDecl*>, 64> EnumValsTy;
712 /// Returns true if we should emit a diagnostic about this case expression not
713 /// being a part of the enum used in the switch controlling expression.
714 static bool ShouldDiagnoseSwitchCaseNotInEnum(const Sema &S,
716 const Expr *CaseExpr,
717 EnumValsTy::iterator &EI,
718 EnumValsTy::iterator &EIEnd,
719 const llvm::APSInt &Val) {
723 if (const DeclRefExpr *DRE =
724 dyn_cast<DeclRefExpr>(CaseExpr->IgnoreParenImpCasts())) {
725 if (const VarDecl *VD = dyn_cast<VarDecl>(DRE->getDecl())) {
726 QualType VarType = VD->getType();
727 QualType EnumType = S.Context.getTypeDeclType(ED);
728 if (VD->hasGlobalStorage() && VarType.isConstQualified() &&
729 S.Context.hasSameUnqualifiedType(EnumType, VarType))
734 if (ED->hasAttr<FlagEnumAttr>())
735 return !S.IsValueInFlagEnum(ED, Val, false);
737 while (EI != EIEnd && EI->first < Val)
740 if (EI != EIEnd && EI->first == Val)
747 Sema::ActOnFinishSwitchStmt(SourceLocation SwitchLoc, Stmt *Switch,
749 SwitchStmt *SS = cast<SwitchStmt>(Switch);
750 assert(SS == getCurFunction()->SwitchStack.back() &&
751 "switch stack missing push/pop!");
753 getCurFunction()->SwitchStack.pop_back();
755 if (!BodyStmt) return StmtError();
756 SS->setBody(BodyStmt, SwitchLoc);
758 Expr *CondExpr = SS->getCond();
759 if (!CondExpr) return StmtError();
761 QualType CondType = CondExpr->getType();
763 Expr *CondExprBeforePromotion = CondExpr;
764 QualType CondTypeBeforePromotion =
765 GetTypeBeforeIntegralPromotion(CondExprBeforePromotion);
768 // Integral promotions are performed (on the switch condition).
770 // A case value unrepresentable by the original switch condition
771 // type (before the promotion) doesn't make sense, even when it can
772 // be represented by the promoted type. Therefore we need to find
773 // the pre-promotion type of the switch condition.
774 if (!CondExpr->isTypeDependent()) {
775 // We have already converted the expression to an integral or enumeration
776 // type, when we started the switch statement. If we don't have an
777 // appropriate type now, just return an error.
778 if (!CondType->isIntegralOrEnumerationType())
781 if (CondExpr->isKnownToHaveBooleanValue()) {
782 // switch(bool_expr) {...} is often a programmer error, e.g.
783 // switch(n && mask) { ... } // Doh - should be "n & mask".
784 // One can always use an if statement instead of switch(bool_expr).
785 Diag(SwitchLoc, diag::warn_bool_switch_condition)
786 << CondExpr->getSourceRange();
790 // Get the bitwidth of the switched-on value after promotions. We must
791 // convert the integer case values to this width before comparison.
792 bool HasDependentValue
793 = CondExpr->isTypeDependent() || CondExpr->isValueDependent();
794 unsigned CondWidth = HasDependentValue ? 0 : Context.getIntWidth(CondType);
795 bool CondIsSigned = CondType->isSignedIntegerOrEnumerationType();
797 // Get the width and signedness that the condition might actually have, for
799 // FIXME: Grab an IntRange for the condition rather than using the unpromoted
801 unsigned CondWidthBeforePromotion
802 = HasDependentValue ? 0 : Context.getIntWidth(CondTypeBeforePromotion);
803 bool CondIsSignedBeforePromotion
804 = CondTypeBeforePromotion->isSignedIntegerOrEnumerationType();
806 // Accumulate all of the case values in a vector so that we can sort them
807 // and detect duplicates. This vector contains the APInt for the case after
808 // it has been converted to the condition type.
809 typedef SmallVector<std::pair<llvm::APSInt, CaseStmt*>, 64> CaseValsTy;
812 // Keep track of any GNU case ranges we see. The APSInt is the low value.
813 typedef std::vector<std::pair<llvm::APSInt, CaseStmt*> > CaseRangesTy;
814 CaseRangesTy CaseRanges;
816 DefaultStmt *TheDefaultStmt = nullptr;
818 bool CaseListIsErroneous = false;
820 for (SwitchCase *SC = SS->getSwitchCaseList(); SC && !HasDependentValue;
821 SC = SC->getNextSwitchCase()) {
823 if (DefaultStmt *DS = dyn_cast<DefaultStmt>(SC)) {
824 if (TheDefaultStmt) {
825 Diag(DS->getDefaultLoc(), diag::err_multiple_default_labels_defined);
826 Diag(TheDefaultStmt->getDefaultLoc(), diag::note_duplicate_case_prev);
828 // FIXME: Remove the default statement from the switch block so that
829 // we'll return a valid AST. This requires recursing down the AST and
830 // finding it, not something we are set up to do right now. For now,
831 // just lop the entire switch stmt out of the AST.
832 CaseListIsErroneous = true;
837 CaseStmt *CS = cast<CaseStmt>(SC);
839 Expr *Lo = CS->getLHS();
841 if (Lo->isTypeDependent() || Lo->isValueDependent()) {
842 HasDependentValue = true;
848 if (getLangOpts().CPlusPlus11) {
849 // C++11 [stmt.switch]p2: the constant-expression shall be a converted
850 // constant expression of the promoted type of the switch condition.
852 CheckConvertedConstantExpression(Lo, CondType, LoVal, CCEK_CaseValue);
853 if (ConvLo.isInvalid()) {
854 CaseListIsErroneous = true;
859 // We already verified that the expression has a i-c-e value (C99
860 // 6.8.4.2p3) - get that value now.
861 LoVal = Lo->EvaluateKnownConstInt(Context);
863 // If the LHS is not the same type as the condition, insert an implicit
865 Lo = DefaultLvalueConversion(Lo).get();
866 Lo = ImpCastExprToType(Lo, CondType, CK_IntegralCast).get();
869 // Check the unconverted value is within the range of possible values of
870 // the switch expression.
871 checkCaseValue(*this, Lo->getLocStart(), LoVal,
872 CondWidthBeforePromotion, CondIsSignedBeforePromotion);
874 // Convert the value to the same width/sign as the condition.
875 AdjustAPSInt(LoVal, CondWidth, CondIsSigned);
879 // If this is a case range, remember it in CaseRanges, otherwise CaseVals.
881 if (CS->getRHS()->isTypeDependent() ||
882 CS->getRHS()->isValueDependent()) {
883 HasDependentValue = true;
886 CaseRanges.push_back(std::make_pair(LoVal, CS));
888 CaseVals.push_back(std::make_pair(LoVal, CS));
892 if (!HasDependentValue) {
893 // If we don't have a default statement, check whether the
894 // condition is constant.
895 llvm::APSInt ConstantCondValue;
896 bool HasConstantCond = false;
897 if (!HasDependentValue && !TheDefaultStmt) {
898 HasConstantCond = CondExpr->EvaluateAsInt(ConstantCondValue, Context,
899 Expr::SE_AllowSideEffects);
900 assert(!HasConstantCond ||
901 (ConstantCondValue.getBitWidth() == CondWidth &&
902 ConstantCondValue.isSigned() == CondIsSigned));
904 bool ShouldCheckConstantCond = HasConstantCond;
906 // Sort all the scalar case values so we can easily detect duplicates.
907 std::stable_sort(CaseVals.begin(), CaseVals.end(), CmpCaseVals);
909 if (!CaseVals.empty()) {
910 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
911 if (ShouldCheckConstantCond &&
912 CaseVals[i].first == ConstantCondValue)
913 ShouldCheckConstantCond = false;
915 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
916 // If we have a duplicate, report it.
917 // First, determine if either case value has a name
918 StringRef PrevString, CurrString;
919 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
920 Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
921 if (DeclRefExpr *DeclRef = dyn_cast<DeclRefExpr>(PrevCase)) {
922 PrevString = DeclRef->getDecl()->getName();
924 if (DeclRefExpr *DeclRef = dyn_cast<DeclRefExpr>(CurrCase)) {
925 CurrString = DeclRef->getDecl()->getName();
927 SmallString<16> CaseValStr;
928 CaseVals[i-1].first.toString(CaseValStr);
930 if (PrevString == CurrString)
931 Diag(CaseVals[i].second->getLHS()->getLocStart(),
932 diag::err_duplicate_case) <<
933 (PrevString.empty() ? StringRef(CaseValStr) : PrevString);
935 Diag(CaseVals[i].second->getLHS()->getLocStart(),
936 diag::err_duplicate_case_differing_expr) <<
937 (PrevString.empty() ? StringRef(CaseValStr) : PrevString) <<
938 (CurrString.empty() ? StringRef(CaseValStr) : CurrString) <<
941 Diag(CaseVals[i-1].second->getLHS()->getLocStart(),
942 diag::note_duplicate_case_prev);
943 // FIXME: We really want to remove the bogus case stmt from the
944 // substmt, but we have no way to do this right now.
945 CaseListIsErroneous = true;
950 // Detect duplicate case ranges, which usually don't exist at all in
952 if (!CaseRanges.empty()) {
953 // Sort all the case ranges by their low value so we can easily detect
954 // overlaps between ranges.
955 std::stable_sort(CaseRanges.begin(), CaseRanges.end());
957 // Scan the ranges, computing the high values and removing empty ranges.
958 std::vector<llvm::APSInt> HiVals;
959 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) {
960 llvm::APSInt &LoVal = CaseRanges[i].first;
961 CaseStmt *CR = CaseRanges[i].second;
962 Expr *Hi = CR->getRHS();
965 if (getLangOpts().CPlusPlus11) {
966 // C++11 [stmt.switch]p2: the constant-expression shall be a converted
967 // constant expression of the promoted type of the switch condition.
969 CheckConvertedConstantExpression(Hi, CondType, HiVal,
971 if (ConvHi.isInvalid()) {
972 CaseListIsErroneous = true;
977 HiVal = Hi->EvaluateKnownConstInt(Context);
979 // If the RHS is not the same type as the condition, insert an
981 Hi = DefaultLvalueConversion(Hi).get();
982 Hi = ImpCastExprToType(Hi, CondType, CK_IntegralCast).get();
985 // Check the unconverted value is within the range of possible values of
986 // the switch expression.
987 checkCaseValue(*this, Hi->getLocStart(), HiVal,
988 CondWidthBeforePromotion, CondIsSignedBeforePromotion);
990 // Convert the value to the same width/sign as the condition.
991 AdjustAPSInt(HiVal, CondWidth, CondIsSigned);
995 // If the low value is bigger than the high value, the case is empty.
997 Diag(CR->getLHS()->getLocStart(), diag::warn_case_empty_range)
998 << SourceRange(CR->getLHS()->getLocStart(),
1000 CaseRanges.erase(CaseRanges.begin()+i);
1006 if (ShouldCheckConstantCond &&
1007 LoVal <= ConstantCondValue &&
1008 ConstantCondValue <= HiVal)
1009 ShouldCheckConstantCond = false;
1011 HiVals.push_back(HiVal);
1014 // Rescan the ranges, looking for overlap with singleton values and other
1015 // ranges. Since the range list is sorted, we only need to compare case
1016 // ranges with their neighbors.
1017 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) {
1018 llvm::APSInt &CRLo = CaseRanges[i].first;
1019 llvm::APSInt &CRHi = HiVals[i];
1020 CaseStmt *CR = CaseRanges[i].second;
1022 // Check to see whether the case range overlaps with any
1024 CaseStmt *OverlapStmt = nullptr;
1025 llvm::APSInt OverlapVal(32);
1027 // Find the smallest value >= the lower bound. If I is in the
1028 // case range, then we have overlap.
1029 CaseValsTy::iterator I = std::lower_bound(CaseVals.begin(),
1030 CaseVals.end(), CRLo,
1031 CaseCompareFunctor());
1032 if (I != CaseVals.end() && I->first < CRHi) {
1033 OverlapVal = I->first; // Found overlap with scalar.
1034 OverlapStmt = I->second;
1037 // Find the smallest value bigger than the upper bound.
1038 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor());
1039 if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1040 OverlapVal = (I-1)->first; // Found overlap with scalar.
1041 OverlapStmt = (I-1)->second;
1044 // Check to see if this case stmt overlaps with the subsequent
1046 if (i && CRLo <= HiVals[i-1]) {
1047 OverlapVal = HiVals[i-1]; // Found overlap with range.
1048 OverlapStmt = CaseRanges[i-1].second;
1052 // If we have a duplicate, report it.
1053 Diag(CR->getLHS()->getLocStart(), diag::err_duplicate_case)
1054 << OverlapVal.toString(10);
1055 Diag(OverlapStmt->getLHS()->getLocStart(),
1056 diag::note_duplicate_case_prev);
1057 // FIXME: We really want to remove the bogus case stmt from the
1058 // substmt, but we have no way to do this right now.
1059 CaseListIsErroneous = true;
1064 // Complain if we have a constant condition and we didn't find a match.
1065 if (!CaseListIsErroneous && ShouldCheckConstantCond) {
1066 // TODO: it would be nice if we printed enums as enums, chars as
1068 Diag(CondExpr->getExprLoc(), diag::warn_missing_case_for_condition)
1069 << ConstantCondValue.toString(10)
1070 << CondExpr->getSourceRange();
1073 // Check to see if switch is over an Enum and handles all of its
1074 // values. We only issue a warning if there is not 'default:', but
1075 // we still do the analysis to preserve this information in the AST
1076 // (which can be used by flow-based analyes).
1078 const EnumType *ET = CondTypeBeforePromotion->getAs<EnumType>();
1080 // If switch has default case, then ignore it.
1081 if (!CaseListIsErroneous && !HasConstantCond && ET &&
1082 ET->getDecl()->isCompleteDefinition()) {
1083 const EnumDecl *ED = ET->getDecl();
1084 EnumValsTy EnumVals;
1086 // Gather all enum values, set their type and sort them,
1087 // allowing easier comparison with CaseVals.
1088 for (auto *EDI : ED->enumerators()) {
1089 llvm::APSInt Val = EDI->getInitVal();
1090 AdjustAPSInt(Val, CondWidth, CondIsSigned);
1091 EnumVals.push_back(std::make_pair(Val, EDI));
1093 std::stable_sort(EnumVals.begin(), EnumVals.end(), CmpEnumVals);
1094 auto EI = EnumVals.begin(), EIEnd =
1095 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
1097 // See which case values aren't in enum.
1098 for (CaseValsTy::const_iterator CI = CaseVals.begin();
1099 CI != CaseVals.end(); CI++) {
1100 Expr *CaseExpr = CI->second->getLHS();
1101 if (ShouldDiagnoseSwitchCaseNotInEnum(*this, ED, CaseExpr, EI, EIEnd,
1103 Diag(CaseExpr->getExprLoc(), diag::warn_not_in_enum)
1104 << CondTypeBeforePromotion;
1107 // See which of case ranges aren't in enum
1108 EI = EnumVals.begin();
1109 for (CaseRangesTy::const_iterator RI = CaseRanges.begin();
1110 RI != CaseRanges.end(); RI++) {
1111 Expr *CaseExpr = RI->second->getLHS();
1112 if (ShouldDiagnoseSwitchCaseNotInEnum(*this, ED, CaseExpr, EI, EIEnd,
1114 Diag(CaseExpr->getExprLoc(), diag::warn_not_in_enum)
1115 << CondTypeBeforePromotion;
1118 RI->second->getRHS()->EvaluateKnownConstInt(Context);
1119 AdjustAPSInt(Hi, CondWidth, CondIsSigned);
1121 CaseExpr = RI->second->getRHS();
1122 if (ShouldDiagnoseSwitchCaseNotInEnum(*this, ED, CaseExpr, EI, EIEnd,
1124 Diag(CaseExpr->getExprLoc(), diag::warn_not_in_enum)
1125 << CondTypeBeforePromotion;
1128 // Check which enum vals aren't in switch
1129 auto CI = CaseVals.begin();
1130 auto RI = CaseRanges.begin();
1131 bool hasCasesNotInSwitch = false;
1133 SmallVector<DeclarationName,8> UnhandledNames;
1135 for (EI = EnumVals.begin(); EI != EIEnd; EI++){
1136 // Drop unneeded case values
1137 while (CI != CaseVals.end() && CI->first < EI->first)
1140 if (CI != CaseVals.end() && CI->first == EI->first)
1143 // Drop unneeded case ranges
1144 for (; RI != CaseRanges.end(); RI++) {
1146 RI->second->getRHS()->EvaluateKnownConstInt(Context);
1147 AdjustAPSInt(Hi, CondWidth, CondIsSigned);
1148 if (EI->first <= Hi)
1152 if (RI == CaseRanges.end() || EI->first < RI->first) {
1153 hasCasesNotInSwitch = true;
1154 UnhandledNames.push_back(EI->second->getDeclName());
1158 if (TheDefaultStmt && UnhandledNames.empty() && ED->isClosedNonFlag())
1159 Diag(TheDefaultStmt->getDefaultLoc(), diag::warn_unreachable_default);
1161 // Produce a nice diagnostic if multiple values aren't handled.
1162 if (!UnhandledNames.empty()) {
1163 DiagnosticBuilder DB = Diag(CondExpr->getExprLoc(),
1164 TheDefaultStmt ? diag::warn_def_missing_case
1165 : diag::warn_missing_case)
1166 << (int)UnhandledNames.size();
1168 for (size_t I = 0, E = std::min(UnhandledNames.size(), (size_t)3);
1170 DB << UnhandledNames[I];
1173 if (!hasCasesNotInSwitch)
1174 SS->setAllEnumCasesCovered();
1179 DiagnoseEmptyStmtBody(CondExpr->getLocEnd(), BodyStmt,
1180 diag::warn_empty_switch_body);
1182 // FIXME: If the case list was broken is some way, we don't have a good system
1183 // to patch it up. Instead, just return the whole substmt as broken.
1184 if (CaseListIsErroneous)
1191 Sema::DiagnoseAssignmentEnum(QualType DstType, QualType SrcType,
1193 if (Diags.isIgnored(diag::warn_not_in_enum_assignment, SrcExpr->getExprLoc()))
1196 if (const EnumType *ET = DstType->getAs<EnumType>())
1197 if (!Context.hasSameUnqualifiedType(SrcType, DstType) &&
1198 SrcType->isIntegerType()) {
1199 if (!SrcExpr->isTypeDependent() && !SrcExpr->isValueDependent() &&
1200 SrcExpr->isIntegerConstantExpr(Context)) {
1201 // Get the bitwidth of the enum value before promotions.
1202 unsigned DstWidth = Context.getIntWidth(DstType);
1203 bool DstIsSigned = DstType->isSignedIntegerOrEnumerationType();
1205 llvm::APSInt RhsVal = SrcExpr->EvaluateKnownConstInt(Context);
1206 AdjustAPSInt(RhsVal, DstWidth, DstIsSigned);
1207 const EnumDecl *ED = ET->getDecl();
1209 if (!ED->isClosed())
1212 if (ED->hasAttr<FlagEnumAttr>()) {
1213 if (!IsValueInFlagEnum(ED, RhsVal, true))
1214 Diag(SrcExpr->getExprLoc(), diag::warn_not_in_enum_assignment)
1215 << DstType.getUnqualifiedType();
1217 typedef SmallVector<std::pair<llvm::APSInt, EnumConstantDecl *>, 64>
1219 EnumValsTy EnumVals;
1221 // Gather all enum values, set their type and sort them,
1222 // allowing easier comparison with rhs constant.
1223 for (auto *EDI : ED->enumerators()) {
1224 llvm::APSInt Val = EDI->getInitVal();
1225 AdjustAPSInt(Val, DstWidth, DstIsSigned);
1226 EnumVals.push_back(std::make_pair(Val, EDI));
1228 if (EnumVals.empty())
1230 std::stable_sort(EnumVals.begin(), EnumVals.end(), CmpEnumVals);
1231 EnumValsTy::iterator EIend =
1232 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
1234 // See which values aren't in the enum.
1235 EnumValsTy::const_iterator EI = EnumVals.begin();
1236 while (EI != EIend && EI->first < RhsVal)
1238 if (EI == EIend || EI->first != RhsVal) {
1239 Diag(SrcExpr->getExprLoc(), diag::warn_not_in_enum_assignment)
1240 << DstType.getUnqualifiedType();
1247 StmtResult Sema::ActOnWhileStmt(SourceLocation WhileLoc, ConditionResult Cond,
1249 if (Cond.isInvalid())
1252 auto CondVal = Cond.get();
1253 CheckBreakContinueBinding(CondVal.second);
1255 if (CondVal.second &&
1256 !Diags.isIgnored(diag::warn_comma_operator, CondVal.second->getExprLoc()))
1257 CommaVisitor(*this).Visit(CondVal.second);
1259 DiagnoseUnusedExprResult(Body);
1261 if (isa<NullStmt>(Body))
1262 getCurCompoundScope().setHasEmptyLoopBodies();
1264 return new (Context)
1265 WhileStmt(Context, CondVal.first, CondVal.second, Body, WhileLoc);
1269 Sema::ActOnDoStmt(SourceLocation DoLoc, Stmt *Body,
1270 SourceLocation WhileLoc, SourceLocation CondLParen,
1271 Expr *Cond, SourceLocation CondRParen) {
1272 assert(Cond && "ActOnDoStmt(): missing expression");
1274 CheckBreakContinueBinding(Cond);
1275 ExprResult CondResult = CheckBooleanCondition(DoLoc, Cond);
1276 if (CondResult.isInvalid())
1278 Cond = CondResult.get();
1280 CondResult = ActOnFinishFullExpr(Cond, DoLoc);
1281 if (CondResult.isInvalid())
1283 Cond = CondResult.get();
1285 DiagnoseUnusedExprResult(Body);
1287 return new (Context) DoStmt(Body, Cond, DoLoc, WhileLoc, CondRParen);
1291 // This visitor will traverse a conditional statement and store all
1292 // the evaluated decls into a vector. Simple is set to true if none
1293 // of the excluded constructs are used.
1294 class DeclExtractor : public EvaluatedExprVisitor<DeclExtractor> {
1295 llvm::SmallPtrSetImpl<VarDecl*> &Decls;
1296 SmallVectorImpl<SourceRange> &Ranges;
1299 typedef EvaluatedExprVisitor<DeclExtractor> Inherited;
1301 DeclExtractor(Sema &S, llvm::SmallPtrSetImpl<VarDecl*> &Decls,
1302 SmallVectorImpl<SourceRange> &Ranges) :
1303 Inherited(S.Context),
1308 bool isSimple() { return Simple; }
1310 // Replaces the method in EvaluatedExprVisitor.
1311 void VisitMemberExpr(MemberExpr* E) {
1315 // Any Stmt not whitelisted will cause the condition to be marked complex.
1316 void VisitStmt(Stmt *S) {
1320 void VisitBinaryOperator(BinaryOperator *E) {
1325 void VisitCastExpr(CastExpr *E) {
1326 Visit(E->getSubExpr());
1329 void VisitUnaryOperator(UnaryOperator *E) {
1330 // Skip checking conditionals with derefernces.
1331 if (E->getOpcode() == UO_Deref)
1334 Visit(E->getSubExpr());
1337 void VisitConditionalOperator(ConditionalOperator *E) {
1338 Visit(E->getCond());
1339 Visit(E->getTrueExpr());
1340 Visit(E->getFalseExpr());
1343 void VisitParenExpr(ParenExpr *E) {
1344 Visit(E->getSubExpr());
1347 void VisitBinaryConditionalOperator(BinaryConditionalOperator *E) {
1348 Visit(E->getOpaqueValue()->getSourceExpr());
1349 Visit(E->getFalseExpr());
1352 void VisitIntegerLiteral(IntegerLiteral *E) { }
1353 void VisitFloatingLiteral(FloatingLiteral *E) { }
1354 void VisitCXXBoolLiteralExpr(CXXBoolLiteralExpr *E) { }
1355 void VisitCharacterLiteral(CharacterLiteral *E) { }
1356 void VisitGNUNullExpr(GNUNullExpr *E) { }
1357 void VisitImaginaryLiteral(ImaginaryLiteral *E) { }
1359 void VisitDeclRefExpr(DeclRefExpr *E) {
1360 VarDecl *VD = dyn_cast<VarDecl>(E->getDecl());
1363 Ranges.push_back(E->getSourceRange());
1368 }; // end class DeclExtractor
1370 // DeclMatcher checks to see if the decls are used in a non-evaluated
1372 class DeclMatcher : public EvaluatedExprVisitor<DeclMatcher> {
1373 llvm::SmallPtrSetImpl<VarDecl*> &Decls;
1377 typedef EvaluatedExprVisitor<DeclMatcher> Inherited;
1379 DeclMatcher(Sema &S, llvm::SmallPtrSetImpl<VarDecl*> &Decls,
1381 Inherited(S.Context), Decls(Decls), FoundDecl(false) {
1382 if (!Statement) return;
1387 void VisitReturnStmt(ReturnStmt *S) {
1391 void VisitBreakStmt(BreakStmt *S) {
1395 void VisitGotoStmt(GotoStmt *S) {
1399 void VisitCastExpr(CastExpr *E) {
1400 if (E->getCastKind() == CK_LValueToRValue)
1401 CheckLValueToRValueCast(E->getSubExpr());
1403 Visit(E->getSubExpr());
1406 void CheckLValueToRValueCast(Expr *E) {
1407 E = E->IgnoreParenImpCasts();
1409 if (isa<DeclRefExpr>(E)) {
1413 if (ConditionalOperator *CO = dyn_cast<ConditionalOperator>(E)) {
1414 Visit(CO->getCond());
1415 CheckLValueToRValueCast(CO->getTrueExpr());
1416 CheckLValueToRValueCast(CO->getFalseExpr());
1420 if (BinaryConditionalOperator *BCO =
1421 dyn_cast<BinaryConditionalOperator>(E)) {
1422 CheckLValueToRValueCast(BCO->getOpaqueValue()->getSourceExpr());
1423 CheckLValueToRValueCast(BCO->getFalseExpr());
1430 void VisitDeclRefExpr(DeclRefExpr *E) {
1431 if (VarDecl *VD = dyn_cast<VarDecl>(E->getDecl()))
1432 if (Decls.count(VD))
1436 void VisitPseudoObjectExpr(PseudoObjectExpr *POE) {
1437 // Only need to visit the semantics for POE.
1438 // SyntaticForm doesn't really use the Decal.
1439 for (auto *S : POE->semantics()) {
1440 if (auto *OVE = dyn_cast<OpaqueValueExpr>(S))
1441 // Look past the OVE into the expression it binds.
1442 Visit(OVE->getSourceExpr());
1448 bool FoundDeclInUse() { return FoundDecl; }
1450 }; // end class DeclMatcher
1452 void CheckForLoopConditionalStatement(Sema &S, Expr *Second,
1453 Expr *Third, Stmt *Body) {
1454 // Condition is empty
1455 if (!Second) return;
1457 if (S.Diags.isIgnored(diag::warn_variables_not_in_loop_body,
1458 Second->getLocStart()))
1461 PartialDiagnostic PDiag = S.PDiag(diag::warn_variables_not_in_loop_body);
1462 llvm::SmallPtrSet<VarDecl*, 8> Decls;
1463 SmallVector<SourceRange, 10> Ranges;
1464 DeclExtractor DE(S, Decls, Ranges);
1467 // Don't analyze complex conditionals.
1468 if (!DE.isSimple()) return;
1471 if (Decls.size() == 0) return;
1473 // Don't warn on volatile, static, or global variables.
1474 for (llvm::SmallPtrSetImpl<VarDecl*>::iterator I = Decls.begin(),
1477 if ((*I)->getType().isVolatileQualified() ||
1478 (*I)->hasGlobalStorage()) return;
1480 if (DeclMatcher(S, Decls, Second).FoundDeclInUse() ||
1481 DeclMatcher(S, Decls, Third).FoundDeclInUse() ||
1482 DeclMatcher(S, Decls, Body).FoundDeclInUse())
1485 // Load decl names into diagnostic.
1486 if (Decls.size() > 4)
1489 PDiag << Decls.size();
1490 for (llvm::SmallPtrSetImpl<VarDecl*>::iterator I = Decls.begin(),
1493 PDiag << (*I)->getDeclName();
1496 // Load SourceRanges into diagnostic if there is room.
1497 // Otherwise, load the SourceRange of the conditional expression.
1498 if (Ranges.size() <= PartialDiagnostic::MaxArguments)
1499 for (SmallVectorImpl<SourceRange>::iterator I = Ranges.begin(),
1504 PDiag << Second->getSourceRange();
1506 S.Diag(Ranges.begin()->getBegin(), PDiag);
1509 // If Statement is an incemement or decrement, return true and sets the
1510 // variables Increment and DRE.
1511 bool ProcessIterationStmt(Sema &S, Stmt* Statement, bool &Increment,
1512 DeclRefExpr *&DRE) {
1513 if (auto Cleanups = dyn_cast<ExprWithCleanups>(Statement))
1514 if (!Cleanups->cleanupsHaveSideEffects())
1515 Statement = Cleanups->getSubExpr();
1517 if (UnaryOperator *UO = dyn_cast<UnaryOperator>(Statement)) {
1518 switch (UO->getOpcode()) {
1519 default: return false;
1529 DRE = dyn_cast<DeclRefExpr>(UO->getSubExpr());
1533 if (CXXOperatorCallExpr *Call = dyn_cast<CXXOperatorCallExpr>(Statement)) {
1534 FunctionDecl *FD = Call->getDirectCallee();
1535 if (!FD || !FD->isOverloadedOperator()) return false;
1536 switch (FD->getOverloadedOperator()) {
1537 default: return false;
1545 DRE = dyn_cast<DeclRefExpr>(Call->getArg(0));
1552 // A visitor to determine if a continue or break statement is a
1554 class BreakContinueFinder : public EvaluatedExprVisitor<BreakContinueFinder> {
1555 SourceLocation BreakLoc;
1556 SourceLocation ContinueLoc;
1558 BreakContinueFinder(Sema &S, Stmt* Body) :
1559 Inherited(S.Context) {
1563 typedef EvaluatedExprVisitor<BreakContinueFinder> Inherited;
1565 void VisitContinueStmt(ContinueStmt* E) {
1566 ContinueLoc = E->getContinueLoc();
1569 void VisitBreakStmt(BreakStmt* E) {
1570 BreakLoc = E->getBreakLoc();
1573 bool ContinueFound() { return ContinueLoc.isValid(); }
1574 bool BreakFound() { return BreakLoc.isValid(); }
1575 SourceLocation GetContinueLoc() { return ContinueLoc; }
1576 SourceLocation GetBreakLoc() { return BreakLoc; }
1578 }; // end class BreakContinueFinder
1580 // Emit a warning when a loop increment/decrement appears twice per loop
1581 // iteration. The conditions which trigger this warning are:
1582 // 1) The last statement in the loop body and the third expression in the
1583 // for loop are both increment or both decrement of the same variable
1584 // 2) No continue statements in the loop body.
1585 void CheckForRedundantIteration(Sema &S, Expr *Third, Stmt *Body) {
1586 // Return when there is nothing to check.
1587 if (!Body || !Third) return;
1589 if (S.Diags.isIgnored(diag::warn_redundant_loop_iteration,
1590 Third->getLocStart()))
1593 // Get the last statement from the loop body.
1594 CompoundStmt *CS = dyn_cast<CompoundStmt>(Body);
1595 if (!CS || CS->body_empty()) return;
1596 Stmt *LastStmt = CS->body_back();
1597 if (!LastStmt) return;
1599 bool LoopIncrement, LastIncrement;
1600 DeclRefExpr *LoopDRE, *LastDRE;
1602 if (!ProcessIterationStmt(S, Third, LoopIncrement, LoopDRE)) return;
1603 if (!ProcessIterationStmt(S, LastStmt, LastIncrement, LastDRE)) return;
1605 // Check that the two statements are both increments or both decrements
1606 // on the same variable.
1607 if (LoopIncrement != LastIncrement ||
1608 LoopDRE->getDecl() != LastDRE->getDecl()) return;
1610 if (BreakContinueFinder(S, Body).ContinueFound()) return;
1612 S.Diag(LastDRE->getLocation(), diag::warn_redundant_loop_iteration)
1613 << LastDRE->getDecl() << LastIncrement;
1614 S.Diag(LoopDRE->getLocation(), diag::note_loop_iteration_here)
1621 void Sema::CheckBreakContinueBinding(Expr *E) {
1622 if (!E || getLangOpts().CPlusPlus)
1624 BreakContinueFinder BCFinder(*this, E);
1625 Scope *BreakParent = CurScope->getBreakParent();
1626 if (BCFinder.BreakFound() && BreakParent) {
1627 if (BreakParent->getFlags() & Scope::SwitchScope) {
1628 Diag(BCFinder.GetBreakLoc(), diag::warn_break_binds_to_switch);
1630 Diag(BCFinder.GetBreakLoc(), diag::warn_loop_ctrl_binds_to_inner)
1633 } else if (BCFinder.ContinueFound() && CurScope->getContinueParent()) {
1634 Diag(BCFinder.GetContinueLoc(), diag::warn_loop_ctrl_binds_to_inner)
1639 StmtResult Sema::ActOnForStmt(SourceLocation ForLoc, SourceLocation LParenLoc,
1640 Stmt *First, ConditionResult Second,
1641 FullExprArg third, SourceLocation RParenLoc,
1643 if (Second.isInvalid())
1646 if (!getLangOpts().CPlusPlus) {
1647 if (DeclStmt *DS = dyn_cast_or_null<DeclStmt>(First)) {
1648 // C99 6.8.5p3: The declaration part of a 'for' statement shall only
1649 // declare identifiers for objects having storage class 'auto' or
1651 for (auto *DI : DS->decls()) {
1652 VarDecl *VD = dyn_cast<VarDecl>(DI);
1653 if (VD && VD->isLocalVarDecl() && !VD->hasLocalStorage())
1656 Diag(DI->getLocation(), diag::err_non_local_variable_decl_in_for);
1657 DI->setInvalidDecl();
1663 CheckBreakContinueBinding(Second.get().second);
1664 CheckBreakContinueBinding(third.get());
1666 if (!Second.get().first)
1667 CheckForLoopConditionalStatement(*this, Second.get().second, third.get(),
1669 CheckForRedundantIteration(*this, third.get(), Body);
1671 if (Second.get().second &&
1672 !Diags.isIgnored(diag::warn_comma_operator,
1673 Second.get().second->getExprLoc()))
1674 CommaVisitor(*this).Visit(Second.get().second);
1676 Expr *Third = third.release().getAs<Expr>();
1678 DiagnoseUnusedExprResult(First);
1679 DiagnoseUnusedExprResult(Third);
1680 DiagnoseUnusedExprResult(Body);
1682 if (isa<NullStmt>(Body))
1683 getCurCompoundScope().setHasEmptyLoopBodies();
1685 return new (Context)
1686 ForStmt(Context, First, Second.get().second, Second.get().first, Third,
1687 Body, ForLoc, LParenLoc, RParenLoc);
1690 /// In an Objective C collection iteration statement:
1692 /// x can be an arbitrary l-value expression. Bind it up as a
1693 /// full-expression.
1694 StmtResult Sema::ActOnForEachLValueExpr(Expr *E) {
1695 // Reduce placeholder expressions here. Note that this rejects the
1696 // use of pseudo-object l-values in this position.
1697 ExprResult result = CheckPlaceholderExpr(E);
1698 if (result.isInvalid()) return StmtError();
1701 ExprResult FullExpr = ActOnFinishFullExpr(E);
1702 if (FullExpr.isInvalid())
1704 return StmtResult(static_cast<Stmt*>(FullExpr.get()));
1708 Sema::CheckObjCForCollectionOperand(SourceLocation forLoc, Expr *collection) {
1712 ExprResult result = CorrectDelayedTyposInExpr(collection);
1713 if (!result.isUsable())
1715 collection = result.get();
1717 // Bail out early if we've got a type-dependent expression.
1718 if (collection->isTypeDependent()) return collection;
1720 // Perform normal l-value conversion.
1721 result = DefaultFunctionArrayLvalueConversion(collection);
1722 if (result.isInvalid())
1724 collection = result.get();
1726 // The operand needs to have object-pointer type.
1727 // TODO: should we do a contextual conversion?
1728 const ObjCObjectPointerType *pointerType =
1729 collection->getType()->getAs<ObjCObjectPointerType>();
1731 return Diag(forLoc, diag::err_collection_expr_type)
1732 << collection->getType() << collection->getSourceRange();
1734 // Check that the operand provides
1735 // - countByEnumeratingWithState:objects:count:
1736 const ObjCObjectType *objectType = pointerType->getObjectType();
1737 ObjCInterfaceDecl *iface = objectType->getInterface();
1739 // If we have a forward-declared type, we can't do this check.
1740 // Under ARC, it is an error not to have a forward-declared class.
1742 (getLangOpts().ObjCAutoRefCount
1743 ? RequireCompleteType(forLoc, QualType(objectType, 0),
1744 diag::err_arc_collection_forward, collection)
1745 : !isCompleteType(forLoc, QualType(objectType, 0)))) {
1746 // Otherwise, if we have any useful type information, check that
1747 // the type declares the appropriate method.
1748 } else if (iface || !objectType->qual_empty()) {
1749 IdentifierInfo *selectorIdents[] = {
1750 &Context.Idents.get("countByEnumeratingWithState"),
1751 &Context.Idents.get("objects"),
1752 &Context.Idents.get("count")
1754 Selector selector = Context.Selectors.getSelector(3, &selectorIdents[0]);
1756 ObjCMethodDecl *method = nullptr;
1758 // If there's an interface, look in both the public and private APIs.
1760 method = iface->lookupInstanceMethod(selector);
1761 if (!method) method = iface->lookupPrivateMethod(selector);
1764 // Also check protocol qualifiers.
1766 method = LookupMethodInQualifiedType(selector, pointerType,
1769 // If we didn't find it anywhere, give up.
1771 Diag(forLoc, diag::warn_collection_expr_type)
1772 << collection->getType() << selector << collection->getSourceRange();
1775 // TODO: check for an incompatible signature?
1778 // Wrap up any cleanups in the expression.
1783 Sema::ActOnObjCForCollectionStmt(SourceLocation ForLoc,
1784 Stmt *First, Expr *collection,
1785 SourceLocation RParenLoc) {
1786 getCurFunction()->setHasBranchProtectedScope();
1788 ExprResult CollectionExprResult =
1789 CheckObjCForCollectionOperand(ForLoc, collection);
1793 if (DeclStmt *DS = dyn_cast<DeclStmt>(First)) {
1794 if (!DS->isSingleDecl())
1795 return StmtError(Diag((*DS->decl_begin())->getLocation(),
1796 diag::err_toomany_element_decls));
1798 VarDecl *D = dyn_cast<VarDecl>(DS->getSingleDecl());
1799 if (!D || D->isInvalidDecl())
1802 FirstType = D->getType();
1803 // C99 6.8.5p3: The declaration part of a 'for' statement shall only
1804 // declare identifiers for objects having storage class 'auto' or
1806 if (!D->hasLocalStorage())
1807 return StmtError(Diag(D->getLocation(),
1808 diag::err_non_local_variable_decl_in_for));
1810 // If the type contained 'auto', deduce the 'auto' to 'id'.
1811 if (FirstType->getContainedAutoType()) {
1812 OpaqueValueExpr OpaqueId(D->getLocation(), Context.getObjCIdType(),
1814 Expr *DeducedInit = &OpaqueId;
1815 if (DeduceAutoType(D->getTypeSourceInfo(), DeducedInit, FirstType) ==
1817 DiagnoseAutoDeductionFailure(D, DeducedInit);
1818 if (FirstType.isNull()) {
1819 D->setInvalidDecl();
1823 D->setType(FirstType);
1825 if (!inTemplateInstantiation()) {
1826 SourceLocation Loc =
1827 D->getTypeSourceInfo()->getTypeLoc().getBeginLoc();
1828 Diag(Loc, diag::warn_auto_var_is_id)
1829 << D->getDeclName();
1834 Expr *FirstE = cast<Expr>(First);
1835 if (!FirstE->isTypeDependent() && !FirstE->isLValue())
1836 return StmtError(Diag(First->getLocStart(),
1837 diag::err_selector_element_not_lvalue)
1838 << First->getSourceRange());
1840 FirstType = static_cast<Expr*>(First)->getType();
1841 if (FirstType.isConstQualified())
1842 Diag(ForLoc, diag::err_selector_element_const_type)
1843 << FirstType << First->getSourceRange();
1845 if (!FirstType->isDependentType() &&
1846 !FirstType->isObjCObjectPointerType() &&
1847 !FirstType->isBlockPointerType())
1848 return StmtError(Diag(ForLoc, diag::err_selector_element_type)
1849 << FirstType << First->getSourceRange());
1852 if (CollectionExprResult.isInvalid())
1855 CollectionExprResult = ActOnFinishFullExpr(CollectionExprResult.get());
1856 if (CollectionExprResult.isInvalid())
1859 return new (Context) ObjCForCollectionStmt(First, CollectionExprResult.get(),
1860 nullptr, ForLoc, RParenLoc);
1863 /// Finish building a variable declaration for a for-range statement.
1864 /// \return true if an error occurs.
1865 static bool FinishForRangeVarDecl(Sema &SemaRef, VarDecl *Decl, Expr *Init,
1866 SourceLocation Loc, int DiagID) {
1867 if (Decl->getType()->isUndeducedType()) {
1868 ExprResult Res = SemaRef.CorrectDelayedTyposInExpr(Init);
1869 if (!Res.isUsable()) {
1870 Decl->setInvalidDecl();
1876 // Deduce the type for the iterator variable now rather than leaving it to
1877 // AddInitializerToDecl, so we can produce a more suitable diagnostic.
1879 if ((!isa<InitListExpr>(Init) && Init->getType()->isVoidType()) ||
1880 SemaRef.DeduceAutoType(Decl->getTypeSourceInfo(), Init, InitType) ==
1882 SemaRef.Diag(Loc, DiagID) << Init->getType();
1883 if (InitType.isNull()) {
1884 Decl->setInvalidDecl();
1887 Decl->setType(InitType);
1889 // In ARC, infer lifetime.
1890 // FIXME: ARC may want to turn this into 'const __unsafe_unretained' if
1891 // we're doing the equivalent of fast iteration.
1892 if (SemaRef.getLangOpts().ObjCAutoRefCount &&
1893 SemaRef.inferObjCARCLifetime(Decl))
1894 Decl->setInvalidDecl();
1896 SemaRef.AddInitializerToDecl(Decl, Init, /*DirectInit=*/false);
1897 SemaRef.FinalizeDeclaration(Decl);
1898 SemaRef.CurContext->addHiddenDecl(Decl);
1903 // An enum to represent whether something is dealing with a call to begin()
1904 // or a call to end() in a range-based for loop.
1905 enum BeginEndFunction {
1910 /// Produce a note indicating which begin/end function was implicitly called
1911 /// by a C++11 for-range statement. This is often not obvious from the code,
1912 /// nor from the diagnostics produced when analysing the implicit expressions
1913 /// required in a for-range statement.
1914 void NoteForRangeBeginEndFunction(Sema &SemaRef, Expr *E,
1915 BeginEndFunction BEF) {
1916 CallExpr *CE = dyn_cast<CallExpr>(E);
1919 FunctionDecl *D = dyn_cast<FunctionDecl>(CE->getCalleeDecl());
1922 SourceLocation Loc = D->getLocation();
1924 std::string Description;
1925 bool IsTemplate = false;
1926 if (FunctionTemplateDecl *FunTmpl = D->getPrimaryTemplate()) {
1927 Description = SemaRef.getTemplateArgumentBindingsText(
1928 FunTmpl->getTemplateParameters(), *D->getTemplateSpecializationArgs());
1932 SemaRef.Diag(Loc, diag::note_for_range_begin_end)
1933 << BEF << IsTemplate << Description << E->getType();
1936 /// Build a variable declaration for a for-range statement.
1937 VarDecl *BuildForRangeVarDecl(Sema &SemaRef, SourceLocation Loc,
1938 QualType Type, const char *Name) {
1939 DeclContext *DC = SemaRef.CurContext;
1940 IdentifierInfo *II = &SemaRef.PP.getIdentifierTable().get(Name);
1941 TypeSourceInfo *TInfo = SemaRef.Context.getTrivialTypeSourceInfo(Type, Loc);
1942 VarDecl *Decl = VarDecl::Create(SemaRef.Context, DC, Loc, Loc, II, Type,
1944 Decl->setImplicit();
1950 static bool ObjCEnumerationCollection(Expr *Collection) {
1951 return !Collection->isTypeDependent()
1952 && Collection->getType()->getAs<ObjCObjectPointerType>() != nullptr;
1955 /// ActOnCXXForRangeStmt - Check and build a C++11 for-range statement.
1957 /// C++11 [stmt.ranged]:
1958 /// A range-based for statement is equivalent to
1961 /// auto && __range = range-init;
1962 /// for ( auto __begin = begin-expr,
1963 /// __end = end-expr;
1964 /// __begin != __end;
1966 /// for-range-declaration = *__begin;
1971 /// The body of the loop is not available yet, since it cannot be analysed until
1972 /// we have determined the type of the for-range-declaration.
1973 StmtResult Sema::ActOnCXXForRangeStmt(Scope *S, SourceLocation ForLoc,
1974 SourceLocation CoawaitLoc, Stmt *First,
1975 SourceLocation ColonLoc, Expr *Range,
1976 SourceLocation RParenLoc,
1977 BuildForRangeKind Kind) {
1981 if (Range && ObjCEnumerationCollection(Range))
1982 return ActOnObjCForCollectionStmt(ForLoc, First, Range, RParenLoc);
1984 DeclStmt *DS = dyn_cast<DeclStmt>(First);
1985 assert(DS && "first part of for range not a decl stmt");
1987 if (!DS->isSingleDecl()) {
1988 Diag(DS->getStartLoc(), diag::err_type_defined_in_for_range);
1992 Decl *LoopVar = DS->getSingleDecl();
1993 if (LoopVar->isInvalidDecl() || !Range ||
1994 DiagnoseUnexpandedParameterPack(Range, UPPC_Expression)) {
1995 LoopVar->setInvalidDecl();
1999 // Coroutines: 'for co_await' implicitly co_awaits its range.
2000 if (CoawaitLoc.isValid()) {
2001 ExprResult Coawait = ActOnCoawaitExpr(S, CoawaitLoc, Range);
2002 if (Coawait.isInvalid()) return StmtError();
2003 Range = Coawait.get();
2006 // Build auto && __range = range-init
2007 SourceLocation RangeLoc = Range->getLocStart();
2008 VarDecl *RangeVar = BuildForRangeVarDecl(*this, RangeLoc,
2009 Context.getAutoRRefDeductType(),
2011 if (FinishForRangeVarDecl(*this, RangeVar, Range, RangeLoc,
2012 diag::err_for_range_deduction_failure)) {
2013 LoopVar->setInvalidDecl();
2017 // Claim the type doesn't contain auto: we've already done the checking.
2018 DeclGroupPtrTy RangeGroup =
2019 BuildDeclaratorGroup(MutableArrayRef<Decl *>((Decl **)&RangeVar, 1));
2020 StmtResult RangeDecl = ActOnDeclStmt(RangeGroup, RangeLoc, RangeLoc);
2021 if (RangeDecl.isInvalid()) {
2022 LoopVar->setInvalidDecl();
2026 return BuildCXXForRangeStmt(ForLoc, CoawaitLoc, ColonLoc, RangeDecl.get(),
2027 /*BeginStmt=*/nullptr, /*EndStmt=*/nullptr,
2028 /*Cond=*/nullptr, /*Inc=*/nullptr,
2029 DS, RParenLoc, Kind);
2032 /// \brief Create the initialization, compare, and increment steps for
2033 /// the range-based for loop expression.
2034 /// This function does not handle array-based for loops,
2035 /// which are created in Sema::BuildCXXForRangeStmt.
2037 /// \returns a ForRangeStatus indicating success or what kind of error occurred.
2038 /// BeginExpr and EndExpr are set and FRS_Success is returned on success;
2039 /// CandidateSet and BEF are set and some non-success value is returned on
2041 static Sema::ForRangeStatus BuildNonArrayForRange(Sema &SemaRef,
2042 Expr *BeginRange, Expr *EndRange,
2046 SourceLocation ColonLoc,
2047 OverloadCandidateSet *CandidateSet,
2048 ExprResult *BeginExpr,
2049 ExprResult *EndExpr,
2050 BeginEndFunction *BEF) {
2051 DeclarationNameInfo BeginNameInfo(
2052 &SemaRef.PP.getIdentifierTable().get("begin"), ColonLoc);
2053 DeclarationNameInfo EndNameInfo(&SemaRef.PP.getIdentifierTable().get("end"),
2056 LookupResult BeginMemberLookup(SemaRef, BeginNameInfo,
2057 Sema::LookupMemberName);
2058 LookupResult EndMemberLookup(SemaRef, EndNameInfo, Sema::LookupMemberName);
2060 if (CXXRecordDecl *D = RangeType->getAsCXXRecordDecl()) {
2061 // - if _RangeT is a class type, the unqualified-ids begin and end are
2062 // looked up in the scope of class _RangeT as if by class member access
2063 // lookup (3.4.5), and if either (or both) finds at least one
2064 // declaration, begin-expr and end-expr are __range.begin() and
2065 // __range.end(), respectively;
2066 SemaRef.LookupQualifiedName(BeginMemberLookup, D);
2067 SemaRef.LookupQualifiedName(EndMemberLookup, D);
2069 if (BeginMemberLookup.empty() != EndMemberLookup.empty()) {
2070 SourceLocation RangeLoc = BeginVar->getLocation();
2071 *BEF = BeginMemberLookup.empty() ? BEF_end : BEF_begin;
2073 SemaRef.Diag(RangeLoc, diag::err_for_range_member_begin_end_mismatch)
2074 << RangeLoc << BeginRange->getType() << *BEF;
2075 return Sema::FRS_DiagnosticIssued;
2078 // - otherwise, begin-expr and end-expr are begin(__range) and
2079 // end(__range), respectively, where begin and end are looked up with
2080 // argument-dependent lookup (3.4.2). For the purposes of this name
2081 // lookup, namespace std is an associated namespace.
2086 Sema::ForRangeStatus RangeStatus =
2087 SemaRef.BuildForRangeBeginEndCall(ColonLoc, ColonLoc, BeginNameInfo,
2088 BeginMemberLookup, CandidateSet,
2089 BeginRange, BeginExpr);
2091 if (RangeStatus != Sema::FRS_Success) {
2092 if (RangeStatus == Sema::FRS_DiagnosticIssued)
2093 SemaRef.Diag(BeginRange->getLocStart(), diag::note_in_for_range)
2094 << ColonLoc << BEF_begin << BeginRange->getType();
2097 if (FinishForRangeVarDecl(SemaRef, BeginVar, BeginExpr->get(), ColonLoc,
2098 diag::err_for_range_iter_deduction_failure)) {
2099 NoteForRangeBeginEndFunction(SemaRef, BeginExpr->get(), *BEF);
2100 return Sema::FRS_DiagnosticIssued;
2105 SemaRef.BuildForRangeBeginEndCall(ColonLoc, ColonLoc, EndNameInfo,
2106 EndMemberLookup, CandidateSet,
2108 if (RangeStatus != Sema::FRS_Success) {
2109 if (RangeStatus == Sema::FRS_DiagnosticIssued)
2110 SemaRef.Diag(EndRange->getLocStart(), diag::note_in_for_range)
2111 << ColonLoc << BEF_end << EndRange->getType();
2114 if (FinishForRangeVarDecl(SemaRef, EndVar, EndExpr->get(), ColonLoc,
2115 diag::err_for_range_iter_deduction_failure)) {
2116 NoteForRangeBeginEndFunction(SemaRef, EndExpr->get(), *BEF);
2117 return Sema::FRS_DiagnosticIssued;
2119 return Sema::FRS_Success;
2122 /// Speculatively attempt to dereference an invalid range expression.
2123 /// If the attempt fails, this function will return a valid, null StmtResult
2124 /// and emit no diagnostics.
2125 static StmtResult RebuildForRangeWithDereference(Sema &SemaRef, Scope *S,
2126 SourceLocation ForLoc,
2127 SourceLocation CoawaitLoc,
2129 SourceLocation ColonLoc,
2131 SourceLocation RangeLoc,
2132 SourceLocation RParenLoc) {
2133 // Determine whether we can rebuild the for-range statement with a
2134 // dereferenced range expression.
2135 ExprResult AdjustedRange;
2137 Sema::SFINAETrap Trap(SemaRef);
2139 AdjustedRange = SemaRef.BuildUnaryOp(S, RangeLoc, UO_Deref, Range);
2140 if (AdjustedRange.isInvalid())
2141 return StmtResult();
2143 StmtResult SR = SemaRef.ActOnCXXForRangeStmt(
2144 S, ForLoc, CoawaitLoc, LoopVarDecl, ColonLoc, AdjustedRange.get(),
2145 RParenLoc, Sema::BFRK_Check);
2147 return StmtResult();
2150 // The attempt to dereference worked well enough that it could produce a valid
2151 // loop. Produce a fixit, and rebuild the loop with diagnostics enabled, in
2152 // case there are any other (non-fatal) problems with it.
2153 SemaRef.Diag(RangeLoc, diag::err_for_range_dereference)
2154 << Range->getType() << FixItHint::CreateInsertion(RangeLoc, "*");
2155 return SemaRef.ActOnCXXForRangeStmt(S, ForLoc, CoawaitLoc, LoopVarDecl,
2156 ColonLoc, AdjustedRange.get(), RParenLoc,
2157 Sema::BFRK_Rebuild);
2161 /// RAII object to automatically invalidate a declaration if an error occurs.
2162 struct InvalidateOnErrorScope {
2163 InvalidateOnErrorScope(Sema &SemaRef, Decl *D, bool Enabled)
2164 : Trap(SemaRef.Diags), D(D), Enabled(Enabled) {}
2165 ~InvalidateOnErrorScope() {
2166 if (Enabled && Trap.hasErrorOccurred())
2167 D->setInvalidDecl();
2170 DiagnosticErrorTrap Trap;
2176 /// BuildCXXForRangeStmt - Build or instantiate a C++11 for-range statement.
2178 Sema::BuildCXXForRangeStmt(SourceLocation ForLoc, SourceLocation CoawaitLoc,
2179 SourceLocation ColonLoc, Stmt *RangeDecl,
2180 Stmt *Begin, Stmt *End, Expr *Cond,
2181 Expr *Inc, Stmt *LoopVarDecl,
2182 SourceLocation RParenLoc, BuildForRangeKind Kind) {
2183 // FIXME: This should not be used during template instantiation. We should
2184 // pick up the set of unqualified lookup results for the != and + operators
2185 // in the initial parse.
2187 // Testcase (accepts-invalid):
2188 // template<typename T> void f() { for (auto x : T()) {} }
2189 // namespace N { struct X { X begin(); X end(); int operator*(); }; }
2190 // bool operator!=(N::X, N::X); void operator++(N::X);
2191 // void g() { f<N::X>(); }
2192 Scope *S = getCurScope();
2194 DeclStmt *RangeDS = cast<DeclStmt>(RangeDecl);
2195 VarDecl *RangeVar = cast<VarDecl>(RangeDS->getSingleDecl());
2196 QualType RangeVarType = RangeVar->getType();
2198 DeclStmt *LoopVarDS = cast<DeclStmt>(LoopVarDecl);
2199 VarDecl *LoopVar = cast<VarDecl>(LoopVarDS->getSingleDecl());
2201 // If we hit any errors, mark the loop variable as invalid if its type
2203 InvalidateOnErrorScope Invalidate(*this, LoopVar,
2204 LoopVar->getType()->isUndeducedType());
2206 StmtResult BeginDeclStmt = Begin;
2207 StmtResult EndDeclStmt = End;
2208 ExprResult NotEqExpr = Cond, IncrExpr = Inc;
2210 if (RangeVarType->isDependentType()) {
2211 // The range is implicitly used as a placeholder when it is dependent.
2212 RangeVar->markUsed(Context);
2214 // Deduce any 'auto's in the loop variable as 'DependentTy'. We'll fill
2215 // them in properly when we instantiate the loop.
2216 if (!LoopVar->isInvalidDecl() && Kind != BFRK_Check)
2217 LoopVar->setType(SubstAutoType(LoopVar->getType(), Context.DependentTy));
2218 } else if (!BeginDeclStmt.get()) {
2219 SourceLocation RangeLoc = RangeVar->getLocation();
2221 const QualType RangeVarNonRefType = RangeVarType.getNonReferenceType();
2223 ExprResult BeginRangeRef = BuildDeclRefExpr(RangeVar, RangeVarNonRefType,
2224 VK_LValue, ColonLoc);
2225 if (BeginRangeRef.isInvalid())
2228 ExprResult EndRangeRef = BuildDeclRefExpr(RangeVar, RangeVarNonRefType,
2229 VK_LValue, ColonLoc);
2230 if (EndRangeRef.isInvalid())
2233 QualType AutoType = Context.getAutoDeductType();
2234 Expr *Range = RangeVar->getInit();
2237 QualType RangeType = Range->getType();
2239 if (RequireCompleteType(RangeLoc, RangeType,
2240 diag::err_for_range_incomplete_type))
2243 // Build auto __begin = begin-expr, __end = end-expr.
2244 VarDecl *BeginVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType,
2246 VarDecl *EndVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType,
2249 // Build begin-expr and end-expr and attach to __begin and __end variables.
2250 ExprResult BeginExpr, EndExpr;
2251 if (const ArrayType *UnqAT = RangeType->getAsArrayTypeUnsafe()) {
2252 // - if _RangeT is an array type, begin-expr and end-expr are __range and
2253 // __range + __bound, respectively, where __bound is the array bound. If
2254 // _RangeT is an array of unknown size or an array of incomplete type,
2255 // the program is ill-formed;
2257 // begin-expr is __range.
2258 BeginExpr = BeginRangeRef;
2259 if (FinishForRangeVarDecl(*this, BeginVar, BeginRangeRef.get(), ColonLoc,
2260 diag::err_for_range_iter_deduction_failure)) {
2261 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2265 // Find the array bound.
2266 ExprResult BoundExpr;
2267 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(UnqAT))
2268 BoundExpr = IntegerLiteral::Create(
2269 Context, CAT->getSize(), Context.getPointerDiffType(), RangeLoc);
2270 else if (const VariableArrayType *VAT =
2271 dyn_cast<VariableArrayType>(UnqAT))
2272 BoundExpr = VAT->getSizeExpr();
2274 // Can't be a DependentSizedArrayType or an IncompleteArrayType since
2275 // UnqAT is not incomplete and Range is not type-dependent.
2276 llvm_unreachable("Unexpected array type in for-range");
2279 // end-expr is __range + __bound.
2280 EndExpr = ActOnBinOp(S, ColonLoc, tok::plus, EndRangeRef.get(),
2282 if (EndExpr.isInvalid())
2284 if (FinishForRangeVarDecl(*this, EndVar, EndExpr.get(), ColonLoc,
2285 diag::err_for_range_iter_deduction_failure)) {
2286 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end);
2290 OverloadCandidateSet CandidateSet(RangeLoc,
2291 OverloadCandidateSet::CSK_Normal);
2292 BeginEndFunction BEFFailure;
2293 ForRangeStatus RangeStatus =
2294 BuildNonArrayForRange(*this, BeginRangeRef.get(),
2295 EndRangeRef.get(), RangeType,
2296 BeginVar, EndVar, ColonLoc, &CandidateSet,
2297 &BeginExpr, &EndExpr, &BEFFailure);
2299 if (Kind == BFRK_Build && RangeStatus == FRS_NoViableFunction &&
2300 BEFFailure == BEF_begin) {
2301 // If the range is being built from an array parameter, emit a
2302 // a diagnostic that it is being treated as a pointer.
2303 if (DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(Range)) {
2304 if (ParmVarDecl *PVD = dyn_cast<ParmVarDecl>(DRE->getDecl())) {
2305 QualType ArrayTy = PVD->getOriginalType();
2306 QualType PointerTy = PVD->getType();
2307 if (PointerTy->isPointerType() && ArrayTy->isArrayType()) {
2308 Diag(Range->getLocStart(), diag::err_range_on_array_parameter)
2309 << RangeLoc << PVD << ArrayTy << PointerTy;
2310 Diag(PVD->getLocation(), diag::note_declared_at);
2316 // If building the range failed, try dereferencing the range expression
2317 // unless a diagnostic was issued or the end function is problematic.
2318 StmtResult SR = RebuildForRangeWithDereference(*this, S, ForLoc,
2320 LoopVarDecl, ColonLoc,
2323 if (SR.isInvalid() || SR.isUsable())
2327 // Otherwise, emit diagnostics if we haven't already.
2328 if (RangeStatus == FRS_NoViableFunction) {
2329 Expr *Range = BEFFailure ? EndRangeRef.get() : BeginRangeRef.get();
2330 Diag(Range->getLocStart(), diag::err_for_range_invalid)
2331 << RangeLoc << Range->getType() << BEFFailure;
2332 CandidateSet.NoteCandidates(*this, OCD_AllCandidates, Range);
2334 // Return an error if no fix was discovered.
2335 if (RangeStatus != FRS_Success)
2339 assert(!BeginExpr.isInvalid() && !EndExpr.isInvalid() &&
2340 "invalid range expression in for loop");
2342 // C++11 [dcl.spec.auto]p7: BeginType and EndType must be the same.
2343 // C++1z removes this restriction.
2344 QualType BeginType = BeginVar->getType(), EndType = EndVar->getType();
2345 if (!Context.hasSameType(BeginType, EndType)) {
2346 Diag(RangeLoc, getLangOpts().CPlusPlus1z
2347 ? diag::warn_for_range_begin_end_types_differ
2348 : diag::ext_for_range_begin_end_types_differ)
2349 << BeginType << EndType;
2350 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2351 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end);
2355 ActOnDeclStmt(ConvertDeclToDeclGroup(BeginVar), ColonLoc, ColonLoc);
2357 ActOnDeclStmt(ConvertDeclToDeclGroup(EndVar), ColonLoc, ColonLoc);
2359 const QualType BeginRefNonRefType = BeginType.getNonReferenceType();
2360 ExprResult BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType,
2361 VK_LValue, ColonLoc);
2362 if (BeginRef.isInvalid())
2365 ExprResult EndRef = BuildDeclRefExpr(EndVar, EndType.getNonReferenceType(),
2366 VK_LValue, ColonLoc);
2367 if (EndRef.isInvalid())
2370 // Build and check __begin != __end expression.
2371 NotEqExpr = ActOnBinOp(S, ColonLoc, tok::exclaimequal,
2372 BeginRef.get(), EndRef.get());
2373 if (!NotEqExpr.isInvalid())
2374 NotEqExpr = CheckBooleanCondition(ColonLoc, NotEqExpr.get());
2375 if (!NotEqExpr.isInvalid())
2376 NotEqExpr = ActOnFinishFullExpr(NotEqExpr.get());
2377 if (NotEqExpr.isInvalid()) {
2378 Diag(RangeLoc, diag::note_for_range_invalid_iterator)
2379 << RangeLoc << 0 << BeginRangeRef.get()->getType();
2380 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2381 if (!Context.hasSameType(BeginType, EndType))
2382 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end);
2386 // Build and check ++__begin expression.
2387 BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType,
2388 VK_LValue, ColonLoc);
2389 if (BeginRef.isInvalid())
2392 IncrExpr = ActOnUnaryOp(S, ColonLoc, tok::plusplus, BeginRef.get());
2393 if (!IncrExpr.isInvalid() && CoawaitLoc.isValid())
2394 IncrExpr = ActOnCoawaitExpr(S, CoawaitLoc, IncrExpr.get());
2395 if (!IncrExpr.isInvalid())
2396 IncrExpr = ActOnFinishFullExpr(IncrExpr.get());
2397 if (IncrExpr.isInvalid()) {
2398 Diag(RangeLoc, diag::note_for_range_invalid_iterator)
2399 << RangeLoc << 2 << BeginRangeRef.get()->getType() ;
2400 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2404 // Build and check *__begin expression.
2405 BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType,
2406 VK_LValue, ColonLoc);
2407 if (BeginRef.isInvalid())
2410 ExprResult DerefExpr = ActOnUnaryOp(S, ColonLoc, tok::star, BeginRef.get());
2411 if (DerefExpr.isInvalid()) {
2412 Diag(RangeLoc, diag::note_for_range_invalid_iterator)
2413 << RangeLoc << 1 << BeginRangeRef.get()->getType();
2414 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2418 // Attach *__begin as initializer for VD. Don't touch it if we're just
2419 // trying to determine whether this would be a valid range.
2420 if (!LoopVar->isInvalidDecl() && Kind != BFRK_Check) {
2421 AddInitializerToDecl(LoopVar, DerefExpr.get(), /*DirectInit=*/false);
2422 if (LoopVar->isInvalidDecl())
2423 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin);
2427 // Don't bother to actually allocate the result if we're just trying to
2428 // determine whether it would be valid.
2429 if (Kind == BFRK_Check)
2430 return StmtResult();
2432 return new (Context) CXXForRangeStmt(
2433 RangeDS, cast_or_null<DeclStmt>(BeginDeclStmt.get()),
2434 cast_or_null<DeclStmt>(EndDeclStmt.get()), NotEqExpr.get(),
2435 IncrExpr.get(), LoopVarDS, /*Body=*/nullptr, ForLoc, CoawaitLoc,
2436 ColonLoc, RParenLoc);
2439 /// FinishObjCForCollectionStmt - Attach the body to a objective-C foreach
2441 StmtResult Sema::FinishObjCForCollectionStmt(Stmt *S, Stmt *B) {
2444 ObjCForCollectionStmt * ForStmt = cast<ObjCForCollectionStmt>(S);
2446 ForStmt->setBody(B);
2450 // Warn when the loop variable is a const reference that creates a copy.
2451 // Suggest using the non-reference type for copies. If a copy can be prevented
2452 // suggest the const reference type that would do so.
2453 // For instance, given "for (const &Foo : Range)", suggest
2454 // "for (const Foo : Range)" to denote a copy is made for the loop. If
2455 // possible, also suggest "for (const &Bar : Range)" if this type prevents
2456 // the copy altogether.
2457 static void DiagnoseForRangeReferenceVariableCopies(Sema &SemaRef,
2459 QualType RangeInitType) {
2460 const Expr *InitExpr = VD->getInit();
2464 QualType VariableType = VD->getType();
2466 if (auto Cleanups = dyn_cast<ExprWithCleanups>(InitExpr))
2467 if (!Cleanups->cleanupsHaveSideEffects())
2468 InitExpr = Cleanups->getSubExpr();
2470 const MaterializeTemporaryExpr *MTE =
2471 dyn_cast<MaterializeTemporaryExpr>(InitExpr);
2477 const Expr *E = MTE->GetTemporaryExpr()->IgnoreImpCasts();
2479 // Searching for either UnaryOperator for dereference of a pointer or
2480 // CXXOperatorCallExpr for handling iterators.
2481 while (!isa<CXXOperatorCallExpr>(E) && !isa<UnaryOperator>(E)) {
2482 if (const CXXConstructExpr *CCE = dyn_cast<CXXConstructExpr>(E)) {
2484 } else if (const CXXMemberCallExpr *Call = dyn_cast<CXXMemberCallExpr>(E)) {
2485 const MemberExpr *ME = cast<MemberExpr>(Call->getCallee());
2488 const MaterializeTemporaryExpr *MTE = cast<MaterializeTemporaryExpr>(E);
2489 E = MTE->GetTemporaryExpr();
2491 E = E->IgnoreImpCasts();
2494 bool ReturnsReference = false;
2495 if (isa<UnaryOperator>(E)) {
2496 ReturnsReference = true;
2498 const CXXOperatorCallExpr *Call = cast<CXXOperatorCallExpr>(E);
2499 const FunctionDecl *FD = Call->getDirectCallee();
2500 QualType ReturnType = FD->getReturnType();
2501 ReturnsReference = ReturnType->isReferenceType();
2504 if (ReturnsReference) {
2505 // Loop variable creates a temporary. Suggest either to go with
2506 // non-reference loop variable to indiciate a copy is made, or
2507 // the correct time to bind a const reference.
2508 SemaRef.Diag(VD->getLocation(), diag::warn_for_range_const_reference_copy)
2509 << VD << VariableType << E->getType();
2510 QualType NonReferenceType = VariableType.getNonReferenceType();
2511 NonReferenceType.removeLocalConst();
2512 QualType NewReferenceType =
2513 SemaRef.Context.getLValueReferenceType(E->getType().withConst());
2514 SemaRef.Diag(VD->getLocStart(), diag::note_use_type_or_non_reference)
2515 << NonReferenceType << NewReferenceType << VD->getSourceRange();
2517 // The range always returns a copy, so a temporary is always created.
2518 // Suggest removing the reference from the loop variable.
2519 SemaRef.Diag(VD->getLocation(), diag::warn_for_range_variable_always_copy)
2520 << VD << RangeInitType;
2521 QualType NonReferenceType = VariableType.getNonReferenceType();
2522 NonReferenceType.removeLocalConst();
2523 SemaRef.Diag(VD->getLocStart(), diag::note_use_non_reference_type)
2524 << NonReferenceType << VD->getSourceRange();
2528 // Warns when the loop variable can be changed to a reference type to
2529 // prevent a copy. For instance, if given "for (const Foo x : Range)" suggest
2530 // "for (const Foo &x : Range)" if this form does not make a copy.
2531 static void DiagnoseForRangeConstVariableCopies(Sema &SemaRef,
2532 const VarDecl *VD) {
2533 const Expr *InitExpr = VD->getInit();
2537 QualType VariableType = VD->getType();
2539 if (const CXXConstructExpr *CE = dyn_cast<CXXConstructExpr>(InitExpr)) {
2540 if (!CE->getConstructor()->isCopyConstructor())
2542 } else if (const CastExpr *CE = dyn_cast<CastExpr>(InitExpr)) {
2543 if (CE->getCastKind() != CK_LValueToRValue)
2549 // TODO: Determine a maximum size that a POD type can be before a diagnostic
2550 // should be emitted. Also, only ignore POD types with trivial copy
2552 if (VariableType.isPODType(SemaRef.Context))
2555 // Suggest changing from a const variable to a const reference variable
2556 // if doing so will prevent a copy.
2557 SemaRef.Diag(VD->getLocation(), diag::warn_for_range_copy)
2558 << VD << VariableType << InitExpr->getType();
2559 SemaRef.Diag(VD->getLocStart(), diag::note_use_reference_type)
2560 << SemaRef.Context.getLValueReferenceType(VariableType)
2561 << VD->getSourceRange();
2564 /// DiagnoseForRangeVariableCopies - Diagnose three cases and fixes for them.
2565 /// 1) for (const foo &x : foos) where foos only returns a copy. Suggest
2566 /// using "const foo x" to show that a copy is made
2567 /// 2) for (const bar &x : foos) where bar is a temporary intialized by bar.
2568 /// Suggest either "const bar x" to keep the copying or "const foo& x" to
2569 /// prevent the copy.
2570 /// 3) for (const foo x : foos) where x is constructed from a reference foo.
2571 /// Suggest "const foo &x" to prevent the copy.
2572 static void DiagnoseForRangeVariableCopies(Sema &SemaRef,
2573 const CXXForRangeStmt *ForStmt) {
2574 if (SemaRef.Diags.isIgnored(diag::warn_for_range_const_reference_copy,
2575 ForStmt->getLocStart()) &&
2576 SemaRef.Diags.isIgnored(diag::warn_for_range_variable_always_copy,
2577 ForStmt->getLocStart()) &&
2578 SemaRef.Diags.isIgnored(diag::warn_for_range_copy,
2579 ForStmt->getLocStart())) {
2583 const VarDecl *VD = ForStmt->getLoopVariable();
2587 QualType VariableType = VD->getType();
2589 if (VariableType->isIncompleteType())
2592 const Expr *InitExpr = VD->getInit();
2596 if (VariableType->isReferenceType()) {
2597 DiagnoseForRangeReferenceVariableCopies(SemaRef, VD,
2598 ForStmt->getRangeInit()->getType());
2599 } else if (VariableType.isConstQualified()) {
2600 DiagnoseForRangeConstVariableCopies(SemaRef, VD);
2604 /// FinishCXXForRangeStmt - Attach the body to a C++0x for-range statement.
2605 /// This is a separate step from ActOnCXXForRangeStmt because analysis of the
2606 /// body cannot be performed until after the type of the range variable is
2608 StmtResult Sema::FinishCXXForRangeStmt(Stmt *S, Stmt *B) {
2612 if (isa<ObjCForCollectionStmt>(S))
2613 return FinishObjCForCollectionStmt(S, B);
2615 CXXForRangeStmt *ForStmt = cast<CXXForRangeStmt>(S);
2616 ForStmt->setBody(B);
2618 DiagnoseEmptyStmtBody(ForStmt->getRParenLoc(), B,
2619 diag::warn_empty_range_based_for_body);
2621 DiagnoseForRangeVariableCopies(*this, ForStmt);
2626 StmtResult Sema::ActOnGotoStmt(SourceLocation GotoLoc,
2627 SourceLocation LabelLoc,
2628 LabelDecl *TheDecl) {
2629 getCurFunction()->setHasBranchIntoScope();
2630 TheDecl->markUsed(Context);
2631 return new (Context) GotoStmt(TheDecl, GotoLoc, LabelLoc);
2635 Sema::ActOnIndirectGotoStmt(SourceLocation GotoLoc, SourceLocation StarLoc,
2637 // Convert operand to void*
2638 if (!E->isTypeDependent()) {
2639 QualType ETy = E->getType();
2640 QualType DestTy = Context.getPointerType(Context.VoidTy.withConst());
2641 ExprResult ExprRes = E;
2642 AssignConvertType ConvTy =
2643 CheckSingleAssignmentConstraints(DestTy, ExprRes);
2644 if (ExprRes.isInvalid())
2647 if (DiagnoseAssignmentResult(ConvTy, StarLoc, DestTy, ETy, E, AA_Passing))
2651 ExprResult ExprRes = ActOnFinishFullExpr(E);
2652 if (ExprRes.isInvalid())
2656 getCurFunction()->setHasIndirectGoto();
2658 return new (Context) IndirectGotoStmt(GotoLoc, StarLoc, E);
2661 static void CheckJumpOutOfSEHFinally(Sema &S, SourceLocation Loc,
2662 const Scope &DestScope) {
2663 if (!S.CurrentSEHFinally.empty() &&
2664 DestScope.Contains(*S.CurrentSEHFinally.back())) {
2665 S.Diag(Loc, diag::warn_jump_out_of_seh_finally);
2670 Sema::ActOnContinueStmt(SourceLocation ContinueLoc, Scope *CurScope) {
2671 Scope *S = CurScope->getContinueParent();
2673 // C99 6.8.6.2p1: A break shall appear only in or as a loop body.
2674 return StmtError(Diag(ContinueLoc, diag::err_continue_not_in_loop));
2676 CheckJumpOutOfSEHFinally(*this, ContinueLoc, *S);
2678 return new (Context) ContinueStmt(ContinueLoc);
2682 Sema::ActOnBreakStmt(SourceLocation BreakLoc, Scope *CurScope) {
2683 Scope *S = CurScope->getBreakParent();
2685 // C99 6.8.6.3p1: A break shall appear only in or as a switch/loop body.
2686 return StmtError(Diag(BreakLoc, diag::err_break_not_in_loop_or_switch));
2688 if (S->isOpenMPLoopScope())
2689 return StmtError(Diag(BreakLoc, diag::err_omp_loop_cannot_use_stmt)
2691 CheckJumpOutOfSEHFinally(*this, BreakLoc, *S);
2693 return new (Context) BreakStmt(BreakLoc);
2696 /// \brief Determine whether the given expression is a candidate for
2697 /// copy elision in either a return statement or a throw expression.
2699 /// \param ReturnType If we're determining the copy elision candidate for
2700 /// a return statement, this is the return type of the function. If we're
2701 /// determining the copy elision candidate for a throw expression, this will
2704 /// \param E The expression being returned from the function or block, or
2707 /// \param AllowParamOrMoveConstructible Whether we allow function parameters or
2708 /// id-expressions that could be moved out of the function to be considered NRVO
2709 /// candidates. C++ prohibits these for NRVO itself, but we re-use this logic to
2710 /// determine whether we should try to move as part of a return or throw (which
2711 /// does allow function parameters).
2713 /// \returns The NRVO candidate variable, if the return statement may use the
2714 /// NRVO, or NULL if there is no such candidate.
2715 VarDecl *Sema::getCopyElisionCandidate(QualType ReturnType, Expr *E,
2716 bool AllowParamOrMoveConstructible) {
2717 if (!getLangOpts().CPlusPlus)
2720 // - in a return statement in a function [where] ...
2721 // ... the expression is the name of a non-volatile automatic object ...
2722 DeclRefExpr *DR = dyn_cast<DeclRefExpr>(E->IgnoreParens());
2723 if (!DR || DR->refersToEnclosingVariableOrCapture())
2725 VarDecl *VD = dyn_cast<VarDecl>(DR->getDecl());
2729 if (isCopyElisionCandidate(ReturnType, VD, AllowParamOrMoveConstructible))
2734 bool Sema::isCopyElisionCandidate(QualType ReturnType, const VarDecl *VD,
2735 bool AllowParamOrMoveConstructible) {
2736 QualType VDType = VD->getType();
2737 // - in a return statement in a function with ...
2738 // ... a class return type ...
2739 if (!ReturnType.isNull() && !ReturnType->isDependentType()) {
2740 if (!ReturnType->isRecordType())
2742 // ... the same cv-unqualified type as the function return type ...
2743 // When considering moving this expression out, allow dissimilar types.
2744 if (!AllowParamOrMoveConstructible && !VDType->isDependentType() &&
2745 !Context.hasSameUnqualifiedType(ReturnType, VDType))
2749 // ...object (other than a function or catch-clause parameter)...
2750 if (VD->getKind() != Decl::Var &&
2751 !(AllowParamOrMoveConstructible && VD->getKind() == Decl::ParmVar))
2753 if (VD->isExceptionVariable()) return false;
2756 if (!VD->hasLocalStorage()) return false;
2758 // Return false if VD is a __block variable. We don't want to implicitly move
2759 // out of a __block variable during a return because we cannot assume the
2760 // variable will no longer be used.
2761 if (VD->hasAttr<BlocksAttr>()) return false;
2763 if (AllowParamOrMoveConstructible)
2766 // ...non-volatile...
2767 if (VD->getType().isVolatileQualified()) return false;
2769 // Variables with higher required alignment than their type's ABI
2770 // alignment cannot use NRVO.
2771 if (!VD->getType()->isDependentType() && VD->hasAttr<AlignedAttr>() &&
2772 Context.getDeclAlign(VD) > Context.getTypeAlignInChars(VD->getType()))
2778 /// \brief Perform the initialization of a potentially-movable value, which
2779 /// is the result of return value.
2781 /// This routine implements C++14 [class.copy]p32, which attempts to treat
2782 /// returned lvalues as rvalues in certain cases (to prefer move construction),
2783 /// then falls back to treating them as lvalues if that failed.
2785 Sema::PerformMoveOrCopyInitialization(const InitializedEntity &Entity,
2786 const VarDecl *NRVOCandidate,
2787 QualType ResultType,
2790 // C++14 [class.copy]p32:
2791 // When the criteria for elision of a copy/move operation are met, but not for
2792 // an exception-declaration, and the object to be copied is designated by an
2793 // lvalue, or when the expression in a return statement is a (possibly
2794 // parenthesized) id-expression that names an object with automatic storage
2795 // duration declared in the body or parameter-declaration-clause of the
2796 // innermost enclosing function or lambda-expression, overload resolution to
2797 // select the constructor for the copy is first performed as if the object
2798 // were designated by an rvalue.
2799 ExprResult Res = ExprError();
2801 if (AllowNRVO && !NRVOCandidate)
2802 NRVOCandidate = getCopyElisionCandidate(ResultType, Value, true);
2804 if (AllowNRVO && NRVOCandidate) {
2805 ImplicitCastExpr AsRvalue(ImplicitCastExpr::OnStack, Value->getType(),
2806 CK_NoOp, Value, VK_XValue);
2808 Expr *InitExpr = &AsRvalue;
2810 InitializationKind Kind = InitializationKind::CreateCopy(
2811 Value->getLocStart(), Value->getLocStart());
2813 InitializationSequence Seq(*this, Entity, Kind, InitExpr);
2815 for (const InitializationSequence::Step &Step : Seq.steps()) {
2817 InitializationSequence::SK_ConstructorInitialization ||
2818 (Step.Kind == InitializationSequence::SK_UserConversion &&
2819 isa<CXXConstructorDecl>(Step.Function.Function))))
2822 CXXConstructorDecl *Constructor =
2823 cast<CXXConstructorDecl>(Step.Function.Function);
2825 const RValueReferenceType *RRefType
2826 = Constructor->getParamDecl(0)->getType()
2827 ->getAs<RValueReferenceType>();
2829 // [...] If the first overload resolution fails or was not performed, or
2830 // if the type of the first parameter of the selected constructor is not
2831 // an rvalue reference to the object's type (possibly cv-qualified),
2832 // overload resolution is performed again, considering the object as an
2835 !Context.hasSameUnqualifiedType(RRefType->getPointeeType(),
2836 NRVOCandidate->getType()))
2839 // Promote "AsRvalue" to the heap, since we now need this
2840 // expression node to persist.
2841 Value = ImplicitCastExpr::Create(Context, Value->getType(), CK_NoOp,
2842 Value, nullptr, VK_XValue);
2844 // Complete type-checking the initialization of the return type
2845 // using the constructor we found.
2846 Res = Seq.Perform(*this, Entity, Kind, Value);
2851 // Either we didn't meet the criteria for treating an lvalue as an rvalue,
2852 // above, or overload resolution failed. Either way, we need to try
2853 // (again) now with the return value expression as written.
2854 if (Res.isInvalid())
2855 Res = PerformCopyInitialization(Entity, SourceLocation(), Value);
2860 /// \brief Determine whether the declared return type of the specified function
2861 /// contains 'auto'.
2862 static bool hasDeducedReturnType(FunctionDecl *FD) {
2863 const FunctionProtoType *FPT =
2864 FD->getTypeSourceInfo()->getType()->castAs<FunctionProtoType>();
2865 return FPT->getReturnType()->isUndeducedType();
2868 /// ActOnCapScopeReturnStmt - Utility routine to type-check return statements
2869 /// for capturing scopes.
2872 Sema::ActOnCapScopeReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) {
2873 // If this is the first return we've seen, infer the return type.
2874 // [expr.prim.lambda]p4 in C++11; block literals follow the same rules.
2875 CapturingScopeInfo *CurCap = cast<CapturingScopeInfo>(getCurFunction());
2876 QualType FnRetType = CurCap->ReturnType;
2877 LambdaScopeInfo *CurLambda = dyn_cast<LambdaScopeInfo>(CurCap);
2878 bool HasDeducedReturnType =
2879 CurLambda && hasDeducedReturnType(CurLambda->CallOperator);
2881 if (ExprEvalContexts.back().Context ==
2882 ExpressionEvaluationContext::DiscardedStatement &&
2883 (HasDeducedReturnType || CurCap->HasImplicitReturnType)) {
2885 ExprResult ER = ActOnFinishFullExpr(RetValExp, ReturnLoc);
2888 RetValExp = ER.get();
2890 return new (Context) ReturnStmt(ReturnLoc, RetValExp, nullptr);
2893 if (HasDeducedReturnType) {
2894 // In C++1y, the return type may involve 'auto'.
2895 // FIXME: Blocks might have a return type of 'auto' explicitly specified.
2896 FunctionDecl *FD = CurLambda->CallOperator;
2897 if (CurCap->ReturnType.isNull())
2898 CurCap->ReturnType = FD->getReturnType();
2900 AutoType *AT = CurCap->ReturnType->getContainedAutoType();
2901 assert(AT && "lost auto type from lambda return type");
2902 if (DeduceFunctionTypeFromReturnExpr(FD, ReturnLoc, RetValExp, AT)) {
2903 FD->setInvalidDecl();
2906 CurCap->ReturnType = FnRetType = FD->getReturnType();
2907 } else if (CurCap->HasImplicitReturnType) {
2908 // For blocks/lambdas with implicit return types, we check each return
2909 // statement individually, and deduce the common return type when the block
2910 // or lambda is completed.
2911 // FIXME: Fold this into the 'auto' codepath above.
2912 if (RetValExp && !isa<InitListExpr>(RetValExp)) {
2913 ExprResult Result = DefaultFunctionArrayLvalueConversion(RetValExp);
2914 if (Result.isInvalid())
2916 RetValExp = Result.get();
2918 // DR1048: even prior to C++14, we should use the 'auto' deduction rules
2919 // when deducing a return type for a lambda-expression (or by extension
2920 // for a block). These rules differ from the stated C++11 rules only in
2921 // that they remove top-level cv-qualifiers.
2922 if (!CurContext->isDependentContext())
2923 FnRetType = RetValExp->getType().getUnqualifiedType();
2925 FnRetType = CurCap->ReturnType = Context.DependentTy;
2928 // C++11 [expr.lambda.prim]p4 bans inferring the result from an
2929 // initializer list, because it is not an expression (even
2930 // though we represent it as one). We still deduce 'void'.
2931 Diag(ReturnLoc, diag::err_lambda_return_init_list)
2932 << RetValExp->getSourceRange();
2935 FnRetType = Context.VoidTy;
2938 // Although we'll properly infer the type of the block once it's completed,
2939 // make sure we provide a return type now for better error recovery.
2940 if (CurCap->ReturnType.isNull())
2941 CurCap->ReturnType = FnRetType;
2943 assert(!FnRetType.isNull());
2945 if (BlockScopeInfo *CurBlock = dyn_cast<BlockScopeInfo>(CurCap)) {
2946 if (CurBlock->FunctionType->getAs<FunctionType>()->getNoReturnAttr()) {
2947 Diag(ReturnLoc, diag::err_noreturn_block_has_return_expr);
2950 } else if (CapturedRegionScopeInfo *CurRegion =
2951 dyn_cast<CapturedRegionScopeInfo>(CurCap)) {
2952 Diag(ReturnLoc, diag::err_return_in_captured_stmt) << CurRegion->getRegionName();
2955 assert(CurLambda && "unknown kind of captured scope");
2956 if (CurLambda->CallOperator->getType()->getAs<FunctionType>()
2957 ->getNoReturnAttr()) {
2958 Diag(ReturnLoc, diag::err_noreturn_lambda_has_return_expr);
2963 // Otherwise, verify that this result type matches the previous one. We are
2964 // pickier with blocks than for normal functions because we don't have GCC
2965 // compatibility to worry about here.
2966 const VarDecl *NRVOCandidate = nullptr;
2967 if (FnRetType->isDependentType()) {
2968 // Delay processing for now. TODO: there are lots of dependent
2969 // types we can conclusively prove aren't void.
2970 } else if (FnRetType->isVoidType()) {
2971 if (RetValExp && !isa<InitListExpr>(RetValExp) &&
2972 !(getLangOpts().CPlusPlus &&
2973 (RetValExp->isTypeDependent() ||
2974 RetValExp->getType()->isVoidType()))) {
2975 if (!getLangOpts().CPlusPlus &&
2976 RetValExp->getType()->isVoidType())
2977 Diag(ReturnLoc, diag::ext_return_has_void_expr) << "literal" << 2;
2979 Diag(ReturnLoc, diag::err_return_block_has_expr);
2980 RetValExp = nullptr;
2983 } else if (!RetValExp) {
2984 return StmtError(Diag(ReturnLoc, diag::err_block_return_missing_expr));
2985 } else if (!RetValExp->isTypeDependent()) {
2986 // we have a non-void block with an expression, continue checking
2988 // C99 6.8.6.4p3(136): The return statement is not an assignment. The
2989 // overlap restriction of subclause 6.5.16.1 does not apply to the case of
2992 // In C++ the return statement is handled via a copy initialization.
2993 // the C version of which boils down to CheckSingleAssignmentConstraints.
2994 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false);
2995 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc,
2997 NRVOCandidate != nullptr);
2998 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate,
2999 FnRetType, RetValExp);
3000 if (Res.isInvalid()) {
3001 // FIXME: Cleanup temporaries here, anyway?
3004 RetValExp = Res.get();
3005 CheckReturnValExpr(RetValExp, FnRetType, ReturnLoc);
3007 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false);
3011 ExprResult ER = ActOnFinishFullExpr(RetValExp, ReturnLoc);
3014 RetValExp = ER.get();
3016 ReturnStmt *Result = new (Context) ReturnStmt(ReturnLoc, RetValExp,
3019 // If we need to check for the named return value optimization,
3020 // or if we need to infer the return type,
3021 // save the return statement in our scope for later processing.
3022 if (CurCap->HasImplicitReturnType || NRVOCandidate)
3023 FunctionScopes.back()->Returns.push_back(Result);
3025 if (FunctionScopes.back()->FirstReturnLoc.isInvalid())
3026 FunctionScopes.back()->FirstReturnLoc = ReturnLoc;
3032 /// \brief Marks all typedefs in all local classes in a type referenced.
3034 /// In a function like
3036 /// struct S { typedef int a; };
3040 /// the local type escapes and could be referenced in some TUs but not in
3041 /// others. Pretend that all local typedefs are always referenced, to not warn
3042 /// on this. This isn't necessary if f has internal linkage, or the typedef
3044 class LocalTypedefNameReferencer
3045 : public RecursiveASTVisitor<LocalTypedefNameReferencer> {
3047 LocalTypedefNameReferencer(Sema &S) : S(S) {}
3048 bool VisitRecordType(const RecordType *RT);
3052 bool LocalTypedefNameReferencer::VisitRecordType(const RecordType *RT) {
3053 auto *R = dyn_cast<CXXRecordDecl>(RT->getDecl());
3054 if (!R || !R->isLocalClass() || !R->isLocalClass()->isExternallyVisible() ||
3055 R->isDependentType())
3057 for (auto *TmpD : R->decls())
3058 if (auto *T = dyn_cast<TypedefNameDecl>(TmpD))
3059 if (T->getAccess() != AS_private || R->hasFriends())
3060 S.MarkAnyDeclReferenced(T->getLocation(), T, /*OdrUse=*/false);
3065 TypeLoc Sema::getReturnTypeLoc(FunctionDecl *FD) const {
3066 TypeLoc TL = FD->getTypeSourceInfo()->getTypeLoc().IgnoreParens();
3067 while (auto ATL = TL.getAs<AttributedTypeLoc>())
3068 TL = ATL.getModifiedLoc().IgnoreParens();
3069 return TL.castAs<FunctionProtoTypeLoc>().getReturnLoc();
3072 /// Deduce the return type for a function from a returned expression, per
3073 /// C++1y [dcl.spec.auto]p6.
3074 bool Sema::DeduceFunctionTypeFromReturnExpr(FunctionDecl *FD,
3075 SourceLocation ReturnLoc,
3078 TypeLoc OrigResultType = getReturnTypeLoc(FD);
3081 if (RetExpr && isa<InitListExpr>(RetExpr)) {
3082 // If the deduction is for a return statement and the initializer is
3083 // a braced-init-list, the program is ill-formed.
3084 Diag(RetExpr->getExprLoc(),
3085 getCurLambda() ? diag::err_lambda_return_init_list
3086 : diag::err_auto_fn_return_init_list)
3087 << RetExpr->getSourceRange();
3091 if (FD->isDependentContext()) {
3092 // C++1y [dcl.spec.auto]p12:
3093 // Return type deduction [...] occurs when the definition is
3094 // instantiated even if the function body contains a return
3095 // statement with a non-type-dependent operand.
3096 assert(AT->isDeduced() && "should have deduced to dependent type");
3101 // Otherwise, [...] deduce a value for U using the rules of template
3102 // argument deduction.
3103 DeduceAutoResult DAR = DeduceAutoType(OrigResultType, RetExpr, Deduced);
3105 if (DAR == DAR_Failed && !FD->isInvalidDecl())
3106 Diag(RetExpr->getExprLoc(), diag::err_auto_fn_deduction_failure)
3107 << OrigResultType.getType() << RetExpr->getType();
3109 if (DAR != DAR_Succeeded)
3112 // If a local type is part of the returned type, mark its fields as
3114 LocalTypedefNameReferencer Referencer(*this);
3115 Referencer.TraverseType(RetExpr->getType());
3117 // In the case of a return with no operand, the initializer is considered
3120 // Deduction here can only succeed if the return type is exactly 'cv auto'
3121 // or 'decltype(auto)', so just check for that case directly.
3122 if (!OrigResultType.getType()->getAs<AutoType>()) {
3123 Diag(ReturnLoc, diag::err_auto_fn_return_void_but_not_auto)
3124 << OrigResultType.getType();
3127 // We always deduce U = void in this case.
3128 Deduced = SubstAutoType(OrigResultType.getType(), Context.VoidTy);
3129 if (Deduced.isNull())
3133 // If a function with a declared return type that contains a placeholder type
3134 // has multiple return statements, the return type is deduced for each return
3135 // statement. [...] if the type deduced is not the same in each deduction,
3136 // the program is ill-formed.
3137 QualType DeducedT = AT->getDeducedType();
3138 if (!DeducedT.isNull() && !FD->isInvalidDecl()) {
3139 AutoType *NewAT = Deduced->getContainedAutoType();
3140 // It is possible that NewAT->getDeducedType() is null. When that happens,
3141 // we should not crash, instead we ignore this deduction.
3142 if (NewAT->getDeducedType().isNull())
3145 CanQualType OldDeducedType = Context.getCanonicalFunctionResultType(
3147 CanQualType NewDeducedType = Context.getCanonicalFunctionResultType(
3148 NewAT->getDeducedType());
3149 if (!FD->isDependentContext() && OldDeducedType != NewDeducedType) {
3150 const LambdaScopeInfo *LambdaSI = getCurLambda();
3151 if (LambdaSI && LambdaSI->HasImplicitReturnType) {
3152 Diag(ReturnLoc, diag::err_typecheck_missing_return_type_incompatible)
3153 << NewAT->getDeducedType() << DeducedT
3154 << true /*IsLambda*/;
3156 Diag(ReturnLoc, diag::err_auto_fn_different_deductions)
3157 << (AT->isDecltypeAuto() ? 1 : 0)
3158 << NewAT->getDeducedType() << DeducedT;
3162 } else if (!FD->isInvalidDecl()) {
3163 // Update all declarations of the function to have the deduced return type.
3164 Context.adjustDeducedFunctionResultType(FD, Deduced);
3171 Sema::ActOnReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp,
3173 StmtResult R = BuildReturnStmt(ReturnLoc, RetValExp);
3174 if (R.isInvalid() || ExprEvalContexts.back().Context ==
3175 ExpressionEvaluationContext::DiscardedStatement)
3179 const_cast<VarDecl*>(cast<ReturnStmt>(R.get())->getNRVOCandidate())) {
3180 CurScope->addNRVOCandidate(VD);
3182 CurScope->setNoNRVO();
3185 CheckJumpOutOfSEHFinally(*this, ReturnLoc, *CurScope->getFnParent());
3190 StmtResult Sema::BuildReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) {
3191 // Check for unexpanded parameter packs.
3192 if (RetValExp && DiagnoseUnexpandedParameterPack(RetValExp))
3195 if (isa<CapturingScopeInfo>(getCurFunction()))
3196 return ActOnCapScopeReturnStmt(ReturnLoc, RetValExp);
3199 QualType RelatedRetType;
3200 const AttrVec *Attrs = nullptr;
3201 bool isObjCMethod = false;
3203 if (const FunctionDecl *FD = getCurFunctionDecl()) {
3204 FnRetType = FD->getReturnType();
3206 Attrs = &FD->getAttrs();
3207 if (FD->isNoReturn())
3208 Diag(ReturnLoc, diag::warn_noreturn_function_has_return_expr)
3209 << FD->getDeclName();
3210 if (FD->isMain() && RetValExp)
3211 if (isa<CXXBoolLiteralExpr>(RetValExp))
3212 Diag(ReturnLoc, diag::warn_main_returns_bool_literal)
3213 << RetValExp->getSourceRange();
3214 } else if (ObjCMethodDecl *MD = getCurMethodDecl()) {
3215 FnRetType = MD->getReturnType();
3216 isObjCMethod = true;
3218 Attrs = &MD->getAttrs();
3219 if (MD->hasRelatedResultType() && MD->getClassInterface()) {
3220 // In the implementation of a method with a related return type, the
3221 // type used to type-check the validity of return statements within the
3222 // method body is a pointer to the type of the class being implemented.
3223 RelatedRetType = Context.getObjCInterfaceType(MD->getClassInterface());
3224 RelatedRetType = Context.getObjCObjectPointerType(RelatedRetType);
3226 } else // If we don't have a function/method context, bail.
3229 // C++1z: discarded return statements are not considered when deducing a
3231 if (ExprEvalContexts.back().Context ==
3232 ExpressionEvaluationContext::DiscardedStatement &&
3233 FnRetType->getContainedAutoType()) {
3235 ExprResult ER = ActOnFinishFullExpr(RetValExp, ReturnLoc);
3238 RetValExp = ER.get();
3240 return new (Context) ReturnStmt(ReturnLoc, RetValExp, nullptr);
3243 // FIXME: Add a flag to the ScopeInfo to indicate whether we're performing
3245 if (getLangOpts().CPlusPlus14) {
3246 if (AutoType *AT = FnRetType->getContainedAutoType()) {
3247 FunctionDecl *FD = cast<FunctionDecl>(CurContext);
3248 if (DeduceFunctionTypeFromReturnExpr(FD, ReturnLoc, RetValExp, AT)) {
3249 FD->setInvalidDecl();
3252 FnRetType = FD->getReturnType();
3257 bool HasDependentReturnType = FnRetType->isDependentType();
3259 ReturnStmt *Result = nullptr;
3260 if (FnRetType->isVoidType()) {
3262 if (isa<InitListExpr>(RetValExp)) {
3263 // We simply never allow init lists as the return value of void
3264 // functions. This is compatible because this was never allowed before,
3265 // so there's no legacy code to deal with.
3266 NamedDecl *CurDecl = getCurFunctionOrMethodDecl();
3267 int FunctionKind = 0;
3268 if (isa<ObjCMethodDecl>(CurDecl))
3270 else if (isa<CXXConstructorDecl>(CurDecl))
3272 else if (isa<CXXDestructorDecl>(CurDecl))
3275 Diag(ReturnLoc, diag::err_return_init_list)
3276 << CurDecl->getDeclName() << FunctionKind
3277 << RetValExp->getSourceRange();
3279 // Drop the expression.
3280 RetValExp = nullptr;
3281 } else if (!RetValExp->isTypeDependent()) {
3282 // C99 6.8.6.4p1 (ext_ since GCC warns)
3283 unsigned D = diag::ext_return_has_expr;
3284 if (RetValExp->getType()->isVoidType()) {
3285 NamedDecl *CurDecl = getCurFunctionOrMethodDecl();
3286 if (isa<CXXConstructorDecl>(CurDecl) ||
3287 isa<CXXDestructorDecl>(CurDecl))
3288 D = diag::err_ctor_dtor_returns_void;
3290 D = diag::ext_return_has_void_expr;
3293 ExprResult Result = RetValExp;
3294 Result = IgnoredValueConversions(Result.get());
3295 if (Result.isInvalid())
3297 RetValExp = Result.get();
3298 RetValExp = ImpCastExprToType(RetValExp,
3299 Context.VoidTy, CK_ToVoid).get();
3301 // return of void in constructor/destructor is illegal in C++.
3302 if (D == diag::err_ctor_dtor_returns_void) {
3303 NamedDecl *CurDecl = getCurFunctionOrMethodDecl();
3305 << CurDecl->getDeclName() << isa<CXXDestructorDecl>(CurDecl)
3306 << RetValExp->getSourceRange();
3308 // return (some void expression); is legal in C++.
3309 else if (D != diag::ext_return_has_void_expr ||
3310 !getLangOpts().CPlusPlus) {
3311 NamedDecl *CurDecl = getCurFunctionOrMethodDecl();
3313 int FunctionKind = 0;
3314 if (isa<ObjCMethodDecl>(CurDecl))
3316 else if (isa<CXXConstructorDecl>(CurDecl))
3318 else if (isa<CXXDestructorDecl>(CurDecl))
3322 << CurDecl->getDeclName() << FunctionKind
3323 << RetValExp->getSourceRange();
3328 ExprResult ER = ActOnFinishFullExpr(RetValExp, ReturnLoc);
3331 RetValExp = ER.get();
3335 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, nullptr);
3336 } else if (!RetValExp && !HasDependentReturnType) {
3337 FunctionDecl *FD = getCurFunctionDecl();
3340 if (getLangOpts().CPlusPlus11 && FD && FD->isConstexpr()) {
3341 // C++11 [stmt.return]p2
3342 DiagID = diag::err_constexpr_return_missing_expr;
3343 FD->setInvalidDecl();
3344 } else if (getLangOpts().C99) {
3345 // C99 6.8.6.4p1 (ext_ since GCC warns)
3346 DiagID = diag::ext_return_missing_expr;
3349 DiagID = diag::warn_return_missing_expr;
3353 Diag(ReturnLoc, DiagID) << FD->getIdentifier() << 0/*fn*/;
3355 Diag(ReturnLoc, DiagID) << getCurMethodDecl()->getDeclName() << 1/*meth*/;
3357 Result = new (Context) ReturnStmt(ReturnLoc);
3359 assert(RetValExp || HasDependentReturnType);
3360 const VarDecl *NRVOCandidate = nullptr;
3362 QualType RetType = RelatedRetType.isNull() ? FnRetType : RelatedRetType;
3364 // C99 6.8.6.4p3(136): The return statement is not an assignment. The
3365 // overlap restriction of subclause 6.5.16.1 does not apply to the case of
3368 // In C++ the return statement is handled via a copy initialization,
3369 // the C version of which boils down to CheckSingleAssignmentConstraints.
3371 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false);
3372 if (!HasDependentReturnType && !RetValExp->isTypeDependent()) {
3373 // we have a non-void function with an expression, continue checking
3374 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc,
3376 NRVOCandidate != nullptr);
3377 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate,
3378 RetType, RetValExp);
3379 if (Res.isInvalid()) {
3380 // FIXME: Clean up temporaries here anyway?
3383 RetValExp = Res.getAs<Expr>();
3385 // If we have a related result type, we need to implicitly
3386 // convert back to the formal result type. We can't pretend to
3387 // initialize the result again --- we might end double-retaining
3388 // --- so instead we initialize a notional temporary.
3389 if (!RelatedRetType.isNull()) {
3390 Entity = InitializedEntity::InitializeRelatedResult(getCurMethodDecl(),
3392 Res = PerformCopyInitialization(Entity, ReturnLoc, RetValExp);
3393 if (Res.isInvalid()) {
3394 // FIXME: Clean up temporaries here anyway?
3397 RetValExp = Res.getAs<Expr>();
3400 CheckReturnValExpr(RetValExp, FnRetType, ReturnLoc, isObjCMethod, Attrs,
3401 getCurFunctionDecl());
3405 ExprResult ER = ActOnFinishFullExpr(RetValExp, ReturnLoc);
3408 RetValExp = ER.get();
3410 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, NRVOCandidate);
3413 // If we need to check for the named return value optimization, save the
3414 // return statement in our scope for later processing.
3415 if (Result->getNRVOCandidate())
3416 FunctionScopes.back()->Returns.push_back(Result);
3418 if (FunctionScopes.back()->FirstReturnLoc.isInvalid())
3419 FunctionScopes.back()->FirstReturnLoc = ReturnLoc;
3425 Sema::ActOnObjCAtCatchStmt(SourceLocation AtLoc,
3426 SourceLocation RParen, Decl *Parm,
3428 VarDecl *Var = cast_or_null<VarDecl>(Parm);
3429 if (Var && Var->isInvalidDecl())
3432 return new (Context) ObjCAtCatchStmt(AtLoc, RParen, Var, Body);
3436 Sema::ActOnObjCAtFinallyStmt(SourceLocation AtLoc, Stmt *Body) {
3437 return new (Context) ObjCAtFinallyStmt(AtLoc, Body);
3441 Sema::ActOnObjCAtTryStmt(SourceLocation AtLoc, Stmt *Try,
3442 MultiStmtArg CatchStmts, Stmt *Finally) {
3443 if (!getLangOpts().ObjCExceptions)
3444 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@try";
3446 getCurFunction()->setHasBranchProtectedScope();
3447 unsigned NumCatchStmts = CatchStmts.size();
3448 return ObjCAtTryStmt::Create(Context, AtLoc, Try, CatchStmts.data(),
3449 NumCatchStmts, Finally);
3452 StmtResult Sema::BuildObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw) {
3454 ExprResult Result = DefaultLvalueConversion(Throw);
3455 if (Result.isInvalid())
3458 Result = ActOnFinishFullExpr(Result.get());
3459 if (Result.isInvalid())
3461 Throw = Result.get();
3463 QualType ThrowType = Throw->getType();
3464 // Make sure the expression type is an ObjC pointer or "void *".
3465 if (!ThrowType->isDependentType() &&
3466 !ThrowType->isObjCObjectPointerType()) {
3467 const PointerType *PT = ThrowType->getAs<PointerType>();
3468 if (!PT || !PT->getPointeeType()->isVoidType())
3469 return StmtError(Diag(AtLoc, diag::err_objc_throw_expects_object)
3470 << Throw->getType() << Throw->getSourceRange());
3474 return new (Context) ObjCAtThrowStmt(AtLoc, Throw);
3478 Sema::ActOnObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw,
3480 if (!getLangOpts().ObjCExceptions)
3481 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@throw";
3484 // @throw without an expression designates a rethrow (which must occur
3485 // in the context of an @catch clause).
3486 Scope *AtCatchParent = CurScope;
3487 while (AtCatchParent && !AtCatchParent->isAtCatchScope())
3488 AtCatchParent = AtCatchParent->getParent();
3490 return StmtError(Diag(AtLoc, diag::err_rethrow_used_outside_catch));
3492 return BuildObjCAtThrowStmt(AtLoc, Throw);
3496 Sema::ActOnObjCAtSynchronizedOperand(SourceLocation atLoc, Expr *operand) {
3497 ExprResult result = DefaultLvalueConversion(operand);
3498 if (result.isInvalid())
3500 operand = result.get();
3502 // Make sure the expression type is an ObjC pointer or "void *".
3503 QualType type = operand->getType();
3504 if (!type->isDependentType() &&
3505 !type->isObjCObjectPointerType()) {
3506 const PointerType *pointerType = type->getAs<PointerType>();
3507 if (!pointerType || !pointerType->getPointeeType()->isVoidType()) {
3508 if (getLangOpts().CPlusPlus) {
3509 if (RequireCompleteType(atLoc, type,
3510 diag::err_incomplete_receiver_type))
3511 return Diag(atLoc, diag::err_objc_synchronized_expects_object)
3512 << type << operand->getSourceRange();
3514 ExprResult result = PerformContextuallyConvertToObjCPointer(operand);
3515 if (result.isInvalid())
3517 if (!result.isUsable())
3518 return Diag(atLoc, diag::err_objc_synchronized_expects_object)
3519 << type << operand->getSourceRange();
3521 operand = result.get();
3523 return Diag(atLoc, diag::err_objc_synchronized_expects_object)
3524 << type << operand->getSourceRange();
3529 // The operand to @synchronized is a full-expression.
3530 return ActOnFinishFullExpr(operand);
3534 Sema::ActOnObjCAtSynchronizedStmt(SourceLocation AtLoc, Expr *SyncExpr,
3536 // We can't jump into or indirect-jump out of a @synchronized block.
3537 getCurFunction()->setHasBranchProtectedScope();
3538 return new (Context) ObjCAtSynchronizedStmt(AtLoc, SyncExpr, SyncBody);
3541 /// ActOnCXXCatchBlock - Takes an exception declaration and a handler block
3542 /// and creates a proper catch handler from them.
3544 Sema::ActOnCXXCatchBlock(SourceLocation CatchLoc, Decl *ExDecl,
3545 Stmt *HandlerBlock) {
3546 // There's nothing to test that ActOnExceptionDecl didn't already test.
3547 return new (Context)
3548 CXXCatchStmt(CatchLoc, cast_or_null<VarDecl>(ExDecl), HandlerBlock);
3552 Sema::ActOnObjCAutoreleasePoolStmt(SourceLocation AtLoc, Stmt *Body) {
3553 getCurFunction()->setHasBranchProtectedScope();
3554 return new (Context) ObjCAutoreleasePoolStmt(AtLoc, Body);
3558 class CatchHandlerType {
3560 unsigned IsPointer : 1;
3562 // This is a special constructor to be used only with DenseMapInfo's
3563 // getEmptyKey() and getTombstoneKey() functions.
3564 friend struct llvm::DenseMapInfo<CatchHandlerType>;
3565 enum Unique { ForDenseMap };
3566 CatchHandlerType(QualType QT, Unique) : QT(QT), IsPointer(false) {}
3569 /// Used when creating a CatchHandlerType from a handler type; will determine
3570 /// whether the type is a pointer or reference and will strip off the top
3571 /// level pointer and cv-qualifiers.
3572 CatchHandlerType(QualType Q) : QT(Q), IsPointer(false) {
3573 if (QT->isPointerType())
3576 if (IsPointer || QT->isReferenceType())
3577 QT = QT->getPointeeType();
3578 QT = QT.getUnqualifiedType();
3581 /// Used when creating a CatchHandlerType from a base class type; pretends the
3582 /// type passed in had the pointer qualifier, does not need to get an
3583 /// unqualified type.
3584 CatchHandlerType(QualType QT, bool IsPointer)
3585 : QT(QT), IsPointer(IsPointer) {}
3587 QualType underlying() const { return QT; }
3588 bool isPointer() const { return IsPointer; }
3590 friend bool operator==(const CatchHandlerType &LHS,
3591 const CatchHandlerType &RHS) {
3592 // If the pointer qualification does not match, we can return early.
3593 if (LHS.IsPointer != RHS.IsPointer)
3595 // Otherwise, check the underlying type without cv-qualifiers.
3596 return LHS.QT == RHS.QT;
3602 template <> struct DenseMapInfo<CatchHandlerType> {
3603 static CatchHandlerType getEmptyKey() {
3604 return CatchHandlerType(DenseMapInfo<QualType>::getEmptyKey(),
3605 CatchHandlerType::ForDenseMap);
3608 static CatchHandlerType getTombstoneKey() {
3609 return CatchHandlerType(DenseMapInfo<QualType>::getTombstoneKey(),
3610 CatchHandlerType::ForDenseMap);
3613 static unsigned getHashValue(const CatchHandlerType &Base) {
3614 return DenseMapInfo<QualType>::getHashValue(Base.underlying());
3617 static bool isEqual(const CatchHandlerType &LHS,
3618 const CatchHandlerType &RHS) {
3625 class CatchTypePublicBases {
3627 const llvm::DenseMap<CatchHandlerType, CXXCatchStmt *> &TypesToCheck;
3628 const bool CheckAgainstPointer;
3630 CXXCatchStmt *FoundHandler;
3631 CanQualType FoundHandlerType;
3634 CatchTypePublicBases(
3636 const llvm::DenseMap<CatchHandlerType, CXXCatchStmt *> &T, bool C)
3637 : Ctx(Ctx), TypesToCheck(T), CheckAgainstPointer(C),
3638 FoundHandler(nullptr) {}
3640 CXXCatchStmt *getFoundHandler() const { return FoundHandler; }
3641 CanQualType getFoundHandlerType() const { return FoundHandlerType; }
3643 bool operator()(const CXXBaseSpecifier *S, CXXBasePath &) {
3644 if (S->getAccessSpecifier() == AccessSpecifier::AS_public) {
3645 CatchHandlerType Check(S->getType(), CheckAgainstPointer);
3646 const auto &M = TypesToCheck;
3647 auto I = M.find(Check);
3649 FoundHandler = I->second;
3650 FoundHandlerType = Ctx.getCanonicalType(S->getType());
3659 /// ActOnCXXTryBlock - Takes a try compound-statement and a number of
3660 /// handlers and creates a try statement from them.
3661 StmtResult Sema::ActOnCXXTryBlock(SourceLocation TryLoc, Stmt *TryBlock,
3662 ArrayRef<Stmt *> Handlers) {
3663 // Don't report an error if 'try' is used in system headers.
3664 if (!getLangOpts().CXXExceptions &&
3665 !getSourceManager().isInSystemHeader(TryLoc))
3666 Diag(TryLoc, diag::err_exceptions_disabled) << "try";
3668 // Exceptions aren't allowed in CUDA device code.
3669 if (getLangOpts().CUDA)
3670 CUDADiagIfDeviceCode(TryLoc, diag::err_cuda_device_exceptions)
3671 << "try" << CurrentCUDATarget();
3673 if (getCurScope() && getCurScope()->isOpenMPSimdDirectiveScope())
3674 Diag(TryLoc, diag::err_omp_simd_region_cannot_use_stmt) << "try";
3676 sema::FunctionScopeInfo *FSI = getCurFunction();
3678 // C++ try is incompatible with SEH __try.
3679 if (!getLangOpts().Borland && FSI->FirstSEHTryLoc.isValid()) {
3680 Diag(TryLoc, diag::err_mixing_cxx_try_seh_try);
3681 Diag(FSI->FirstSEHTryLoc, diag::note_conflicting_try_here) << "'__try'";
3684 const unsigned NumHandlers = Handlers.size();
3685 assert(!Handlers.empty() &&
3686 "The parser shouldn't call this if there are no handlers.");
3688 llvm::DenseMap<CatchHandlerType, CXXCatchStmt *> HandledTypes;
3689 for (unsigned i = 0; i < NumHandlers; ++i) {
3690 CXXCatchStmt *H = cast<CXXCatchStmt>(Handlers[i]);
3692 // Diagnose when the handler is a catch-all handler, but it isn't the last
3693 // handler for the try block. [except.handle]p5. Also, skip exception
3694 // declarations that are invalid, since we can't usefully report on them.
3695 if (!H->getExceptionDecl()) {
3696 if (i < NumHandlers - 1)
3697 return StmtError(Diag(H->getLocStart(), diag::err_early_catch_all));
3699 } else if (H->getExceptionDecl()->isInvalidDecl())
3702 // Walk the type hierarchy to diagnose when this type has already been
3703 // handled (duplication), or cannot be handled (derivation inversion). We
3704 // ignore top-level cv-qualifiers, per [except.handle]p3
3705 CatchHandlerType HandlerCHT =
3706 (QualType)Context.getCanonicalType(H->getCaughtType());
3708 // We can ignore whether the type is a reference or a pointer; we need the
3709 // underlying declaration type in order to get at the underlying record
3710 // decl, if there is one.
3711 QualType Underlying = HandlerCHT.underlying();
3712 if (auto *RD = Underlying->getAsCXXRecordDecl()) {
3713 if (!RD->hasDefinition())
3715 // Check that none of the public, unambiguous base classes are in the
3716 // map ([except.handle]p1). Give the base classes the same pointer
3717 // qualification as the original type we are basing off of. This allows
3718 // comparison against the handler type using the same top-level pointer
3719 // as the original type.
3721 Paths.setOrigin(RD);
3722 CatchTypePublicBases CTPB(Context, HandledTypes, HandlerCHT.isPointer());
3723 if (RD->lookupInBases(CTPB, Paths)) {
3724 const CXXCatchStmt *Problem = CTPB.getFoundHandler();
3725 if (!Paths.isAmbiguous(CTPB.getFoundHandlerType())) {
3726 Diag(H->getExceptionDecl()->getTypeSpecStartLoc(),
3727 diag::warn_exception_caught_by_earlier_handler)
3728 << H->getCaughtType();
3729 Diag(Problem->getExceptionDecl()->getTypeSpecStartLoc(),
3730 diag::note_previous_exception_handler)
3731 << Problem->getCaughtType();
3736 // Add the type the list of ones we have handled; diagnose if we've already
3738 auto R = HandledTypes.insert(std::make_pair(H->getCaughtType(), H));
3740 const CXXCatchStmt *Problem = R.first->second;
3741 Diag(H->getExceptionDecl()->getTypeSpecStartLoc(),
3742 diag::warn_exception_caught_by_earlier_handler)
3743 << H->getCaughtType();
3744 Diag(Problem->getExceptionDecl()->getTypeSpecStartLoc(),
3745 diag::note_previous_exception_handler)
3746 << Problem->getCaughtType();
3750 FSI->setHasCXXTry(TryLoc);
3752 return CXXTryStmt::Create(Context, TryLoc, TryBlock, Handlers);
3755 StmtResult Sema::ActOnSEHTryBlock(bool IsCXXTry, SourceLocation TryLoc,
3756 Stmt *TryBlock, Stmt *Handler) {
3757 assert(TryBlock && Handler);
3759 sema::FunctionScopeInfo *FSI = getCurFunction();
3761 // SEH __try is incompatible with C++ try. Borland appears to support this,
3763 if (!getLangOpts().Borland) {
3764 if (FSI->FirstCXXTryLoc.isValid()) {
3765 Diag(TryLoc, diag::err_mixing_cxx_try_seh_try);
3766 Diag(FSI->FirstCXXTryLoc, diag::note_conflicting_try_here) << "'try'";
3770 FSI->setHasSEHTry(TryLoc);
3772 // Reject __try in Obj-C methods, blocks, and captured decls, since we don't
3773 // track if they use SEH.
3774 DeclContext *DC = CurContext;
3775 while (DC && !DC->isFunctionOrMethod())
3776 DC = DC->getParent();
3777 FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(DC);
3779 FD->setUsesSEHTry(true);
3781 Diag(TryLoc, diag::err_seh_try_outside_functions);
3783 // Reject __try on unsupported targets.
3784 if (!Context.getTargetInfo().isSEHTrySupported())
3785 Diag(TryLoc, diag::err_seh_try_unsupported);
3787 return SEHTryStmt::Create(Context, IsCXXTry, TryLoc, TryBlock, Handler);
3791 Sema::ActOnSEHExceptBlock(SourceLocation Loc,
3794 assert(FilterExpr && Block);
3796 if(!FilterExpr->getType()->isIntegerType()) {
3797 return StmtError(Diag(FilterExpr->getExprLoc(),
3798 diag::err_filter_expression_integral)
3799 << FilterExpr->getType());
3802 return SEHExceptStmt::Create(Context,Loc,FilterExpr,Block);
3805 void Sema::ActOnStartSEHFinallyBlock() {
3806 CurrentSEHFinally.push_back(CurScope);
3809 void Sema::ActOnAbortSEHFinallyBlock() {
3810 CurrentSEHFinally.pop_back();
3813 StmtResult Sema::ActOnFinishSEHFinallyBlock(SourceLocation Loc, Stmt *Block) {
3815 CurrentSEHFinally.pop_back();
3816 return SEHFinallyStmt::Create(Context, Loc, Block);
3820 Sema::ActOnSEHLeaveStmt(SourceLocation Loc, Scope *CurScope) {
3821 Scope *SEHTryParent = CurScope;
3822 while (SEHTryParent && !SEHTryParent->isSEHTryScope())
3823 SEHTryParent = SEHTryParent->getParent();
3825 return StmtError(Diag(Loc, diag::err_ms___leave_not_in___try));
3826 CheckJumpOutOfSEHFinally(*this, Loc, *SEHTryParent);
3828 return new (Context) SEHLeaveStmt(Loc);
3831 StmtResult Sema::BuildMSDependentExistsStmt(SourceLocation KeywordLoc,
3833 NestedNameSpecifierLoc QualifierLoc,
3834 DeclarationNameInfo NameInfo,
3837 return new (Context) MSDependentExistsStmt(KeywordLoc, IsIfExists,
3838 QualifierLoc, NameInfo,
3839 cast<CompoundStmt>(Nested));
3843 StmtResult Sema::ActOnMSDependentExistsStmt(SourceLocation KeywordLoc,
3846 UnqualifiedId &Name,
3848 return BuildMSDependentExistsStmt(KeywordLoc, IsIfExists,
3849 SS.getWithLocInContext(Context),
3850 GetNameFromUnqualifiedId(Name),
3855 Sema::CreateCapturedStmtRecordDecl(CapturedDecl *&CD, SourceLocation Loc,
3856 unsigned NumParams) {
3857 DeclContext *DC = CurContext;
3858 while (!(DC->isFunctionOrMethod() || DC->isRecord() || DC->isFileContext()))
3859 DC = DC->getParent();
3861 RecordDecl *RD = nullptr;
3862 if (getLangOpts().CPlusPlus)
3863 RD = CXXRecordDecl::Create(Context, TTK_Struct, DC, Loc, Loc,
3866 RD = RecordDecl::Create(Context, TTK_Struct, DC, Loc, Loc, /*Id=*/nullptr);
3868 RD->setCapturedRecord();
3871 RD->startDefinition();
3873 assert(NumParams > 0 && "CapturedStmt requires context parameter");
3874 CD = CapturedDecl::Create(Context, CurContext, NumParams);
3879 static void buildCapturedStmtCaptureList(
3880 SmallVectorImpl<CapturedStmt::Capture> &Captures,
3881 SmallVectorImpl<Expr *> &CaptureInits,
3882 ArrayRef<CapturingScopeInfo::Capture> Candidates) {
3884 typedef ArrayRef<CapturingScopeInfo::Capture>::const_iterator CaptureIter;
3885 for (CaptureIter Cap = Candidates.begin(); Cap != Candidates.end(); ++Cap) {
3887 if (Cap->isThisCapture()) {
3888 Captures.push_back(CapturedStmt::Capture(Cap->getLocation(),
3889 CapturedStmt::VCK_This));
3890 CaptureInits.push_back(Cap->getInitExpr());
3892 } else if (Cap->isVLATypeCapture()) {
3894 CapturedStmt::Capture(Cap->getLocation(), CapturedStmt::VCK_VLAType));
3895 CaptureInits.push_back(nullptr);
3899 Captures.push_back(CapturedStmt::Capture(Cap->getLocation(),
3900 Cap->isReferenceCapture()
3901 ? CapturedStmt::VCK_ByRef
3902 : CapturedStmt::VCK_ByCopy,
3903 Cap->getVariable()));
3904 CaptureInits.push_back(Cap->getInitExpr());
3908 void Sema::ActOnCapturedRegionStart(SourceLocation Loc, Scope *CurScope,
3909 CapturedRegionKind Kind,
3910 unsigned NumParams) {
3911 CapturedDecl *CD = nullptr;
3912 RecordDecl *RD = CreateCapturedStmtRecordDecl(CD, Loc, NumParams);
3914 // Build the context parameter
3915 DeclContext *DC = CapturedDecl::castToDeclContext(CD);
3916 IdentifierInfo *ParamName = &Context.Idents.get("__context");
3917 QualType ParamType = Context.getPointerType(Context.getTagDeclType(RD));
3918 ImplicitParamDecl *Param
3919 = ImplicitParamDecl::Create(Context, DC, Loc, ParamName, ParamType);
3922 CD->setContextParam(0, Param);
3924 // Enter the capturing scope for this captured region.
3925 PushCapturedRegionScope(CurScope, CD, RD, Kind);
3928 PushDeclContext(CurScope, CD);
3932 PushExpressionEvaluationContext(
3933 ExpressionEvaluationContext::PotentiallyEvaluated);
3936 void Sema::ActOnCapturedRegionStart(SourceLocation Loc, Scope *CurScope,
3937 CapturedRegionKind Kind,
3938 ArrayRef<CapturedParamNameType> Params) {
3939 CapturedDecl *CD = nullptr;
3940 RecordDecl *RD = CreateCapturedStmtRecordDecl(CD, Loc, Params.size());
3942 // Build the context parameter
3943 DeclContext *DC = CapturedDecl::castToDeclContext(CD);
3944 bool ContextIsFound = false;
3945 unsigned ParamNum = 0;
3946 for (ArrayRef<CapturedParamNameType>::iterator I = Params.begin(),
3948 I != E; ++I, ++ParamNum) {
3949 if (I->second.isNull()) {
3950 assert(!ContextIsFound &&
3951 "null type has been found already for '__context' parameter");
3952 IdentifierInfo *ParamName = &Context.Idents.get("__context");
3953 QualType ParamType = Context.getPointerType(Context.getTagDeclType(RD));
3954 ImplicitParamDecl *Param
3955 = ImplicitParamDecl::Create(Context, DC, Loc, ParamName, ParamType);
3957 CD->setContextParam(ParamNum, Param);
3958 ContextIsFound = true;
3960 IdentifierInfo *ParamName = &Context.Idents.get(I->first);
3961 ImplicitParamDecl *Param
3962 = ImplicitParamDecl::Create(Context, DC, Loc, ParamName, I->second);
3964 CD->setParam(ParamNum, Param);
3967 assert(ContextIsFound && "no null type for '__context' parameter");
3968 if (!ContextIsFound) {
3969 // Add __context implicitly if it is not specified.
3970 IdentifierInfo *ParamName = &Context.Idents.get("__context");
3971 QualType ParamType = Context.getPointerType(Context.getTagDeclType(RD));
3972 ImplicitParamDecl *Param =
3973 ImplicitParamDecl::Create(Context, DC, Loc, ParamName, ParamType);
3975 CD->setContextParam(ParamNum, Param);
3977 // Enter the capturing scope for this captured region.
3978 PushCapturedRegionScope(CurScope, CD, RD, Kind);
3981 PushDeclContext(CurScope, CD);
3985 PushExpressionEvaluationContext(
3986 ExpressionEvaluationContext::PotentiallyEvaluated);
3989 void Sema::ActOnCapturedRegionError() {
3990 DiscardCleanupsInEvaluationContext();
3991 PopExpressionEvaluationContext();
3993 CapturedRegionScopeInfo *RSI = getCurCapturedRegion();
3994 RecordDecl *Record = RSI->TheRecordDecl;
3995 Record->setInvalidDecl();
3997 SmallVector<Decl*, 4> Fields(Record->fields());
3998 ActOnFields(/*Scope=*/nullptr, Record->getLocation(), Record, Fields,
3999 SourceLocation(), SourceLocation(), /*AttributeList=*/nullptr);
4002 PopFunctionScopeInfo();
4005 StmtResult Sema::ActOnCapturedRegionEnd(Stmt *S) {
4006 CapturedRegionScopeInfo *RSI = getCurCapturedRegion();
4008 SmallVector<CapturedStmt::Capture, 4> Captures;
4009 SmallVector<Expr *, 4> CaptureInits;
4010 buildCapturedStmtCaptureList(Captures, CaptureInits, RSI->Captures);
4012 CapturedDecl *CD = RSI->TheCapturedDecl;
4013 RecordDecl *RD = RSI->TheRecordDecl;
4015 CapturedStmt *Res = CapturedStmt::Create(
4016 getASTContext(), S, static_cast<CapturedRegionKind>(RSI->CapRegionKind),
4017 Captures, CaptureInits, CD, RD);
4019 CD->setBody(Res->getCapturedStmt());
4020 RD->completeDefinition();
4022 DiscardCleanupsInEvaluationContext();
4023 PopExpressionEvaluationContext();
4026 PopFunctionScopeInfo();