SemaStmt.cpp revision facde171ae4b8926622a1bffa833732a06f1875b
1//===--- SemaStmt.cpp - Semantic Analysis for Statements ------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This file implements semantic analysis for statements. 11// 12//===----------------------------------------------------------------------===// 13 14#include "clang/Sema/SemaInternal.h" 15#include "clang/Sema/Scope.h" 16#include "clang/Sema/ScopeInfo.h" 17#include "clang/Sema/Initialization.h" 18#include "clang/Sema/Lookup.h" 19#include "clang/AST/ASTContext.h" 20#include "clang/AST/CharUnits.h" 21#include "clang/AST/DeclObjC.h" 22#include "clang/AST/EvaluatedExprVisitor.h" 23#include "clang/AST/ExprCXX.h" 24#include "clang/AST/ExprObjC.h" 25#include "clang/AST/StmtObjC.h" 26#include "clang/AST/StmtCXX.h" 27#include "clang/AST/TypeLoc.h" 28#include "clang/Lex/Preprocessor.h" 29#include "clang/Basic/TargetInfo.h" 30#include "llvm/ADT/ArrayRef.h" 31#include "llvm/ADT/STLExtras.h" 32#include "llvm/ADT/SmallPtrSet.h" 33#include "llvm/ADT/SmallString.h" 34#include "llvm/ADT/SmallVector.h" 35using namespace clang; 36using namespace sema; 37 38StmtResult Sema::ActOnExprStmt(FullExprArg expr) { 39 Expr *E = expr.get(); 40 if (!E) // FIXME: FullExprArg has no error state? 41 return StmtError(); 42 43 // C99 6.8.3p2: The expression in an expression statement is evaluated as a 44 // void expression for its side effects. Conversion to void allows any 45 // operand, even incomplete types. 46 47 // Same thing in for stmt first clause (when expr) and third clause. 48 return Owned(static_cast<Stmt*>(E)); 49} 50 51 52StmtResult Sema::ActOnNullStmt(SourceLocation SemiLoc, 53 bool HasLeadingEmptyMacro) { 54 return Owned(new (Context) NullStmt(SemiLoc, HasLeadingEmptyMacro)); 55} 56 57StmtResult Sema::ActOnDeclStmt(DeclGroupPtrTy dg, SourceLocation StartLoc, 58 SourceLocation EndLoc) { 59 DeclGroupRef DG = dg.getAsVal<DeclGroupRef>(); 60 61 // If we have an invalid decl, just return an error. 62 if (DG.isNull()) return StmtError(); 63 64 return Owned(new (Context) DeclStmt(DG, StartLoc, EndLoc)); 65} 66 67void Sema::ActOnForEachDeclStmt(DeclGroupPtrTy dg) { 68 DeclGroupRef DG = dg.getAsVal<DeclGroupRef>(); 69 70 // If we have an invalid decl, just return. 71 if (DG.isNull() || !DG.isSingleDecl()) return; 72 VarDecl *var = cast<VarDecl>(DG.getSingleDecl()); 73 74 // suppress any potential 'unused variable' warning. 75 var->setUsed(); 76 77 // foreach variables are never actually initialized in the way that 78 // the parser came up with. 79 var->setInit(0); 80 81 // In ARC, we don't need to retain the iteration variable of a fast 82 // enumeration loop. Rather than actually trying to catch that 83 // during declaration processing, we remove the consequences here. 84 if (getLangOpts().ObjCAutoRefCount) { 85 QualType type = var->getType(); 86 87 // Only do this if we inferred the lifetime. Inferred lifetime 88 // will show up as a local qualifier because explicit lifetime 89 // should have shown up as an AttributedType instead. 90 if (type.getLocalQualifiers().getObjCLifetime() == Qualifiers::OCL_Strong) { 91 // Add 'const' and mark the variable as pseudo-strong. 92 var->setType(type.withConst()); 93 var->setARCPseudoStrong(true); 94 } 95 } 96} 97 98/// \brief Diagnose unused '==' and '!=' as likely typos for '=' or '|='. 99/// 100/// Adding a cast to void (or other expression wrappers) will prevent the 101/// warning from firing. 102static bool DiagnoseUnusedComparison(Sema &S, const Expr *E) { 103 SourceLocation Loc; 104 bool IsNotEqual, CanAssign; 105 106 if (const BinaryOperator *Op = dyn_cast<BinaryOperator>(E)) { 107 if (Op->getOpcode() != BO_EQ && Op->getOpcode() != BO_NE) 108 return false; 109 110 Loc = Op->getOperatorLoc(); 111 IsNotEqual = Op->getOpcode() == BO_NE; 112 CanAssign = Op->getLHS()->IgnoreParenImpCasts()->isLValue(); 113 } else if (const CXXOperatorCallExpr *Op = dyn_cast<CXXOperatorCallExpr>(E)) { 114 if (Op->getOperator() != OO_EqualEqual && 115 Op->getOperator() != OO_ExclaimEqual) 116 return false; 117 118 Loc = Op->getOperatorLoc(); 119 IsNotEqual = Op->getOperator() == OO_ExclaimEqual; 120 CanAssign = Op->getArg(0)->IgnoreParenImpCasts()->isLValue(); 121 } else { 122 // Not a typo-prone comparison. 123 return false; 124 } 125 126 // Suppress warnings when the operator, suspicious as it may be, comes from 127 // a macro expansion. 128 if (Loc.isMacroID()) 129 return false; 130 131 S.Diag(Loc, diag::warn_unused_comparison) 132 << (unsigned)IsNotEqual << E->getSourceRange(); 133 134 // If the LHS is a plausible entity to assign to, provide a fixit hint to 135 // correct common typos. 136 if (CanAssign) { 137 if (IsNotEqual) 138 S.Diag(Loc, diag::note_inequality_comparison_to_or_assign) 139 << FixItHint::CreateReplacement(Loc, "|="); 140 else 141 S.Diag(Loc, diag::note_equality_comparison_to_assign) 142 << FixItHint::CreateReplacement(Loc, "="); 143 } 144 145 return true; 146} 147 148void Sema::DiagnoseUnusedExprResult(const Stmt *S) { 149 if (const LabelStmt *Label = dyn_cast_or_null<LabelStmt>(S)) 150 return DiagnoseUnusedExprResult(Label->getSubStmt()); 151 152 const Expr *E = dyn_cast_or_null<Expr>(S); 153 if (!E) 154 return; 155 156 const Expr *WarnExpr; 157 SourceLocation Loc; 158 SourceRange R1, R2; 159 if (SourceMgr.isInSystemMacro(E->getExprLoc()) || 160 !E->isUnusedResultAWarning(WarnExpr, Loc, R1, R2, Context)) 161 return; 162 163 // Okay, we have an unused result. Depending on what the base expression is, 164 // we might want to make a more specific diagnostic. Check for one of these 165 // cases now. 166 unsigned DiagID = diag::warn_unused_expr; 167 if (const ExprWithCleanups *Temps = dyn_cast<ExprWithCleanups>(E)) 168 E = Temps->getSubExpr(); 169 if (const CXXBindTemporaryExpr *TempExpr = dyn_cast<CXXBindTemporaryExpr>(E)) 170 E = TempExpr->getSubExpr(); 171 172 if (DiagnoseUnusedComparison(*this, E)) 173 return; 174 175 E = WarnExpr; 176 if (const CallExpr *CE = dyn_cast<CallExpr>(E)) { 177 if (E->getType()->isVoidType()) 178 return; 179 180 // If the callee has attribute pure, const, or warn_unused_result, warn with 181 // a more specific message to make it clear what is happening. 182 if (const Decl *FD = CE->getCalleeDecl()) { 183 if (FD->getAttr<WarnUnusedResultAttr>()) { 184 Diag(Loc, diag::warn_unused_result) << R1 << R2; 185 return; 186 } 187 if (FD->getAttr<PureAttr>()) { 188 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "pure"; 189 return; 190 } 191 if (FD->getAttr<ConstAttr>()) { 192 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "const"; 193 return; 194 } 195 } 196 } else if (const ObjCMessageExpr *ME = dyn_cast<ObjCMessageExpr>(E)) { 197 if (getLangOpts().ObjCAutoRefCount && ME->isDelegateInitCall()) { 198 Diag(Loc, diag::err_arc_unused_init_message) << R1; 199 return; 200 } 201 const ObjCMethodDecl *MD = ME->getMethodDecl(); 202 if (MD && MD->getAttr<WarnUnusedResultAttr>()) { 203 Diag(Loc, diag::warn_unused_result) << R1 << R2; 204 return; 205 } 206 } else if (const PseudoObjectExpr *POE = dyn_cast<PseudoObjectExpr>(E)) { 207 const Expr *Source = POE->getSyntacticForm(); 208 if (isa<ObjCSubscriptRefExpr>(Source)) 209 DiagID = diag::warn_unused_container_subscript_expr; 210 else 211 DiagID = diag::warn_unused_property_expr; 212 } else if (const CXXFunctionalCastExpr *FC 213 = dyn_cast<CXXFunctionalCastExpr>(E)) { 214 if (isa<CXXConstructExpr>(FC->getSubExpr()) || 215 isa<CXXTemporaryObjectExpr>(FC->getSubExpr())) 216 return; 217 } 218 // Diagnose "(void*) blah" as a typo for "(void) blah". 219 else if (const CStyleCastExpr *CE = dyn_cast<CStyleCastExpr>(E)) { 220 TypeSourceInfo *TI = CE->getTypeInfoAsWritten(); 221 QualType T = TI->getType(); 222 223 // We really do want to use the non-canonical type here. 224 if (T == Context.VoidPtrTy) { 225 PointerTypeLoc TL = cast<PointerTypeLoc>(TI->getTypeLoc()); 226 227 Diag(Loc, diag::warn_unused_voidptr) 228 << FixItHint::CreateRemoval(TL.getStarLoc()); 229 return; 230 } 231 } 232 233 if (E->isGLValue() && E->getType().isVolatileQualified()) { 234 Diag(Loc, diag::warn_unused_volatile) << R1 << R2; 235 return; 236 } 237 238 DiagRuntimeBehavior(Loc, 0, PDiag(DiagID) << R1 << R2); 239} 240 241void Sema::ActOnStartOfCompoundStmt() { 242 PushCompoundScope(); 243} 244 245void Sema::ActOnFinishOfCompoundStmt() { 246 PopCompoundScope(); 247} 248 249sema::CompoundScopeInfo &Sema::getCurCompoundScope() const { 250 return getCurFunction()->CompoundScopes.back(); 251} 252 253StmtResult 254Sema::ActOnCompoundStmt(SourceLocation L, SourceLocation R, 255 MultiStmtArg elts, bool isStmtExpr) { 256 unsigned NumElts = elts.size(); 257 Stmt **Elts = reinterpret_cast<Stmt**>(elts.release()); 258 // If we're in C89 mode, check that we don't have any decls after stmts. If 259 // so, emit an extension diagnostic. 260 if (!getLangOpts().C99 && !getLangOpts().CPlusPlus) { 261 // Note that __extension__ can be around a decl. 262 unsigned i = 0; 263 // Skip over all declarations. 264 for (; i != NumElts && isa<DeclStmt>(Elts[i]); ++i) 265 /*empty*/; 266 267 // We found the end of the list or a statement. Scan for another declstmt. 268 for (; i != NumElts && !isa<DeclStmt>(Elts[i]); ++i) 269 /*empty*/; 270 271 if (i != NumElts) { 272 Decl *D = *cast<DeclStmt>(Elts[i])->decl_begin(); 273 Diag(D->getLocation(), diag::ext_mixed_decls_code); 274 } 275 } 276 // Warn about unused expressions in statements. 277 for (unsigned i = 0; i != NumElts; ++i) { 278 // Ignore statements that are last in a statement expression. 279 if (isStmtExpr && i == NumElts - 1) 280 continue; 281 282 DiagnoseUnusedExprResult(Elts[i]); 283 } 284 285 // Check for suspicious empty body (null statement) in `for' and `while' 286 // statements. Don't do anything for template instantiations, this just adds 287 // noise. 288 if (NumElts != 0 && !CurrentInstantiationScope && 289 getCurCompoundScope().HasEmptyLoopBodies) { 290 for (unsigned i = 0; i != NumElts - 1; ++i) 291 DiagnoseEmptyLoopBody(Elts[i], Elts[i + 1]); 292 } 293 294 return Owned(new (Context) CompoundStmt(Context, Elts, NumElts, L, R)); 295} 296 297StmtResult 298Sema::ActOnCaseStmt(SourceLocation CaseLoc, Expr *LHSVal, 299 SourceLocation DotDotDotLoc, Expr *RHSVal, 300 SourceLocation ColonLoc) { 301 assert((LHSVal != 0) && "missing expression in case statement"); 302 303 if (getCurFunction()->SwitchStack.empty()) { 304 Diag(CaseLoc, diag::err_case_not_in_switch); 305 return StmtError(); 306 } 307 308 if (!getLangOpts().CPlusPlus0x) { 309 // C99 6.8.4.2p3: The expression shall be an integer constant. 310 // However, GCC allows any evaluatable integer expression. 311 if (!LHSVal->isTypeDependent() && !LHSVal->isValueDependent()) { 312 LHSVal = VerifyIntegerConstantExpression(LHSVal).take(); 313 if (!LHSVal) 314 return StmtError(); 315 } 316 317 // GCC extension: The expression shall be an integer constant. 318 319 if (RHSVal && !RHSVal->isTypeDependent() && !RHSVal->isValueDependent()) { 320 RHSVal = VerifyIntegerConstantExpression(RHSVal).take(); 321 // Recover from an error by just forgetting about it. 322 } 323 } 324 325 CaseStmt *CS = new (Context) CaseStmt(LHSVal, RHSVal, CaseLoc, DotDotDotLoc, 326 ColonLoc); 327 getCurFunction()->SwitchStack.back()->addSwitchCase(CS); 328 return Owned(CS); 329} 330 331/// ActOnCaseStmtBody - This installs a statement as the body of a case. 332void Sema::ActOnCaseStmtBody(Stmt *caseStmt, Stmt *SubStmt) { 333 DiagnoseUnusedExprResult(SubStmt); 334 335 CaseStmt *CS = static_cast<CaseStmt*>(caseStmt); 336 CS->setSubStmt(SubStmt); 337} 338 339StmtResult 340Sema::ActOnDefaultStmt(SourceLocation DefaultLoc, SourceLocation ColonLoc, 341 Stmt *SubStmt, Scope *CurScope) { 342 DiagnoseUnusedExprResult(SubStmt); 343 344 if (getCurFunction()->SwitchStack.empty()) { 345 Diag(DefaultLoc, diag::err_default_not_in_switch); 346 return Owned(SubStmt); 347 } 348 349 DefaultStmt *DS = new (Context) DefaultStmt(DefaultLoc, ColonLoc, SubStmt); 350 getCurFunction()->SwitchStack.back()->addSwitchCase(DS); 351 return Owned(DS); 352} 353 354StmtResult 355Sema::ActOnLabelStmt(SourceLocation IdentLoc, LabelDecl *TheDecl, 356 SourceLocation ColonLoc, Stmt *SubStmt) { 357 // If the label was multiply defined, reject it now. 358 if (TheDecl->getStmt()) { 359 Diag(IdentLoc, diag::err_redefinition_of_label) << TheDecl->getDeclName(); 360 Diag(TheDecl->getLocation(), diag::note_previous_definition); 361 return Owned(SubStmt); 362 } 363 364 // Otherwise, things are good. Fill in the declaration and return it. 365 LabelStmt *LS = new (Context) LabelStmt(IdentLoc, TheDecl, SubStmt); 366 TheDecl->setStmt(LS); 367 if (!TheDecl->isGnuLocal()) 368 TheDecl->setLocation(IdentLoc); 369 return Owned(LS); 370} 371 372StmtResult Sema::ActOnAttributedStmt(SourceLocation AttrLoc, 373 const AttrVec &Attrs, 374 Stmt *SubStmt) { 375 // Fill in the declaration and return it. Variable length will require to 376 // change this to AttributedStmt::Create(Context, ....); 377 // and probably using ArrayRef 378 AttributedStmt *LS = new (Context) AttributedStmt(AttrLoc, Attrs, SubStmt); 379 return Owned(LS); 380} 381 382StmtResult 383Sema::ActOnIfStmt(SourceLocation IfLoc, FullExprArg CondVal, Decl *CondVar, 384 Stmt *thenStmt, SourceLocation ElseLoc, 385 Stmt *elseStmt) { 386 ExprResult CondResult(CondVal.release()); 387 388 VarDecl *ConditionVar = 0; 389 if (CondVar) { 390 ConditionVar = cast<VarDecl>(CondVar); 391 CondResult = CheckConditionVariable(ConditionVar, IfLoc, true); 392 if (CondResult.isInvalid()) 393 return StmtError(); 394 } 395 Expr *ConditionExpr = CondResult.takeAs<Expr>(); 396 if (!ConditionExpr) 397 return StmtError(); 398 399 DiagnoseUnusedExprResult(thenStmt); 400 401 if (!elseStmt) { 402 DiagnoseEmptyStmtBody(ConditionExpr->getLocEnd(), thenStmt, 403 diag::warn_empty_if_body); 404 } 405 406 DiagnoseUnusedExprResult(elseStmt); 407 408 return Owned(new (Context) IfStmt(Context, IfLoc, ConditionVar, ConditionExpr, 409 thenStmt, ElseLoc, elseStmt)); 410} 411 412/// ConvertIntegerToTypeWarnOnOverflow - Convert the specified APInt to have 413/// the specified width and sign. If an overflow occurs, detect it and emit 414/// the specified diagnostic. 415void Sema::ConvertIntegerToTypeWarnOnOverflow(llvm::APSInt &Val, 416 unsigned NewWidth, bool NewSign, 417 SourceLocation Loc, 418 unsigned DiagID) { 419 // Perform a conversion to the promoted condition type if needed. 420 if (NewWidth > Val.getBitWidth()) { 421 // If this is an extension, just do it. 422 Val = Val.extend(NewWidth); 423 Val.setIsSigned(NewSign); 424 425 // If the input was signed and negative and the output is 426 // unsigned, don't bother to warn: this is implementation-defined 427 // behavior. 428 // FIXME: Introduce a second, default-ignored warning for this case? 429 } else if (NewWidth < Val.getBitWidth()) { 430 // If this is a truncation, check for overflow. 431 llvm::APSInt ConvVal(Val); 432 ConvVal = ConvVal.trunc(NewWidth); 433 ConvVal.setIsSigned(NewSign); 434 ConvVal = ConvVal.extend(Val.getBitWidth()); 435 ConvVal.setIsSigned(Val.isSigned()); 436 if (ConvVal != Val) 437 Diag(Loc, DiagID) << Val.toString(10) << ConvVal.toString(10); 438 439 // Regardless of whether a diagnostic was emitted, really do the 440 // truncation. 441 Val = Val.trunc(NewWidth); 442 Val.setIsSigned(NewSign); 443 } else if (NewSign != Val.isSigned()) { 444 // Convert the sign to match the sign of the condition. This can cause 445 // overflow as well: unsigned(INTMIN) 446 // We don't diagnose this overflow, because it is implementation-defined 447 // behavior. 448 // FIXME: Introduce a second, default-ignored warning for this case? 449 llvm::APSInt OldVal(Val); 450 Val.setIsSigned(NewSign); 451 } 452} 453 454namespace { 455 struct CaseCompareFunctor { 456 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS, 457 const llvm::APSInt &RHS) { 458 return LHS.first < RHS; 459 } 460 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS, 461 const std::pair<llvm::APSInt, CaseStmt*> &RHS) { 462 return LHS.first < RHS.first; 463 } 464 bool operator()(const llvm::APSInt &LHS, 465 const std::pair<llvm::APSInt, CaseStmt*> &RHS) { 466 return LHS < RHS.first; 467 } 468 }; 469} 470 471/// CmpCaseVals - Comparison predicate for sorting case values. 472/// 473static bool CmpCaseVals(const std::pair<llvm::APSInt, CaseStmt*>& lhs, 474 const std::pair<llvm::APSInt, CaseStmt*>& rhs) { 475 if (lhs.first < rhs.first) 476 return true; 477 478 if (lhs.first == rhs.first && 479 lhs.second->getCaseLoc().getRawEncoding() 480 < rhs.second->getCaseLoc().getRawEncoding()) 481 return true; 482 return false; 483} 484 485/// CmpEnumVals - Comparison predicate for sorting enumeration values. 486/// 487static bool CmpEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs, 488 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs) 489{ 490 return lhs.first < rhs.first; 491} 492 493/// EqEnumVals - Comparison preficate for uniqing enumeration values. 494/// 495static bool EqEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs, 496 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs) 497{ 498 return lhs.first == rhs.first; 499} 500 501/// GetTypeBeforeIntegralPromotion - Returns the pre-promotion type of 502/// potentially integral-promoted expression @p expr. 503static QualType GetTypeBeforeIntegralPromotion(Expr *&expr) { 504 if (ExprWithCleanups *cleanups = dyn_cast<ExprWithCleanups>(expr)) 505 expr = cleanups->getSubExpr(); 506 while (ImplicitCastExpr *impcast = dyn_cast<ImplicitCastExpr>(expr)) { 507 if (impcast->getCastKind() != CK_IntegralCast) break; 508 expr = impcast->getSubExpr(); 509 } 510 return expr->getType(); 511} 512 513StmtResult 514Sema::ActOnStartOfSwitchStmt(SourceLocation SwitchLoc, Expr *Cond, 515 Decl *CondVar) { 516 ExprResult CondResult; 517 518 VarDecl *ConditionVar = 0; 519 if (CondVar) { 520 ConditionVar = cast<VarDecl>(CondVar); 521 CondResult = CheckConditionVariable(ConditionVar, SourceLocation(), false); 522 if (CondResult.isInvalid()) 523 return StmtError(); 524 525 Cond = CondResult.release(); 526 } 527 528 if (!Cond) 529 return StmtError(); 530 531 class SwitchConvertDiagnoser : public ICEConvertDiagnoser { 532 Expr *Cond; 533 534 public: 535 SwitchConvertDiagnoser(Expr *Cond) 536 : ICEConvertDiagnoser(false, true), Cond(Cond) { } 537 538 virtual DiagnosticBuilder diagnoseNotInt(Sema &S, SourceLocation Loc, 539 QualType T) { 540 return S.Diag(Loc, diag::err_typecheck_statement_requires_integer) << T; 541 } 542 543 virtual DiagnosticBuilder diagnoseIncomplete(Sema &S, SourceLocation Loc, 544 QualType T) { 545 return S.Diag(Loc, diag::err_switch_incomplete_class_type) 546 << T << Cond->getSourceRange(); 547 } 548 549 virtual DiagnosticBuilder diagnoseExplicitConv(Sema &S, SourceLocation Loc, 550 QualType T, 551 QualType ConvTy) { 552 return S.Diag(Loc, diag::err_switch_explicit_conversion) << T << ConvTy; 553 } 554 555 virtual DiagnosticBuilder noteExplicitConv(Sema &S, CXXConversionDecl *Conv, 556 QualType ConvTy) { 557 return S.Diag(Conv->getLocation(), diag::note_switch_conversion) 558 << ConvTy->isEnumeralType() << ConvTy; 559 } 560 561 virtual DiagnosticBuilder diagnoseAmbiguous(Sema &S, SourceLocation Loc, 562 QualType T) { 563 return S.Diag(Loc, diag::err_switch_multiple_conversions) << T; 564 } 565 566 virtual DiagnosticBuilder noteAmbiguous(Sema &S, CXXConversionDecl *Conv, 567 QualType ConvTy) { 568 return S.Diag(Conv->getLocation(), diag::note_switch_conversion) 569 << ConvTy->isEnumeralType() << ConvTy; 570 } 571 572 virtual DiagnosticBuilder diagnoseConversion(Sema &S, SourceLocation Loc, 573 QualType T, 574 QualType ConvTy) { 575 return DiagnosticBuilder::getEmpty(); 576 } 577 } SwitchDiagnoser(Cond); 578 579 CondResult 580 = ConvertToIntegralOrEnumerationType(SwitchLoc, Cond, SwitchDiagnoser, 581 /*AllowScopedEnumerations*/ true); 582 if (CondResult.isInvalid()) return StmtError(); 583 Cond = CondResult.take(); 584 585 // C99 6.8.4.2p5 - Integer promotions are performed on the controlling expr. 586 CondResult = UsualUnaryConversions(Cond); 587 if (CondResult.isInvalid()) return StmtError(); 588 Cond = CondResult.take(); 589 590 if (!CondVar) { 591 CheckImplicitConversions(Cond, SwitchLoc); 592 CondResult = MaybeCreateExprWithCleanups(Cond); 593 if (CondResult.isInvalid()) 594 return StmtError(); 595 Cond = CondResult.take(); 596 } 597 598 getCurFunction()->setHasBranchIntoScope(); 599 600 SwitchStmt *SS = new (Context) SwitchStmt(Context, ConditionVar, Cond); 601 getCurFunction()->SwitchStack.push_back(SS); 602 return Owned(SS); 603} 604 605static void AdjustAPSInt(llvm::APSInt &Val, unsigned BitWidth, bool IsSigned) { 606 if (Val.getBitWidth() < BitWidth) 607 Val = Val.extend(BitWidth); 608 else if (Val.getBitWidth() > BitWidth) 609 Val = Val.trunc(BitWidth); 610 Val.setIsSigned(IsSigned); 611} 612 613StmtResult 614Sema::ActOnFinishSwitchStmt(SourceLocation SwitchLoc, Stmt *Switch, 615 Stmt *BodyStmt) { 616 SwitchStmt *SS = cast<SwitchStmt>(Switch); 617 assert(SS == getCurFunction()->SwitchStack.back() && 618 "switch stack missing push/pop!"); 619 620 SS->setBody(BodyStmt, SwitchLoc); 621 getCurFunction()->SwitchStack.pop_back(); 622 623 Expr *CondExpr = SS->getCond(); 624 if (!CondExpr) return StmtError(); 625 626 QualType CondType = CondExpr->getType(); 627 628 Expr *CondExprBeforePromotion = CondExpr; 629 QualType CondTypeBeforePromotion = 630 GetTypeBeforeIntegralPromotion(CondExprBeforePromotion); 631 632 // C++ 6.4.2.p2: 633 // Integral promotions are performed (on the switch condition). 634 // 635 // A case value unrepresentable by the original switch condition 636 // type (before the promotion) doesn't make sense, even when it can 637 // be represented by the promoted type. Therefore we need to find 638 // the pre-promotion type of the switch condition. 639 if (!CondExpr->isTypeDependent()) { 640 // We have already converted the expression to an integral or enumeration 641 // type, when we started the switch statement. If we don't have an 642 // appropriate type now, just return an error. 643 if (!CondType->isIntegralOrEnumerationType()) 644 return StmtError(); 645 646 if (CondExpr->isKnownToHaveBooleanValue()) { 647 // switch(bool_expr) {...} is often a programmer error, e.g. 648 // switch(n && mask) { ... } // Doh - should be "n & mask". 649 // One can always use an if statement instead of switch(bool_expr). 650 Diag(SwitchLoc, diag::warn_bool_switch_condition) 651 << CondExpr->getSourceRange(); 652 } 653 } 654 655 // Get the bitwidth of the switched-on value before promotions. We must 656 // convert the integer case values to this width before comparison. 657 bool HasDependentValue 658 = CondExpr->isTypeDependent() || CondExpr->isValueDependent(); 659 unsigned CondWidth 660 = HasDependentValue ? 0 : Context.getIntWidth(CondTypeBeforePromotion); 661 bool CondIsSigned 662 = CondTypeBeforePromotion->isSignedIntegerOrEnumerationType(); 663 664 // Accumulate all of the case values in a vector so that we can sort them 665 // and detect duplicates. This vector contains the APInt for the case after 666 // it has been converted to the condition type. 667 typedef SmallVector<std::pair<llvm::APSInt, CaseStmt*>, 64> CaseValsTy; 668 CaseValsTy CaseVals; 669 670 // Keep track of any GNU case ranges we see. The APSInt is the low value. 671 typedef std::vector<std::pair<llvm::APSInt, CaseStmt*> > CaseRangesTy; 672 CaseRangesTy CaseRanges; 673 674 DefaultStmt *TheDefaultStmt = 0; 675 676 bool CaseListIsErroneous = false; 677 678 for (SwitchCase *SC = SS->getSwitchCaseList(); SC && !HasDependentValue; 679 SC = SC->getNextSwitchCase()) { 680 681 if (DefaultStmt *DS = dyn_cast<DefaultStmt>(SC)) { 682 if (TheDefaultStmt) { 683 Diag(DS->getDefaultLoc(), diag::err_multiple_default_labels_defined); 684 Diag(TheDefaultStmt->getDefaultLoc(), diag::note_duplicate_case_prev); 685 686 // FIXME: Remove the default statement from the switch block so that 687 // we'll return a valid AST. This requires recursing down the AST and 688 // finding it, not something we are set up to do right now. For now, 689 // just lop the entire switch stmt out of the AST. 690 CaseListIsErroneous = true; 691 } 692 TheDefaultStmt = DS; 693 694 } else { 695 CaseStmt *CS = cast<CaseStmt>(SC); 696 697 Expr *Lo = CS->getLHS(); 698 699 if (Lo->isTypeDependent() || Lo->isValueDependent()) { 700 HasDependentValue = true; 701 break; 702 } 703 704 llvm::APSInt LoVal; 705 706 if (getLangOpts().CPlusPlus0x) { 707 // C++11 [stmt.switch]p2: the constant-expression shall be a converted 708 // constant expression of the promoted type of the switch condition. 709 ExprResult ConvLo = 710 CheckConvertedConstantExpression(Lo, CondType, LoVal, CCEK_CaseValue); 711 if (ConvLo.isInvalid()) { 712 CaseListIsErroneous = true; 713 continue; 714 } 715 Lo = ConvLo.take(); 716 } else { 717 // We already verified that the expression has a i-c-e value (C99 718 // 6.8.4.2p3) - get that value now. 719 LoVal = Lo->EvaluateKnownConstInt(Context); 720 721 // If the LHS is not the same type as the condition, insert an implicit 722 // cast. 723 Lo = DefaultLvalueConversion(Lo).take(); 724 Lo = ImpCastExprToType(Lo, CondType, CK_IntegralCast).take(); 725 } 726 727 // Convert the value to the same width/sign as the condition had prior to 728 // integral promotions. 729 // 730 // FIXME: This causes us to reject valid code: 731 // switch ((char)c) { case 256: case 0: return 0; } 732 // Here we claim there is a duplicated condition value, but there is not. 733 ConvertIntegerToTypeWarnOnOverflow(LoVal, CondWidth, CondIsSigned, 734 Lo->getLocStart(), 735 diag::warn_case_value_overflow); 736 737 CS->setLHS(Lo); 738 739 // If this is a case range, remember it in CaseRanges, otherwise CaseVals. 740 if (CS->getRHS()) { 741 if (CS->getRHS()->isTypeDependent() || 742 CS->getRHS()->isValueDependent()) { 743 HasDependentValue = true; 744 break; 745 } 746 CaseRanges.push_back(std::make_pair(LoVal, CS)); 747 } else 748 CaseVals.push_back(std::make_pair(LoVal, CS)); 749 } 750 } 751 752 if (!HasDependentValue) { 753 // If we don't have a default statement, check whether the 754 // condition is constant. 755 llvm::APSInt ConstantCondValue; 756 bool HasConstantCond = false; 757 if (!HasDependentValue && !TheDefaultStmt) { 758 HasConstantCond 759 = CondExprBeforePromotion->EvaluateAsInt(ConstantCondValue, Context, 760 Expr::SE_AllowSideEffects); 761 assert(!HasConstantCond || 762 (ConstantCondValue.getBitWidth() == CondWidth && 763 ConstantCondValue.isSigned() == CondIsSigned)); 764 } 765 bool ShouldCheckConstantCond = HasConstantCond; 766 767 // Sort all the scalar case values so we can easily detect duplicates. 768 std::stable_sort(CaseVals.begin(), CaseVals.end(), CmpCaseVals); 769 770 if (!CaseVals.empty()) { 771 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) { 772 if (ShouldCheckConstantCond && 773 CaseVals[i].first == ConstantCondValue) 774 ShouldCheckConstantCond = false; 775 776 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) { 777 // If we have a duplicate, report it. 778 // First, determine if either case value has a name 779 StringRef PrevString, CurrString; 780 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts(); 781 Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts(); 782 if (DeclRefExpr *DeclRef = dyn_cast<DeclRefExpr>(PrevCase)) { 783 PrevString = DeclRef->getDecl()->getName(); 784 } 785 if (DeclRefExpr *DeclRef = dyn_cast<DeclRefExpr>(CurrCase)) { 786 CurrString = DeclRef->getDecl()->getName(); 787 } 788 llvm::SmallString<16> CaseValStr; 789 CaseVals[i-1].first.toString(CaseValStr); 790 791 if (PrevString == CurrString) 792 Diag(CaseVals[i].second->getLHS()->getLocStart(), 793 diag::err_duplicate_case) << 794 (PrevString.empty() ? CaseValStr.str() : PrevString); 795 else 796 Diag(CaseVals[i].second->getLHS()->getLocStart(), 797 diag::err_duplicate_case_differing_expr) << 798 (PrevString.empty() ? CaseValStr.str() : PrevString) << 799 (CurrString.empty() ? CaseValStr.str() : CurrString) << 800 CaseValStr; 801 802 Diag(CaseVals[i-1].second->getLHS()->getLocStart(), 803 diag::note_duplicate_case_prev); 804 // FIXME: We really want to remove the bogus case stmt from the 805 // substmt, but we have no way to do this right now. 806 CaseListIsErroneous = true; 807 } 808 } 809 } 810 811 // Detect duplicate case ranges, which usually don't exist at all in 812 // the first place. 813 if (!CaseRanges.empty()) { 814 // Sort all the case ranges by their low value so we can easily detect 815 // overlaps between ranges. 816 std::stable_sort(CaseRanges.begin(), CaseRanges.end()); 817 818 // Scan the ranges, computing the high values and removing empty ranges. 819 std::vector<llvm::APSInt> HiVals; 820 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) { 821 llvm::APSInt &LoVal = CaseRanges[i].first; 822 CaseStmt *CR = CaseRanges[i].second; 823 Expr *Hi = CR->getRHS(); 824 llvm::APSInt HiVal; 825 826 if (getLangOpts().CPlusPlus0x) { 827 // C++11 [stmt.switch]p2: the constant-expression shall be a converted 828 // constant expression of the promoted type of the switch condition. 829 ExprResult ConvHi = 830 CheckConvertedConstantExpression(Hi, CondType, HiVal, 831 CCEK_CaseValue); 832 if (ConvHi.isInvalid()) { 833 CaseListIsErroneous = true; 834 continue; 835 } 836 Hi = ConvHi.take(); 837 } else { 838 HiVal = Hi->EvaluateKnownConstInt(Context); 839 840 // If the RHS is not the same type as the condition, insert an 841 // implicit cast. 842 Hi = DefaultLvalueConversion(Hi).take(); 843 Hi = ImpCastExprToType(Hi, CondType, CK_IntegralCast).take(); 844 } 845 846 // Convert the value to the same width/sign as the condition. 847 ConvertIntegerToTypeWarnOnOverflow(HiVal, CondWidth, CondIsSigned, 848 Hi->getLocStart(), 849 diag::warn_case_value_overflow); 850 851 CR->setRHS(Hi); 852 853 // If the low value is bigger than the high value, the case is empty. 854 if (LoVal > HiVal) { 855 Diag(CR->getLHS()->getLocStart(), diag::warn_case_empty_range) 856 << SourceRange(CR->getLHS()->getLocStart(), 857 Hi->getLocEnd()); 858 CaseRanges.erase(CaseRanges.begin()+i); 859 --i, --e; 860 continue; 861 } 862 863 if (ShouldCheckConstantCond && 864 LoVal <= ConstantCondValue && 865 ConstantCondValue <= HiVal) 866 ShouldCheckConstantCond = false; 867 868 HiVals.push_back(HiVal); 869 } 870 871 // Rescan the ranges, looking for overlap with singleton values and other 872 // ranges. Since the range list is sorted, we only need to compare case 873 // ranges with their neighbors. 874 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) { 875 llvm::APSInt &CRLo = CaseRanges[i].first; 876 llvm::APSInt &CRHi = HiVals[i]; 877 CaseStmt *CR = CaseRanges[i].second; 878 879 // Check to see whether the case range overlaps with any 880 // singleton cases. 881 CaseStmt *OverlapStmt = 0; 882 llvm::APSInt OverlapVal(32); 883 884 // Find the smallest value >= the lower bound. If I is in the 885 // case range, then we have overlap. 886 CaseValsTy::iterator I = std::lower_bound(CaseVals.begin(), 887 CaseVals.end(), CRLo, 888 CaseCompareFunctor()); 889 if (I != CaseVals.end() && I->first < CRHi) { 890 OverlapVal = I->first; // Found overlap with scalar. 891 OverlapStmt = I->second; 892 } 893 894 // Find the smallest value bigger than the upper bound. 895 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor()); 896 if (I != CaseVals.begin() && (I-1)->first >= CRLo) { 897 OverlapVal = (I-1)->first; // Found overlap with scalar. 898 OverlapStmt = (I-1)->second; 899 } 900 901 // Check to see if this case stmt overlaps with the subsequent 902 // case range. 903 if (i && CRLo <= HiVals[i-1]) { 904 OverlapVal = HiVals[i-1]; // Found overlap with range. 905 OverlapStmt = CaseRanges[i-1].second; 906 } 907 908 if (OverlapStmt) { 909 // If we have a duplicate, report it. 910 Diag(CR->getLHS()->getLocStart(), diag::err_duplicate_case) 911 << OverlapVal.toString(10); 912 Diag(OverlapStmt->getLHS()->getLocStart(), 913 diag::note_duplicate_case_prev); 914 // FIXME: We really want to remove the bogus case stmt from the 915 // substmt, but we have no way to do this right now. 916 CaseListIsErroneous = true; 917 } 918 } 919 } 920 921 // Complain if we have a constant condition and we didn't find a match. 922 if (!CaseListIsErroneous && ShouldCheckConstantCond) { 923 // TODO: it would be nice if we printed enums as enums, chars as 924 // chars, etc. 925 Diag(CondExpr->getExprLoc(), diag::warn_missing_case_for_condition) 926 << ConstantCondValue.toString(10) 927 << CondExpr->getSourceRange(); 928 } 929 930 // Check to see if switch is over an Enum and handles all of its 931 // values. We only issue a warning if there is not 'default:', but 932 // we still do the analysis to preserve this information in the AST 933 // (which can be used by flow-based analyes). 934 // 935 const EnumType *ET = CondTypeBeforePromotion->getAs<EnumType>(); 936 937 // If switch has default case, then ignore it. 938 if (!CaseListIsErroneous && !HasConstantCond && ET) { 939 const EnumDecl *ED = ET->getDecl(); 940 typedef SmallVector<std::pair<llvm::APSInt, EnumConstantDecl*>, 64> 941 EnumValsTy; 942 EnumValsTy EnumVals; 943 944 // Gather all enum values, set their type and sort them, 945 // allowing easier comparison with CaseVals. 946 for (EnumDecl::enumerator_iterator EDI = ED->enumerator_begin(); 947 EDI != ED->enumerator_end(); ++EDI) { 948 llvm::APSInt Val = EDI->getInitVal(); 949 AdjustAPSInt(Val, CondWidth, CondIsSigned); 950 EnumVals.push_back(std::make_pair(Val, &*EDI)); 951 } 952 std::stable_sort(EnumVals.begin(), EnumVals.end(), CmpEnumVals); 953 EnumValsTy::iterator EIend = 954 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals); 955 956 // See which case values aren't in enum. 957 EnumValsTy::const_iterator EI = EnumVals.begin(); 958 for (CaseValsTy::const_iterator CI = CaseVals.begin(); 959 CI != CaseVals.end(); CI++) { 960 while (EI != EIend && EI->first < CI->first) 961 EI++; 962 if (EI == EIend || EI->first > CI->first) 963 Diag(CI->second->getLHS()->getExprLoc(), diag::warn_not_in_enum) 964 << CondTypeBeforePromotion; 965 } 966 // See which of case ranges aren't in enum 967 EI = EnumVals.begin(); 968 for (CaseRangesTy::const_iterator RI = CaseRanges.begin(); 969 RI != CaseRanges.end() && EI != EIend; RI++) { 970 while (EI != EIend && EI->first < RI->first) 971 EI++; 972 973 if (EI == EIend || EI->first != RI->first) { 974 Diag(RI->second->getLHS()->getExprLoc(), diag::warn_not_in_enum) 975 << CondTypeBeforePromotion; 976 } 977 978 llvm::APSInt Hi = 979 RI->second->getRHS()->EvaluateKnownConstInt(Context); 980 AdjustAPSInt(Hi, CondWidth, CondIsSigned); 981 while (EI != EIend && EI->first < Hi) 982 EI++; 983 if (EI == EIend || EI->first != Hi) 984 Diag(RI->second->getRHS()->getExprLoc(), diag::warn_not_in_enum) 985 << CondTypeBeforePromotion; 986 } 987 988 // Check which enum vals aren't in switch 989 CaseValsTy::const_iterator CI = CaseVals.begin(); 990 CaseRangesTy::const_iterator RI = CaseRanges.begin(); 991 bool hasCasesNotInSwitch = false; 992 993 SmallVector<DeclarationName,8> UnhandledNames; 994 995 for (EI = EnumVals.begin(); EI != EIend; EI++){ 996 // Drop unneeded case values 997 llvm::APSInt CIVal; 998 while (CI != CaseVals.end() && CI->first < EI->first) 999 CI++; 1000 1001 if (CI != CaseVals.end() && CI->first == EI->first) 1002 continue; 1003 1004 // Drop unneeded case ranges 1005 for (; RI != CaseRanges.end(); RI++) { 1006 llvm::APSInt Hi = 1007 RI->second->getRHS()->EvaluateKnownConstInt(Context); 1008 AdjustAPSInt(Hi, CondWidth, CondIsSigned); 1009 if (EI->first <= Hi) 1010 break; 1011 } 1012 1013 if (RI == CaseRanges.end() || EI->first < RI->first) { 1014 hasCasesNotInSwitch = true; 1015 UnhandledNames.push_back(EI->second->getDeclName()); 1016 } 1017 } 1018 1019 if (TheDefaultStmt && UnhandledNames.empty()) 1020 Diag(TheDefaultStmt->getDefaultLoc(), diag::warn_unreachable_default); 1021 1022 // Produce a nice diagnostic if multiple values aren't handled. 1023 switch (UnhandledNames.size()) { 1024 case 0: break; 1025 case 1: 1026 Diag(CondExpr->getExprLoc(), TheDefaultStmt 1027 ? diag::warn_def_missing_case1 : diag::warn_missing_case1) 1028 << UnhandledNames[0]; 1029 break; 1030 case 2: 1031 Diag(CondExpr->getExprLoc(), TheDefaultStmt 1032 ? diag::warn_def_missing_case2 : diag::warn_missing_case2) 1033 << UnhandledNames[0] << UnhandledNames[1]; 1034 break; 1035 case 3: 1036 Diag(CondExpr->getExprLoc(), TheDefaultStmt 1037 ? diag::warn_def_missing_case3 : diag::warn_missing_case3) 1038 << UnhandledNames[0] << UnhandledNames[1] << UnhandledNames[2]; 1039 break; 1040 default: 1041 Diag(CondExpr->getExprLoc(), TheDefaultStmt 1042 ? diag::warn_def_missing_cases : diag::warn_missing_cases) 1043 << (unsigned)UnhandledNames.size() 1044 << UnhandledNames[0] << UnhandledNames[1] << UnhandledNames[2]; 1045 break; 1046 } 1047 1048 if (!hasCasesNotInSwitch) 1049 SS->setAllEnumCasesCovered(); 1050 } 1051 } 1052 1053 DiagnoseEmptyStmtBody(CondExpr->getLocEnd(), BodyStmt, 1054 diag::warn_empty_switch_body); 1055 1056 // FIXME: If the case list was broken is some way, we don't have a good system 1057 // to patch it up. Instead, just return the whole substmt as broken. 1058 if (CaseListIsErroneous) 1059 return StmtError(); 1060 1061 return Owned(SS); 1062} 1063 1064StmtResult 1065Sema::ActOnWhileStmt(SourceLocation WhileLoc, FullExprArg Cond, 1066 Decl *CondVar, Stmt *Body) { 1067 ExprResult CondResult(Cond.release()); 1068 1069 VarDecl *ConditionVar = 0; 1070 if (CondVar) { 1071 ConditionVar = cast<VarDecl>(CondVar); 1072 CondResult = CheckConditionVariable(ConditionVar, WhileLoc, true); 1073 if (CondResult.isInvalid()) 1074 return StmtError(); 1075 } 1076 Expr *ConditionExpr = CondResult.take(); 1077 if (!ConditionExpr) 1078 return StmtError(); 1079 1080 DiagnoseUnusedExprResult(Body); 1081 1082 if (isa<NullStmt>(Body)) 1083 getCurCompoundScope().setHasEmptyLoopBodies(); 1084 1085 return Owned(new (Context) WhileStmt(Context, ConditionVar, ConditionExpr, 1086 Body, WhileLoc)); 1087} 1088 1089StmtResult 1090Sema::ActOnDoStmt(SourceLocation DoLoc, Stmt *Body, 1091 SourceLocation WhileLoc, SourceLocation CondLParen, 1092 Expr *Cond, SourceLocation CondRParen) { 1093 assert(Cond && "ActOnDoStmt(): missing expression"); 1094 1095 ExprResult CondResult = CheckBooleanCondition(Cond, DoLoc); 1096 if (CondResult.isInvalid() || CondResult.isInvalid()) 1097 return StmtError(); 1098 Cond = CondResult.take(); 1099 1100 CheckImplicitConversions(Cond, DoLoc); 1101 CondResult = MaybeCreateExprWithCleanups(Cond); 1102 if (CondResult.isInvalid()) 1103 return StmtError(); 1104 Cond = CondResult.take(); 1105 1106 DiagnoseUnusedExprResult(Body); 1107 1108 return Owned(new (Context) DoStmt(Body, Cond, DoLoc, WhileLoc, CondRParen)); 1109} 1110 1111namespace { 1112 // This visitor will traverse a conditional statement and store all 1113 // the evaluated decls into a vector. Simple is set to true if none 1114 // of the excluded constructs are used. 1115 class DeclExtractor : public EvaluatedExprVisitor<DeclExtractor> { 1116 llvm::SmallPtrSet<VarDecl*, 8> &Decls; 1117 llvm::SmallVector<SourceRange, 10> &Ranges; 1118 bool Simple; 1119public: 1120 typedef EvaluatedExprVisitor<DeclExtractor> Inherited; 1121 1122 DeclExtractor(Sema &S, llvm::SmallPtrSet<VarDecl*, 8> &Decls, 1123 llvm::SmallVector<SourceRange, 10> &Ranges) : 1124 Inherited(S.Context), 1125 Decls(Decls), 1126 Ranges(Ranges), 1127 Simple(true) {} 1128 1129 bool isSimple() { return Simple; } 1130 1131 // Replaces the method in EvaluatedExprVisitor. 1132 void VisitMemberExpr(MemberExpr* E) { 1133 Simple = false; 1134 } 1135 1136 // Any Stmt not whitelisted will cause the condition to be marked complex. 1137 void VisitStmt(Stmt *S) { 1138 Simple = false; 1139 } 1140 1141 void VisitBinaryOperator(BinaryOperator *E) { 1142 Visit(E->getLHS()); 1143 Visit(E->getRHS()); 1144 } 1145 1146 void VisitCastExpr(CastExpr *E) { 1147 Visit(E->getSubExpr()); 1148 } 1149 1150 void VisitUnaryOperator(UnaryOperator *E) { 1151 // Skip checking conditionals with derefernces. 1152 if (E->getOpcode() == UO_Deref) 1153 Simple = false; 1154 else 1155 Visit(E->getSubExpr()); 1156 } 1157 1158 void VisitConditionalOperator(ConditionalOperator *E) { 1159 Visit(E->getCond()); 1160 Visit(E->getTrueExpr()); 1161 Visit(E->getFalseExpr()); 1162 } 1163 1164 void VisitParenExpr(ParenExpr *E) { 1165 Visit(E->getSubExpr()); 1166 } 1167 1168 void VisitBinaryConditionalOperator(BinaryConditionalOperator *E) { 1169 Visit(E->getOpaqueValue()->getSourceExpr()); 1170 Visit(E->getFalseExpr()); 1171 } 1172 1173 void VisitIntegerLiteral(IntegerLiteral *E) { } 1174 void VisitFloatingLiteral(FloatingLiteral *E) { } 1175 void VisitCXXBoolLiteralExpr(CXXBoolLiteralExpr *E) { } 1176 void VisitCharacterLiteral(CharacterLiteral *E) { } 1177 void VisitGNUNullExpr(GNUNullExpr *E) { } 1178 void VisitImaginaryLiteral(ImaginaryLiteral *E) { } 1179 1180 void VisitDeclRefExpr(DeclRefExpr *E) { 1181 VarDecl *VD = dyn_cast<VarDecl>(E->getDecl()); 1182 if (!VD) return; 1183 1184 Ranges.push_back(E->getSourceRange()); 1185 1186 Decls.insert(VD); 1187 } 1188 1189 }; // end class DeclExtractor 1190 1191 // DeclMatcher checks to see if the decls are used in a non-evauluated 1192 // context. 1193 class DeclMatcher : public EvaluatedExprVisitor<DeclMatcher> { 1194 llvm::SmallPtrSet<VarDecl*, 8> &Decls; 1195 bool FoundDecl; 1196 //bool EvalDecl; 1197 1198public: 1199 typedef EvaluatedExprVisitor<DeclMatcher> Inherited; 1200 1201 DeclMatcher(Sema &S, llvm::SmallPtrSet<VarDecl*, 8> &Decls, Stmt *Statement) : 1202 Inherited(S.Context), Decls(Decls), FoundDecl(false) { 1203 if (!Statement) return; 1204 1205 Visit(Statement); 1206 } 1207 1208 void VisitReturnStmt(ReturnStmt *S) { 1209 FoundDecl = true; 1210 } 1211 1212 void VisitBreakStmt(BreakStmt *S) { 1213 FoundDecl = true; 1214 } 1215 1216 void VisitGotoStmt(GotoStmt *S) { 1217 FoundDecl = true; 1218 } 1219 1220 void VisitCastExpr(CastExpr *E) { 1221 if (E->getCastKind() == CK_LValueToRValue) 1222 CheckLValueToRValueCast(E->getSubExpr()); 1223 else 1224 Visit(E->getSubExpr()); 1225 } 1226 1227 void CheckLValueToRValueCast(Expr *E) { 1228 E = E->IgnoreParenImpCasts(); 1229 1230 if (isa<DeclRefExpr>(E)) { 1231 return; 1232 } 1233 1234 if (ConditionalOperator *CO = dyn_cast<ConditionalOperator>(E)) { 1235 Visit(CO->getCond()); 1236 CheckLValueToRValueCast(CO->getTrueExpr()); 1237 CheckLValueToRValueCast(CO->getFalseExpr()); 1238 return; 1239 } 1240 1241 if (BinaryConditionalOperator *BCO = 1242 dyn_cast<BinaryConditionalOperator>(E)) { 1243 CheckLValueToRValueCast(BCO->getOpaqueValue()->getSourceExpr()); 1244 CheckLValueToRValueCast(BCO->getFalseExpr()); 1245 return; 1246 } 1247 1248 Visit(E); 1249 } 1250 1251 void VisitDeclRefExpr(DeclRefExpr *E) { 1252 if (VarDecl *VD = dyn_cast<VarDecl>(E->getDecl())) 1253 if (Decls.count(VD)) 1254 FoundDecl = true; 1255 } 1256 1257 bool FoundDeclInUse() { return FoundDecl; } 1258 1259 }; // end class DeclMatcher 1260 1261 void CheckForLoopConditionalStatement(Sema &S, Expr *Second, 1262 Expr *Third, Stmt *Body) { 1263 // Condition is empty 1264 if (!Second) return; 1265 1266 if (S.Diags.getDiagnosticLevel(diag::warn_variables_not_in_loop_body, 1267 Second->getLocStart()) 1268 == DiagnosticsEngine::Ignored) 1269 return; 1270 1271 PartialDiagnostic PDiag = S.PDiag(diag::warn_variables_not_in_loop_body); 1272 llvm::SmallPtrSet<VarDecl*, 8> Decls; 1273 llvm::SmallVector<SourceRange, 10> Ranges; 1274 DeclExtractor DE(S, Decls, Ranges); 1275 DE.Visit(Second); 1276 1277 // Don't analyze complex conditionals. 1278 if (!DE.isSimple()) return; 1279 1280 // No decls found. 1281 if (Decls.size() == 0) return; 1282 1283 // Don't warn on volatile, static, or global variables. 1284 for (llvm::SmallPtrSet<VarDecl*, 8>::iterator I = Decls.begin(), 1285 E = Decls.end(); 1286 I != E; ++I) 1287 if ((*I)->getType().isVolatileQualified() || 1288 (*I)->hasGlobalStorage()) return; 1289 1290 if (DeclMatcher(S, Decls, Second).FoundDeclInUse() || 1291 DeclMatcher(S, Decls, Third).FoundDeclInUse() || 1292 DeclMatcher(S, Decls, Body).FoundDeclInUse()) 1293 return; 1294 1295 // Load decl names into diagnostic. 1296 if (Decls.size() > 4) 1297 PDiag << 0; 1298 else { 1299 PDiag << Decls.size(); 1300 for (llvm::SmallPtrSet<VarDecl*, 8>::iterator I = Decls.begin(), 1301 E = Decls.end(); 1302 I != E; ++I) 1303 PDiag << (*I)->getDeclName(); 1304 } 1305 1306 // Load SourceRanges into diagnostic if there is room. 1307 // Otherwise, load the SourceRange of the conditional expression. 1308 if (Ranges.size() <= PartialDiagnostic::MaxArguments) 1309 for (llvm::SmallVector<SourceRange, 10>::iterator I = Ranges.begin(), 1310 E = Ranges.end(); 1311 I != E; ++I) 1312 PDiag << *I; 1313 else 1314 PDiag << Second->getSourceRange(); 1315 1316 S.Diag(Ranges.begin()->getBegin(), PDiag); 1317 } 1318 1319} // end namespace 1320 1321StmtResult 1322Sema::ActOnForStmt(SourceLocation ForLoc, SourceLocation LParenLoc, 1323 Stmt *First, FullExprArg second, Decl *secondVar, 1324 FullExprArg third, 1325 SourceLocation RParenLoc, Stmt *Body) { 1326 if (!getLangOpts().CPlusPlus) { 1327 if (DeclStmt *DS = dyn_cast_or_null<DeclStmt>(First)) { 1328 // C99 6.8.5p3: The declaration part of a 'for' statement shall only 1329 // declare identifiers for objects having storage class 'auto' or 1330 // 'register'. 1331 for (DeclStmt::decl_iterator DI=DS->decl_begin(), DE=DS->decl_end(); 1332 DI!=DE; ++DI) { 1333 VarDecl *VD = dyn_cast<VarDecl>(*DI); 1334 if (VD && VD->isLocalVarDecl() && !VD->hasLocalStorage()) 1335 VD = 0; 1336 if (VD == 0) 1337 Diag((*DI)->getLocation(), diag::err_non_variable_decl_in_for); 1338 // FIXME: mark decl erroneous! 1339 } 1340 } 1341 } 1342 1343 CheckForLoopConditionalStatement(*this, second.get(), third.get(), Body); 1344 1345 ExprResult SecondResult(second.release()); 1346 VarDecl *ConditionVar = 0; 1347 if (secondVar) { 1348 ConditionVar = cast<VarDecl>(secondVar); 1349 SecondResult = CheckConditionVariable(ConditionVar, ForLoc, true); 1350 if (SecondResult.isInvalid()) 1351 return StmtError(); 1352 } 1353 1354 Expr *Third = third.release().takeAs<Expr>(); 1355 1356 DiagnoseUnusedExprResult(First); 1357 DiagnoseUnusedExprResult(Third); 1358 DiagnoseUnusedExprResult(Body); 1359 1360 if (isa<NullStmt>(Body)) 1361 getCurCompoundScope().setHasEmptyLoopBodies(); 1362 1363 return Owned(new (Context) ForStmt(Context, First, 1364 SecondResult.take(), ConditionVar, 1365 Third, Body, ForLoc, LParenLoc, 1366 RParenLoc)); 1367} 1368 1369/// In an Objective C collection iteration statement: 1370/// for (x in y) 1371/// x can be an arbitrary l-value expression. Bind it up as a 1372/// full-expression. 1373StmtResult Sema::ActOnForEachLValueExpr(Expr *E) { 1374 // Reduce placeholder expressions here. Note that this rejects the 1375 // use of pseudo-object l-values in this position. 1376 ExprResult result = CheckPlaceholderExpr(E); 1377 if (result.isInvalid()) return StmtError(); 1378 E = result.take(); 1379 1380 CheckImplicitConversions(E); 1381 1382 result = MaybeCreateExprWithCleanups(E); 1383 if (result.isInvalid()) return StmtError(); 1384 1385 return Owned(static_cast<Stmt*>(result.take())); 1386} 1387 1388ExprResult 1389Sema::ActOnObjCForCollectionOperand(SourceLocation forLoc, Expr *collection) { 1390 assert(collection); 1391 1392 // Bail out early if we've got a type-dependent expression. 1393 if (collection->isTypeDependent()) return Owned(collection); 1394 1395 // Perform normal l-value conversion. 1396 ExprResult result = DefaultFunctionArrayLvalueConversion(collection); 1397 if (result.isInvalid()) 1398 return ExprError(); 1399 collection = result.take(); 1400 1401 // The operand needs to have object-pointer type. 1402 // TODO: should we do a contextual conversion? 1403 const ObjCObjectPointerType *pointerType = 1404 collection->getType()->getAs<ObjCObjectPointerType>(); 1405 if (!pointerType) 1406 return Diag(forLoc, diag::err_collection_expr_type) 1407 << collection->getType() << collection->getSourceRange(); 1408 1409 // Check that the operand provides 1410 // - countByEnumeratingWithState:objects:count: 1411 const ObjCObjectType *objectType = pointerType->getObjectType(); 1412 ObjCInterfaceDecl *iface = objectType->getInterface(); 1413 1414 // If we have a forward-declared type, we can't do this check. 1415 // Under ARC, it is an error not to have a forward-declared class. 1416 if (iface && 1417 RequireCompleteType(forLoc, QualType(objectType, 0), 1418 getLangOpts().ObjCAutoRefCount 1419 ? diag::err_arc_collection_forward 1420 : 0, 1421 collection)) { 1422 // Otherwise, if we have any useful type information, check that 1423 // the type declares the appropriate method. 1424 } else if (iface || !objectType->qual_empty()) { 1425 IdentifierInfo *selectorIdents[] = { 1426 &Context.Idents.get("countByEnumeratingWithState"), 1427 &Context.Idents.get("objects"), 1428 &Context.Idents.get("count") 1429 }; 1430 Selector selector = Context.Selectors.getSelector(3, &selectorIdents[0]); 1431 1432 ObjCMethodDecl *method = 0; 1433 1434 // If there's an interface, look in both the public and private APIs. 1435 if (iface) { 1436 method = iface->lookupInstanceMethod(selector); 1437 if (!method) method = LookupPrivateInstanceMethod(selector, iface); 1438 } 1439 1440 // Also check protocol qualifiers. 1441 if (!method) 1442 method = LookupMethodInQualifiedType(selector, pointerType, 1443 /*instance*/ true); 1444 1445 // If we didn't find it anywhere, give up. 1446 if (!method) { 1447 Diag(forLoc, diag::warn_collection_expr_type) 1448 << collection->getType() << selector << collection->getSourceRange(); 1449 } 1450 1451 // TODO: check for an incompatible signature? 1452 } 1453 1454 // Wrap up any cleanups in the expression. 1455 return Owned(MaybeCreateExprWithCleanups(collection)); 1456} 1457 1458StmtResult 1459Sema::ActOnObjCForCollectionStmt(SourceLocation ForLoc, 1460 SourceLocation LParenLoc, 1461 Stmt *First, Expr *Second, 1462 SourceLocation RParenLoc, Stmt *Body) { 1463 if (First) { 1464 QualType FirstType; 1465 if (DeclStmt *DS = dyn_cast<DeclStmt>(First)) { 1466 if (!DS->isSingleDecl()) 1467 return StmtError(Diag((*DS->decl_begin())->getLocation(), 1468 diag::err_toomany_element_decls)); 1469 1470 VarDecl *D = cast<VarDecl>(DS->getSingleDecl()); 1471 FirstType = D->getType(); 1472 // C99 6.8.5p3: The declaration part of a 'for' statement shall only 1473 // declare identifiers for objects having storage class 'auto' or 1474 // 'register'. 1475 if (!D->hasLocalStorage()) 1476 return StmtError(Diag(D->getLocation(), 1477 diag::err_non_variable_decl_in_for)); 1478 } else { 1479 Expr *FirstE = cast<Expr>(First); 1480 if (!FirstE->isTypeDependent() && !FirstE->isLValue()) 1481 return StmtError(Diag(First->getLocStart(), 1482 diag::err_selector_element_not_lvalue) 1483 << First->getSourceRange()); 1484 1485 FirstType = static_cast<Expr*>(First)->getType(); 1486 } 1487 if (!FirstType->isDependentType() && 1488 !FirstType->isObjCObjectPointerType() && 1489 !FirstType->isBlockPointerType()) 1490 Diag(ForLoc, diag::err_selector_element_type) 1491 << FirstType << First->getSourceRange(); 1492 } 1493 1494 return Owned(new (Context) ObjCForCollectionStmt(First, Second, Body, 1495 ForLoc, RParenLoc)); 1496} 1497 1498namespace { 1499 1500enum BeginEndFunction { 1501 BEF_begin, 1502 BEF_end 1503}; 1504 1505/// Build a variable declaration for a for-range statement. 1506static VarDecl *BuildForRangeVarDecl(Sema &SemaRef, SourceLocation Loc, 1507 QualType Type, const char *Name) { 1508 DeclContext *DC = SemaRef.CurContext; 1509 IdentifierInfo *II = &SemaRef.PP.getIdentifierTable().get(Name); 1510 TypeSourceInfo *TInfo = SemaRef.Context.getTrivialTypeSourceInfo(Type, Loc); 1511 VarDecl *Decl = VarDecl::Create(SemaRef.Context, DC, Loc, Loc, II, Type, 1512 TInfo, SC_Auto, SC_None); 1513 Decl->setImplicit(); 1514 return Decl; 1515} 1516 1517/// Finish building a variable declaration for a for-range statement. 1518/// \return true if an error occurs. 1519static bool FinishForRangeVarDecl(Sema &SemaRef, VarDecl *Decl, Expr *Init, 1520 SourceLocation Loc, int diag) { 1521 // Deduce the type for the iterator variable now rather than leaving it to 1522 // AddInitializerToDecl, so we can produce a more suitable diagnostic. 1523 TypeSourceInfo *InitTSI = 0; 1524 if ((!isa<InitListExpr>(Init) && Init->getType()->isVoidType()) || 1525 SemaRef.DeduceAutoType(Decl->getTypeSourceInfo(), Init, InitTSI) == 1526 Sema::DAR_Failed) 1527 SemaRef.Diag(Loc, diag) << Init->getType(); 1528 if (!InitTSI) { 1529 Decl->setInvalidDecl(); 1530 return true; 1531 } 1532 Decl->setTypeSourceInfo(InitTSI); 1533 Decl->setType(InitTSI->getType()); 1534 1535 // In ARC, infer lifetime. 1536 // FIXME: ARC may want to turn this into 'const __unsafe_unretained' if 1537 // we're doing the equivalent of fast iteration. 1538 if (SemaRef.getLangOpts().ObjCAutoRefCount && 1539 SemaRef.inferObjCARCLifetime(Decl)) 1540 Decl->setInvalidDecl(); 1541 1542 SemaRef.AddInitializerToDecl(Decl, Init, /*DirectInit=*/false, 1543 /*TypeMayContainAuto=*/false); 1544 SemaRef.FinalizeDeclaration(Decl); 1545 SemaRef.CurContext->addHiddenDecl(Decl); 1546 return false; 1547} 1548 1549/// Produce a note indicating which begin/end function was implicitly called 1550/// by a C++0x for-range statement. This is often not obvious from the code, 1551/// nor from the diagnostics produced when analysing the implicit expressions 1552/// required in a for-range statement. 1553void NoteForRangeBeginEndFunction(Sema &SemaRef, Expr *E, 1554 BeginEndFunction BEF) { 1555 CallExpr *CE = dyn_cast<CallExpr>(E); 1556 if (!CE) 1557 return; 1558 FunctionDecl *D = dyn_cast<FunctionDecl>(CE->getCalleeDecl()); 1559 if (!D) 1560 return; 1561 SourceLocation Loc = D->getLocation(); 1562 1563 std::string Description; 1564 bool IsTemplate = false; 1565 if (FunctionTemplateDecl *FunTmpl = D->getPrimaryTemplate()) { 1566 Description = SemaRef.getTemplateArgumentBindingsText( 1567 FunTmpl->getTemplateParameters(), *D->getTemplateSpecializationArgs()); 1568 IsTemplate = true; 1569 } 1570 1571 SemaRef.Diag(Loc, diag::note_for_range_begin_end) 1572 << BEF << IsTemplate << Description << E->getType(); 1573} 1574 1575/// Build a call to 'begin' or 'end' for a C++0x for-range statement. If the 1576/// given LookupResult is non-empty, it is assumed to describe a member which 1577/// will be invoked. Otherwise, the function will be found via argument 1578/// dependent lookup. 1579static ExprResult BuildForRangeBeginEndCall(Sema &SemaRef, Scope *S, 1580 SourceLocation Loc, 1581 VarDecl *Decl, 1582 BeginEndFunction BEF, 1583 const DeclarationNameInfo &NameInfo, 1584 LookupResult &MemberLookup, 1585 Expr *Range) { 1586 ExprResult CallExpr; 1587 if (!MemberLookup.empty()) { 1588 ExprResult MemberRef = 1589 SemaRef.BuildMemberReferenceExpr(Range, Range->getType(), Loc, 1590 /*IsPtr=*/false, CXXScopeSpec(), 1591 /*TemplateKWLoc=*/SourceLocation(), 1592 /*FirstQualifierInScope=*/0, 1593 MemberLookup, 1594 /*TemplateArgs=*/0); 1595 if (MemberRef.isInvalid()) 1596 return ExprError(); 1597 CallExpr = SemaRef.ActOnCallExpr(S, MemberRef.get(), Loc, MultiExprArg(), 1598 Loc, 0); 1599 if (CallExpr.isInvalid()) 1600 return ExprError(); 1601 } else { 1602 UnresolvedSet<0> FoundNames; 1603 // C++0x [stmt.ranged]p1: For the purposes of this name lookup, namespace 1604 // std is an associated namespace. 1605 UnresolvedLookupExpr *Fn = 1606 UnresolvedLookupExpr::Create(SemaRef.Context, /*NamingClass=*/0, 1607 NestedNameSpecifierLoc(), NameInfo, 1608 /*NeedsADL=*/true, /*Overloaded=*/false, 1609 FoundNames.begin(), FoundNames.end(), 1610 /*LookInStdNamespace=*/true); 1611 CallExpr = SemaRef.BuildOverloadedCallExpr(S, Fn, Fn, Loc, &Range, 1, Loc, 1612 0, /*AllowTypoCorrection=*/false); 1613 if (CallExpr.isInvalid()) { 1614 SemaRef.Diag(Range->getLocStart(), diag::note_for_range_type) 1615 << Range->getType(); 1616 return ExprError(); 1617 } 1618 } 1619 if (FinishForRangeVarDecl(SemaRef, Decl, CallExpr.get(), Loc, 1620 diag::err_for_range_iter_deduction_failure)) { 1621 NoteForRangeBeginEndFunction(SemaRef, CallExpr.get(), BEF); 1622 return ExprError(); 1623 } 1624 return CallExpr; 1625} 1626 1627} 1628 1629/// ActOnCXXForRangeStmt - Check and build a C++0x for-range statement. 1630/// 1631/// C++0x [stmt.ranged]: 1632/// A range-based for statement is equivalent to 1633/// 1634/// { 1635/// auto && __range = range-init; 1636/// for ( auto __begin = begin-expr, 1637/// __end = end-expr; 1638/// __begin != __end; 1639/// ++__begin ) { 1640/// for-range-declaration = *__begin; 1641/// statement 1642/// } 1643/// } 1644/// 1645/// The body of the loop is not available yet, since it cannot be analysed until 1646/// we have determined the type of the for-range-declaration. 1647StmtResult 1648Sema::ActOnCXXForRangeStmt(SourceLocation ForLoc, SourceLocation LParenLoc, 1649 Stmt *First, SourceLocation ColonLoc, Expr *Range, 1650 SourceLocation RParenLoc) { 1651 if (!First || !Range) 1652 return StmtError(); 1653 1654 DeclStmt *DS = dyn_cast<DeclStmt>(First); 1655 assert(DS && "first part of for range not a decl stmt"); 1656 1657 if (!DS->isSingleDecl()) { 1658 Diag(DS->getStartLoc(), diag::err_type_defined_in_for_range); 1659 return StmtError(); 1660 } 1661 if (DS->getSingleDecl()->isInvalidDecl()) 1662 return StmtError(); 1663 1664 if (DiagnoseUnexpandedParameterPack(Range, UPPC_Expression)) 1665 return StmtError(); 1666 1667 // Build auto && __range = range-init 1668 SourceLocation RangeLoc = Range->getLocStart(); 1669 VarDecl *RangeVar = BuildForRangeVarDecl(*this, RangeLoc, 1670 Context.getAutoRRefDeductType(), 1671 "__range"); 1672 if (FinishForRangeVarDecl(*this, RangeVar, Range, RangeLoc, 1673 diag::err_for_range_deduction_failure)) 1674 return StmtError(); 1675 1676 // Claim the type doesn't contain auto: we've already done the checking. 1677 DeclGroupPtrTy RangeGroup = 1678 BuildDeclaratorGroup((Decl**)&RangeVar, 1, /*TypeMayContainAuto=*/false); 1679 StmtResult RangeDecl = ActOnDeclStmt(RangeGroup, RangeLoc, RangeLoc); 1680 if (RangeDecl.isInvalid()) 1681 return StmtError(); 1682 1683 return BuildCXXForRangeStmt(ForLoc, ColonLoc, RangeDecl.get(), 1684 /*BeginEndDecl=*/0, /*Cond=*/0, /*Inc=*/0, DS, 1685 RParenLoc); 1686} 1687 1688/// BuildCXXForRangeStmt - Build or instantiate a C++0x for-range statement. 1689StmtResult 1690Sema::BuildCXXForRangeStmt(SourceLocation ForLoc, SourceLocation ColonLoc, 1691 Stmt *RangeDecl, Stmt *BeginEnd, Expr *Cond, 1692 Expr *Inc, Stmt *LoopVarDecl, 1693 SourceLocation RParenLoc) { 1694 Scope *S = getCurScope(); 1695 1696 DeclStmt *RangeDS = cast<DeclStmt>(RangeDecl); 1697 VarDecl *RangeVar = cast<VarDecl>(RangeDS->getSingleDecl()); 1698 QualType RangeVarType = RangeVar->getType(); 1699 1700 DeclStmt *LoopVarDS = cast<DeclStmt>(LoopVarDecl); 1701 VarDecl *LoopVar = cast<VarDecl>(LoopVarDS->getSingleDecl()); 1702 1703 StmtResult BeginEndDecl = BeginEnd; 1704 ExprResult NotEqExpr = Cond, IncrExpr = Inc; 1705 1706 if (!BeginEndDecl.get() && !RangeVarType->isDependentType()) { 1707 SourceLocation RangeLoc = RangeVar->getLocation(); 1708 1709 const QualType RangeVarNonRefType = RangeVarType.getNonReferenceType(); 1710 1711 ExprResult BeginRangeRef = BuildDeclRefExpr(RangeVar, RangeVarNonRefType, 1712 VK_LValue, ColonLoc); 1713 if (BeginRangeRef.isInvalid()) 1714 return StmtError(); 1715 1716 ExprResult EndRangeRef = BuildDeclRefExpr(RangeVar, RangeVarNonRefType, 1717 VK_LValue, ColonLoc); 1718 if (EndRangeRef.isInvalid()) 1719 return StmtError(); 1720 1721 QualType AutoType = Context.getAutoDeductType(); 1722 Expr *Range = RangeVar->getInit(); 1723 if (!Range) 1724 return StmtError(); 1725 QualType RangeType = Range->getType(); 1726 1727 if (RequireCompleteType(RangeLoc, RangeType, 1728 diag::err_for_range_incomplete_type)) 1729 return StmtError(); 1730 1731 // Build auto __begin = begin-expr, __end = end-expr. 1732 VarDecl *BeginVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType, 1733 "__begin"); 1734 VarDecl *EndVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType, 1735 "__end"); 1736 1737 // Build begin-expr and end-expr and attach to __begin and __end variables. 1738 ExprResult BeginExpr, EndExpr; 1739 if (const ArrayType *UnqAT = RangeType->getAsArrayTypeUnsafe()) { 1740 // - if _RangeT is an array type, begin-expr and end-expr are __range and 1741 // __range + __bound, respectively, where __bound is the array bound. If 1742 // _RangeT is an array of unknown size or an array of incomplete type, 1743 // the program is ill-formed; 1744 1745 // begin-expr is __range. 1746 BeginExpr = BeginRangeRef; 1747 if (FinishForRangeVarDecl(*this, BeginVar, BeginRangeRef.get(), ColonLoc, 1748 diag::err_for_range_iter_deduction_failure)) { 1749 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1750 return StmtError(); 1751 } 1752 1753 // Find the array bound. 1754 ExprResult BoundExpr; 1755 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(UnqAT)) 1756 BoundExpr = Owned(IntegerLiteral::Create(Context, CAT->getSize(), 1757 Context.getPointerDiffType(), 1758 RangeLoc)); 1759 else if (const VariableArrayType *VAT = 1760 dyn_cast<VariableArrayType>(UnqAT)) 1761 BoundExpr = VAT->getSizeExpr(); 1762 else { 1763 // Can't be a DependentSizedArrayType or an IncompleteArrayType since 1764 // UnqAT is not incomplete and Range is not type-dependent. 1765 llvm_unreachable("Unexpected array type in for-range"); 1766 } 1767 1768 // end-expr is __range + __bound. 1769 EndExpr = ActOnBinOp(S, ColonLoc, tok::plus, EndRangeRef.get(), 1770 BoundExpr.get()); 1771 if (EndExpr.isInvalid()) 1772 return StmtError(); 1773 if (FinishForRangeVarDecl(*this, EndVar, EndExpr.get(), ColonLoc, 1774 diag::err_for_range_iter_deduction_failure)) { 1775 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1776 return StmtError(); 1777 } 1778 } else { 1779 DeclarationNameInfo BeginNameInfo(&PP.getIdentifierTable().get("begin"), 1780 ColonLoc); 1781 DeclarationNameInfo EndNameInfo(&PP.getIdentifierTable().get("end"), 1782 ColonLoc); 1783 1784 LookupResult BeginMemberLookup(*this, BeginNameInfo, LookupMemberName); 1785 LookupResult EndMemberLookup(*this, EndNameInfo, LookupMemberName); 1786 1787 if (CXXRecordDecl *D = RangeType->getAsCXXRecordDecl()) { 1788 // - if _RangeT is a class type, the unqualified-ids begin and end are 1789 // looked up in the scope of class _RangeT as if by class member access 1790 // lookup (3.4.5), and if either (or both) finds at least one 1791 // declaration, begin-expr and end-expr are __range.begin() and 1792 // __range.end(), respectively; 1793 LookupQualifiedName(BeginMemberLookup, D); 1794 LookupQualifiedName(EndMemberLookup, D); 1795 1796 if (BeginMemberLookup.empty() != EndMemberLookup.empty()) { 1797 Diag(ColonLoc, diag::err_for_range_member_begin_end_mismatch) 1798 << RangeType << BeginMemberLookup.empty(); 1799 return StmtError(); 1800 } 1801 } else { 1802 // - otherwise, begin-expr and end-expr are begin(__range) and 1803 // end(__range), respectively, where begin and end are looked up with 1804 // argument-dependent lookup (3.4.2). For the purposes of this name 1805 // lookup, namespace std is an associated namespace. 1806 } 1807 1808 BeginExpr = BuildForRangeBeginEndCall(*this, S, ColonLoc, BeginVar, 1809 BEF_begin, BeginNameInfo, 1810 BeginMemberLookup, 1811 BeginRangeRef.get()); 1812 if (BeginExpr.isInvalid()) 1813 return StmtError(); 1814 1815 EndExpr = BuildForRangeBeginEndCall(*this, S, ColonLoc, EndVar, 1816 BEF_end, EndNameInfo, 1817 EndMemberLookup, EndRangeRef.get()); 1818 if (EndExpr.isInvalid()) 1819 return StmtError(); 1820 } 1821 1822 // C++0x [decl.spec.auto]p6: BeginType and EndType must be the same. 1823 QualType BeginType = BeginVar->getType(), EndType = EndVar->getType(); 1824 if (!Context.hasSameType(BeginType, EndType)) { 1825 Diag(RangeLoc, diag::err_for_range_begin_end_types_differ) 1826 << BeginType << EndType; 1827 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1828 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1829 } 1830 1831 Decl *BeginEndDecls[] = { BeginVar, EndVar }; 1832 // Claim the type doesn't contain auto: we've already done the checking. 1833 DeclGroupPtrTy BeginEndGroup = 1834 BuildDeclaratorGroup(BeginEndDecls, 2, /*TypeMayContainAuto=*/false); 1835 BeginEndDecl = ActOnDeclStmt(BeginEndGroup, ColonLoc, ColonLoc); 1836 1837 const QualType BeginRefNonRefType = BeginType.getNonReferenceType(); 1838 ExprResult BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType, 1839 VK_LValue, ColonLoc); 1840 if (BeginRef.isInvalid()) 1841 return StmtError(); 1842 1843 ExprResult EndRef = BuildDeclRefExpr(EndVar, EndType.getNonReferenceType(), 1844 VK_LValue, ColonLoc); 1845 if (EndRef.isInvalid()) 1846 return StmtError(); 1847 1848 // Build and check __begin != __end expression. 1849 NotEqExpr = ActOnBinOp(S, ColonLoc, tok::exclaimequal, 1850 BeginRef.get(), EndRef.get()); 1851 NotEqExpr = ActOnBooleanCondition(S, ColonLoc, NotEqExpr.get()); 1852 NotEqExpr = ActOnFinishFullExpr(NotEqExpr.get()); 1853 if (NotEqExpr.isInvalid()) { 1854 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1855 if (!Context.hasSameType(BeginType, EndType)) 1856 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1857 return StmtError(); 1858 } 1859 1860 // Build and check ++__begin expression. 1861 BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType, 1862 VK_LValue, ColonLoc); 1863 if (BeginRef.isInvalid()) 1864 return StmtError(); 1865 1866 IncrExpr = ActOnUnaryOp(S, ColonLoc, tok::plusplus, BeginRef.get()); 1867 IncrExpr = ActOnFinishFullExpr(IncrExpr.get()); 1868 if (IncrExpr.isInvalid()) { 1869 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1870 return StmtError(); 1871 } 1872 1873 // Build and check *__begin expression. 1874 BeginRef = BuildDeclRefExpr(BeginVar, BeginRefNonRefType, 1875 VK_LValue, ColonLoc); 1876 if (BeginRef.isInvalid()) 1877 return StmtError(); 1878 1879 ExprResult DerefExpr = ActOnUnaryOp(S, ColonLoc, tok::star, BeginRef.get()); 1880 if (DerefExpr.isInvalid()) { 1881 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1882 return StmtError(); 1883 } 1884 1885 // Attach *__begin as initializer for VD. 1886 if (!LoopVar->isInvalidDecl()) { 1887 AddInitializerToDecl(LoopVar, DerefExpr.get(), /*DirectInit=*/false, 1888 /*TypeMayContainAuto=*/true); 1889 if (LoopVar->isInvalidDecl()) 1890 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1891 } 1892 } else { 1893 // The range is implicitly used as a placeholder when it is dependent. 1894 RangeVar->setUsed(); 1895 } 1896 1897 return Owned(new (Context) CXXForRangeStmt(RangeDS, 1898 cast_or_null<DeclStmt>(BeginEndDecl.get()), 1899 NotEqExpr.take(), IncrExpr.take(), 1900 LoopVarDS, /*Body=*/0, ForLoc, 1901 ColonLoc, RParenLoc)); 1902} 1903 1904/// FinishCXXForRangeStmt - Attach the body to a C++0x for-range statement. 1905/// This is a separate step from ActOnCXXForRangeStmt because analysis of the 1906/// body cannot be performed until after the type of the range variable is 1907/// determined. 1908StmtResult Sema::FinishCXXForRangeStmt(Stmt *S, Stmt *B) { 1909 if (!S || !B) 1910 return StmtError(); 1911 1912 CXXForRangeStmt *ForStmt = cast<CXXForRangeStmt>(S); 1913 ForStmt->setBody(B); 1914 1915 DiagnoseEmptyStmtBody(ForStmt->getRParenLoc(), B, 1916 diag::warn_empty_range_based_for_body); 1917 1918 return S; 1919} 1920 1921StmtResult Sema::ActOnGotoStmt(SourceLocation GotoLoc, 1922 SourceLocation LabelLoc, 1923 LabelDecl *TheDecl) { 1924 getCurFunction()->setHasBranchIntoScope(); 1925 TheDecl->setUsed(); 1926 return Owned(new (Context) GotoStmt(TheDecl, GotoLoc, LabelLoc)); 1927} 1928 1929StmtResult 1930Sema::ActOnIndirectGotoStmt(SourceLocation GotoLoc, SourceLocation StarLoc, 1931 Expr *E) { 1932 // Convert operand to void* 1933 if (!E->isTypeDependent()) { 1934 QualType ETy = E->getType(); 1935 QualType DestTy = Context.getPointerType(Context.VoidTy.withConst()); 1936 ExprResult ExprRes = Owned(E); 1937 AssignConvertType ConvTy = 1938 CheckSingleAssignmentConstraints(DestTy, ExprRes); 1939 if (ExprRes.isInvalid()) 1940 return StmtError(); 1941 E = ExprRes.take(); 1942 if (DiagnoseAssignmentResult(ConvTy, StarLoc, DestTy, ETy, E, AA_Passing)) 1943 return StmtError(); 1944 E = MaybeCreateExprWithCleanups(E); 1945 } 1946 1947 getCurFunction()->setHasIndirectGoto(); 1948 1949 return Owned(new (Context) IndirectGotoStmt(GotoLoc, StarLoc, E)); 1950} 1951 1952StmtResult 1953Sema::ActOnContinueStmt(SourceLocation ContinueLoc, Scope *CurScope) { 1954 Scope *S = CurScope->getContinueParent(); 1955 if (!S) { 1956 // C99 6.8.6.2p1: A break shall appear only in or as a loop body. 1957 return StmtError(Diag(ContinueLoc, diag::err_continue_not_in_loop)); 1958 } 1959 1960 return Owned(new (Context) ContinueStmt(ContinueLoc)); 1961} 1962 1963StmtResult 1964Sema::ActOnBreakStmt(SourceLocation BreakLoc, Scope *CurScope) { 1965 Scope *S = CurScope->getBreakParent(); 1966 if (!S) { 1967 // C99 6.8.6.3p1: A break shall appear only in or as a switch/loop body. 1968 return StmtError(Diag(BreakLoc, diag::err_break_not_in_loop_or_switch)); 1969 } 1970 1971 return Owned(new (Context) BreakStmt(BreakLoc)); 1972} 1973 1974/// \brief Determine whether the given expression is a candidate for 1975/// copy elision in either a return statement or a throw expression. 1976/// 1977/// \param ReturnType If we're determining the copy elision candidate for 1978/// a return statement, this is the return type of the function. If we're 1979/// determining the copy elision candidate for a throw expression, this will 1980/// be a NULL type. 1981/// 1982/// \param E The expression being returned from the function or block, or 1983/// being thrown. 1984/// 1985/// \param AllowFunctionParameter Whether we allow function parameters to 1986/// be considered NRVO candidates. C++ prohibits this for NRVO itself, but 1987/// we re-use this logic to determine whether we should try to move as part of 1988/// a return or throw (which does allow function parameters). 1989/// 1990/// \returns The NRVO candidate variable, if the return statement may use the 1991/// NRVO, or NULL if there is no such candidate. 1992const VarDecl *Sema::getCopyElisionCandidate(QualType ReturnType, 1993 Expr *E, 1994 bool AllowFunctionParameter) { 1995 QualType ExprType = E->getType(); 1996 // - in a return statement in a function with ... 1997 // ... a class return type ... 1998 if (!ReturnType.isNull()) { 1999 if (!ReturnType->isRecordType()) 2000 return 0; 2001 // ... the same cv-unqualified type as the function return type ... 2002 if (!Context.hasSameUnqualifiedType(ReturnType, ExprType)) 2003 return 0; 2004 } 2005 2006 // ... the expression is the name of a non-volatile automatic object 2007 // (other than a function or catch-clause parameter)) ... 2008 const DeclRefExpr *DR = dyn_cast<DeclRefExpr>(E->IgnoreParens()); 2009 if (!DR) 2010 return 0; 2011 const VarDecl *VD = dyn_cast<VarDecl>(DR->getDecl()); 2012 if (!VD) 2013 return 0; 2014 2015 // ...object (other than a function or catch-clause parameter)... 2016 if (VD->getKind() != Decl::Var && 2017 !(AllowFunctionParameter && VD->getKind() == Decl::ParmVar)) 2018 return 0; 2019 if (VD->isExceptionVariable()) return 0; 2020 2021 // ...automatic... 2022 if (!VD->hasLocalStorage()) return 0; 2023 2024 // ...non-volatile... 2025 if (VD->getType().isVolatileQualified()) return 0; 2026 if (VD->getType()->isReferenceType()) return 0; 2027 2028 // __block variables can't be allocated in a way that permits NRVO. 2029 if (VD->hasAttr<BlocksAttr>()) return 0; 2030 2031 // Variables with higher required alignment than their type's ABI 2032 // alignment cannot use NRVO. 2033 if (VD->hasAttr<AlignedAttr>() && 2034 Context.getDeclAlign(VD) > Context.getTypeAlignInChars(VD->getType())) 2035 return 0; 2036 2037 return VD; 2038} 2039 2040/// \brief Perform the initialization of a potentially-movable value, which 2041/// is the result of return value. 2042/// 2043/// This routine implements C++0x [class.copy]p33, which attempts to treat 2044/// returned lvalues as rvalues in certain cases (to prefer move construction), 2045/// then falls back to treating them as lvalues if that failed. 2046ExprResult 2047Sema::PerformMoveOrCopyInitialization(const InitializedEntity &Entity, 2048 const VarDecl *NRVOCandidate, 2049 QualType ResultType, 2050 Expr *Value, 2051 bool AllowNRVO) { 2052 // C++0x [class.copy]p33: 2053 // When the criteria for elision of a copy operation are met or would 2054 // be met save for the fact that the source object is a function 2055 // parameter, and the object to be copied is designated by an lvalue, 2056 // overload resolution to select the constructor for the copy is first 2057 // performed as if the object were designated by an rvalue. 2058 ExprResult Res = ExprError(); 2059 if (AllowNRVO && 2060 (NRVOCandidate || getCopyElisionCandidate(ResultType, Value, true))) { 2061 ImplicitCastExpr AsRvalue(ImplicitCastExpr::OnStack, 2062 Value->getType(), CK_NoOp, Value, VK_XValue); 2063 2064 Expr *InitExpr = &AsRvalue; 2065 InitializationKind Kind 2066 = InitializationKind::CreateCopy(Value->getLocStart(), 2067 Value->getLocStart()); 2068 InitializationSequence Seq(*this, Entity, Kind, &InitExpr, 1); 2069 2070 // [...] If overload resolution fails, or if the type of the first 2071 // parameter of the selected constructor is not an rvalue reference 2072 // to the object's type (possibly cv-qualified), overload resolution 2073 // is performed again, considering the object as an lvalue. 2074 if (Seq) { 2075 for (InitializationSequence::step_iterator Step = Seq.step_begin(), 2076 StepEnd = Seq.step_end(); 2077 Step != StepEnd; ++Step) { 2078 if (Step->Kind != InitializationSequence::SK_ConstructorInitialization) 2079 continue; 2080 2081 CXXConstructorDecl *Constructor 2082 = cast<CXXConstructorDecl>(Step->Function.Function); 2083 2084 const RValueReferenceType *RRefType 2085 = Constructor->getParamDecl(0)->getType() 2086 ->getAs<RValueReferenceType>(); 2087 2088 // If we don't meet the criteria, break out now. 2089 if (!RRefType || 2090 !Context.hasSameUnqualifiedType(RRefType->getPointeeType(), 2091 Context.getTypeDeclType(Constructor->getParent()))) 2092 break; 2093 2094 // Promote "AsRvalue" to the heap, since we now need this 2095 // expression node to persist. 2096 Value = ImplicitCastExpr::Create(Context, Value->getType(), 2097 CK_NoOp, Value, 0, VK_XValue); 2098 2099 // Complete type-checking the initialization of the return type 2100 // using the constructor we found. 2101 Res = Seq.Perform(*this, Entity, Kind, MultiExprArg(&Value, 1)); 2102 } 2103 } 2104 } 2105 2106 // Either we didn't meet the criteria for treating an lvalue as an rvalue, 2107 // above, or overload resolution failed. Either way, we need to try 2108 // (again) now with the return value expression as written. 2109 if (Res.isInvalid()) 2110 Res = PerformCopyInitialization(Entity, SourceLocation(), Value); 2111 2112 return Res; 2113} 2114 2115/// ActOnCapScopeReturnStmt - Utility routine to type-check return statements 2116/// for capturing scopes. 2117/// 2118StmtResult 2119Sema::ActOnCapScopeReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) { 2120 // If this is the first return we've seen, infer the return type. 2121 // [expr.prim.lambda]p4 in C++11; block literals follow a superset of those 2122 // rules which allows multiple return statements. 2123 CapturingScopeInfo *CurCap = cast<CapturingScopeInfo>(getCurFunction()); 2124 if (CurCap->HasImplicitReturnType) { 2125 QualType ReturnT; 2126 if (RetValExp && !isa<InitListExpr>(RetValExp)) { 2127 ExprResult Result = DefaultFunctionArrayLvalueConversion(RetValExp); 2128 if (Result.isInvalid()) 2129 return StmtError(); 2130 RetValExp = Result.take(); 2131 2132 if (!RetValExp->isTypeDependent()) 2133 ReturnT = RetValExp->getType(); 2134 else 2135 ReturnT = Context.DependentTy; 2136 } else { 2137 if (RetValExp) { 2138 // C++11 [expr.lambda.prim]p4 bans inferring the result from an 2139 // initializer list, because it is not an expression (even 2140 // though we represent it as one). We still deduce 'void'. 2141 Diag(ReturnLoc, diag::err_lambda_return_init_list) 2142 << RetValExp->getSourceRange(); 2143 } 2144 2145 ReturnT = Context.VoidTy; 2146 } 2147 // We require the return types to strictly match here. 2148 if (!CurCap->ReturnType.isNull() && 2149 !CurCap->ReturnType->isDependentType() && 2150 !ReturnT->isDependentType() && 2151 !Context.hasSameType(ReturnT, CurCap->ReturnType)) { 2152 Diag(ReturnLoc, diag::err_typecheck_missing_return_type_incompatible) 2153 << ReturnT << CurCap->ReturnType 2154 << (getCurLambda() != 0); 2155 return StmtError(); 2156 } 2157 CurCap->ReturnType = ReturnT; 2158 } 2159 QualType FnRetType = CurCap->ReturnType; 2160 assert(!FnRetType.isNull()); 2161 2162 if (BlockScopeInfo *CurBlock = dyn_cast<BlockScopeInfo>(CurCap)) { 2163 if (CurBlock->FunctionType->getAs<FunctionType>()->getNoReturnAttr()) { 2164 Diag(ReturnLoc, diag::err_noreturn_block_has_return_expr); 2165 return StmtError(); 2166 } 2167 } else { 2168 LambdaScopeInfo *LSI = cast<LambdaScopeInfo>(CurCap); 2169 if (LSI->CallOperator->getType()->getAs<FunctionType>()->getNoReturnAttr()){ 2170 Diag(ReturnLoc, diag::err_noreturn_lambda_has_return_expr); 2171 return StmtError(); 2172 } 2173 } 2174 2175 // Otherwise, verify that this result type matches the previous one. We are 2176 // pickier with blocks than for normal functions because we don't have GCC 2177 // compatibility to worry about here. 2178 const VarDecl *NRVOCandidate = 0; 2179 if (FnRetType->isDependentType()) { 2180 // Delay processing for now. TODO: there are lots of dependent 2181 // types we can conclusively prove aren't void. 2182 } else if (FnRetType->isVoidType()) { 2183 if (RetValExp && !isa<InitListExpr>(RetValExp) && 2184 !(getLangOpts().CPlusPlus && 2185 (RetValExp->isTypeDependent() || 2186 RetValExp->getType()->isVoidType()))) { 2187 if (!getLangOpts().CPlusPlus && 2188 RetValExp->getType()->isVoidType()) 2189 Diag(ReturnLoc, diag::ext_return_has_void_expr) << "literal" << 2; 2190 else { 2191 Diag(ReturnLoc, diag::err_return_block_has_expr); 2192 RetValExp = 0; 2193 } 2194 } 2195 } else if (!RetValExp) { 2196 return StmtError(Diag(ReturnLoc, diag::err_block_return_missing_expr)); 2197 } else if (!RetValExp->isTypeDependent()) { 2198 // we have a non-void block with an expression, continue checking 2199 2200 // C99 6.8.6.4p3(136): The return statement is not an assignment. The 2201 // overlap restriction of subclause 6.5.16.1 does not apply to the case of 2202 // function return. 2203 2204 // In C++ the return statement is handled via a copy initialization. 2205 // the C version of which boils down to CheckSingleAssignmentConstraints. 2206 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false); 2207 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc, 2208 FnRetType, 2209 NRVOCandidate != 0); 2210 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate, 2211 FnRetType, RetValExp); 2212 if (Res.isInvalid()) { 2213 // FIXME: Cleanup temporaries here, anyway? 2214 return StmtError(); 2215 } 2216 RetValExp = Res.take(); 2217 CheckReturnStackAddr(RetValExp, FnRetType, ReturnLoc); 2218 } 2219 2220 if (RetValExp) { 2221 CheckImplicitConversions(RetValExp, ReturnLoc); 2222 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 2223 } 2224 ReturnStmt *Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, 2225 NRVOCandidate); 2226 2227 // If we need to check for the named return value optimization, save the 2228 // return statement in our scope for later processing. 2229 if (getLangOpts().CPlusPlus && FnRetType->isRecordType() && 2230 !CurContext->isDependentContext()) 2231 FunctionScopes.back()->Returns.push_back(Result); 2232 2233 return Owned(Result); 2234} 2235 2236StmtResult 2237Sema::ActOnReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) { 2238 // Check for unexpanded parameter packs. 2239 if (RetValExp && DiagnoseUnexpandedParameterPack(RetValExp)) 2240 return StmtError(); 2241 2242 if (isa<CapturingScopeInfo>(getCurFunction())) 2243 return ActOnCapScopeReturnStmt(ReturnLoc, RetValExp); 2244 2245 QualType FnRetType; 2246 QualType RelatedRetType; 2247 if (const FunctionDecl *FD = getCurFunctionDecl()) { 2248 FnRetType = FD->getResultType(); 2249 if (FD->hasAttr<NoReturnAttr>() || 2250 FD->getType()->getAs<FunctionType>()->getNoReturnAttr()) 2251 Diag(ReturnLoc, diag::warn_noreturn_function_has_return_expr) 2252 << FD->getDeclName(); 2253 } else if (ObjCMethodDecl *MD = getCurMethodDecl()) { 2254 FnRetType = MD->getResultType(); 2255 if (MD->hasRelatedResultType() && MD->getClassInterface()) { 2256 // In the implementation of a method with a related return type, the 2257 // type used to type-check the validity of return statements within the 2258 // method body is a pointer to the type of the class being implemented. 2259 RelatedRetType = Context.getObjCInterfaceType(MD->getClassInterface()); 2260 RelatedRetType = Context.getObjCObjectPointerType(RelatedRetType); 2261 } 2262 } else // If we don't have a function/method context, bail. 2263 return StmtError(); 2264 2265 ReturnStmt *Result = 0; 2266 if (FnRetType->isVoidType()) { 2267 if (RetValExp) { 2268 if (isa<InitListExpr>(RetValExp)) { 2269 // We simply never allow init lists as the return value of void 2270 // functions. This is compatible because this was never allowed before, 2271 // so there's no legacy code to deal with. 2272 NamedDecl *CurDecl = getCurFunctionOrMethodDecl(); 2273 int FunctionKind = 0; 2274 if (isa<ObjCMethodDecl>(CurDecl)) 2275 FunctionKind = 1; 2276 else if (isa<CXXConstructorDecl>(CurDecl)) 2277 FunctionKind = 2; 2278 else if (isa<CXXDestructorDecl>(CurDecl)) 2279 FunctionKind = 3; 2280 2281 Diag(ReturnLoc, diag::err_return_init_list) 2282 << CurDecl->getDeclName() << FunctionKind 2283 << RetValExp->getSourceRange(); 2284 2285 // Drop the expression. 2286 RetValExp = 0; 2287 } else if (!RetValExp->isTypeDependent()) { 2288 // C99 6.8.6.4p1 (ext_ since GCC warns) 2289 unsigned D = diag::ext_return_has_expr; 2290 if (RetValExp->getType()->isVoidType()) 2291 D = diag::ext_return_has_void_expr; 2292 else { 2293 ExprResult Result = Owned(RetValExp); 2294 Result = IgnoredValueConversions(Result.take()); 2295 if (Result.isInvalid()) 2296 return StmtError(); 2297 RetValExp = Result.take(); 2298 RetValExp = ImpCastExprToType(RetValExp, 2299 Context.VoidTy, CK_ToVoid).take(); 2300 } 2301 2302 // return (some void expression); is legal in C++. 2303 if (D != diag::ext_return_has_void_expr || 2304 !getLangOpts().CPlusPlus) { 2305 NamedDecl *CurDecl = getCurFunctionOrMethodDecl(); 2306 2307 int FunctionKind = 0; 2308 if (isa<ObjCMethodDecl>(CurDecl)) 2309 FunctionKind = 1; 2310 else if (isa<CXXConstructorDecl>(CurDecl)) 2311 FunctionKind = 2; 2312 else if (isa<CXXDestructorDecl>(CurDecl)) 2313 FunctionKind = 3; 2314 2315 Diag(ReturnLoc, D) 2316 << CurDecl->getDeclName() << FunctionKind 2317 << RetValExp->getSourceRange(); 2318 } 2319 } 2320 2321 if (RetValExp) { 2322 CheckImplicitConversions(RetValExp, ReturnLoc); 2323 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 2324 } 2325 } 2326 2327 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, 0); 2328 } else if (!RetValExp && !FnRetType->isDependentType()) { 2329 unsigned DiagID = diag::warn_return_missing_expr; // C90 6.6.6.4p4 2330 // C99 6.8.6.4p1 (ext_ since GCC warns) 2331 if (getLangOpts().C99) DiagID = diag::ext_return_missing_expr; 2332 2333 if (FunctionDecl *FD = getCurFunctionDecl()) 2334 Diag(ReturnLoc, DiagID) << FD->getIdentifier() << 0/*fn*/; 2335 else 2336 Diag(ReturnLoc, DiagID) << getCurMethodDecl()->getDeclName() << 1/*meth*/; 2337 Result = new (Context) ReturnStmt(ReturnLoc); 2338 } else { 2339 const VarDecl *NRVOCandidate = 0; 2340 if (!FnRetType->isDependentType() && !RetValExp->isTypeDependent()) { 2341 // we have a non-void function with an expression, continue checking 2342 2343 if (!RelatedRetType.isNull()) { 2344 // If we have a related result type, perform an extra conversion here. 2345 // FIXME: The diagnostics here don't really describe what is happening. 2346 InitializedEntity Entity = 2347 InitializedEntity::InitializeTemporary(RelatedRetType); 2348 2349 ExprResult Res = PerformCopyInitialization(Entity, SourceLocation(), 2350 RetValExp); 2351 if (Res.isInvalid()) { 2352 // FIXME: Cleanup temporaries here, anyway? 2353 return StmtError(); 2354 } 2355 RetValExp = Res.takeAs<Expr>(); 2356 } 2357 2358 // C99 6.8.6.4p3(136): The return statement is not an assignment. The 2359 // overlap restriction of subclause 6.5.16.1 does not apply to the case of 2360 // function return. 2361 2362 // In C++ the return statement is handled via a copy initialization, 2363 // the C version of which boils down to CheckSingleAssignmentConstraints. 2364 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false); 2365 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc, 2366 FnRetType, 2367 NRVOCandidate != 0); 2368 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate, 2369 FnRetType, RetValExp); 2370 if (Res.isInvalid()) { 2371 // FIXME: Cleanup temporaries here, anyway? 2372 return StmtError(); 2373 } 2374 2375 RetValExp = Res.takeAs<Expr>(); 2376 if (RetValExp) 2377 CheckReturnStackAddr(RetValExp, FnRetType, ReturnLoc); 2378 } 2379 2380 if (RetValExp) { 2381 CheckImplicitConversions(RetValExp, ReturnLoc); 2382 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 2383 } 2384 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, NRVOCandidate); 2385 } 2386 2387 // If we need to check for the named return value optimization, save the 2388 // return statement in our scope for later processing. 2389 if (getLangOpts().CPlusPlus && FnRetType->isRecordType() && 2390 !CurContext->isDependentContext()) 2391 FunctionScopes.back()->Returns.push_back(Result); 2392 2393 return Owned(Result); 2394} 2395 2396/// CheckAsmLValue - GNU C has an extremely ugly extension whereby they silently 2397/// ignore "noop" casts in places where an lvalue is required by an inline asm. 2398/// We emulate this behavior when -fheinous-gnu-extensions is specified, but 2399/// provide a strong guidance to not use it. 2400/// 2401/// This method checks to see if the argument is an acceptable l-value and 2402/// returns false if it is a case we can handle. 2403static bool CheckAsmLValue(const Expr *E, Sema &S) { 2404 // Type dependent expressions will be checked during instantiation. 2405 if (E->isTypeDependent()) 2406 return false; 2407 2408 if (E->isLValue()) 2409 return false; // Cool, this is an lvalue. 2410 2411 // Okay, this is not an lvalue, but perhaps it is the result of a cast that we 2412 // are supposed to allow. 2413 const Expr *E2 = E->IgnoreParenNoopCasts(S.Context); 2414 if (E != E2 && E2->isLValue()) { 2415 if (!S.getLangOpts().HeinousExtensions) 2416 S.Diag(E2->getLocStart(), diag::err_invalid_asm_cast_lvalue) 2417 << E->getSourceRange(); 2418 else 2419 S.Diag(E2->getLocStart(), diag::warn_invalid_asm_cast_lvalue) 2420 << E->getSourceRange(); 2421 // Accept, even if we emitted an error diagnostic. 2422 return false; 2423 } 2424 2425 // None of the above, just randomly invalid non-lvalue. 2426 return true; 2427} 2428 2429/// isOperandMentioned - Return true if the specified operand # is mentioned 2430/// anywhere in the decomposed asm string. 2431static bool isOperandMentioned(unsigned OpNo, 2432 ArrayRef<AsmStmt::AsmStringPiece> AsmStrPieces) { 2433 for (unsigned p = 0, e = AsmStrPieces.size(); p != e; ++p) { 2434 const AsmStmt::AsmStringPiece &Piece = AsmStrPieces[p]; 2435 if (!Piece.isOperand()) continue; 2436 2437 // If this is a reference to the input and if the input was the smaller 2438 // one, then we have to reject this asm. 2439 if (Piece.getOperandNo() == OpNo) 2440 return true; 2441 } 2442 2443 return false; 2444} 2445 2446StmtResult Sema::ActOnAsmStmt(SourceLocation AsmLoc, bool IsSimple, 2447 bool IsVolatile, unsigned NumOutputs, 2448 unsigned NumInputs, IdentifierInfo **Names, 2449 MultiExprArg constraints, MultiExprArg exprs, 2450 Expr *asmString, MultiExprArg clobbers, 2451 SourceLocation RParenLoc, bool MSAsm) { 2452 unsigned NumClobbers = clobbers.size(); 2453 StringLiteral **Constraints = 2454 reinterpret_cast<StringLiteral**>(constraints.get()); 2455 Expr **Exprs = exprs.get(); 2456 StringLiteral *AsmString = cast<StringLiteral>(asmString); 2457 StringLiteral **Clobbers = reinterpret_cast<StringLiteral**>(clobbers.get()); 2458 2459 SmallVector<TargetInfo::ConstraintInfo, 4> OutputConstraintInfos; 2460 2461 // The parser verifies that there is a string literal here. 2462 if (!AsmString->isAscii()) 2463 return StmtError(Diag(AsmString->getLocStart(),diag::err_asm_wide_character) 2464 << AsmString->getSourceRange()); 2465 2466 for (unsigned i = 0; i != NumOutputs; i++) { 2467 StringLiteral *Literal = Constraints[i]; 2468 if (!Literal->isAscii()) 2469 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 2470 << Literal->getSourceRange()); 2471 2472 StringRef OutputName; 2473 if (Names[i]) 2474 OutputName = Names[i]->getName(); 2475 2476 TargetInfo::ConstraintInfo Info(Literal->getString(), OutputName); 2477 if (!Context.getTargetInfo().validateOutputConstraint(Info)) 2478 return StmtError(Diag(Literal->getLocStart(), 2479 diag::err_asm_invalid_output_constraint) 2480 << Info.getConstraintStr()); 2481 2482 // Check that the output exprs are valid lvalues. 2483 Expr *OutputExpr = Exprs[i]; 2484 if (CheckAsmLValue(OutputExpr, *this)) { 2485 return StmtError(Diag(OutputExpr->getLocStart(), 2486 diag::err_asm_invalid_lvalue_in_output) 2487 << OutputExpr->getSourceRange()); 2488 } 2489 2490 OutputConstraintInfos.push_back(Info); 2491 } 2492 2493 SmallVector<TargetInfo::ConstraintInfo, 4> InputConstraintInfos; 2494 2495 for (unsigned i = NumOutputs, e = NumOutputs + NumInputs; i != e; i++) { 2496 StringLiteral *Literal = Constraints[i]; 2497 if (!Literal->isAscii()) 2498 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 2499 << Literal->getSourceRange()); 2500 2501 StringRef InputName; 2502 if (Names[i]) 2503 InputName = Names[i]->getName(); 2504 2505 TargetInfo::ConstraintInfo Info(Literal->getString(), InputName); 2506 if (!Context.getTargetInfo().validateInputConstraint(OutputConstraintInfos.data(), 2507 NumOutputs, Info)) { 2508 return StmtError(Diag(Literal->getLocStart(), 2509 diag::err_asm_invalid_input_constraint) 2510 << Info.getConstraintStr()); 2511 } 2512 2513 Expr *InputExpr = Exprs[i]; 2514 2515 // Only allow void types for memory constraints. 2516 if (Info.allowsMemory() && !Info.allowsRegister()) { 2517 if (CheckAsmLValue(InputExpr, *this)) 2518 return StmtError(Diag(InputExpr->getLocStart(), 2519 diag::err_asm_invalid_lvalue_in_input) 2520 << Info.getConstraintStr() 2521 << InputExpr->getSourceRange()); 2522 } 2523 2524 if (Info.allowsRegister()) { 2525 if (InputExpr->getType()->isVoidType()) { 2526 return StmtError(Diag(InputExpr->getLocStart(), 2527 diag::err_asm_invalid_type_in_input) 2528 << InputExpr->getType() << Info.getConstraintStr() 2529 << InputExpr->getSourceRange()); 2530 } 2531 } 2532 2533 ExprResult Result = DefaultFunctionArrayLvalueConversion(Exprs[i]); 2534 if (Result.isInvalid()) 2535 return StmtError(); 2536 2537 Exprs[i] = Result.take(); 2538 InputConstraintInfos.push_back(Info); 2539 } 2540 2541 // Check that the clobbers are valid. 2542 for (unsigned i = 0; i != NumClobbers; i++) { 2543 StringLiteral *Literal = Clobbers[i]; 2544 if (!Literal->isAscii()) 2545 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 2546 << Literal->getSourceRange()); 2547 2548 StringRef Clobber = Literal->getString(); 2549 2550 if (!Context.getTargetInfo().isValidClobber(Clobber)) 2551 return StmtError(Diag(Literal->getLocStart(), 2552 diag::err_asm_unknown_register_name) << Clobber); 2553 } 2554 2555 AsmStmt *NS = 2556 new (Context) AsmStmt(Context, AsmLoc, IsSimple, IsVolatile, MSAsm, 2557 NumOutputs, NumInputs, Names, Constraints, Exprs, 2558 AsmString, NumClobbers, Clobbers, RParenLoc); 2559 // Validate the asm string, ensuring it makes sense given the operands we 2560 // have. 2561 SmallVector<AsmStmt::AsmStringPiece, 8> Pieces; 2562 unsigned DiagOffs; 2563 if (unsigned DiagID = NS->AnalyzeAsmString(Pieces, Context, DiagOffs)) { 2564 Diag(getLocationOfStringLiteralByte(AsmString, DiagOffs), DiagID) 2565 << AsmString->getSourceRange(); 2566 return StmtError(); 2567 } 2568 2569 // Validate tied input operands for type mismatches. 2570 for (unsigned i = 0, e = InputConstraintInfos.size(); i != e; ++i) { 2571 TargetInfo::ConstraintInfo &Info = InputConstraintInfos[i]; 2572 2573 // If this is a tied constraint, verify that the output and input have 2574 // either exactly the same type, or that they are int/ptr operands with the 2575 // same size (int/long, int*/long, are ok etc). 2576 if (!Info.hasTiedOperand()) continue; 2577 2578 unsigned TiedTo = Info.getTiedOperand(); 2579 unsigned InputOpNo = i+NumOutputs; 2580 Expr *OutputExpr = Exprs[TiedTo]; 2581 Expr *InputExpr = Exprs[InputOpNo]; 2582 2583 if (OutputExpr->isTypeDependent() || InputExpr->isTypeDependent()) 2584 continue; 2585 2586 QualType InTy = InputExpr->getType(); 2587 QualType OutTy = OutputExpr->getType(); 2588 if (Context.hasSameType(InTy, OutTy)) 2589 continue; // All types can be tied to themselves. 2590 2591 // Decide if the input and output are in the same domain (integer/ptr or 2592 // floating point. 2593 enum AsmDomain { 2594 AD_Int, AD_FP, AD_Other 2595 } InputDomain, OutputDomain; 2596 2597 if (InTy->isIntegerType() || InTy->isPointerType()) 2598 InputDomain = AD_Int; 2599 else if (InTy->isRealFloatingType()) 2600 InputDomain = AD_FP; 2601 else 2602 InputDomain = AD_Other; 2603 2604 if (OutTy->isIntegerType() || OutTy->isPointerType()) 2605 OutputDomain = AD_Int; 2606 else if (OutTy->isRealFloatingType()) 2607 OutputDomain = AD_FP; 2608 else 2609 OutputDomain = AD_Other; 2610 2611 // They are ok if they are the same size and in the same domain. This 2612 // allows tying things like: 2613 // void* to int* 2614 // void* to int if they are the same size. 2615 // double to long double if they are the same size. 2616 // 2617 uint64_t OutSize = Context.getTypeSize(OutTy); 2618 uint64_t InSize = Context.getTypeSize(InTy); 2619 if (OutSize == InSize && InputDomain == OutputDomain && 2620 InputDomain != AD_Other) 2621 continue; 2622 2623 // If the smaller input/output operand is not mentioned in the asm string, 2624 // then we can promote the smaller one to a larger input and the asm string 2625 // won't notice. 2626 bool SmallerValueMentioned = false; 2627 2628 // If this is a reference to the input and if the input was the smaller 2629 // one, then we have to reject this asm. 2630 if (isOperandMentioned(InputOpNo, Pieces)) { 2631 // This is a use in the asm string of the smaller operand. Since we 2632 // codegen this by promoting to a wider value, the asm will get printed 2633 // "wrong". 2634 SmallerValueMentioned |= InSize < OutSize; 2635 } 2636 if (isOperandMentioned(TiedTo, Pieces)) { 2637 // If this is a reference to the output, and if the output is the larger 2638 // value, then it's ok because we'll promote the input to the larger type. 2639 SmallerValueMentioned |= OutSize < InSize; 2640 } 2641 2642 // If the smaller value wasn't mentioned in the asm string, and if the 2643 // output was a register, just extend the shorter one to the size of the 2644 // larger one. 2645 if (!SmallerValueMentioned && InputDomain != AD_Other && 2646 OutputConstraintInfos[TiedTo].allowsRegister()) 2647 continue; 2648 2649 // Either both of the operands were mentioned or the smaller one was 2650 // mentioned. One more special case that we'll allow: if the tied input is 2651 // integer, unmentioned, and is a constant, then we'll allow truncating it 2652 // down to the size of the destination. 2653 if (InputDomain == AD_Int && OutputDomain == AD_Int && 2654 !isOperandMentioned(InputOpNo, Pieces) && 2655 InputExpr->isEvaluatable(Context)) { 2656 CastKind castKind = 2657 (OutTy->isBooleanType() ? CK_IntegralToBoolean : CK_IntegralCast); 2658 InputExpr = ImpCastExprToType(InputExpr, OutTy, castKind).take(); 2659 Exprs[InputOpNo] = InputExpr; 2660 NS->setInputExpr(i, InputExpr); 2661 continue; 2662 } 2663 2664 Diag(InputExpr->getLocStart(), 2665 diag::err_asm_tying_incompatible_types) 2666 << InTy << OutTy << OutputExpr->getSourceRange() 2667 << InputExpr->getSourceRange(); 2668 return StmtError(); 2669 } 2670 2671 return Owned(NS); 2672} 2673 2674StmtResult 2675Sema::ActOnObjCAtCatchStmt(SourceLocation AtLoc, 2676 SourceLocation RParen, Decl *Parm, 2677 Stmt *Body) { 2678 VarDecl *Var = cast_or_null<VarDecl>(Parm); 2679 if (Var && Var->isInvalidDecl()) 2680 return StmtError(); 2681 2682 return Owned(new (Context) ObjCAtCatchStmt(AtLoc, RParen, Var, Body)); 2683} 2684 2685StmtResult 2686Sema::ActOnObjCAtFinallyStmt(SourceLocation AtLoc, Stmt *Body) { 2687 return Owned(new (Context) ObjCAtFinallyStmt(AtLoc, Body)); 2688} 2689 2690StmtResult 2691Sema::ActOnObjCAtTryStmt(SourceLocation AtLoc, Stmt *Try, 2692 MultiStmtArg CatchStmts, Stmt *Finally) { 2693 if (!getLangOpts().ObjCExceptions) 2694 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@try"; 2695 2696 getCurFunction()->setHasBranchProtectedScope(); 2697 unsigned NumCatchStmts = CatchStmts.size(); 2698 return Owned(ObjCAtTryStmt::Create(Context, AtLoc, Try, 2699 CatchStmts.release(), 2700 NumCatchStmts, 2701 Finally)); 2702} 2703 2704StmtResult Sema::BuildObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw) { 2705 if (Throw) { 2706 ExprResult Result = DefaultLvalueConversion(Throw); 2707 if (Result.isInvalid()) 2708 return StmtError(); 2709 2710 Throw = MaybeCreateExprWithCleanups(Result.take()); 2711 QualType ThrowType = Throw->getType(); 2712 // Make sure the expression type is an ObjC pointer or "void *". 2713 if (!ThrowType->isDependentType() && 2714 !ThrowType->isObjCObjectPointerType()) { 2715 const PointerType *PT = ThrowType->getAs<PointerType>(); 2716 if (!PT || !PT->getPointeeType()->isVoidType()) 2717 return StmtError(Diag(AtLoc, diag::error_objc_throw_expects_object) 2718 << Throw->getType() << Throw->getSourceRange()); 2719 } 2720 } 2721 2722 return Owned(new (Context) ObjCAtThrowStmt(AtLoc, Throw)); 2723} 2724 2725StmtResult 2726Sema::ActOnObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw, 2727 Scope *CurScope) { 2728 if (!getLangOpts().ObjCExceptions) 2729 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@throw"; 2730 2731 if (!Throw) { 2732 // @throw without an expression designates a rethrow (which much occur 2733 // in the context of an @catch clause). 2734 Scope *AtCatchParent = CurScope; 2735 while (AtCatchParent && !AtCatchParent->isAtCatchScope()) 2736 AtCatchParent = AtCatchParent->getParent(); 2737 if (!AtCatchParent) 2738 return StmtError(Diag(AtLoc, diag::error_rethrow_used_outside_catch)); 2739 } 2740 2741 return BuildObjCAtThrowStmt(AtLoc, Throw); 2742} 2743 2744ExprResult 2745Sema::ActOnObjCAtSynchronizedOperand(SourceLocation atLoc, Expr *operand) { 2746 ExprResult result = DefaultLvalueConversion(operand); 2747 if (result.isInvalid()) 2748 return ExprError(); 2749 operand = result.take(); 2750 2751 // Make sure the expression type is an ObjC pointer or "void *". 2752 QualType type = operand->getType(); 2753 if (!type->isDependentType() && 2754 !type->isObjCObjectPointerType()) { 2755 const PointerType *pointerType = type->getAs<PointerType>(); 2756 if (!pointerType || !pointerType->getPointeeType()->isVoidType()) 2757 return Diag(atLoc, diag::error_objc_synchronized_expects_object) 2758 << type << operand->getSourceRange(); 2759 } 2760 2761 // The operand to @synchronized is a full-expression. 2762 return MaybeCreateExprWithCleanups(operand); 2763} 2764 2765StmtResult 2766Sema::ActOnObjCAtSynchronizedStmt(SourceLocation AtLoc, Expr *SyncExpr, 2767 Stmt *SyncBody) { 2768 // We can't jump into or indirect-jump out of a @synchronized block. 2769 getCurFunction()->setHasBranchProtectedScope(); 2770 return Owned(new (Context) ObjCAtSynchronizedStmt(AtLoc, SyncExpr, SyncBody)); 2771} 2772 2773/// ActOnCXXCatchBlock - Takes an exception declaration and a handler block 2774/// and creates a proper catch handler from them. 2775StmtResult 2776Sema::ActOnCXXCatchBlock(SourceLocation CatchLoc, Decl *ExDecl, 2777 Stmt *HandlerBlock) { 2778 // There's nothing to test that ActOnExceptionDecl didn't already test. 2779 return Owned(new (Context) CXXCatchStmt(CatchLoc, 2780 cast_or_null<VarDecl>(ExDecl), 2781 HandlerBlock)); 2782} 2783 2784StmtResult 2785Sema::ActOnObjCAutoreleasePoolStmt(SourceLocation AtLoc, Stmt *Body) { 2786 getCurFunction()->setHasBranchProtectedScope(); 2787 return Owned(new (Context) ObjCAutoreleasePoolStmt(AtLoc, Body)); 2788} 2789 2790namespace { 2791 2792class TypeWithHandler { 2793 QualType t; 2794 CXXCatchStmt *stmt; 2795public: 2796 TypeWithHandler(const QualType &type, CXXCatchStmt *statement) 2797 : t(type), stmt(statement) {} 2798 2799 // An arbitrary order is fine as long as it places identical 2800 // types next to each other. 2801 bool operator<(const TypeWithHandler &y) const { 2802 if (t.getAsOpaquePtr() < y.t.getAsOpaquePtr()) 2803 return true; 2804 if (t.getAsOpaquePtr() > y.t.getAsOpaquePtr()) 2805 return false; 2806 else 2807 return getTypeSpecStartLoc() < y.getTypeSpecStartLoc(); 2808 } 2809 2810 bool operator==(const TypeWithHandler& other) const { 2811 return t == other.t; 2812 } 2813 2814 CXXCatchStmt *getCatchStmt() const { return stmt; } 2815 SourceLocation getTypeSpecStartLoc() const { 2816 return stmt->getExceptionDecl()->getTypeSpecStartLoc(); 2817 } 2818}; 2819 2820} 2821 2822/// ActOnCXXTryBlock - Takes a try compound-statement and a number of 2823/// handlers and creates a try statement from them. 2824StmtResult 2825Sema::ActOnCXXTryBlock(SourceLocation TryLoc, Stmt *TryBlock, 2826 MultiStmtArg RawHandlers) { 2827 // Don't report an error if 'try' is used in system headers. 2828 if (!getLangOpts().CXXExceptions && 2829 !getSourceManager().isInSystemHeader(TryLoc)) 2830 Diag(TryLoc, diag::err_exceptions_disabled) << "try"; 2831 2832 unsigned NumHandlers = RawHandlers.size(); 2833 assert(NumHandlers > 0 && 2834 "The parser shouldn't call this if there are no handlers."); 2835 Stmt **Handlers = RawHandlers.get(); 2836 2837 SmallVector<TypeWithHandler, 8> TypesWithHandlers; 2838 2839 for (unsigned i = 0; i < NumHandlers; ++i) { 2840 CXXCatchStmt *Handler = cast<CXXCatchStmt>(Handlers[i]); 2841 if (!Handler->getExceptionDecl()) { 2842 if (i < NumHandlers - 1) 2843 return StmtError(Diag(Handler->getLocStart(), 2844 diag::err_early_catch_all)); 2845 2846 continue; 2847 } 2848 2849 const QualType CaughtType = Handler->getCaughtType(); 2850 const QualType CanonicalCaughtType = Context.getCanonicalType(CaughtType); 2851 TypesWithHandlers.push_back(TypeWithHandler(CanonicalCaughtType, Handler)); 2852 } 2853 2854 // Detect handlers for the same type as an earlier one. 2855 if (NumHandlers > 1) { 2856 llvm::array_pod_sort(TypesWithHandlers.begin(), TypesWithHandlers.end()); 2857 2858 TypeWithHandler prev = TypesWithHandlers[0]; 2859 for (unsigned i = 1; i < TypesWithHandlers.size(); ++i) { 2860 TypeWithHandler curr = TypesWithHandlers[i]; 2861 2862 if (curr == prev) { 2863 Diag(curr.getTypeSpecStartLoc(), 2864 diag::warn_exception_caught_by_earlier_handler) 2865 << curr.getCatchStmt()->getCaughtType().getAsString(); 2866 Diag(prev.getTypeSpecStartLoc(), 2867 diag::note_previous_exception_handler) 2868 << prev.getCatchStmt()->getCaughtType().getAsString(); 2869 } 2870 2871 prev = curr; 2872 } 2873 } 2874 2875 getCurFunction()->setHasBranchProtectedScope(); 2876 2877 // FIXME: We should detect handlers that cannot catch anything because an 2878 // earlier handler catches a superclass. Need to find a method that is not 2879 // quadratic for this. 2880 // Neither of these are explicitly forbidden, but every compiler detects them 2881 // and warns. 2882 2883 return Owned(CXXTryStmt::Create(Context, TryLoc, TryBlock, 2884 Handlers, NumHandlers)); 2885} 2886 2887StmtResult 2888Sema::ActOnSEHTryBlock(bool IsCXXTry, 2889 SourceLocation TryLoc, 2890 Stmt *TryBlock, 2891 Stmt *Handler) { 2892 assert(TryBlock && Handler); 2893 2894 getCurFunction()->setHasBranchProtectedScope(); 2895 2896 return Owned(SEHTryStmt::Create(Context,IsCXXTry,TryLoc,TryBlock,Handler)); 2897} 2898 2899StmtResult 2900Sema::ActOnSEHExceptBlock(SourceLocation Loc, 2901 Expr *FilterExpr, 2902 Stmt *Block) { 2903 assert(FilterExpr && Block); 2904 2905 if(!FilterExpr->getType()->isIntegerType()) { 2906 return StmtError(Diag(FilterExpr->getExprLoc(), 2907 diag::err_filter_expression_integral) 2908 << FilterExpr->getType()); 2909 } 2910 2911 return Owned(SEHExceptStmt::Create(Context,Loc,FilterExpr,Block)); 2912} 2913 2914StmtResult 2915Sema::ActOnSEHFinallyBlock(SourceLocation Loc, 2916 Stmt *Block) { 2917 assert(Block); 2918 return Owned(SEHFinallyStmt::Create(Context,Loc,Block)); 2919} 2920 2921StmtResult Sema::BuildMSDependentExistsStmt(SourceLocation KeywordLoc, 2922 bool IsIfExists, 2923 NestedNameSpecifierLoc QualifierLoc, 2924 DeclarationNameInfo NameInfo, 2925 Stmt *Nested) 2926{ 2927 return new (Context) MSDependentExistsStmt(KeywordLoc, IsIfExists, 2928 QualifierLoc, NameInfo, 2929 cast<CompoundStmt>(Nested)); 2930} 2931 2932 2933StmtResult Sema::ActOnMSDependentExistsStmt(SourceLocation KeywordLoc, 2934 bool IsIfExists, 2935 CXXScopeSpec &SS, 2936 UnqualifiedId &Name, 2937 Stmt *Nested) { 2938 return BuildMSDependentExistsStmt(KeywordLoc, IsIfExists, 2939 SS.getWithLocInContext(Context), 2940 GetNameFromUnqualifiedId(Name), 2941 Nested); 2942} 2943