SemaStmt.cpp revision ad762fcdc16b9e4705b12b09d92b8c026212b906
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/APValue.h" 20#include "clang/AST/ASTContext.h" 21#include "clang/AST/DeclObjC.h" 22#include "clang/AST/ExprCXX.h" 23#include "clang/AST/ExprObjC.h" 24#include "clang/AST/StmtObjC.h" 25#include "clang/AST/StmtCXX.h" 26#include "clang/AST/TypeLoc.h" 27#include "clang/Lex/Preprocessor.h" 28#include "clang/Basic/TargetInfo.h" 29#include "llvm/ADT/ArrayRef.h" 30#include "llvm/ADT/STLExtras.h" 31#include "llvm/ADT/SmallVector.h" 32using namespace clang; 33using namespace sema; 34 35StmtResult Sema::ActOnExprStmt(FullExprArg expr) { 36 Expr *E = expr.get(); 37 if (!E) // FIXME: FullExprArg has no error state? 38 return StmtError(); 39 40 // C99 6.8.3p2: The expression in an expression statement is evaluated as a 41 // void expression for its side effects. Conversion to void allows any 42 // operand, even incomplete types. 43 44 // Same thing in for stmt first clause (when expr) and third clause. 45 return Owned(static_cast<Stmt*>(E)); 46} 47 48 49StmtResult Sema::ActOnNullStmt(SourceLocation SemiLoc, bool LeadingEmptyMacro) { 50 return Owned(new (Context) NullStmt(SemiLoc, LeadingEmptyMacro)); 51} 52 53StmtResult Sema::ActOnDeclStmt(DeclGroupPtrTy dg, SourceLocation StartLoc, 54 SourceLocation EndLoc) { 55 DeclGroupRef DG = dg.getAsVal<DeclGroupRef>(); 56 57 // If we have an invalid decl, just return an error. 58 if (DG.isNull()) return StmtError(); 59 60 return Owned(new (Context) DeclStmt(DG, StartLoc, EndLoc)); 61} 62 63void Sema::ActOnForEachDeclStmt(DeclGroupPtrTy dg) { 64 DeclGroupRef DG = dg.getAsVal<DeclGroupRef>(); 65 66 // If we have an invalid decl, just return. 67 if (DG.isNull() || !DG.isSingleDecl()) return; 68 // suppress any potential 'unused variable' warning. 69 DG.getSingleDecl()->setUsed(); 70} 71 72void Sema::DiagnoseUnusedExprResult(const Stmt *S) { 73 if (const LabelStmt *Label = dyn_cast_or_null<LabelStmt>(S)) 74 return DiagnoseUnusedExprResult(Label->getSubStmt()); 75 76 const Expr *E = dyn_cast_or_null<Expr>(S); 77 if (!E) 78 return; 79 80 if (E->isBoundMemberFunction(Context)) { 81 Diag(E->getLocStart(), diag::err_invalid_use_of_bound_member_func) 82 << E->getSourceRange(); 83 return; 84 } 85 86 SourceLocation Loc; 87 SourceRange R1, R2; 88 if (!E->isUnusedResultAWarning(Loc, R1, R2, Context)) 89 return; 90 91 // Okay, we have an unused result. Depending on what the base expression is, 92 // we might want to make a more specific diagnostic. Check for one of these 93 // cases now. 94 unsigned DiagID = diag::warn_unused_expr; 95 if (const ExprWithCleanups *Temps = dyn_cast<ExprWithCleanups>(E)) 96 E = Temps->getSubExpr(); 97 if (const CXXBindTemporaryExpr *TempExpr = dyn_cast<CXXBindTemporaryExpr>(E)) 98 E = TempExpr->getSubExpr(); 99 100 E = E->IgnoreParenImpCasts(); 101 if (const CallExpr *CE = dyn_cast<CallExpr>(E)) { 102 if (E->getType()->isVoidType()) 103 return; 104 105 // If the callee has attribute pure, const, or warn_unused_result, warn with 106 // a more specific message to make it clear what is happening. 107 if (const Decl *FD = CE->getCalleeDecl()) { 108 if (FD->getAttr<WarnUnusedResultAttr>()) { 109 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "warn_unused_result"; 110 return; 111 } 112 if (FD->getAttr<PureAttr>()) { 113 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "pure"; 114 return; 115 } 116 if (FD->getAttr<ConstAttr>()) { 117 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "const"; 118 return; 119 } 120 } 121 } else if (const ObjCMessageExpr *ME = dyn_cast<ObjCMessageExpr>(E)) { 122 const ObjCMethodDecl *MD = ME->getMethodDecl(); 123 if (MD && MD->getAttr<WarnUnusedResultAttr>()) { 124 Diag(Loc, diag::warn_unused_call) << R1 << R2 << "warn_unused_result"; 125 return; 126 } 127 } else if (isa<ObjCPropertyRefExpr>(E)) { 128 DiagID = diag::warn_unused_property_expr; 129 } else if (const CXXFunctionalCastExpr *FC 130 = dyn_cast<CXXFunctionalCastExpr>(E)) { 131 if (isa<CXXConstructExpr>(FC->getSubExpr()) || 132 isa<CXXTemporaryObjectExpr>(FC->getSubExpr())) 133 return; 134 } 135 // Diagnose "(void*) blah" as a typo for "(void) blah". 136 else if (const CStyleCastExpr *CE = dyn_cast<CStyleCastExpr>(E)) { 137 TypeSourceInfo *TI = CE->getTypeInfoAsWritten(); 138 QualType T = TI->getType(); 139 140 // We really do want to use the non-canonical type here. 141 if (T == Context.VoidPtrTy) { 142 PointerTypeLoc TL = cast<PointerTypeLoc>(TI->getTypeLoc()); 143 144 Diag(Loc, diag::warn_unused_voidptr) 145 << FixItHint::CreateRemoval(TL.getStarLoc()); 146 return; 147 } 148 } 149 150 DiagRuntimeBehavior(Loc, 0, PDiag(DiagID) << R1 << R2); 151} 152 153StmtResult 154Sema::ActOnCompoundStmt(SourceLocation L, SourceLocation R, 155 MultiStmtArg elts, bool isStmtExpr) { 156 unsigned NumElts = elts.size(); 157 Stmt **Elts = reinterpret_cast<Stmt**>(elts.release()); 158 // If we're in C89 mode, check that we don't have any decls after stmts. If 159 // so, emit an extension diagnostic. 160 if (!getLangOptions().C99 && !getLangOptions().CPlusPlus) { 161 // Note that __extension__ can be around a decl. 162 unsigned i = 0; 163 // Skip over all declarations. 164 for (; i != NumElts && isa<DeclStmt>(Elts[i]); ++i) 165 /*empty*/; 166 167 // We found the end of the list or a statement. Scan for another declstmt. 168 for (; i != NumElts && !isa<DeclStmt>(Elts[i]); ++i) 169 /*empty*/; 170 171 if (i != NumElts) { 172 Decl *D = *cast<DeclStmt>(Elts[i])->decl_begin(); 173 Diag(D->getLocation(), diag::ext_mixed_decls_code); 174 } 175 } 176 // Warn about unused expressions in statements. 177 for (unsigned i = 0; i != NumElts; ++i) { 178 // Ignore statements that are last in a statement expression. 179 if (isStmtExpr && i == NumElts - 1) 180 continue; 181 182 DiagnoseUnusedExprResult(Elts[i]); 183 } 184 185 return Owned(new (Context) CompoundStmt(Context, Elts, NumElts, L, R)); 186} 187 188StmtResult 189Sema::ActOnCaseStmt(SourceLocation CaseLoc, Expr *LHSVal, 190 SourceLocation DotDotDotLoc, Expr *RHSVal, 191 SourceLocation ColonLoc) { 192 assert((LHSVal != 0) && "missing expression in case statement"); 193 194 // C99 6.8.4.2p3: The expression shall be an integer constant. 195 // However, GCC allows any evaluatable integer expression. 196 if (!LHSVal->isTypeDependent() && !LHSVal->isValueDependent() && 197 VerifyIntegerConstantExpression(LHSVal)) 198 return StmtError(); 199 200 // GCC extension: The expression shall be an integer constant. 201 202 if (RHSVal && !RHSVal->isTypeDependent() && !RHSVal->isValueDependent() && 203 VerifyIntegerConstantExpression(RHSVal)) { 204 RHSVal = 0; // Recover by just forgetting about it. 205 } 206 207 if (getCurFunction()->SwitchStack.empty()) { 208 Diag(CaseLoc, diag::err_case_not_in_switch); 209 return StmtError(); 210 } 211 212 CaseStmt *CS = new (Context) CaseStmt(LHSVal, RHSVal, CaseLoc, DotDotDotLoc, 213 ColonLoc); 214 getCurFunction()->SwitchStack.back()->addSwitchCase(CS); 215 return Owned(CS); 216} 217 218/// ActOnCaseStmtBody - This installs a statement as the body of a case. 219void Sema::ActOnCaseStmtBody(Stmt *caseStmt, Stmt *SubStmt) { 220 CaseStmt *CS = static_cast<CaseStmt*>(caseStmt); 221 CS->setSubStmt(SubStmt); 222} 223 224StmtResult 225Sema::ActOnDefaultStmt(SourceLocation DefaultLoc, SourceLocation ColonLoc, 226 Stmt *SubStmt, Scope *CurScope) { 227 if (getCurFunction()->SwitchStack.empty()) { 228 Diag(DefaultLoc, diag::err_default_not_in_switch); 229 return Owned(SubStmt); 230 } 231 232 DefaultStmt *DS = new (Context) DefaultStmt(DefaultLoc, ColonLoc, SubStmt); 233 getCurFunction()->SwitchStack.back()->addSwitchCase(DS); 234 return Owned(DS); 235} 236 237StmtResult 238Sema::ActOnLabelStmt(SourceLocation IdentLoc, LabelDecl *TheDecl, 239 SourceLocation ColonLoc, Stmt *SubStmt) { 240 241 // If the label was multiply defined, reject it now. 242 if (TheDecl->getStmt()) { 243 Diag(IdentLoc, diag::err_redefinition_of_label) << TheDecl->getDeclName(); 244 Diag(TheDecl->getLocation(), diag::note_previous_definition); 245 return Owned(SubStmt); 246 } 247 248 // Otherwise, things are good. Fill in the declaration and return it. 249 LabelStmt *LS = new (Context) LabelStmt(IdentLoc, TheDecl, SubStmt); 250 TheDecl->setStmt(LS); 251 if (!TheDecl->isGnuLocal()) 252 TheDecl->setLocation(IdentLoc); 253 return Owned(LS); 254} 255 256StmtResult 257Sema::ActOnIfStmt(SourceLocation IfLoc, FullExprArg CondVal, Decl *CondVar, 258 Stmt *thenStmt, SourceLocation ElseLoc, 259 Stmt *elseStmt) { 260 ExprResult CondResult(CondVal.release()); 261 262 VarDecl *ConditionVar = 0; 263 if (CondVar) { 264 ConditionVar = cast<VarDecl>(CondVar); 265 CondResult = CheckConditionVariable(ConditionVar, IfLoc, true); 266 if (CondResult.isInvalid()) 267 return StmtError(); 268 } 269 Expr *ConditionExpr = CondResult.takeAs<Expr>(); 270 if (!ConditionExpr) 271 return StmtError(); 272 273 DiagnoseUnusedExprResult(thenStmt); 274 275 // Warn if the if block has a null body without an else value. 276 // this helps prevent bugs due to typos, such as 277 // if (condition); 278 // do_stuff(); 279 // 280 if (!elseStmt) { 281 if (NullStmt* stmt = dyn_cast<NullStmt>(thenStmt)) 282 // But do not warn if the body is a macro that expands to nothing, e.g: 283 // 284 // #define CALL(x) 285 // if (condition) 286 // CALL(0); 287 // 288 if (!stmt->hasLeadingEmptyMacro()) 289 Diag(stmt->getSemiLoc(), diag::warn_empty_if_body); 290 } 291 292 DiagnoseUnusedExprResult(elseStmt); 293 294 return Owned(new (Context) IfStmt(Context, IfLoc, ConditionVar, ConditionExpr, 295 thenStmt, ElseLoc, elseStmt)); 296} 297 298/// ConvertIntegerToTypeWarnOnOverflow - Convert the specified APInt to have 299/// the specified width and sign. If an overflow occurs, detect it and emit 300/// the specified diagnostic. 301void Sema::ConvertIntegerToTypeWarnOnOverflow(llvm::APSInt &Val, 302 unsigned NewWidth, bool NewSign, 303 SourceLocation Loc, 304 unsigned DiagID) { 305 // Perform a conversion to the promoted condition type if needed. 306 if (NewWidth > Val.getBitWidth()) { 307 // If this is an extension, just do it. 308 Val = Val.extend(NewWidth); 309 Val.setIsSigned(NewSign); 310 311 // If the input was signed and negative and the output is 312 // unsigned, don't bother to warn: this is implementation-defined 313 // behavior. 314 // FIXME: Introduce a second, default-ignored warning for this case? 315 } else if (NewWidth < Val.getBitWidth()) { 316 // If this is a truncation, check for overflow. 317 llvm::APSInt ConvVal(Val); 318 ConvVal = ConvVal.trunc(NewWidth); 319 ConvVal.setIsSigned(NewSign); 320 ConvVal = ConvVal.extend(Val.getBitWidth()); 321 ConvVal.setIsSigned(Val.isSigned()); 322 if (ConvVal != Val) 323 Diag(Loc, DiagID) << Val.toString(10) << ConvVal.toString(10); 324 325 // Regardless of whether a diagnostic was emitted, really do the 326 // truncation. 327 Val = Val.trunc(NewWidth); 328 Val.setIsSigned(NewSign); 329 } else if (NewSign != Val.isSigned()) { 330 // Convert the sign to match the sign of the condition. This can cause 331 // overflow as well: unsigned(INTMIN) 332 // We don't diagnose this overflow, because it is implementation-defined 333 // behavior. 334 // FIXME: Introduce a second, default-ignored warning for this case? 335 llvm::APSInt OldVal(Val); 336 Val.setIsSigned(NewSign); 337 } 338} 339 340namespace { 341 struct CaseCompareFunctor { 342 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS, 343 const llvm::APSInt &RHS) { 344 return LHS.first < RHS; 345 } 346 bool operator()(const std::pair<llvm::APSInt, CaseStmt*> &LHS, 347 const std::pair<llvm::APSInt, CaseStmt*> &RHS) { 348 return LHS.first < RHS.first; 349 } 350 bool operator()(const llvm::APSInt &LHS, 351 const std::pair<llvm::APSInt, CaseStmt*> &RHS) { 352 return LHS < RHS.first; 353 } 354 }; 355} 356 357/// CmpCaseVals - Comparison predicate for sorting case values. 358/// 359static bool CmpCaseVals(const std::pair<llvm::APSInt, CaseStmt*>& lhs, 360 const std::pair<llvm::APSInt, CaseStmt*>& rhs) { 361 if (lhs.first < rhs.first) 362 return true; 363 364 if (lhs.first == rhs.first && 365 lhs.second->getCaseLoc().getRawEncoding() 366 < rhs.second->getCaseLoc().getRawEncoding()) 367 return true; 368 return false; 369} 370 371/// CmpEnumVals - Comparison predicate for sorting enumeration values. 372/// 373static bool CmpEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs, 374 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs) 375{ 376 return lhs.first < rhs.first; 377} 378 379/// EqEnumVals - Comparison preficate for uniqing enumeration values. 380/// 381static bool EqEnumVals(const std::pair<llvm::APSInt, EnumConstantDecl*>& lhs, 382 const std::pair<llvm::APSInt, EnumConstantDecl*>& rhs) 383{ 384 return lhs.first == rhs.first; 385} 386 387/// GetTypeBeforeIntegralPromotion - Returns the pre-promotion type of 388/// potentially integral-promoted expression @p expr. 389static QualType GetTypeBeforeIntegralPromotion(const Expr* expr) { 390 if (const CastExpr *ImplicitCast = dyn_cast<ImplicitCastExpr>(expr)) { 391 const Expr *ExprBeforePromotion = ImplicitCast->getSubExpr(); 392 QualType TypeBeforePromotion = ExprBeforePromotion->getType(); 393 if (TypeBeforePromotion->isIntegralOrEnumerationType()) { 394 return TypeBeforePromotion; 395 } 396 } 397 return expr->getType(); 398} 399 400StmtResult 401Sema::ActOnStartOfSwitchStmt(SourceLocation SwitchLoc, Expr *Cond, 402 Decl *CondVar) { 403 ExprResult CondResult; 404 405 VarDecl *ConditionVar = 0; 406 if (CondVar) { 407 ConditionVar = cast<VarDecl>(CondVar); 408 CondResult = CheckConditionVariable(ConditionVar, SourceLocation(), false); 409 if (CondResult.isInvalid()) 410 return StmtError(); 411 412 Cond = CondResult.release(); 413 } 414 415 if (!Cond) 416 return StmtError(); 417 418 CondResult 419 = ConvertToIntegralOrEnumerationType(SwitchLoc, Cond, 420 PDiag(diag::err_typecheck_statement_requires_integer), 421 PDiag(diag::err_switch_incomplete_class_type) 422 << Cond->getSourceRange(), 423 PDiag(diag::err_switch_explicit_conversion), 424 PDiag(diag::note_switch_conversion), 425 PDiag(diag::err_switch_multiple_conversions), 426 PDiag(diag::note_switch_conversion), 427 PDiag(0)); 428 if (CondResult.isInvalid()) return StmtError(); 429 Cond = CondResult.take(); 430 431 if (!CondVar) { 432 CheckImplicitConversions(Cond, SwitchLoc); 433 CondResult = MaybeCreateExprWithCleanups(Cond); 434 if (CondResult.isInvalid()) 435 return StmtError(); 436 Cond = CondResult.take(); 437 } 438 439 getCurFunction()->setHasBranchIntoScope(); 440 441 SwitchStmt *SS = new (Context) SwitchStmt(Context, ConditionVar, Cond); 442 getCurFunction()->SwitchStack.push_back(SS); 443 return Owned(SS); 444} 445 446static void AdjustAPSInt(llvm::APSInt &Val, unsigned BitWidth, bool IsSigned) { 447 if (Val.getBitWidth() < BitWidth) 448 Val = Val.extend(BitWidth); 449 else if (Val.getBitWidth() > BitWidth) 450 Val = Val.trunc(BitWidth); 451 Val.setIsSigned(IsSigned); 452} 453 454StmtResult 455Sema::ActOnFinishSwitchStmt(SourceLocation SwitchLoc, Stmt *Switch, 456 Stmt *BodyStmt) { 457 SwitchStmt *SS = cast<SwitchStmt>(Switch); 458 assert(SS == getCurFunction()->SwitchStack.back() && 459 "switch stack missing push/pop!"); 460 461 SS->setBody(BodyStmt, SwitchLoc); 462 getCurFunction()->SwitchStack.pop_back(); 463 464 if (SS->getCond() == 0) 465 return StmtError(); 466 467 Expr *CondExpr = SS->getCond(); 468 Expr *CondExprBeforePromotion = CondExpr; 469 QualType CondTypeBeforePromotion = 470 GetTypeBeforeIntegralPromotion(CondExpr); 471 472 // C99 6.8.4.2p5 - Integer promotions are performed on the controlling expr. 473 ExprResult CondResult = UsualUnaryConversions(CondExpr); 474 if (CondResult.isInvalid()) 475 return StmtError(); 476 CondExpr = CondResult.take(); 477 QualType CondType = CondExpr->getType(); 478 SS->setCond(CondExpr); 479 480 // C++ 6.4.2.p2: 481 // Integral promotions are performed (on the switch condition). 482 // 483 // A case value unrepresentable by the original switch condition 484 // type (before the promotion) doesn't make sense, even when it can 485 // be represented by the promoted type. Therefore we need to find 486 // the pre-promotion type of the switch condition. 487 if (!CondExpr->isTypeDependent()) { 488 // We have already converted the expression to an integral or enumeration 489 // type, when we started the switch statement. If we don't have an 490 // appropriate type now, just return an error. 491 if (!CondType->isIntegralOrEnumerationType()) 492 return StmtError(); 493 494 if (CondExpr->isKnownToHaveBooleanValue()) { 495 // switch(bool_expr) {...} is often a programmer error, e.g. 496 // switch(n && mask) { ... } // Doh - should be "n & mask". 497 // One can always use an if statement instead of switch(bool_expr). 498 Diag(SwitchLoc, diag::warn_bool_switch_condition) 499 << CondExpr->getSourceRange(); 500 } 501 } 502 503 // Get the bitwidth of the switched-on value before promotions. We must 504 // convert the integer case values to this width before comparison. 505 bool HasDependentValue 506 = CondExpr->isTypeDependent() || CondExpr->isValueDependent(); 507 unsigned CondWidth 508 = HasDependentValue ? 0 : Context.getIntWidth(CondTypeBeforePromotion); 509 bool CondIsSigned = CondTypeBeforePromotion->isSignedIntegerType(); 510 511 // Accumulate all of the case values in a vector so that we can sort them 512 // and detect duplicates. This vector contains the APInt for the case after 513 // it has been converted to the condition type. 514 typedef llvm::SmallVector<std::pair<llvm::APSInt, CaseStmt*>, 64> CaseValsTy; 515 CaseValsTy CaseVals; 516 517 // Keep track of any GNU case ranges we see. The APSInt is the low value. 518 typedef std::vector<std::pair<llvm::APSInt, CaseStmt*> > CaseRangesTy; 519 CaseRangesTy CaseRanges; 520 521 DefaultStmt *TheDefaultStmt = 0; 522 523 bool CaseListIsErroneous = false; 524 525 for (SwitchCase *SC = SS->getSwitchCaseList(); SC && !HasDependentValue; 526 SC = SC->getNextSwitchCase()) { 527 528 if (DefaultStmt *DS = dyn_cast<DefaultStmt>(SC)) { 529 if (TheDefaultStmt) { 530 Diag(DS->getDefaultLoc(), diag::err_multiple_default_labels_defined); 531 Diag(TheDefaultStmt->getDefaultLoc(), diag::note_duplicate_case_prev); 532 533 // FIXME: Remove the default statement from the switch block so that 534 // we'll return a valid AST. This requires recursing down the AST and 535 // finding it, not something we are set up to do right now. For now, 536 // just lop the entire switch stmt out of the AST. 537 CaseListIsErroneous = true; 538 } 539 TheDefaultStmt = DS; 540 541 } else { 542 CaseStmt *CS = cast<CaseStmt>(SC); 543 544 // We already verified that the expression has a i-c-e value (C99 545 // 6.8.4.2p3) - get that value now. 546 Expr *Lo = CS->getLHS(); 547 548 if (Lo->isTypeDependent() || Lo->isValueDependent()) { 549 HasDependentValue = true; 550 break; 551 } 552 553 llvm::APSInt LoVal = Lo->EvaluateAsInt(Context); 554 555 // Convert the value to the same width/sign as the condition. 556 ConvertIntegerToTypeWarnOnOverflow(LoVal, CondWidth, CondIsSigned, 557 Lo->getLocStart(), 558 diag::warn_case_value_overflow); 559 560 // If the LHS is not the same type as the condition, insert an implicit 561 // cast. 562 Lo = ImpCastExprToType(Lo, CondType, CK_IntegralCast).take(); 563 CS->setLHS(Lo); 564 565 // If this is a case range, remember it in CaseRanges, otherwise CaseVals. 566 if (CS->getRHS()) { 567 if (CS->getRHS()->isTypeDependent() || 568 CS->getRHS()->isValueDependent()) { 569 HasDependentValue = true; 570 break; 571 } 572 CaseRanges.push_back(std::make_pair(LoVal, CS)); 573 } else 574 CaseVals.push_back(std::make_pair(LoVal, CS)); 575 } 576 } 577 578 if (!HasDependentValue) { 579 // If we don't have a default statement, check whether the 580 // condition is constant. 581 llvm::APSInt ConstantCondValue; 582 bool HasConstantCond = false; 583 bool ShouldCheckConstantCond = false; 584 if (!HasDependentValue && !TheDefaultStmt) { 585 Expr::EvalResult Result; 586 HasConstantCond = CondExprBeforePromotion->Evaluate(Result, Context); 587 if (HasConstantCond) { 588 assert(Result.Val.isInt() && "switch condition evaluated to non-int"); 589 ConstantCondValue = Result.Val.getInt(); 590 ShouldCheckConstantCond = true; 591 592 assert(ConstantCondValue.getBitWidth() == CondWidth && 593 ConstantCondValue.isSigned() == CondIsSigned); 594 } 595 } 596 597 // Sort all the scalar case values so we can easily detect duplicates. 598 std::stable_sort(CaseVals.begin(), CaseVals.end(), CmpCaseVals); 599 600 if (!CaseVals.empty()) { 601 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) { 602 if (ShouldCheckConstantCond && 603 CaseVals[i].first == ConstantCondValue) 604 ShouldCheckConstantCond = false; 605 606 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) { 607 // If we have a duplicate, report it. 608 Diag(CaseVals[i].second->getLHS()->getLocStart(), 609 diag::err_duplicate_case) << CaseVals[i].first.toString(10); 610 Diag(CaseVals[i-1].second->getLHS()->getLocStart(), 611 diag::note_duplicate_case_prev); 612 // FIXME: We really want to remove the bogus case stmt from the 613 // substmt, but we have no way to do this right now. 614 CaseListIsErroneous = true; 615 } 616 } 617 } 618 619 // Detect duplicate case ranges, which usually don't exist at all in 620 // the first place. 621 if (!CaseRanges.empty()) { 622 // Sort all the case ranges by their low value so we can easily detect 623 // overlaps between ranges. 624 std::stable_sort(CaseRanges.begin(), CaseRanges.end()); 625 626 // Scan the ranges, computing the high values and removing empty ranges. 627 std::vector<llvm::APSInt> HiVals; 628 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) { 629 llvm::APSInt &LoVal = CaseRanges[i].first; 630 CaseStmt *CR = CaseRanges[i].second; 631 Expr *Hi = CR->getRHS(); 632 llvm::APSInt HiVal = Hi->EvaluateAsInt(Context); 633 634 // Convert the value to the same width/sign as the condition. 635 ConvertIntegerToTypeWarnOnOverflow(HiVal, CondWidth, CondIsSigned, 636 Hi->getLocStart(), 637 diag::warn_case_value_overflow); 638 639 // If the LHS is not the same type as the condition, insert an implicit 640 // cast. 641 Hi = ImpCastExprToType(Hi, CondType, CK_IntegralCast).take(); 642 CR->setRHS(Hi); 643 644 // If the low value is bigger than the high value, the case is empty. 645 if (LoVal > HiVal) { 646 Diag(CR->getLHS()->getLocStart(), diag::warn_case_empty_range) 647 << SourceRange(CR->getLHS()->getLocStart(), 648 Hi->getLocEnd()); 649 CaseRanges.erase(CaseRanges.begin()+i); 650 --i, --e; 651 continue; 652 } 653 654 if (ShouldCheckConstantCond && 655 LoVal <= ConstantCondValue && 656 ConstantCondValue <= HiVal) 657 ShouldCheckConstantCond = false; 658 659 HiVals.push_back(HiVal); 660 } 661 662 // Rescan the ranges, looking for overlap with singleton values and other 663 // ranges. Since the range list is sorted, we only need to compare case 664 // ranges with their neighbors. 665 for (unsigned i = 0, e = CaseRanges.size(); i != e; ++i) { 666 llvm::APSInt &CRLo = CaseRanges[i].first; 667 llvm::APSInt &CRHi = HiVals[i]; 668 CaseStmt *CR = CaseRanges[i].second; 669 670 // Check to see whether the case range overlaps with any 671 // singleton cases. 672 CaseStmt *OverlapStmt = 0; 673 llvm::APSInt OverlapVal(32); 674 675 // Find the smallest value >= the lower bound. If I is in the 676 // case range, then we have overlap. 677 CaseValsTy::iterator I = std::lower_bound(CaseVals.begin(), 678 CaseVals.end(), CRLo, 679 CaseCompareFunctor()); 680 if (I != CaseVals.end() && I->first < CRHi) { 681 OverlapVal = I->first; // Found overlap with scalar. 682 OverlapStmt = I->second; 683 } 684 685 // Find the smallest value bigger than the upper bound. 686 I = std::upper_bound(I, CaseVals.end(), CRHi, CaseCompareFunctor()); 687 if (I != CaseVals.begin() && (I-1)->first >= CRLo) { 688 OverlapVal = (I-1)->first; // Found overlap with scalar. 689 OverlapStmt = (I-1)->second; 690 } 691 692 // Check to see if this case stmt overlaps with the subsequent 693 // case range. 694 if (i && CRLo <= HiVals[i-1]) { 695 OverlapVal = HiVals[i-1]; // Found overlap with range. 696 OverlapStmt = CaseRanges[i-1].second; 697 } 698 699 if (OverlapStmt) { 700 // If we have a duplicate, report it. 701 Diag(CR->getLHS()->getLocStart(), diag::err_duplicate_case) 702 << OverlapVal.toString(10); 703 Diag(OverlapStmt->getLHS()->getLocStart(), 704 diag::note_duplicate_case_prev); 705 // FIXME: We really want to remove the bogus case stmt from the 706 // substmt, but we have no way to do this right now. 707 CaseListIsErroneous = true; 708 } 709 } 710 } 711 712 // Complain if we have a constant condition and we didn't find a match. 713 if (!CaseListIsErroneous && ShouldCheckConstantCond) { 714 // TODO: it would be nice if we printed enums as enums, chars as 715 // chars, etc. 716 Diag(CondExpr->getExprLoc(), diag::warn_missing_case_for_condition) 717 << ConstantCondValue.toString(10) 718 << CondExpr->getSourceRange(); 719 } 720 721 // Check to see if switch is over an Enum and handles all of its 722 // values. We only issue a warning if there is not 'default:', but 723 // we still do the analysis to preserve this information in the AST 724 // (which can be used by flow-based analyes). 725 // 726 const EnumType *ET = CondTypeBeforePromotion->getAs<EnumType>(); 727 728 // If switch has default case, then ignore it. 729 if (!CaseListIsErroneous && !HasConstantCond && ET) { 730 const EnumDecl *ED = ET->getDecl(); 731 typedef llvm::SmallVector<std::pair<llvm::APSInt, EnumConstantDecl*>, 64> EnumValsTy; 732 EnumValsTy EnumVals; 733 734 // Gather all enum values, set their type and sort them, 735 // allowing easier comparison with CaseVals. 736 for (EnumDecl::enumerator_iterator EDI = ED->enumerator_begin(); 737 EDI != ED->enumerator_end(); ++EDI) { 738 llvm::APSInt Val = EDI->getInitVal(); 739 AdjustAPSInt(Val, CondWidth, CondIsSigned); 740 EnumVals.push_back(std::make_pair(Val, *EDI)); 741 } 742 std::stable_sort(EnumVals.begin(), EnumVals.end(), CmpEnumVals); 743 EnumValsTy::iterator EIend = 744 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals); 745 746 // See which case values aren't in enum. 747 // TODO: we might want to check whether case values are out of the 748 // enum even if we don't want to check whether all cases are handled. 749 if (!TheDefaultStmt) { 750 EnumValsTy::const_iterator EI = EnumVals.begin(); 751 for (CaseValsTy::const_iterator CI = CaseVals.begin(); 752 CI != CaseVals.end(); CI++) { 753 while (EI != EIend && EI->first < CI->first) 754 EI++; 755 if (EI == EIend || EI->first > CI->first) 756 Diag(CI->second->getLHS()->getExprLoc(), diag::warn_not_in_enum) 757 << ED->getDeclName(); 758 } 759 // See which of case ranges aren't in enum 760 EI = EnumVals.begin(); 761 for (CaseRangesTy::const_iterator RI = CaseRanges.begin(); 762 RI != CaseRanges.end() && EI != EIend; RI++) { 763 while (EI != EIend && EI->first < RI->first) 764 EI++; 765 766 if (EI == EIend || EI->first != RI->first) { 767 Diag(RI->second->getLHS()->getExprLoc(), diag::warn_not_in_enum) 768 << ED->getDeclName(); 769 } 770 771 llvm::APSInt Hi = RI->second->getRHS()->EvaluateAsInt(Context); 772 AdjustAPSInt(Hi, CondWidth, CondIsSigned); 773 while (EI != EIend && EI->first < Hi) 774 EI++; 775 if (EI == EIend || EI->first != Hi) 776 Diag(RI->second->getRHS()->getExprLoc(), diag::warn_not_in_enum) 777 << ED->getDeclName(); 778 } 779 } 780 781 // Check which enum vals aren't in switch 782 CaseValsTy::const_iterator CI = CaseVals.begin(); 783 CaseRangesTy::const_iterator RI = CaseRanges.begin(); 784 bool hasCasesNotInSwitch = false; 785 786 llvm::SmallVector<DeclarationName,8> UnhandledNames; 787 788 for (EnumValsTy::const_iterator EI = EnumVals.begin(); EI != EIend; EI++){ 789 // Drop unneeded case values 790 llvm::APSInt CIVal; 791 while (CI != CaseVals.end() && CI->first < EI->first) 792 CI++; 793 794 if (CI != CaseVals.end() && CI->first == EI->first) 795 continue; 796 797 // Drop unneeded case ranges 798 for (; RI != CaseRanges.end(); RI++) { 799 llvm::APSInt Hi = RI->second->getRHS()->EvaluateAsInt(Context); 800 AdjustAPSInt(Hi, CondWidth, CondIsSigned); 801 if (EI->first <= Hi) 802 break; 803 } 804 805 if (RI == CaseRanges.end() || EI->first < RI->first) { 806 hasCasesNotInSwitch = true; 807 if (!TheDefaultStmt) 808 UnhandledNames.push_back(EI->second->getDeclName()); 809 } 810 } 811 812 // Produce a nice diagnostic if multiple values aren't handled. 813 switch (UnhandledNames.size()) { 814 case 0: break; 815 case 1: 816 Diag(CondExpr->getExprLoc(), diag::warn_missing_case1) 817 << UnhandledNames[0]; 818 break; 819 case 2: 820 Diag(CondExpr->getExprLoc(), diag::warn_missing_case2) 821 << UnhandledNames[0] << UnhandledNames[1]; 822 break; 823 case 3: 824 Diag(CondExpr->getExprLoc(), diag::warn_missing_case3) 825 << UnhandledNames[0] << UnhandledNames[1] << UnhandledNames[2]; 826 break; 827 default: 828 Diag(CondExpr->getExprLoc(), diag::warn_missing_cases) 829 << (unsigned)UnhandledNames.size() 830 << UnhandledNames[0] << UnhandledNames[1] << UnhandledNames[2]; 831 break; 832 } 833 834 if (!hasCasesNotInSwitch) 835 SS->setAllEnumCasesCovered(); 836 } 837 } 838 839 // FIXME: If the case list was broken is some way, we don't have a good system 840 // to patch it up. Instead, just return the whole substmt as broken. 841 if (CaseListIsErroneous) 842 return StmtError(); 843 844 return Owned(SS); 845} 846 847StmtResult 848Sema::ActOnWhileStmt(SourceLocation WhileLoc, FullExprArg Cond, 849 Decl *CondVar, Stmt *Body) { 850 ExprResult CondResult(Cond.release()); 851 852 VarDecl *ConditionVar = 0; 853 if (CondVar) { 854 ConditionVar = cast<VarDecl>(CondVar); 855 CondResult = CheckConditionVariable(ConditionVar, WhileLoc, true); 856 if (CondResult.isInvalid()) 857 return StmtError(); 858 } 859 Expr *ConditionExpr = CondResult.take(); 860 if (!ConditionExpr) 861 return StmtError(); 862 863 DiagnoseUnusedExprResult(Body); 864 865 return Owned(new (Context) WhileStmt(Context, ConditionVar, ConditionExpr, 866 Body, WhileLoc)); 867} 868 869StmtResult 870Sema::ActOnDoStmt(SourceLocation DoLoc, Stmt *Body, 871 SourceLocation WhileLoc, SourceLocation CondLParen, 872 Expr *Cond, SourceLocation CondRParen) { 873 assert(Cond && "ActOnDoStmt(): missing expression"); 874 875 ExprResult CondResult = CheckBooleanCondition(Cond, DoLoc); 876 if (CondResult.isInvalid() || CondResult.isInvalid()) 877 return StmtError(); 878 Cond = CondResult.take(); 879 880 CheckImplicitConversions(Cond, DoLoc); 881 CondResult = MaybeCreateExprWithCleanups(Cond); 882 if (CondResult.isInvalid()) 883 return StmtError(); 884 Cond = CondResult.take(); 885 886 DiagnoseUnusedExprResult(Body); 887 888 return Owned(new (Context) DoStmt(Body, Cond, DoLoc, WhileLoc, CondRParen)); 889} 890 891StmtResult 892Sema::ActOnForStmt(SourceLocation ForLoc, SourceLocation LParenLoc, 893 Stmt *First, FullExprArg second, Decl *secondVar, 894 FullExprArg third, 895 SourceLocation RParenLoc, Stmt *Body) { 896 if (!getLangOptions().CPlusPlus) { 897 if (DeclStmt *DS = dyn_cast_or_null<DeclStmt>(First)) { 898 // C99 6.8.5p3: The declaration part of a 'for' statement shall only 899 // declare identifiers for objects having storage class 'auto' or 900 // 'register'. 901 for (DeclStmt::decl_iterator DI=DS->decl_begin(), DE=DS->decl_end(); 902 DI!=DE; ++DI) { 903 VarDecl *VD = dyn_cast<VarDecl>(*DI); 904 if (VD && VD->isLocalVarDecl() && !VD->hasLocalStorage()) 905 VD = 0; 906 if (VD == 0) 907 Diag((*DI)->getLocation(), diag::err_non_variable_decl_in_for); 908 // FIXME: mark decl erroneous! 909 } 910 } 911 } 912 913 ExprResult SecondResult(second.release()); 914 VarDecl *ConditionVar = 0; 915 if (secondVar) { 916 ConditionVar = cast<VarDecl>(secondVar); 917 SecondResult = CheckConditionVariable(ConditionVar, ForLoc, true); 918 if (SecondResult.isInvalid()) 919 return StmtError(); 920 } 921 922 Expr *Third = third.release().takeAs<Expr>(); 923 924 DiagnoseUnusedExprResult(First); 925 DiagnoseUnusedExprResult(Third); 926 DiagnoseUnusedExprResult(Body); 927 928 return Owned(new (Context) ForStmt(Context, First, 929 SecondResult.take(), ConditionVar, 930 Third, Body, ForLoc, LParenLoc, 931 RParenLoc)); 932} 933 934/// In an Objective C collection iteration statement: 935/// for (x in y) 936/// x can be an arbitrary l-value expression. Bind it up as a 937/// full-expression. 938StmtResult Sema::ActOnForEachLValueExpr(Expr *E) { 939 CheckImplicitConversions(E); 940 ExprResult Result = MaybeCreateExprWithCleanups(E); 941 if (Result.isInvalid()) return StmtError(); 942 return Owned(static_cast<Stmt*>(Result.get())); 943} 944 945StmtResult 946Sema::ActOnObjCForCollectionStmt(SourceLocation ForLoc, 947 SourceLocation LParenLoc, 948 Stmt *First, Expr *Second, 949 SourceLocation RParenLoc, Stmt *Body) { 950 if (First) { 951 QualType FirstType; 952 if (DeclStmt *DS = dyn_cast<DeclStmt>(First)) { 953 if (!DS->isSingleDecl()) 954 return StmtError(Diag((*DS->decl_begin())->getLocation(), 955 diag::err_toomany_element_decls)); 956 957 Decl *D = DS->getSingleDecl(); 958 FirstType = cast<ValueDecl>(D)->getType(); 959 // C99 6.8.5p3: The declaration part of a 'for' statement shall only 960 // declare identifiers for objects having storage class 'auto' or 961 // 'register'. 962 VarDecl *VD = cast<VarDecl>(D); 963 if (VD->isLocalVarDecl() && !VD->hasLocalStorage()) 964 return StmtError(Diag(VD->getLocation(), 965 diag::err_non_variable_decl_in_for)); 966 } else { 967 Expr *FirstE = cast<Expr>(First); 968 if (!FirstE->isTypeDependent() && !FirstE->isLValue()) 969 return StmtError(Diag(First->getLocStart(), 970 diag::err_selector_element_not_lvalue) 971 << First->getSourceRange()); 972 973 FirstType = static_cast<Expr*>(First)->getType(); 974 } 975 if (!FirstType->isDependentType() && 976 !FirstType->isObjCObjectPointerType() && 977 !FirstType->isBlockPointerType()) 978 Diag(ForLoc, diag::err_selector_element_type) 979 << FirstType << First->getSourceRange(); 980 } 981 if (Second && !Second->isTypeDependent()) { 982 ExprResult Result = DefaultFunctionArrayLvalueConversion(Second); 983 if (Result.isInvalid()) 984 return StmtError(); 985 Second = Result.take(); 986 QualType SecondType = Second->getType(); 987 if (!SecondType->isObjCObjectPointerType()) 988 Diag(ForLoc, diag::err_collection_expr_type) 989 << SecondType << Second->getSourceRange(); 990 else if (const ObjCObjectPointerType *OPT = 991 SecondType->getAsObjCInterfacePointerType()) { 992 llvm::SmallVector<IdentifierInfo *, 4> KeyIdents; 993 IdentifierInfo* selIdent = 994 &Context.Idents.get("countByEnumeratingWithState"); 995 KeyIdents.push_back(selIdent); 996 selIdent = &Context.Idents.get("objects"); 997 KeyIdents.push_back(selIdent); 998 selIdent = &Context.Idents.get("count"); 999 KeyIdents.push_back(selIdent); 1000 Selector CSelector = Context.Selectors.getSelector(3, &KeyIdents[0]); 1001 if (ObjCInterfaceDecl *IDecl = OPT->getInterfaceDecl()) { 1002 if (!IDecl->isForwardDecl() && 1003 !IDecl->lookupInstanceMethod(CSelector) && 1004 !LookupMethodInQualifiedType(CSelector, OPT, true)) { 1005 // Must further look into private implementation methods. 1006 if (!LookupPrivateInstanceMethod(CSelector, IDecl)) 1007 Diag(ForLoc, diag::warn_collection_expr_type) 1008 << SecondType << CSelector << Second->getSourceRange(); 1009 } 1010 } 1011 } 1012 } 1013 return Owned(new (Context) ObjCForCollectionStmt(First, Second, Body, 1014 ForLoc, RParenLoc)); 1015} 1016 1017namespace { 1018 1019enum BeginEndFunction { 1020 BEF_begin, 1021 BEF_end 1022}; 1023 1024/// Build a variable declaration for a for-range statement. 1025static VarDecl *BuildForRangeVarDecl(Sema &SemaRef, SourceLocation Loc, 1026 QualType Type, const char *Name) { 1027 DeclContext *DC = SemaRef.CurContext; 1028 IdentifierInfo *II = &SemaRef.PP.getIdentifierTable().get(Name); 1029 TypeSourceInfo *TInfo = SemaRef.Context.getTrivialTypeSourceInfo(Type, Loc); 1030 VarDecl *Decl = VarDecl::Create(SemaRef.Context, DC, Loc, Loc, II, Type, 1031 TInfo, SC_Auto, SC_None); 1032 return Decl; 1033} 1034 1035/// Finish building a variable declaration for a for-range statement. 1036/// \return true if an error occurs. 1037static bool FinishForRangeVarDecl(Sema &SemaRef, VarDecl *Decl, Expr *Init, 1038 SourceLocation Loc, int diag) { 1039 // Deduce the type for the iterator variable now rather than leaving it to 1040 // AddInitializerToDecl, so we can produce a more suitable diagnostic. 1041 TypeSourceInfo *InitTSI = 0; 1042 if (Init->getType()->isVoidType() || 1043 !SemaRef.DeduceAutoType(Decl->getTypeSourceInfo(), Init, InitTSI)) 1044 SemaRef.Diag(Loc, diag) << Init->getType(); 1045 if (!InitTSI) { 1046 Decl->setInvalidDecl(); 1047 return true; 1048 } 1049 Decl->setTypeSourceInfo(InitTSI); 1050 Decl->setType(InitTSI->getType()); 1051 1052 SemaRef.AddInitializerToDecl(Decl, Init, /*DirectInit=*/false, 1053 /*TypeMayContainAuto=*/false); 1054 SemaRef.FinalizeDeclaration(Decl); 1055 return false; 1056} 1057 1058/// Produce a note indicating which begin/end function was implicitly called 1059/// by a C++0x for-range statement. This is often not obvious from the code, 1060/// nor from the diagnostics produced when analysing the implicit expressions 1061/// required in a for-range statement. 1062void NoteForRangeBeginEndFunction(Sema &SemaRef, Expr *E, 1063 BeginEndFunction BEF) { 1064 CallExpr *CE = dyn_cast<CallExpr>(E); 1065 if (!CE) 1066 return; 1067 FunctionDecl *D = dyn_cast<FunctionDecl>(CE->getCalleeDecl()); 1068 if (!D) 1069 return; 1070 SourceLocation Loc = D->getLocation(); 1071 1072 std::string Description; 1073 bool IsTemplate = false; 1074 if (FunctionTemplateDecl *FunTmpl = D->getPrimaryTemplate()) { 1075 Description = SemaRef.getTemplateArgumentBindingsText( 1076 FunTmpl->getTemplateParameters(), *D->getTemplateSpecializationArgs()); 1077 IsTemplate = true; 1078 } 1079 1080 SemaRef.Diag(Loc, diag::note_for_range_begin_end) 1081 << BEF << IsTemplate << Description << E->getType(); 1082} 1083 1084/// Build a call to 'begin' or 'end' for a C++0x for-range statement. If the 1085/// given LookupResult is non-empty, it is assumed to describe a member which 1086/// will be invoked. Otherwise, the function will be found via argument 1087/// dependent lookup. 1088static ExprResult BuildForRangeBeginEndCall(Sema &SemaRef, Scope *S, 1089 SourceLocation Loc, 1090 VarDecl *Decl, 1091 BeginEndFunction BEF, 1092 const DeclarationNameInfo &NameInfo, 1093 LookupResult &MemberLookup, 1094 Expr *Range) { 1095 ExprResult CallExpr; 1096 if (!MemberLookup.empty()) { 1097 ExprResult MemberRef = 1098 SemaRef.BuildMemberReferenceExpr(Range, Range->getType(), Loc, 1099 /*IsPtr=*/false, CXXScopeSpec(), 1100 /*Qualifier=*/0, MemberLookup, 1101 /*TemplateArgs=*/0); 1102 if (MemberRef.isInvalid()) 1103 return ExprError(); 1104 CallExpr = SemaRef.ActOnCallExpr(S, MemberRef.get(), Loc, MultiExprArg(), 1105 Loc, 0); 1106 if (CallExpr.isInvalid()) 1107 return ExprError(); 1108 } else { 1109 UnresolvedSet<0> FoundNames; 1110 // C++0x [stmt.ranged]p1: For the purposes of this name lookup, namespace 1111 // std is an associated namespace. 1112 UnresolvedLookupExpr *Fn = 1113 UnresolvedLookupExpr::Create(SemaRef.Context, /*NamingClass=*/0, 1114 NestedNameSpecifierLoc(), NameInfo, 1115 /*NeedsADL=*/true, /*Overloaded=*/false, 1116 FoundNames.begin(), FoundNames.end(), 1117 /*LookInStdNamespace=*/true); 1118 CallExpr = SemaRef.BuildOverloadedCallExpr(S, Fn, Fn, Loc, &Range, 1, Loc, 1119 0); 1120 if (CallExpr.isInvalid()) { 1121 SemaRef.Diag(Range->getLocStart(), diag::note_for_range_type) 1122 << Range->getType(); 1123 return ExprError(); 1124 } 1125 } 1126 if (FinishForRangeVarDecl(SemaRef, Decl, CallExpr.get(), Loc, 1127 diag::err_for_range_iter_deduction_failure)) { 1128 NoteForRangeBeginEndFunction(SemaRef, CallExpr.get(), BEF); 1129 return ExprError(); 1130 } 1131 return CallExpr; 1132} 1133 1134} 1135 1136/// ActOnCXXForRangeStmt - Check and build a C++0x for-range statement. 1137/// 1138/// C++0x [stmt.ranged]: 1139/// A range-based for statement is equivalent to 1140/// 1141/// { 1142/// auto && __range = range-init; 1143/// for ( auto __begin = begin-expr, 1144/// __end = end-expr; 1145/// __begin != __end; 1146/// ++__begin ) { 1147/// for-range-declaration = *__begin; 1148/// statement 1149/// } 1150/// } 1151/// 1152/// The body of the loop is not available yet, since it cannot be analysed until 1153/// we have determined the type of the for-range-declaration. 1154StmtResult 1155Sema::ActOnCXXForRangeStmt(SourceLocation ForLoc, SourceLocation LParenLoc, 1156 Stmt *First, SourceLocation ColonLoc, Expr *Range, 1157 SourceLocation RParenLoc) { 1158 if (!First || !Range) 1159 return StmtError(); 1160 1161 DeclStmt *DS = dyn_cast<DeclStmt>(First); 1162 assert(DS && "first part of for range not a decl stmt"); 1163 1164 if (!DS->isSingleDecl()) { 1165 Diag(DS->getStartLoc(), diag::err_type_defined_in_for_range); 1166 return StmtError(); 1167 } 1168 if (DS->getSingleDecl()->isInvalidDecl()) 1169 return StmtError(); 1170 1171 if (DiagnoseUnexpandedParameterPack(Range, UPPC_Expression)) 1172 return StmtError(); 1173 1174 // Build auto && __range = range-init 1175 SourceLocation RangeLoc = Range->getLocStart(); 1176 VarDecl *RangeVar = BuildForRangeVarDecl(*this, RangeLoc, 1177 Context.getAutoRRefDeductType(), 1178 "__range"); 1179 if (FinishForRangeVarDecl(*this, RangeVar, Range, RangeLoc, 1180 diag::err_for_range_deduction_failure)) 1181 return StmtError(); 1182 1183 // Claim the type doesn't contain auto: we've already done the checking. 1184 DeclGroupPtrTy RangeGroup = 1185 BuildDeclaratorGroup((Decl**)&RangeVar, 1, /*TypeMayContainAuto=*/false); 1186 StmtResult RangeDecl = ActOnDeclStmt(RangeGroup, RangeLoc, RangeLoc); 1187 if (RangeDecl.isInvalid()) 1188 return StmtError(); 1189 1190 return BuildCXXForRangeStmt(ForLoc, ColonLoc, RangeDecl.get(), 1191 /*BeginEndDecl=*/0, /*Cond=*/0, /*Inc=*/0, DS, 1192 RParenLoc); 1193} 1194 1195/// BuildCXXForRangeStmt - Build or instantiate a C++0x for-range statement. 1196StmtResult 1197Sema::BuildCXXForRangeStmt(SourceLocation ForLoc, SourceLocation ColonLoc, 1198 Stmt *RangeDecl, Stmt *BeginEnd, Expr *Cond, 1199 Expr *Inc, Stmt *LoopVarDecl, 1200 SourceLocation RParenLoc) { 1201 Scope *S = getCurScope(); 1202 1203 DeclStmt *RangeDS = cast<DeclStmt>(RangeDecl); 1204 VarDecl *RangeVar = cast<VarDecl>(RangeDS->getSingleDecl()); 1205 QualType RangeVarType = RangeVar->getType(); 1206 1207 DeclStmt *LoopVarDS = cast<DeclStmt>(LoopVarDecl); 1208 VarDecl *LoopVar = cast<VarDecl>(LoopVarDS->getSingleDecl()); 1209 1210 StmtResult BeginEndDecl = BeginEnd; 1211 ExprResult NotEqExpr = Cond, IncrExpr = Inc; 1212 1213 if (!BeginEndDecl.get() && !RangeVarType->isDependentType()) { 1214 SourceLocation RangeLoc = RangeVar->getLocation(); 1215 1216 ExprResult RangeRef = BuildDeclRefExpr(RangeVar, 1217 RangeVarType.getNonReferenceType(), 1218 VK_LValue, ColonLoc); 1219 if (RangeRef.isInvalid()) 1220 return StmtError(); 1221 1222 QualType AutoType = Context.getAutoDeductType(); 1223 Expr *Range = RangeVar->getInit(); 1224 if (!Range) 1225 return StmtError(); 1226 QualType RangeType = Range->getType(); 1227 1228 if (RequireCompleteType(RangeLoc, RangeType, 1229 PDiag(diag::err_for_range_incomplete_type))) 1230 return StmtError(); 1231 1232 // Build auto __begin = begin-expr, __end = end-expr. 1233 VarDecl *BeginVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType, 1234 "__begin"); 1235 VarDecl *EndVar = BuildForRangeVarDecl(*this, ColonLoc, AutoType, 1236 "__end"); 1237 1238 // Build begin-expr and end-expr and attach to __begin and __end variables. 1239 ExprResult BeginExpr, EndExpr; 1240 if (const ArrayType *UnqAT = RangeType->getAsArrayTypeUnsafe()) { 1241 // - if _RangeT is an array type, begin-expr and end-expr are __range and 1242 // __range + __bound, respectively, where __bound is the array bound. If 1243 // _RangeT is an array of unknown size or an array of incomplete type, 1244 // the program is ill-formed; 1245 1246 // begin-expr is __range. 1247 BeginExpr = RangeRef; 1248 if (FinishForRangeVarDecl(*this, BeginVar, RangeRef.get(), ColonLoc, 1249 diag::err_for_range_iter_deduction_failure)) { 1250 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1251 return StmtError(); 1252 } 1253 1254 // Find the array bound. 1255 ExprResult BoundExpr; 1256 if (const ConstantArrayType *CAT = dyn_cast<ConstantArrayType>(UnqAT)) 1257 BoundExpr = Owned(IntegerLiteral::Create(Context, CAT->getSize(), 1258 Context.IntTy, RangeLoc)); 1259 else if (const VariableArrayType *VAT = 1260 dyn_cast<VariableArrayType>(UnqAT)) 1261 BoundExpr = VAT->getSizeExpr(); 1262 else { 1263 // Can't be a DependentSizedArrayType or an IncompleteArrayType since 1264 // UnqAT is not incomplete and Range is not type-dependent. 1265 assert(0 && "Unexpected array type in for-range"); 1266 return StmtError(); 1267 } 1268 1269 // end-expr is __range + __bound. 1270 EndExpr = ActOnBinOp(S, ColonLoc, tok::plus, RangeRef.get(), 1271 BoundExpr.get()); 1272 if (EndExpr.isInvalid()) 1273 return StmtError(); 1274 if (FinishForRangeVarDecl(*this, EndVar, EndExpr.get(), ColonLoc, 1275 diag::err_for_range_iter_deduction_failure)) { 1276 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1277 return StmtError(); 1278 } 1279 } else { 1280 DeclarationNameInfo BeginNameInfo(&PP.getIdentifierTable().get("begin"), 1281 ColonLoc); 1282 DeclarationNameInfo EndNameInfo(&PP.getIdentifierTable().get("end"), 1283 ColonLoc); 1284 1285 LookupResult BeginMemberLookup(*this, BeginNameInfo, LookupMemberName); 1286 LookupResult EndMemberLookup(*this, EndNameInfo, LookupMemberName); 1287 1288 if (CXXRecordDecl *D = RangeType->getAsCXXRecordDecl()) { 1289 // - if _RangeT is a class type, the unqualified-ids begin and end are 1290 // looked up in the scope of class _RangeT as if by class member access 1291 // lookup (3.4.5), and if either (or both) finds at least one 1292 // declaration, begin-expr and end-expr are __range.begin() and 1293 // __range.end(), respectively; 1294 LookupQualifiedName(BeginMemberLookup, D); 1295 LookupQualifiedName(EndMemberLookup, D); 1296 1297 if (BeginMemberLookup.empty() != EndMemberLookup.empty()) { 1298 Diag(ColonLoc, diag::err_for_range_member_begin_end_mismatch) 1299 << RangeType << BeginMemberLookup.empty(); 1300 return StmtError(); 1301 } 1302 } else { 1303 // - otherwise, begin-expr and end-expr are begin(__range) and 1304 // end(__range), respectively, where begin and end are looked up with 1305 // argument-dependent lookup (3.4.2). For the purposes of this name 1306 // lookup, namespace std is an associated namespace. 1307 } 1308 1309 BeginExpr = BuildForRangeBeginEndCall(*this, S, ColonLoc, BeginVar, 1310 BEF_begin, BeginNameInfo, 1311 BeginMemberLookup, RangeRef.get()); 1312 if (BeginExpr.isInvalid()) 1313 return StmtError(); 1314 1315 EndExpr = BuildForRangeBeginEndCall(*this, S, ColonLoc, EndVar, 1316 BEF_end, EndNameInfo, 1317 EndMemberLookup, RangeRef.get()); 1318 if (EndExpr.isInvalid()) 1319 return StmtError(); 1320 } 1321 1322 // C++0x [decl.spec.auto]p6: BeginType and EndType must be the same. 1323 QualType BeginType = BeginVar->getType(), EndType = EndVar->getType(); 1324 if (!Context.hasSameType(BeginType, EndType)) { 1325 Diag(RangeLoc, diag::err_for_range_begin_end_types_differ) 1326 << BeginType << EndType; 1327 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1328 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1329 } 1330 1331 Decl *BeginEndDecls[] = { BeginVar, EndVar }; 1332 // Claim the type doesn't contain auto: we've already done the checking. 1333 DeclGroupPtrTy BeginEndGroup = 1334 BuildDeclaratorGroup(BeginEndDecls, 2, /*TypeMayContainAuto=*/false); 1335 BeginEndDecl = ActOnDeclStmt(BeginEndGroup, ColonLoc, ColonLoc); 1336 1337 ExprResult BeginRef = BuildDeclRefExpr(BeginVar, 1338 BeginType.getNonReferenceType(), 1339 VK_LValue, ColonLoc); 1340 ExprResult EndRef = BuildDeclRefExpr(EndVar, EndType.getNonReferenceType(), 1341 VK_LValue, ColonLoc); 1342 1343 // Build and check __begin != __end expression. 1344 NotEqExpr = ActOnBinOp(S, ColonLoc, tok::exclaimequal, 1345 BeginRef.get(), EndRef.get()); 1346 NotEqExpr = ActOnBooleanCondition(S, ColonLoc, NotEqExpr.get()); 1347 NotEqExpr = ActOnFinishFullExpr(NotEqExpr.get()); 1348 if (NotEqExpr.isInvalid()) { 1349 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1350 if (!Context.hasSameType(BeginType, EndType)) 1351 NoteForRangeBeginEndFunction(*this, EndExpr.get(), BEF_end); 1352 return StmtError(); 1353 } 1354 1355 // Build and check ++__begin expression. 1356 IncrExpr = ActOnUnaryOp(S, ColonLoc, tok::plusplus, BeginRef.get()); 1357 IncrExpr = ActOnFinishFullExpr(IncrExpr.get()); 1358 if (IncrExpr.isInvalid()) { 1359 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1360 return StmtError(); 1361 } 1362 1363 // Build and check *__begin expression. 1364 ExprResult DerefExpr = ActOnUnaryOp(S, ColonLoc, tok::star, BeginRef.get()); 1365 if (DerefExpr.isInvalid()) { 1366 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1367 return StmtError(); 1368 } 1369 1370 // Attach *__begin as initializer for VD. 1371 if (!LoopVar->isInvalidDecl()) { 1372 AddInitializerToDecl(LoopVar, DerefExpr.get(), /*DirectInit=*/false, 1373 /*TypeMayContainAuto=*/true); 1374 if (LoopVar->isInvalidDecl()) 1375 NoteForRangeBeginEndFunction(*this, BeginExpr.get(), BEF_begin); 1376 } 1377 } 1378 1379 return Owned(new (Context) CXXForRangeStmt(RangeDS, 1380 cast_or_null<DeclStmt>(BeginEndDecl.get()), 1381 NotEqExpr.take(), IncrExpr.take(), 1382 LoopVarDS, /*Body=*/0, ForLoc, 1383 ColonLoc, RParenLoc)); 1384} 1385 1386/// FinishCXXForRangeStmt - Attach the body to a C++0x for-range statement. 1387/// This is a separate step from ActOnCXXForRangeStmt because analysis of the 1388/// body cannot be performed until after the type of the range variable is 1389/// determined. 1390StmtResult Sema::FinishCXXForRangeStmt(Stmt *S, Stmt *B) { 1391 if (!S || !B) 1392 return StmtError(); 1393 1394 cast<CXXForRangeStmt>(S)->setBody(B); 1395 return S; 1396} 1397 1398StmtResult Sema::ActOnGotoStmt(SourceLocation GotoLoc, 1399 SourceLocation LabelLoc, 1400 LabelDecl *TheDecl) { 1401 getCurFunction()->setHasBranchIntoScope(); 1402 TheDecl->setUsed(); 1403 return Owned(new (Context) GotoStmt(TheDecl, GotoLoc, LabelLoc)); 1404} 1405 1406StmtResult 1407Sema::ActOnIndirectGotoStmt(SourceLocation GotoLoc, SourceLocation StarLoc, 1408 Expr *E) { 1409 // Convert operand to void* 1410 if (!E->isTypeDependent()) { 1411 QualType ETy = E->getType(); 1412 QualType DestTy = Context.getPointerType(Context.VoidTy.withConst()); 1413 ExprResult ExprRes = Owned(E); 1414 AssignConvertType ConvTy = 1415 CheckSingleAssignmentConstraints(DestTy, ExprRes); 1416 if (ExprRes.isInvalid()) 1417 return StmtError(); 1418 E = ExprRes.take(); 1419 if (DiagnoseAssignmentResult(ConvTy, StarLoc, DestTy, ETy, E, AA_Passing)) 1420 return StmtError(); 1421 } 1422 1423 getCurFunction()->setHasIndirectGoto(); 1424 1425 return Owned(new (Context) IndirectGotoStmt(GotoLoc, StarLoc, E)); 1426} 1427 1428StmtResult 1429Sema::ActOnContinueStmt(SourceLocation ContinueLoc, Scope *CurScope) { 1430 Scope *S = CurScope->getContinueParent(); 1431 if (!S) { 1432 // C99 6.8.6.2p1: A break shall appear only in or as a loop body. 1433 return StmtError(Diag(ContinueLoc, diag::err_continue_not_in_loop)); 1434 } 1435 1436 return Owned(new (Context) ContinueStmt(ContinueLoc)); 1437} 1438 1439StmtResult 1440Sema::ActOnBreakStmt(SourceLocation BreakLoc, Scope *CurScope) { 1441 Scope *S = CurScope->getBreakParent(); 1442 if (!S) { 1443 // C99 6.8.6.3p1: A break shall appear only in or as a switch/loop body. 1444 return StmtError(Diag(BreakLoc, diag::err_break_not_in_loop_or_switch)); 1445 } 1446 1447 return Owned(new (Context) BreakStmt(BreakLoc)); 1448} 1449 1450/// \brief Determine whether the given expression is a candidate for 1451/// copy elision in either a return statement or a throw expression. 1452/// 1453/// \param ReturnType If we're determining the copy elision candidate for 1454/// a return statement, this is the return type of the function. If we're 1455/// determining the copy elision candidate for a throw expression, this will 1456/// be a NULL type. 1457/// 1458/// \param E The expression being returned from the function or block, or 1459/// being thrown. 1460/// 1461/// \param AllowFunctionParameter 1462/// 1463/// \returns The NRVO candidate variable, if the return statement may use the 1464/// NRVO, or NULL if there is no such candidate. 1465const VarDecl *Sema::getCopyElisionCandidate(QualType ReturnType, 1466 Expr *E, 1467 bool AllowFunctionParameter) { 1468 QualType ExprType = E->getType(); 1469 // - in a return statement in a function with ... 1470 // ... a class return type ... 1471 if (!ReturnType.isNull()) { 1472 if (!ReturnType->isRecordType()) 1473 return 0; 1474 // ... the same cv-unqualified type as the function return type ... 1475 if (!Context.hasSameUnqualifiedType(ReturnType, ExprType)) 1476 return 0; 1477 } 1478 1479 // ... the expression is the name of a non-volatile automatic object 1480 // (other than a function or catch-clause parameter)) ... 1481 const DeclRefExpr *DR = dyn_cast<DeclRefExpr>(E->IgnoreParens()); 1482 if (!DR) 1483 return 0; 1484 const VarDecl *VD = dyn_cast<VarDecl>(DR->getDecl()); 1485 if (!VD) 1486 return 0; 1487 1488 if (VD->hasLocalStorage() && !VD->isExceptionVariable() && 1489 !VD->getType()->isReferenceType() && !VD->hasAttr<BlocksAttr>() && 1490 !VD->getType().isVolatileQualified() && 1491 ((VD->getKind() == Decl::Var) || 1492 (AllowFunctionParameter && VD->getKind() == Decl::ParmVar))) 1493 return VD; 1494 1495 return 0; 1496} 1497 1498/// \brief Perform the initialization of a potentially-movable value, which 1499/// is the result of return value. 1500/// 1501/// This routine implements C++0x [class.copy]p33, which attempts to treat 1502/// returned lvalues as rvalues in certain cases (to prefer move construction), 1503/// then falls back to treating them as lvalues if that failed. 1504ExprResult 1505Sema::PerformMoveOrCopyInitialization(const InitializedEntity &Entity, 1506 const VarDecl *NRVOCandidate, 1507 QualType ResultType, 1508 Expr *Value) { 1509 // C++0x [class.copy]p33: 1510 // When the criteria for elision of a copy operation are met or would 1511 // be met save for the fact that the source object is a function 1512 // parameter, and the object to be copied is designated by an lvalue, 1513 // overload resolution to select the constructor for the copy is first 1514 // performed as if the object were designated by an rvalue. 1515 ExprResult Res = ExprError(); 1516 if (NRVOCandidate || getCopyElisionCandidate(ResultType, Value, true)) { 1517 ImplicitCastExpr AsRvalue(ImplicitCastExpr::OnStack, 1518 Value->getType(), CK_LValueToRValue, 1519 Value, VK_XValue); 1520 1521 Expr *InitExpr = &AsRvalue; 1522 InitializationKind Kind 1523 = InitializationKind::CreateCopy(Value->getLocStart(), 1524 Value->getLocStart()); 1525 InitializationSequence Seq(*this, Entity, Kind, &InitExpr, 1); 1526 1527 // [...] If overload resolution fails, or if the type of the first 1528 // parameter of the selected constructor is not an rvalue reference 1529 // to the object's type (possibly cv-qualified), overload resolution 1530 // is performed again, considering the object as an lvalue. 1531 if (Seq.getKind() != InitializationSequence::FailedSequence) { 1532 for (InitializationSequence::step_iterator Step = Seq.step_begin(), 1533 StepEnd = Seq.step_end(); 1534 Step != StepEnd; ++Step) { 1535 if (Step->Kind 1536 != InitializationSequence::SK_ConstructorInitialization) 1537 continue; 1538 1539 CXXConstructorDecl *Constructor 1540 = cast<CXXConstructorDecl>(Step->Function.Function); 1541 1542 const RValueReferenceType *RRefType 1543 = Constructor->getParamDecl(0)->getType() 1544 ->getAs<RValueReferenceType>(); 1545 1546 // If we don't meet the criteria, break out now. 1547 if (!RRefType || 1548 !Context.hasSameUnqualifiedType(RRefType->getPointeeType(), 1549 Context.getTypeDeclType(Constructor->getParent()))) 1550 break; 1551 1552 // Promote "AsRvalue" to the heap, since we now need this 1553 // expression node to persist. 1554 Value = ImplicitCastExpr::Create(Context, Value->getType(), 1555 CK_LValueToRValue, Value, 0, 1556 VK_XValue); 1557 1558 // Complete type-checking the initialization of the return type 1559 // using the constructor we found. 1560 Res = Seq.Perform(*this, Entity, Kind, MultiExprArg(&Value, 1)); 1561 } 1562 } 1563 } 1564 1565 // Either we didn't meet the criteria for treating an lvalue as an rvalue, 1566 // above, or overload resolution failed. Either way, we need to try 1567 // (again) now with the return value expression as written. 1568 if (Res.isInvalid()) 1569 Res = PerformCopyInitialization(Entity, SourceLocation(), Value); 1570 1571 return Res; 1572} 1573 1574/// ActOnBlockReturnStmt - Utility routine to figure out block's return type. 1575/// 1576StmtResult 1577Sema::ActOnBlockReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) { 1578 // If this is the first return we've seen in the block, infer the type of 1579 // the block from it. 1580 BlockScopeInfo *CurBlock = getCurBlock(); 1581 if (CurBlock->ReturnType.isNull()) { 1582 if (RetValExp) { 1583 // Don't call UsualUnaryConversions(), since we don't want to do 1584 // integer promotions here. 1585 ExprResult Result = DefaultFunctionArrayLvalueConversion(RetValExp); 1586 if (Result.isInvalid()) 1587 return StmtError(); 1588 RetValExp = Result.take(); 1589 CurBlock->ReturnType = RetValExp->getType(); 1590 if (BlockDeclRefExpr *CDRE = dyn_cast<BlockDeclRefExpr>(RetValExp)) { 1591 // We have to remove a 'const' added to copied-in variable which was 1592 // part of the implementation spec. and not the actual qualifier for 1593 // the variable. 1594 if (CDRE->isConstQualAdded()) 1595 CurBlock->ReturnType.removeLocalConst(); // FIXME: local??? 1596 } 1597 } else 1598 CurBlock->ReturnType = Context.VoidTy; 1599 } 1600 QualType FnRetType = CurBlock->ReturnType; 1601 1602 if (CurBlock->FunctionType->getAs<FunctionType>()->getNoReturnAttr()) { 1603 Diag(ReturnLoc, diag::err_noreturn_block_has_return_expr) 1604 << getCurFunctionOrMethodDecl()->getDeclName(); 1605 return StmtError(); 1606 } 1607 1608 // Otherwise, verify that this result type matches the previous one. We are 1609 // pickier with blocks than for normal functions because we don't have GCC 1610 // compatibility to worry about here. 1611 ReturnStmt *Result = 0; 1612 if (CurBlock->ReturnType->isVoidType()) { 1613 if (RetValExp) { 1614 Diag(ReturnLoc, diag::err_return_block_has_expr); 1615 RetValExp = 0; 1616 } 1617 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, 0); 1618 } else if (!RetValExp) { 1619 return StmtError(Diag(ReturnLoc, diag::err_block_return_missing_expr)); 1620 } else { 1621 const VarDecl *NRVOCandidate = 0; 1622 1623 if (!FnRetType->isDependentType() && !RetValExp->isTypeDependent()) { 1624 // we have a non-void block with an expression, continue checking 1625 1626 // C99 6.8.6.4p3(136): The return statement is not an assignment. The 1627 // overlap restriction of subclause 6.5.16.1 does not apply to the case of 1628 // function return. 1629 1630 // In C++ the return statement is handled via a copy initialization. 1631 // the C version of which boils down to CheckSingleAssignmentConstraints. 1632 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false); 1633 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc, 1634 FnRetType, 1635 NRVOCandidate != 0); 1636 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate, 1637 FnRetType, RetValExp); 1638 if (Res.isInvalid()) { 1639 // FIXME: Cleanup temporaries here, anyway? 1640 return StmtError(); 1641 } 1642 1643 if (RetValExp) { 1644 CheckImplicitConversions(RetValExp, ReturnLoc); 1645 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 1646 } 1647 1648 RetValExp = Res.takeAs<Expr>(); 1649 if (RetValExp) 1650 CheckReturnStackAddr(RetValExp, FnRetType, ReturnLoc); 1651 } 1652 1653 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, NRVOCandidate); 1654 } 1655 1656 // If we need to check for the named return value optimization, save the 1657 // return statement in our scope for later processing. 1658 if (getLangOptions().CPlusPlus && FnRetType->isRecordType() && 1659 !CurContext->isDependentContext()) 1660 FunctionScopes.back()->Returns.push_back(Result); 1661 1662 return Owned(Result); 1663} 1664 1665StmtResult 1666Sema::ActOnReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp) { 1667 if (getCurBlock()) 1668 return ActOnBlockReturnStmt(ReturnLoc, RetValExp); 1669 1670 QualType FnRetType; 1671 if (const FunctionDecl *FD = getCurFunctionDecl()) { 1672 FnRetType = FD->getResultType(); 1673 if (FD->hasAttr<NoReturnAttr>() || 1674 FD->getType()->getAs<FunctionType>()->getNoReturnAttr()) 1675 Diag(ReturnLoc, diag::warn_noreturn_function_has_return_expr) 1676 << getCurFunctionOrMethodDecl()->getDeclName(); 1677 } else if (ObjCMethodDecl *MD = getCurMethodDecl()) 1678 FnRetType = MD->getResultType(); 1679 else // If we don't have a function/method context, bail. 1680 return StmtError(); 1681 1682 ReturnStmt *Result = 0; 1683 if (FnRetType->isVoidType()) { 1684 if (RetValExp && !RetValExp->isTypeDependent()) { 1685 // C99 6.8.6.4p1 (ext_ since GCC warns) 1686 unsigned D = diag::ext_return_has_expr; 1687 if (RetValExp->getType()->isVoidType()) 1688 D = diag::ext_return_has_void_expr; 1689 else { 1690 ExprResult Result = Owned(RetValExp); 1691 Result = IgnoredValueConversions(Result.take()); 1692 if (Result.isInvalid()) 1693 return StmtError(); 1694 RetValExp = Result.take(); 1695 RetValExp = ImpCastExprToType(RetValExp, Context.VoidTy, CK_ToVoid).take(); 1696 } 1697 1698 // return (some void expression); is legal in C++. 1699 if (D != diag::ext_return_has_void_expr || 1700 !getLangOptions().CPlusPlus) { 1701 NamedDecl *CurDecl = getCurFunctionOrMethodDecl(); 1702 Diag(ReturnLoc, D) 1703 << CurDecl->getDeclName() << isa<ObjCMethodDecl>(CurDecl) 1704 << RetValExp->getSourceRange(); 1705 } 1706 1707 CheckImplicitConversions(RetValExp, ReturnLoc); 1708 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 1709 } 1710 1711 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, 0); 1712 } else if (!RetValExp && !FnRetType->isDependentType()) { 1713 unsigned DiagID = diag::warn_return_missing_expr; // C90 6.6.6.4p4 1714 // C99 6.8.6.4p1 (ext_ since GCC warns) 1715 if (getLangOptions().C99) DiagID = diag::ext_return_missing_expr; 1716 1717 if (FunctionDecl *FD = getCurFunctionDecl()) 1718 Diag(ReturnLoc, DiagID) << FD->getIdentifier() << 0/*fn*/; 1719 else 1720 Diag(ReturnLoc, DiagID) << getCurMethodDecl()->getDeclName() << 1/*meth*/; 1721 Result = new (Context) ReturnStmt(ReturnLoc); 1722 } else { 1723 const VarDecl *NRVOCandidate = 0; 1724 if (!FnRetType->isDependentType() && !RetValExp->isTypeDependent()) { 1725 // we have a non-void function with an expression, continue checking 1726 1727 // C99 6.8.6.4p3(136): The return statement is not an assignment. The 1728 // overlap restriction of subclause 6.5.16.1 does not apply to the case of 1729 // function return. 1730 1731 // In C++ the return statement is handled via a copy initialization. 1732 // the C version of which boils down to CheckSingleAssignmentConstraints. 1733 NRVOCandidate = getCopyElisionCandidate(FnRetType, RetValExp, false); 1734 InitializedEntity Entity = InitializedEntity::InitializeResult(ReturnLoc, 1735 FnRetType, 1736 NRVOCandidate != 0); 1737 ExprResult Res = PerformMoveOrCopyInitialization(Entity, NRVOCandidate, 1738 FnRetType, RetValExp); 1739 if (Res.isInvalid()) { 1740 // FIXME: Cleanup temporaries here, anyway? 1741 return StmtError(); 1742 } 1743 1744 RetValExp = Res.takeAs<Expr>(); 1745 if (RetValExp) 1746 CheckReturnStackAddr(RetValExp, FnRetType, ReturnLoc); 1747 } 1748 1749 if (RetValExp) { 1750 CheckImplicitConversions(RetValExp, ReturnLoc); 1751 RetValExp = MaybeCreateExprWithCleanups(RetValExp); 1752 } 1753 Result = new (Context) ReturnStmt(ReturnLoc, RetValExp, NRVOCandidate); 1754 } 1755 1756 // If we need to check for the named return value optimization, save the 1757 // return statement in our scope for later processing. 1758 if (getLangOptions().CPlusPlus && FnRetType->isRecordType() && 1759 !CurContext->isDependentContext()) 1760 FunctionScopes.back()->Returns.push_back(Result); 1761 1762 return Owned(Result); 1763} 1764 1765/// CheckAsmLValue - GNU C has an extremely ugly extension whereby they silently 1766/// ignore "noop" casts in places where an lvalue is required by an inline asm. 1767/// We emulate this behavior when -fheinous-gnu-extensions is specified, but 1768/// provide a strong guidance to not use it. 1769/// 1770/// This method checks to see if the argument is an acceptable l-value and 1771/// returns false if it is a case we can handle. 1772static bool CheckAsmLValue(const Expr *E, Sema &S) { 1773 // Type dependent expressions will be checked during instantiation. 1774 if (E->isTypeDependent()) 1775 return false; 1776 1777 if (E->isLValue()) 1778 return false; // Cool, this is an lvalue. 1779 1780 // Okay, this is not an lvalue, but perhaps it is the result of a cast that we 1781 // are supposed to allow. 1782 const Expr *E2 = E->IgnoreParenNoopCasts(S.Context); 1783 if (E != E2 && E2->isLValue()) { 1784 if (!S.getLangOptions().HeinousExtensions) 1785 S.Diag(E2->getLocStart(), diag::err_invalid_asm_cast_lvalue) 1786 << E->getSourceRange(); 1787 else 1788 S.Diag(E2->getLocStart(), diag::warn_invalid_asm_cast_lvalue) 1789 << E->getSourceRange(); 1790 // Accept, even if we emitted an error diagnostic. 1791 return false; 1792 } 1793 1794 // None of the above, just randomly invalid non-lvalue. 1795 return true; 1796} 1797 1798/// isOperandMentioned - Return true if the specified operand # is mentioned 1799/// anywhere in the decomposed asm string. 1800static bool isOperandMentioned(unsigned OpNo, 1801 llvm::ArrayRef<AsmStmt::AsmStringPiece> AsmStrPieces) { 1802 for (unsigned p = 0, e = AsmStrPieces.size(); p != e; ++p) { 1803 const AsmStmt::AsmStringPiece &Piece = AsmStrPieces[p]; 1804 if (!Piece.isOperand()) continue; 1805 1806 // If this is a reference to the input and if the input was the smaller 1807 // one, then we have to reject this asm. 1808 if (Piece.getOperandNo() == OpNo) 1809 return true; 1810 } 1811 1812 return false; 1813} 1814 1815StmtResult Sema::ActOnAsmStmt(SourceLocation AsmLoc, bool IsSimple, 1816 bool IsVolatile, unsigned NumOutputs, 1817 unsigned NumInputs, IdentifierInfo **Names, 1818 MultiExprArg constraints, MultiExprArg exprs, 1819 Expr *asmString, MultiExprArg clobbers, 1820 SourceLocation RParenLoc, bool MSAsm) { 1821 unsigned NumClobbers = clobbers.size(); 1822 StringLiteral **Constraints = 1823 reinterpret_cast<StringLiteral**>(constraints.get()); 1824 Expr **Exprs = exprs.get(); 1825 StringLiteral *AsmString = cast<StringLiteral>(asmString); 1826 StringLiteral **Clobbers = reinterpret_cast<StringLiteral**>(clobbers.get()); 1827 1828 llvm::SmallVector<TargetInfo::ConstraintInfo, 4> OutputConstraintInfos; 1829 1830 // The parser verifies that there is a string literal here. 1831 if (AsmString->isWide()) 1832 return StmtError(Diag(AsmString->getLocStart(),diag::err_asm_wide_character) 1833 << AsmString->getSourceRange()); 1834 1835 for (unsigned i = 0; i != NumOutputs; i++) { 1836 StringLiteral *Literal = Constraints[i]; 1837 if (Literal->isWide()) 1838 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 1839 << Literal->getSourceRange()); 1840 1841 llvm::StringRef OutputName; 1842 if (Names[i]) 1843 OutputName = Names[i]->getName(); 1844 1845 TargetInfo::ConstraintInfo Info(Literal->getString(), OutputName); 1846 if (!Context.Target.validateOutputConstraint(Info)) 1847 return StmtError(Diag(Literal->getLocStart(), 1848 diag::err_asm_invalid_output_constraint) 1849 << Info.getConstraintStr()); 1850 1851 // Check that the output exprs are valid lvalues. 1852 Expr *OutputExpr = Exprs[i]; 1853 if (CheckAsmLValue(OutputExpr, *this)) { 1854 return StmtError(Diag(OutputExpr->getLocStart(), 1855 diag::err_asm_invalid_lvalue_in_output) 1856 << OutputExpr->getSourceRange()); 1857 } 1858 1859 OutputConstraintInfos.push_back(Info); 1860 } 1861 1862 llvm::SmallVector<TargetInfo::ConstraintInfo, 4> InputConstraintInfos; 1863 1864 for (unsigned i = NumOutputs, e = NumOutputs + NumInputs; i != e; i++) { 1865 StringLiteral *Literal = Constraints[i]; 1866 if (Literal->isWide()) 1867 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 1868 << Literal->getSourceRange()); 1869 1870 llvm::StringRef InputName; 1871 if (Names[i]) 1872 InputName = Names[i]->getName(); 1873 1874 TargetInfo::ConstraintInfo Info(Literal->getString(), InputName); 1875 if (!Context.Target.validateInputConstraint(OutputConstraintInfos.data(), 1876 NumOutputs, Info)) { 1877 return StmtError(Diag(Literal->getLocStart(), 1878 diag::err_asm_invalid_input_constraint) 1879 << Info.getConstraintStr()); 1880 } 1881 1882 Expr *InputExpr = Exprs[i]; 1883 1884 // Only allow void types for memory constraints. 1885 if (Info.allowsMemory() && !Info.allowsRegister()) { 1886 if (CheckAsmLValue(InputExpr, *this)) 1887 return StmtError(Diag(InputExpr->getLocStart(), 1888 diag::err_asm_invalid_lvalue_in_input) 1889 << Info.getConstraintStr() 1890 << InputExpr->getSourceRange()); 1891 } 1892 1893 if (Info.allowsRegister()) { 1894 if (InputExpr->getType()->isVoidType()) { 1895 return StmtError(Diag(InputExpr->getLocStart(), 1896 diag::err_asm_invalid_type_in_input) 1897 << InputExpr->getType() << Info.getConstraintStr() 1898 << InputExpr->getSourceRange()); 1899 } 1900 } 1901 1902 ExprResult Result = DefaultFunctionArrayLvalueConversion(Exprs[i]); 1903 if (Result.isInvalid()) 1904 return StmtError(); 1905 1906 Exprs[i] = Result.take(); 1907 InputConstraintInfos.push_back(Info); 1908 } 1909 1910 // Check that the clobbers are valid. 1911 for (unsigned i = 0; i != NumClobbers; i++) { 1912 StringLiteral *Literal = Clobbers[i]; 1913 if (Literal->isWide()) 1914 return StmtError(Diag(Literal->getLocStart(),diag::err_asm_wide_character) 1915 << Literal->getSourceRange()); 1916 1917 llvm::StringRef Clobber = Literal->getString(); 1918 1919 if (!Context.Target.isValidGCCRegisterName(Clobber)) 1920 return StmtError(Diag(Literal->getLocStart(), 1921 diag::err_asm_unknown_register_name) << Clobber); 1922 } 1923 1924 AsmStmt *NS = 1925 new (Context) AsmStmt(Context, AsmLoc, IsSimple, IsVolatile, MSAsm, 1926 NumOutputs, NumInputs, Names, Constraints, Exprs, 1927 AsmString, NumClobbers, Clobbers, RParenLoc); 1928 // Validate the asm string, ensuring it makes sense given the operands we 1929 // have. 1930 llvm::SmallVector<AsmStmt::AsmStringPiece, 8> Pieces; 1931 unsigned DiagOffs; 1932 if (unsigned DiagID = NS->AnalyzeAsmString(Pieces, Context, DiagOffs)) { 1933 Diag(getLocationOfStringLiteralByte(AsmString, DiagOffs), DiagID) 1934 << AsmString->getSourceRange(); 1935 return StmtError(); 1936 } 1937 1938 // Validate tied input operands for type mismatches. 1939 for (unsigned i = 0, e = InputConstraintInfos.size(); i != e; ++i) { 1940 TargetInfo::ConstraintInfo &Info = InputConstraintInfos[i]; 1941 1942 // If this is a tied constraint, verify that the output and input have 1943 // either exactly the same type, or that they are int/ptr operands with the 1944 // same size (int/long, int*/long, are ok etc). 1945 if (!Info.hasTiedOperand()) continue; 1946 1947 unsigned TiedTo = Info.getTiedOperand(); 1948 unsigned InputOpNo = i+NumOutputs; 1949 Expr *OutputExpr = Exprs[TiedTo]; 1950 Expr *InputExpr = Exprs[InputOpNo]; 1951 QualType InTy = InputExpr->getType(); 1952 QualType OutTy = OutputExpr->getType(); 1953 if (Context.hasSameType(InTy, OutTy)) 1954 continue; // All types can be tied to themselves. 1955 1956 // Decide if the input and output are in the same domain (integer/ptr or 1957 // floating point. 1958 enum AsmDomain { 1959 AD_Int, AD_FP, AD_Other 1960 } InputDomain, OutputDomain; 1961 1962 if (InTy->isIntegerType() || InTy->isPointerType()) 1963 InputDomain = AD_Int; 1964 else if (InTy->isRealFloatingType()) 1965 InputDomain = AD_FP; 1966 else 1967 InputDomain = AD_Other; 1968 1969 if (OutTy->isIntegerType() || OutTy->isPointerType()) 1970 OutputDomain = AD_Int; 1971 else if (OutTy->isRealFloatingType()) 1972 OutputDomain = AD_FP; 1973 else 1974 OutputDomain = AD_Other; 1975 1976 // They are ok if they are the same size and in the same domain. This 1977 // allows tying things like: 1978 // void* to int* 1979 // void* to int if they are the same size. 1980 // double to long double if they are the same size. 1981 // 1982 uint64_t OutSize = Context.getTypeSize(OutTy); 1983 uint64_t InSize = Context.getTypeSize(InTy); 1984 if (OutSize == InSize && InputDomain == OutputDomain && 1985 InputDomain != AD_Other) 1986 continue; 1987 1988 // If the smaller input/output operand is not mentioned in the asm string, 1989 // then we can promote the smaller one to a larger input and the asm string 1990 // won't notice. 1991 bool SmallerValueMentioned = false; 1992 1993 // If this is a reference to the input and if the input was the smaller 1994 // one, then we have to reject this asm. 1995 if (isOperandMentioned(InputOpNo, Pieces)) { 1996 // This is a use in the asm string of the smaller operand. Since we 1997 // codegen this by promoting to a wider value, the asm will get printed 1998 // "wrong". 1999 SmallerValueMentioned |= InSize < OutSize; 2000 } 2001 if (isOperandMentioned(TiedTo, Pieces)) { 2002 // If this is a reference to the output, and if the output is the larger 2003 // value, then it's ok because we'll promote the input to the larger type. 2004 SmallerValueMentioned |= OutSize < InSize; 2005 } 2006 2007 // If the smaller value wasn't mentioned in the asm string, and if the 2008 // output was a register, just extend the shorter one to the size of the 2009 // larger one. 2010 if (!SmallerValueMentioned && InputDomain != AD_Other && 2011 OutputConstraintInfos[TiedTo].allowsRegister()) 2012 continue; 2013 2014 // Either both of the operands were mentioned or the smaller one was 2015 // mentioned. One more special case that we'll allow: if the tied input is 2016 // integer, unmentioned, and is a constant, then we'll allow truncating it 2017 // down to the size of the destination. 2018 if (InputDomain == AD_Int && OutputDomain == AD_Int && 2019 !isOperandMentioned(InputOpNo, Pieces) && 2020 InputExpr->isEvaluatable(Context)) { 2021 InputExpr = ImpCastExprToType(InputExpr, OutTy, CK_IntegralCast).take(); 2022 Exprs[InputOpNo] = InputExpr; 2023 NS->setInputExpr(i, InputExpr); 2024 continue; 2025 } 2026 2027 Diag(InputExpr->getLocStart(), 2028 diag::err_asm_tying_incompatible_types) 2029 << InTy << OutTy << OutputExpr->getSourceRange() 2030 << InputExpr->getSourceRange(); 2031 return StmtError(); 2032 } 2033 2034 return Owned(NS); 2035} 2036 2037StmtResult 2038Sema::ActOnObjCAtCatchStmt(SourceLocation AtLoc, 2039 SourceLocation RParen, Decl *Parm, 2040 Stmt *Body) { 2041 VarDecl *Var = cast_or_null<VarDecl>(Parm); 2042 if (Var && Var->isInvalidDecl()) 2043 return StmtError(); 2044 2045 return Owned(new (Context) ObjCAtCatchStmt(AtLoc, RParen, Var, Body)); 2046} 2047 2048StmtResult 2049Sema::ActOnObjCAtFinallyStmt(SourceLocation AtLoc, Stmt *Body) { 2050 return Owned(new (Context) ObjCAtFinallyStmt(AtLoc, Body)); 2051} 2052 2053StmtResult 2054Sema::ActOnObjCAtTryStmt(SourceLocation AtLoc, Stmt *Try, 2055 MultiStmtArg CatchStmts, Stmt *Finally) { 2056 if (!getLangOptions().ObjCExceptions) 2057 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@try"; 2058 2059 getCurFunction()->setHasBranchProtectedScope(); 2060 unsigned NumCatchStmts = CatchStmts.size(); 2061 return Owned(ObjCAtTryStmt::Create(Context, AtLoc, Try, 2062 CatchStmts.release(), 2063 NumCatchStmts, 2064 Finally)); 2065} 2066 2067StmtResult Sema::BuildObjCAtThrowStmt(SourceLocation AtLoc, 2068 Expr *Throw) { 2069 if (Throw) { 2070 ExprResult Result = DefaultLvalueConversion(Throw); 2071 if (Result.isInvalid()) 2072 return StmtError(); 2073 2074 Throw = Result.take(); 2075 QualType ThrowType = Throw->getType(); 2076 // Make sure the expression type is an ObjC pointer or "void *". 2077 if (!ThrowType->isDependentType() && 2078 !ThrowType->isObjCObjectPointerType()) { 2079 const PointerType *PT = ThrowType->getAs<PointerType>(); 2080 if (!PT || !PT->getPointeeType()->isVoidType()) 2081 return StmtError(Diag(AtLoc, diag::error_objc_throw_expects_object) 2082 << Throw->getType() << Throw->getSourceRange()); 2083 } 2084 } 2085 2086 return Owned(new (Context) ObjCAtThrowStmt(AtLoc, Throw)); 2087} 2088 2089StmtResult 2090Sema::ActOnObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw, 2091 Scope *CurScope) { 2092 if (!getLangOptions().ObjCExceptions) 2093 Diag(AtLoc, diag::err_objc_exceptions_disabled) << "@throw"; 2094 2095 if (!Throw) { 2096 // @throw without an expression designates a rethrow (which much occur 2097 // in the context of an @catch clause). 2098 Scope *AtCatchParent = CurScope; 2099 while (AtCatchParent && !AtCatchParent->isAtCatchScope()) 2100 AtCatchParent = AtCatchParent->getParent(); 2101 if (!AtCatchParent) 2102 return StmtError(Diag(AtLoc, diag::error_rethrow_used_outside_catch)); 2103 } 2104 2105 return BuildObjCAtThrowStmt(AtLoc, Throw); 2106} 2107 2108StmtResult 2109Sema::ActOnObjCAtSynchronizedStmt(SourceLocation AtLoc, Expr *SyncExpr, 2110 Stmt *SyncBody) { 2111 getCurFunction()->setHasBranchProtectedScope(); 2112 2113 ExprResult Result = DefaultLvalueConversion(SyncExpr); 2114 if (Result.isInvalid()) 2115 return StmtError(); 2116 2117 SyncExpr = Result.take(); 2118 // Make sure the expression type is an ObjC pointer or "void *". 2119 if (!SyncExpr->getType()->isDependentType() && 2120 !SyncExpr->getType()->isObjCObjectPointerType()) { 2121 const PointerType *PT = SyncExpr->getType()->getAs<PointerType>(); 2122 if (!PT || !PT->getPointeeType()->isVoidType()) 2123 return StmtError(Diag(AtLoc, diag::error_objc_synchronized_expects_object) 2124 << SyncExpr->getType() << SyncExpr->getSourceRange()); 2125 } 2126 2127 return Owned(new (Context) ObjCAtSynchronizedStmt(AtLoc, SyncExpr, SyncBody)); 2128} 2129 2130/// ActOnCXXCatchBlock - Takes an exception declaration and a handler block 2131/// and creates a proper catch handler from them. 2132StmtResult 2133Sema::ActOnCXXCatchBlock(SourceLocation CatchLoc, Decl *ExDecl, 2134 Stmt *HandlerBlock) { 2135 // There's nothing to test that ActOnExceptionDecl didn't already test. 2136 return Owned(new (Context) CXXCatchStmt(CatchLoc, 2137 cast_or_null<VarDecl>(ExDecl), 2138 HandlerBlock)); 2139} 2140 2141namespace { 2142 2143class TypeWithHandler { 2144 QualType t; 2145 CXXCatchStmt *stmt; 2146public: 2147 TypeWithHandler(const QualType &type, CXXCatchStmt *statement) 2148 : t(type), stmt(statement) {} 2149 2150 // An arbitrary order is fine as long as it places identical 2151 // types next to each other. 2152 bool operator<(const TypeWithHandler &y) const { 2153 if (t.getAsOpaquePtr() < y.t.getAsOpaquePtr()) 2154 return true; 2155 if (t.getAsOpaquePtr() > y.t.getAsOpaquePtr()) 2156 return false; 2157 else 2158 return getTypeSpecStartLoc() < y.getTypeSpecStartLoc(); 2159 } 2160 2161 bool operator==(const TypeWithHandler& other) const { 2162 return t == other.t; 2163 } 2164 2165 CXXCatchStmt *getCatchStmt() const { return stmt; } 2166 SourceLocation getTypeSpecStartLoc() const { 2167 return stmt->getExceptionDecl()->getTypeSpecStartLoc(); 2168 } 2169}; 2170 2171} 2172 2173/// ActOnCXXTryBlock - Takes a try compound-statement and a number of 2174/// handlers and creates a try statement from them. 2175StmtResult 2176Sema::ActOnCXXTryBlock(SourceLocation TryLoc, Stmt *TryBlock, 2177 MultiStmtArg RawHandlers) { 2178 // Don't report an error if 'try' is used in system headers. 2179 if (!getLangOptions().CXXExceptions && 2180 !getSourceManager().isInSystemHeader(TryLoc)) 2181 Diag(TryLoc, diag::err_exceptions_disabled) << "try"; 2182 2183 unsigned NumHandlers = RawHandlers.size(); 2184 assert(NumHandlers > 0 && 2185 "The parser shouldn't call this if there are no handlers."); 2186 Stmt **Handlers = RawHandlers.get(); 2187 2188 llvm::SmallVector<TypeWithHandler, 8> TypesWithHandlers; 2189 2190 for (unsigned i = 0; i < NumHandlers; ++i) { 2191 CXXCatchStmt *Handler = llvm::cast<CXXCatchStmt>(Handlers[i]); 2192 if (!Handler->getExceptionDecl()) { 2193 if (i < NumHandlers - 1) 2194 return StmtError(Diag(Handler->getLocStart(), 2195 diag::err_early_catch_all)); 2196 2197 continue; 2198 } 2199 2200 const QualType CaughtType = Handler->getCaughtType(); 2201 const QualType CanonicalCaughtType = Context.getCanonicalType(CaughtType); 2202 TypesWithHandlers.push_back(TypeWithHandler(CanonicalCaughtType, Handler)); 2203 } 2204 2205 // Detect handlers for the same type as an earlier one. 2206 if (NumHandlers > 1) { 2207 llvm::array_pod_sort(TypesWithHandlers.begin(), TypesWithHandlers.end()); 2208 2209 TypeWithHandler prev = TypesWithHandlers[0]; 2210 for (unsigned i = 1; i < TypesWithHandlers.size(); ++i) { 2211 TypeWithHandler curr = TypesWithHandlers[i]; 2212 2213 if (curr == prev) { 2214 Diag(curr.getTypeSpecStartLoc(), 2215 diag::warn_exception_caught_by_earlier_handler) 2216 << curr.getCatchStmt()->getCaughtType().getAsString(); 2217 Diag(prev.getTypeSpecStartLoc(), 2218 diag::note_previous_exception_handler) 2219 << prev.getCatchStmt()->getCaughtType().getAsString(); 2220 } 2221 2222 prev = curr; 2223 } 2224 } 2225 2226 getCurFunction()->setHasBranchProtectedScope(); 2227 2228 // FIXME: We should detect handlers that cannot catch anything because an 2229 // earlier handler catches a superclass. Need to find a method that is not 2230 // quadratic for this. 2231 // Neither of these are explicitly forbidden, but every compiler detects them 2232 // and warns. 2233 2234 return Owned(CXXTryStmt::Create(Context, TryLoc, TryBlock, 2235 Handlers, NumHandlers)); 2236} 2237