SemaChecking.cpp revision 31310a21fb2a9f13950f864f681c86080b05d5b2
1//===--- SemaChecking.cpp - Extra Semantic Checking -----------------------===// 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 extra semantic analysis beyond what is enforced 11// by the C type system. 12// 13//===----------------------------------------------------------------------===// 14 15#include "Sema.h" 16#include "clang/Analysis/CFG.h" 17#include "clang/Analysis/AnalysisContext.h" 18#include "clang/Analysis/Analyses/PrintfFormatString.h" 19#include "clang/AST/ASTContext.h" 20#include "clang/AST/CharUnits.h" 21#include "clang/AST/DeclObjC.h" 22#include "clang/AST/ExprCXX.h" 23#include "clang/AST/ExprObjC.h" 24#include "clang/AST/DeclObjC.h" 25#include "clang/AST/StmtCXX.h" 26#include "clang/AST/StmtObjC.h" 27#include "clang/Lex/LiteralSupport.h" 28#include "clang/Lex/Preprocessor.h" 29#include "llvm/ADT/BitVector.h" 30#include "llvm/ADT/STLExtras.h" 31#include <limits> 32#include <queue> 33using namespace clang; 34 35/// getLocationOfStringLiteralByte - Return a source location that points to the 36/// specified byte of the specified string literal. 37/// 38/// Strings are amazingly complex. They can be formed from multiple tokens and 39/// can have escape sequences in them in addition to the usual trigraph and 40/// escaped newline business. This routine handles this complexity. 41/// 42SourceLocation Sema::getLocationOfStringLiteralByte(const StringLiteral *SL, 43 unsigned ByteNo) const { 44 assert(!SL->isWide() && "This doesn't work for wide strings yet"); 45 46 // Loop over all of the tokens in this string until we find the one that 47 // contains the byte we're looking for. 48 unsigned TokNo = 0; 49 while (1) { 50 assert(TokNo < SL->getNumConcatenated() && "Invalid byte number!"); 51 SourceLocation StrTokLoc = SL->getStrTokenLoc(TokNo); 52 53 // Get the spelling of the string so that we can get the data that makes up 54 // the string literal, not the identifier for the macro it is potentially 55 // expanded through. 56 SourceLocation StrTokSpellingLoc = SourceMgr.getSpellingLoc(StrTokLoc); 57 58 // Re-lex the token to get its length and original spelling. 59 std::pair<FileID, unsigned> LocInfo = 60 SourceMgr.getDecomposedLoc(StrTokSpellingLoc); 61 std::pair<const char *,const char *> Buffer = 62 SourceMgr.getBufferData(LocInfo.first); 63 const char *StrData = Buffer.first+LocInfo.second; 64 65 // Create a langops struct and enable trigraphs. This is sufficient for 66 // relexing tokens. 67 LangOptions LangOpts; 68 LangOpts.Trigraphs = true; 69 70 // Create a lexer starting at the beginning of this token. 71 Lexer TheLexer(StrTokSpellingLoc, LangOpts, Buffer.first, StrData, 72 Buffer.second); 73 Token TheTok; 74 TheLexer.LexFromRawLexer(TheTok); 75 76 // Use the StringLiteralParser to compute the length of the string in bytes. 77 StringLiteralParser SLP(&TheTok, 1, PP); 78 unsigned TokNumBytes = SLP.GetStringLength(); 79 80 // If the byte is in this token, return the location of the byte. 81 if (ByteNo < TokNumBytes || 82 (ByteNo == TokNumBytes && TokNo == SL->getNumConcatenated())) { 83 unsigned Offset = 84 StringLiteralParser::getOffsetOfStringByte(TheTok, ByteNo, PP); 85 86 // Now that we know the offset of the token in the spelling, use the 87 // preprocessor to get the offset in the original source. 88 return PP.AdvanceToTokenCharacter(StrTokLoc, Offset); 89 } 90 91 // Move to the next string token. 92 ++TokNo; 93 ByteNo -= TokNumBytes; 94 } 95} 96 97/// CheckablePrintfAttr - does a function call have a "printf" attribute 98/// and arguments that merit checking? 99bool Sema::CheckablePrintfAttr(const FormatAttr *Format, CallExpr *TheCall) { 100 if (Format->getType() == "printf") return true; 101 if (Format->getType() == "printf0") { 102 // printf0 allows null "format" string; if so don't check format/args 103 unsigned format_idx = Format->getFormatIdx() - 1; 104 // Does the index refer to the implicit object argument? 105 if (isa<CXXMemberCallExpr>(TheCall)) { 106 if (format_idx == 0) 107 return false; 108 --format_idx; 109 } 110 if (format_idx < TheCall->getNumArgs()) { 111 Expr *Format = TheCall->getArg(format_idx)->IgnoreParenCasts(); 112 if (!Format->isNullPointerConstant(Context, Expr::NPC_ValueDependentIsNull)) 113 return true; 114 } 115 } 116 return false; 117} 118 119Action::OwningExprResult 120Sema::CheckBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall) { 121 OwningExprResult TheCallResult(Owned(TheCall)); 122 123 switch (BuiltinID) { 124 case Builtin::BI__builtin___CFStringMakeConstantString: 125 assert(TheCall->getNumArgs() == 1 && 126 "Wrong # arguments to builtin CFStringMakeConstantString"); 127 if (CheckObjCString(TheCall->getArg(0))) 128 return ExprError(); 129 break; 130 case Builtin::BI__builtin_stdarg_start: 131 case Builtin::BI__builtin_va_start: 132 if (SemaBuiltinVAStart(TheCall)) 133 return ExprError(); 134 break; 135 case Builtin::BI__builtin_isgreater: 136 case Builtin::BI__builtin_isgreaterequal: 137 case Builtin::BI__builtin_isless: 138 case Builtin::BI__builtin_islessequal: 139 case Builtin::BI__builtin_islessgreater: 140 case Builtin::BI__builtin_isunordered: 141 if (SemaBuiltinUnorderedCompare(TheCall)) 142 return ExprError(); 143 break; 144 case Builtin::BI__builtin_isfinite: 145 case Builtin::BI__builtin_isinf: 146 case Builtin::BI__builtin_isinf_sign: 147 case Builtin::BI__builtin_isnan: 148 case Builtin::BI__builtin_isnormal: 149 if (SemaBuiltinUnaryFP(TheCall)) 150 return ExprError(); 151 break; 152 case Builtin::BI__builtin_return_address: 153 case Builtin::BI__builtin_frame_address: 154 if (SemaBuiltinStackAddress(TheCall)) 155 return ExprError(); 156 break; 157 case Builtin::BI__builtin_eh_return_data_regno: 158 if (SemaBuiltinEHReturnDataRegNo(TheCall)) 159 return ExprError(); 160 break; 161 case Builtin::BI__builtin_shufflevector: 162 return SemaBuiltinShuffleVector(TheCall); 163 // TheCall will be freed by the smart pointer here, but that's fine, since 164 // SemaBuiltinShuffleVector guts it, but then doesn't release it. 165 case Builtin::BI__builtin_prefetch: 166 if (SemaBuiltinPrefetch(TheCall)) 167 return ExprError(); 168 break; 169 case Builtin::BI__builtin_object_size: 170 if (SemaBuiltinObjectSize(TheCall)) 171 return ExprError(); 172 break; 173 case Builtin::BI__builtin_longjmp: 174 if (SemaBuiltinLongjmp(TheCall)) 175 return ExprError(); 176 break; 177 case Builtin::BI__sync_fetch_and_add: 178 case Builtin::BI__sync_fetch_and_sub: 179 case Builtin::BI__sync_fetch_and_or: 180 case Builtin::BI__sync_fetch_and_and: 181 case Builtin::BI__sync_fetch_and_xor: 182 case Builtin::BI__sync_fetch_and_nand: 183 case Builtin::BI__sync_add_and_fetch: 184 case Builtin::BI__sync_sub_and_fetch: 185 case Builtin::BI__sync_and_and_fetch: 186 case Builtin::BI__sync_or_and_fetch: 187 case Builtin::BI__sync_xor_and_fetch: 188 case Builtin::BI__sync_nand_and_fetch: 189 case Builtin::BI__sync_val_compare_and_swap: 190 case Builtin::BI__sync_bool_compare_and_swap: 191 case Builtin::BI__sync_lock_test_and_set: 192 case Builtin::BI__sync_lock_release: 193 if (SemaBuiltinAtomicOverloaded(TheCall)) 194 return ExprError(); 195 break; 196 } 197 198 return move(TheCallResult); 199} 200 201/// CheckFunctionCall - Check a direct function call for various correctness 202/// and safety properties not strictly enforced by the C type system. 203bool Sema::CheckFunctionCall(FunctionDecl *FDecl, CallExpr *TheCall) { 204 // Get the IdentifierInfo* for the called function. 205 IdentifierInfo *FnInfo = FDecl->getIdentifier(); 206 207 // None of the checks below are needed for functions that don't have 208 // simple names (e.g., C++ conversion functions). 209 if (!FnInfo) 210 return false; 211 212 // FIXME: This mechanism should be abstracted to be less fragile and 213 // more efficient. For example, just map function ids to custom 214 // handlers. 215 216 // Printf checking. 217 if (const FormatAttr *Format = FDecl->getAttr<FormatAttr>()) { 218 if (CheckablePrintfAttr(Format, TheCall)) { 219 bool HasVAListArg = Format->getFirstArg() == 0; 220 if (!HasVAListArg) { 221 if (const FunctionProtoType *Proto 222 = FDecl->getType()->getAs<FunctionProtoType>()) 223 HasVAListArg = !Proto->isVariadic(); 224 } 225 CheckPrintfArguments(TheCall, HasVAListArg, Format->getFormatIdx() - 1, 226 HasVAListArg ? 0 : Format->getFirstArg() - 1); 227 } 228 } 229 230 for (const NonNullAttr *NonNull = FDecl->getAttr<NonNullAttr>(); NonNull; 231 NonNull = NonNull->getNext<NonNullAttr>()) 232 CheckNonNullArguments(NonNull, TheCall); 233 234 return false; 235} 236 237bool Sema::CheckBlockCall(NamedDecl *NDecl, CallExpr *TheCall) { 238 // Printf checking. 239 const FormatAttr *Format = NDecl->getAttr<FormatAttr>(); 240 if (!Format) 241 return false; 242 243 const VarDecl *V = dyn_cast<VarDecl>(NDecl); 244 if (!V) 245 return false; 246 247 QualType Ty = V->getType(); 248 if (!Ty->isBlockPointerType()) 249 return false; 250 251 if (!CheckablePrintfAttr(Format, TheCall)) 252 return false; 253 254 bool HasVAListArg = Format->getFirstArg() == 0; 255 if (!HasVAListArg) { 256 const FunctionType *FT = 257 Ty->getAs<BlockPointerType>()->getPointeeType()->getAs<FunctionType>(); 258 if (const FunctionProtoType *Proto = dyn_cast<FunctionProtoType>(FT)) 259 HasVAListArg = !Proto->isVariadic(); 260 } 261 CheckPrintfArguments(TheCall, HasVAListArg, Format->getFormatIdx() - 1, 262 HasVAListArg ? 0 : Format->getFirstArg() - 1); 263 264 return false; 265} 266 267/// SemaBuiltinAtomicOverloaded - We have a call to a function like 268/// __sync_fetch_and_add, which is an overloaded function based on the pointer 269/// type of its first argument. The main ActOnCallExpr routines have already 270/// promoted the types of arguments because all of these calls are prototyped as 271/// void(...). 272/// 273/// This function goes through and does final semantic checking for these 274/// builtins, 275bool Sema::SemaBuiltinAtomicOverloaded(CallExpr *TheCall) { 276 DeclRefExpr *DRE =cast<DeclRefExpr>(TheCall->getCallee()->IgnoreParenCasts()); 277 FunctionDecl *FDecl = cast<FunctionDecl>(DRE->getDecl()); 278 279 // Ensure that we have at least one argument to do type inference from. 280 if (TheCall->getNumArgs() < 1) 281 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_few_args) 282 << 0 << TheCall->getCallee()->getSourceRange(); 283 284 // Inspect the first argument of the atomic builtin. This should always be 285 // a pointer type, whose element is an integral scalar or pointer type. 286 // Because it is a pointer type, we don't have to worry about any implicit 287 // casts here. 288 Expr *FirstArg = TheCall->getArg(0); 289 if (!FirstArg->getType()->isPointerType()) 290 return Diag(DRE->getLocStart(), diag::err_atomic_builtin_must_be_pointer) 291 << FirstArg->getType() << FirstArg->getSourceRange(); 292 293 QualType ValType = FirstArg->getType()->getAs<PointerType>()->getPointeeType(); 294 if (!ValType->isIntegerType() && !ValType->isPointerType() && 295 !ValType->isBlockPointerType()) 296 return Diag(DRE->getLocStart(), 297 diag::err_atomic_builtin_must_be_pointer_intptr) 298 << FirstArg->getType() << FirstArg->getSourceRange(); 299 300 // We need to figure out which concrete builtin this maps onto. For example, 301 // __sync_fetch_and_add with a 2 byte object turns into 302 // __sync_fetch_and_add_2. 303#define BUILTIN_ROW(x) \ 304 { Builtin::BI##x##_1, Builtin::BI##x##_2, Builtin::BI##x##_4, \ 305 Builtin::BI##x##_8, Builtin::BI##x##_16 } 306 307 static const unsigned BuiltinIndices[][5] = { 308 BUILTIN_ROW(__sync_fetch_and_add), 309 BUILTIN_ROW(__sync_fetch_and_sub), 310 BUILTIN_ROW(__sync_fetch_and_or), 311 BUILTIN_ROW(__sync_fetch_and_and), 312 BUILTIN_ROW(__sync_fetch_and_xor), 313 BUILTIN_ROW(__sync_fetch_and_nand), 314 315 BUILTIN_ROW(__sync_add_and_fetch), 316 BUILTIN_ROW(__sync_sub_and_fetch), 317 BUILTIN_ROW(__sync_and_and_fetch), 318 BUILTIN_ROW(__sync_or_and_fetch), 319 BUILTIN_ROW(__sync_xor_and_fetch), 320 BUILTIN_ROW(__sync_nand_and_fetch), 321 322 BUILTIN_ROW(__sync_val_compare_and_swap), 323 BUILTIN_ROW(__sync_bool_compare_and_swap), 324 BUILTIN_ROW(__sync_lock_test_and_set), 325 BUILTIN_ROW(__sync_lock_release) 326 }; 327#undef BUILTIN_ROW 328 329 // Determine the index of the size. 330 unsigned SizeIndex; 331 switch (Context.getTypeSizeInChars(ValType).getQuantity()) { 332 case 1: SizeIndex = 0; break; 333 case 2: SizeIndex = 1; break; 334 case 4: SizeIndex = 2; break; 335 case 8: SizeIndex = 3; break; 336 case 16: SizeIndex = 4; break; 337 default: 338 return Diag(DRE->getLocStart(), diag::err_atomic_builtin_pointer_size) 339 << FirstArg->getType() << FirstArg->getSourceRange(); 340 } 341 342 // Each of these builtins has one pointer argument, followed by some number of 343 // values (0, 1 or 2) followed by a potentially empty varags list of stuff 344 // that we ignore. Find out which row of BuiltinIndices to read from as well 345 // as the number of fixed args. 346 unsigned BuiltinID = FDecl->getBuiltinID(); 347 unsigned BuiltinIndex, NumFixed = 1; 348 switch (BuiltinID) { 349 default: assert(0 && "Unknown overloaded atomic builtin!"); 350 case Builtin::BI__sync_fetch_and_add: BuiltinIndex = 0; break; 351 case Builtin::BI__sync_fetch_and_sub: BuiltinIndex = 1; break; 352 case Builtin::BI__sync_fetch_and_or: BuiltinIndex = 2; break; 353 case Builtin::BI__sync_fetch_and_and: BuiltinIndex = 3; break; 354 case Builtin::BI__sync_fetch_and_xor: BuiltinIndex = 4; break; 355 case Builtin::BI__sync_fetch_and_nand:BuiltinIndex = 5; break; 356 357 case Builtin::BI__sync_add_and_fetch: BuiltinIndex = 6; break; 358 case Builtin::BI__sync_sub_and_fetch: BuiltinIndex = 7; break; 359 case Builtin::BI__sync_and_and_fetch: BuiltinIndex = 8; break; 360 case Builtin::BI__sync_or_and_fetch: BuiltinIndex = 9; break; 361 case Builtin::BI__sync_xor_and_fetch: BuiltinIndex =10; break; 362 case Builtin::BI__sync_nand_and_fetch:BuiltinIndex =11; break; 363 364 case Builtin::BI__sync_val_compare_and_swap: 365 BuiltinIndex = 12; 366 NumFixed = 2; 367 break; 368 case Builtin::BI__sync_bool_compare_and_swap: 369 BuiltinIndex = 13; 370 NumFixed = 2; 371 break; 372 case Builtin::BI__sync_lock_test_and_set: BuiltinIndex = 14; break; 373 case Builtin::BI__sync_lock_release: 374 BuiltinIndex = 15; 375 NumFixed = 0; 376 break; 377 } 378 379 // Now that we know how many fixed arguments we expect, first check that we 380 // have at least that many. 381 if (TheCall->getNumArgs() < 1+NumFixed) 382 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_few_args) 383 << 0 << TheCall->getCallee()->getSourceRange(); 384 385 386 // Get the decl for the concrete builtin from this, we can tell what the 387 // concrete integer type we should convert to is. 388 unsigned NewBuiltinID = BuiltinIndices[BuiltinIndex][SizeIndex]; 389 const char *NewBuiltinName = Context.BuiltinInfo.GetName(NewBuiltinID); 390 IdentifierInfo *NewBuiltinII = PP.getIdentifierInfo(NewBuiltinName); 391 FunctionDecl *NewBuiltinDecl = 392 cast<FunctionDecl>(LazilyCreateBuiltin(NewBuiltinII, NewBuiltinID, 393 TUScope, false, DRE->getLocStart())); 394 const FunctionProtoType *BuiltinFT = 395 NewBuiltinDecl->getType()->getAs<FunctionProtoType>(); 396 ValType = BuiltinFT->getArgType(0)->getAs<PointerType>()->getPointeeType(); 397 398 // If the first type needs to be converted (e.g. void** -> int*), do it now. 399 if (BuiltinFT->getArgType(0) != FirstArg->getType()) { 400 ImpCastExprToType(FirstArg, BuiltinFT->getArgType(0), CastExpr::CK_BitCast); 401 TheCall->setArg(0, FirstArg); 402 } 403 404 // Next, walk the valid ones promoting to the right type. 405 for (unsigned i = 0; i != NumFixed; ++i) { 406 Expr *Arg = TheCall->getArg(i+1); 407 408 // If the argument is an implicit cast, then there was a promotion due to 409 // "...", just remove it now. 410 if (ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(Arg)) { 411 Arg = ICE->getSubExpr(); 412 ICE->setSubExpr(0); 413 ICE->Destroy(Context); 414 TheCall->setArg(i+1, Arg); 415 } 416 417 // GCC does an implicit conversion to the pointer or integer ValType. This 418 // can fail in some cases (1i -> int**), check for this error case now. 419 CastExpr::CastKind Kind = CastExpr::CK_Unknown; 420 CXXMethodDecl *ConversionDecl = 0; 421 if (CheckCastTypes(Arg->getSourceRange(), ValType, Arg, Kind, 422 ConversionDecl)) 423 return true; 424 425 // Okay, we have something that *can* be converted to the right type. Check 426 // to see if there is a potentially weird extension going on here. This can 427 // happen when you do an atomic operation on something like an char* and 428 // pass in 42. The 42 gets converted to char. This is even more strange 429 // for things like 45.123 -> char, etc. 430 // FIXME: Do this check. 431 ImpCastExprToType(Arg, ValType, Kind, /*isLvalue=*/false); 432 TheCall->setArg(i+1, Arg); 433 } 434 435 // Switch the DeclRefExpr to refer to the new decl. 436 DRE->setDecl(NewBuiltinDecl); 437 DRE->setType(NewBuiltinDecl->getType()); 438 439 // Set the callee in the CallExpr. 440 // FIXME: This leaks the original parens and implicit casts. 441 Expr *PromotedCall = DRE; 442 UsualUnaryConversions(PromotedCall); 443 TheCall->setCallee(PromotedCall); 444 445 446 // Change the result type of the call to match the result type of the decl. 447 TheCall->setType(NewBuiltinDecl->getResultType()); 448 return false; 449} 450 451 452/// CheckObjCString - Checks that the argument to the builtin 453/// CFString constructor is correct 454/// FIXME: GCC currently emits the following warning: 455/// "warning: input conversion stopped due to an input byte that does not 456/// belong to the input codeset UTF-8" 457/// Note: It might also make sense to do the UTF-16 conversion here (would 458/// simplify the backend). 459bool Sema::CheckObjCString(Expr *Arg) { 460 Arg = Arg->IgnoreParenCasts(); 461 StringLiteral *Literal = dyn_cast<StringLiteral>(Arg); 462 463 if (!Literal || Literal->isWide()) { 464 Diag(Arg->getLocStart(), diag::err_cfstring_literal_not_string_constant) 465 << Arg->getSourceRange(); 466 return true; 467 } 468 469 const char *Data = Literal->getStrData(); 470 unsigned Length = Literal->getByteLength(); 471 472 for (unsigned i = 0; i < Length; ++i) { 473 if (!Data[i]) { 474 Diag(getLocationOfStringLiteralByte(Literal, i), 475 diag::warn_cfstring_literal_contains_nul_character) 476 << Arg->getSourceRange(); 477 break; 478 } 479 } 480 481 return false; 482} 483 484/// SemaBuiltinVAStart - Check the arguments to __builtin_va_start for validity. 485/// Emit an error and return true on failure, return false on success. 486bool Sema::SemaBuiltinVAStart(CallExpr *TheCall) { 487 Expr *Fn = TheCall->getCallee(); 488 if (TheCall->getNumArgs() > 2) { 489 Diag(TheCall->getArg(2)->getLocStart(), 490 diag::err_typecheck_call_too_many_args) 491 << 0 /*function call*/ << Fn->getSourceRange() 492 << SourceRange(TheCall->getArg(2)->getLocStart(), 493 (*(TheCall->arg_end()-1))->getLocEnd()); 494 return true; 495 } 496 497 if (TheCall->getNumArgs() < 2) { 498 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_few_args) 499 << 0 /*function call*/; 500 } 501 502 // Determine whether the current function is variadic or not. 503 bool isVariadic; 504 if (CurBlock) 505 isVariadic = CurBlock->isVariadic; 506 else if (getCurFunctionDecl()) { 507 if (FunctionProtoType* FTP = 508 dyn_cast<FunctionProtoType>(getCurFunctionDecl()->getType())) 509 isVariadic = FTP->isVariadic(); 510 else 511 isVariadic = false; 512 } else { 513 isVariadic = getCurMethodDecl()->isVariadic(); 514 } 515 516 if (!isVariadic) { 517 Diag(Fn->getLocStart(), diag::err_va_start_used_in_non_variadic_function); 518 return true; 519 } 520 521 // Verify that the second argument to the builtin is the last argument of the 522 // current function or method. 523 bool SecondArgIsLastNamedArgument = false; 524 const Expr *Arg = TheCall->getArg(1)->IgnoreParenCasts(); 525 526 if (const DeclRefExpr *DR = dyn_cast<DeclRefExpr>(Arg)) { 527 if (const ParmVarDecl *PV = dyn_cast<ParmVarDecl>(DR->getDecl())) { 528 // FIXME: This isn't correct for methods (results in bogus warning). 529 // Get the last formal in the current function. 530 const ParmVarDecl *LastArg; 531 if (CurBlock) 532 LastArg = *(CurBlock->TheDecl->param_end()-1); 533 else if (FunctionDecl *FD = getCurFunctionDecl()) 534 LastArg = *(FD->param_end()-1); 535 else 536 LastArg = *(getCurMethodDecl()->param_end()-1); 537 SecondArgIsLastNamedArgument = PV == LastArg; 538 } 539 } 540 541 if (!SecondArgIsLastNamedArgument) 542 Diag(TheCall->getArg(1)->getLocStart(), 543 diag::warn_second_parameter_of_va_start_not_last_named_argument); 544 return false; 545} 546 547/// SemaBuiltinUnorderedCompare - Handle functions like __builtin_isgreater and 548/// friends. This is declared to take (...), so we have to check everything. 549bool Sema::SemaBuiltinUnorderedCompare(CallExpr *TheCall) { 550 if (TheCall->getNumArgs() < 2) 551 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_few_args) 552 << 0 /*function call*/; 553 if (TheCall->getNumArgs() > 2) 554 return Diag(TheCall->getArg(2)->getLocStart(), 555 diag::err_typecheck_call_too_many_args) 556 << 0 /*function call*/ 557 << SourceRange(TheCall->getArg(2)->getLocStart(), 558 (*(TheCall->arg_end()-1))->getLocEnd()); 559 560 Expr *OrigArg0 = TheCall->getArg(0); 561 Expr *OrigArg1 = TheCall->getArg(1); 562 563 // Do standard promotions between the two arguments, returning their common 564 // type. 565 QualType Res = UsualArithmeticConversions(OrigArg0, OrigArg1, false); 566 567 // Make sure any conversions are pushed back into the call; this is 568 // type safe since unordered compare builtins are declared as "_Bool 569 // foo(...)". 570 TheCall->setArg(0, OrigArg0); 571 TheCall->setArg(1, OrigArg1); 572 573 if (OrigArg0->isTypeDependent() || OrigArg1->isTypeDependent()) 574 return false; 575 576 // If the common type isn't a real floating type, then the arguments were 577 // invalid for this operation. 578 if (!Res->isRealFloatingType()) 579 return Diag(OrigArg0->getLocStart(), 580 diag::err_typecheck_call_invalid_ordered_compare) 581 << OrigArg0->getType() << OrigArg1->getType() 582 << SourceRange(OrigArg0->getLocStart(), OrigArg1->getLocEnd()); 583 584 return false; 585} 586 587/// SemaBuiltinUnorderedCompare - Handle functions like __builtin_isnan and 588/// friends. This is declared to take (...), so we have to check everything. 589bool Sema::SemaBuiltinUnaryFP(CallExpr *TheCall) { 590 if (TheCall->getNumArgs() < 1) 591 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_few_args) 592 << 0 /*function call*/; 593 if (TheCall->getNumArgs() > 1) 594 return Diag(TheCall->getArg(1)->getLocStart(), 595 diag::err_typecheck_call_too_many_args) 596 << 0 /*function call*/ 597 << SourceRange(TheCall->getArg(1)->getLocStart(), 598 (*(TheCall->arg_end()-1))->getLocEnd()); 599 600 Expr *OrigArg = TheCall->getArg(0); 601 602 if (OrigArg->isTypeDependent()) 603 return false; 604 605 // This operation requires a floating-point number 606 if (!OrigArg->getType()->isRealFloatingType()) 607 return Diag(OrigArg->getLocStart(), 608 diag::err_typecheck_call_invalid_unary_fp) 609 << OrigArg->getType() << OrigArg->getSourceRange(); 610 611 return false; 612} 613 614bool Sema::SemaBuiltinStackAddress(CallExpr *TheCall) { 615 // The signature for these builtins is exact; the only thing we need 616 // to check is that the argument is a constant. 617 SourceLocation Loc; 618 if (!TheCall->getArg(0)->isTypeDependent() && 619 !TheCall->getArg(0)->isValueDependent() && 620 !TheCall->getArg(0)->isIntegerConstantExpr(Context, &Loc)) 621 return Diag(Loc, diag::err_stack_const_level) << TheCall->getSourceRange(); 622 623 return false; 624} 625 626/// SemaBuiltinShuffleVector - Handle __builtin_shufflevector. 627// This is declared to take (...), so we have to check everything. 628Action::OwningExprResult Sema::SemaBuiltinShuffleVector(CallExpr *TheCall) { 629 if (TheCall->getNumArgs() < 3) 630 return ExprError(Diag(TheCall->getLocEnd(), 631 diag::err_typecheck_call_too_few_args) 632 << 0 /*function call*/ << TheCall->getSourceRange()); 633 634 unsigned numElements = std::numeric_limits<unsigned>::max(); 635 if (!TheCall->getArg(0)->isTypeDependent() && 636 !TheCall->getArg(1)->isTypeDependent()) { 637 QualType FAType = TheCall->getArg(0)->getType(); 638 QualType SAType = TheCall->getArg(1)->getType(); 639 640 if (!FAType->isVectorType() || !SAType->isVectorType()) { 641 Diag(TheCall->getLocStart(), diag::err_shufflevector_non_vector) 642 << SourceRange(TheCall->getArg(0)->getLocStart(), 643 TheCall->getArg(1)->getLocEnd()); 644 return ExprError(); 645 } 646 647 if (!Context.hasSameUnqualifiedType(FAType, SAType)) { 648 Diag(TheCall->getLocStart(), diag::err_shufflevector_incompatible_vector) 649 << SourceRange(TheCall->getArg(0)->getLocStart(), 650 TheCall->getArg(1)->getLocEnd()); 651 return ExprError(); 652 } 653 654 numElements = FAType->getAs<VectorType>()->getNumElements(); 655 if (TheCall->getNumArgs() != numElements+2) { 656 if (TheCall->getNumArgs() < numElements+2) 657 return ExprError(Diag(TheCall->getLocEnd(), 658 diag::err_typecheck_call_too_few_args) 659 << 0 /*function call*/ << TheCall->getSourceRange()); 660 return ExprError(Diag(TheCall->getLocEnd(), 661 diag::err_typecheck_call_too_many_args) 662 << 0 /*function call*/ << TheCall->getSourceRange()); 663 } 664 } 665 666 for (unsigned i = 2; i < TheCall->getNumArgs(); i++) { 667 if (TheCall->getArg(i)->isTypeDependent() || 668 TheCall->getArg(i)->isValueDependent()) 669 continue; 670 671 llvm::APSInt Result(32); 672 if (!TheCall->getArg(i)->isIntegerConstantExpr(Result, Context)) 673 return ExprError(Diag(TheCall->getLocStart(), 674 diag::err_shufflevector_nonconstant_argument) 675 << TheCall->getArg(i)->getSourceRange()); 676 677 if (Result.getActiveBits() > 64 || Result.getZExtValue() >= numElements*2) 678 return ExprError(Diag(TheCall->getLocStart(), 679 diag::err_shufflevector_argument_too_large) 680 << TheCall->getArg(i)->getSourceRange()); 681 } 682 683 llvm::SmallVector<Expr*, 32> exprs; 684 685 for (unsigned i = 0, e = TheCall->getNumArgs(); i != e; i++) { 686 exprs.push_back(TheCall->getArg(i)); 687 TheCall->setArg(i, 0); 688 } 689 690 return Owned(new (Context) ShuffleVectorExpr(Context, exprs.begin(), 691 exprs.size(), exprs[0]->getType(), 692 TheCall->getCallee()->getLocStart(), 693 TheCall->getRParenLoc())); 694} 695 696/// SemaBuiltinPrefetch - Handle __builtin_prefetch. 697// This is declared to take (const void*, ...) and can take two 698// optional constant int args. 699bool Sema::SemaBuiltinPrefetch(CallExpr *TheCall) { 700 unsigned NumArgs = TheCall->getNumArgs(); 701 702 if (NumArgs > 3) 703 return Diag(TheCall->getLocEnd(), diag::err_typecheck_call_too_many_args) 704 << 0 /*function call*/ << TheCall->getSourceRange(); 705 706 // Argument 0 is checked for us and the remaining arguments must be 707 // constant integers. 708 for (unsigned i = 1; i != NumArgs; ++i) { 709 Expr *Arg = TheCall->getArg(i); 710 if (Arg->isTypeDependent()) 711 continue; 712 713 if (!Arg->getType()->isIntegralType()) 714 return Diag(TheCall->getLocStart(), diag::err_prefetch_invalid_arg_type) 715 << Arg->getSourceRange(); 716 717 ImpCastExprToType(Arg, Context.IntTy, CastExpr::CK_IntegralCast); 718 TheCall->setArg(i, Arg); 719 720 if (Arg->isValueDependent()) 721 continue; 722 723 llvm::APSInt Result; 724 if (!Arg->isIntegerConstantExpr(Result, Context)) 725 return Diag(TheCall->getLocStart(), diag::err_prefetch_invalid_arg_ice) 726 << SourceRange(Arg->getLocStart(), Arg->getLocEnd()); 727 728 // FIXME: gcc issues a warning and rewrites these to 0. These 729 // seems especially odd for the third argument since the default 730 // is 3. 731 if (i == 1) { 732 if (Result.getLimitedValue() > 1) 733 return Diag(TheCall->getLocStart(), diag::err_argument_invalid_range) 734 << "0" << "1" << Arg->getSourceRange(); 735 } else { 736 if (Result.getLimitedValue() > 3) 737 return Diag(TheCall->getLocStart(), diag::err_argument_invalid_range) 738 << "0" << "3" << Arg->getSourceRange(); 739 } 740 } 741 742 return false; 743} 744 745/// SemaBuiltinEHReturnDataRegNo - Handle __builtin_eh_return_data_regno, the 746/// operand must be an integer constant. 747bool Sema::SemaBuiltinEHReturnDataRegNo(CallExpr *TheCall) { 748 llvm::APSInt Result; 749 if (!TheCall->getArg(0)->isIntegerConstantExpr(Result, Context)) 750 return Diag(TheCall->getLocStart(), diag::err_expr_not_ice) 751 << TheCall->getArg(0)->getSourceRange(); 752 753 return false; 754} 755 756 757/// SemaBuiltinObjectSize - Handle __builtin_object_size(void *ptr, 758/// int type). This simply type checks that type is one of the defined 759/// constants (0-3). 760// For compatability check 0-3, llvm only handles 0 and 2. 761bool Sema::SemaBuiltinObjectSize(CallExpr *TheCall) { 762 Expr *Arg = TheCall->getArg(1); 763 if (Arg->isTypeDependent()) 764 return false; 765 766 QualType ArgType = Arg->getType(); 767 const BuiltinType *BT = ArgType->getAs<BuiltinType>(); 768 llvm::APSInt Result(32); 769 if (!BT || BT->getKind() != BuiltinType::Int) 770 return Diag(TheCall->getLocStart(), diag::err_object_size_invalid_argument) 771 << SourceRange(Arg->getLocStart(), Arg->getLocEnd()); 772 773 if (Arg->isValueDependent()) 774 return false; 775 776 if (!Arg->isIntegerConstantExpr(Result, Context)) { 777 return Diag(TheCall->getLocStart(), diag::err_object_size_invalid_argument) 778 << SourceRange(Arg->getLocStart(), Arg->getLocEnd()); 779 } 780 781 if (Result.getSExtValue() < 0 || Result.getSExtValue() > 3) { 782 return Diag(TheCall->getLocStart(), diag::err_argument_invalid_range) 783 << "0" << "3" << SourceRange(Arg->getLocStart(), Arg->getLocEnd()); 784 } 785 786 return false; 787} 788 789/// SemaBuiltinLongjmp - Handle __builtin_longjmp(void *env[5], int val). 790/// This checks that val is a constant 1. 791bool Sema::SemaBuiltinLongjmp(CallExpr *TheCall) { 792 Expr *Arg = TheCall->getArg(1); 793 if (Arg->isTypeDependent() || Arg->isValueDependent()) 794 return false; 795 796 llvm::APSInt Result(32); 797 if (!Arg->isIntegerConstantExpr(Result, Context) || Result != 1) 798 return Diag(TheCall->getLocStart(), diag::err_builtin_longjmp_invalid_val) 799 << SourceRange(Arg->getLocStart(), Arg->getLocEnd()); 800 801 return false; 802} 803 804// Handle i > 1 ? "x" : "y", recursivelly 805bool Sema::SemaCheckStringLiteral(const Expr *E, const CallExpr *TheCall, 806 bool HasVAListArg, 807 unsigned format_idx, unsigned firstDataArg) { 808 if (E->isTypeDependent() || E->isValueDependent()) 809 return false; 810 811 switch (E->getStmtClass()) { 812 case Stmt::ConditionalOperatorClass: { 813 const ConditionalOperator *C = cast<ConditionalOperator>(E); 814 return SemaCheckStringLiteral(C->getTrueExpr(), TheCall, 815 HasVAListArg, format_idx, firstDataArg) 816 && SemaCheckStringLiteral(C->getRHS(), TheCall, 817 HasVAListArg, format_idx, firstDataArg); 818 } 819 820 case Stmt::ImplicitCastExprClass: { 821 const ImplicitCastExpr *Expr = cast<ImplicitCastExpr>(E); 822 return SemaCheckStringLiteral(Expr->getSubExpr(), TheCall, HasVAListArg, 823 format_idx, firstDataArg); 824 } 825 826 case Stmt::ParenExprClass: { 827 const ParenExpr *Expr = cast<ParenExpr>(E); 828 return SemaCheckStringLiteral(Expr->getSubExpr(), TheCall, HasVAListArg, 829 format_idx, firstDataArg); 830 } 831 832 case Stmt::DeclRefExprClass: { 833 const DeclRefExpr *DR = cast<DeclRefExpr>(E); 834 835 // As an exception, do not flag errors for variables binding to 836 // const string literals. 837 if (const VarDecl *VD = dyn_cast<VarDecl>(DR->getDecl())) { 838 bool isConstant = false; 839 QualType T = DR->getType(); 840 841 if (const ArrayType *AT = Context.getAsArrayType(T)) { 842 isConstant = AT->getElementType().isConstant(Context); 843 } else if (const PointerType *PT = T->getAs<PointerType>()) { 844 isConstant = T.isConstant(Context) && 845 PT->getPointeeType().isConstant(Context); 846 } 847 848 if (isConstant) { 849 if (const Expr *Init = VD->getAnyInitializer()) 850 return SemaCheckStringLiteral(Init, TheCall, 851 HasVAListArg, format_idx, firstDataArg); 852 } 853 854 // For vprintf* functions (i.e., HasVAListArg==true), we add a 855 // special check to see if the format string is a function parameter 856 // of the function calling the printf function. If the function 857 // has an attribute indicating it is a printf-like function, then we 858 // should suppress warnings concerning non-literals being used in a call 859 // to a vprintf function. For example: 860 // 861 // void 862 // logmessage(char const *fmt __attribute__ (format (printf, 1, 2)), ...){ 863 // va_list ap; 864 // va_start(ap, fmt); 865 // vprintf(fmt, ap); // Do NOT emit a warning about "fmt". 866 // ... 867 // 868 // 869 // FIXME: We don't have full attribute support yet, so just check to see 870 // if the argument is a DeclRefExpr that references a parameter. We'll 871 // add proper support for checking the attribute later. 872 if (HasVAListArg) 873 if (isa<ParmVarDecl>(VD)) 874 return true; 875 } 876 877 return false; 878 } 879 880 case Stmt::CallExprClass: { 881 const CallExpr *CE = cast<CallExpr>(E); 882 if (const ImplicitCastExpr *ICE 883 = dyn_cast<ImplicitCastExpr>(CE->getCallee())) { 884 if (const DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(ICE->getSubExpr())) { 885 if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(DRE->getDecl())) { 886 if (const FormatArgAttr *FA = FD->getAttr<FormatArgAttr>()) { 887 unsigned ArgIndex = FA->getFormatIdx(); 888 const Expr *Arg = CE->getArg(ArgIndex - 1); 889 890 return SemaCheckStringLiteral(Arg, TheCall, HasVAListArg, 891 format_idx, firstDataArg); 892 } 893 } 894 } 895 } 896 897 return false; 898 } 899 case Stmt::ObjCStringLiteralClass: 900 case Stmt::StringLiteralClass: { 901 const StringLiteral *StrE = NULL; 902 903 if (const ObjCStringLiteral *ObjCFExpr = dyn_cast<ObjCStringLiteral>(E)) 904 StrE = ObjCFExpr->getString(); 905 else 906 StrE = cast<StringLiteral>(E); 907 908 if (StrE) { 909 CheckPrintfString(StrE, E, TheCall, HasVAListArg, format_idx, 910 firstDataArg); 911 return true; 912 } 913 914 return false; 915 } 916 917 default: 918 return false; 919 } 920} 921 922void 923Sema::CheckNonNullArguments(const NonNullAttr *NonNull, 924 const CallExpr *TheCall) { 925 for (NonNullAttr::iterator i = NonNull->begin(), e = NonNull->end(); 926 i != e; ++i) { 927 const Expr *ArgExpr = TheCall->getArg(*i); 928 if (ArgExpr->isNullPointerConstant(Context, 929 Expr::NPC_ValueDependentIsNotNull)) 930 Diag(TheCall->getCallee()->getLocStart(), diag::warn_null_arg) 931 << ArgExpr->getSourceRange(); 932 } 933} 934 935/// CheckPrintfArguments - Check calls to printf (and similar functions) for 936/// correct use of format strings. 937/// 938/// HasVAListArg - A predicate indicating whether the printf-like 939/// function is passed an explicit va_arg argument (e.g., vprintf) 940/// 941/// format_idx - The index into Args for the format string. 942/// 943/// Improper format strings to functions in the printf family can be 944/// the source of bizarre bugs and very serious security holes. A 945/// good source of information is available in the following paper 946/// (which includes additional references): 947/// 948/// FormatGuard: Automatic Protection From printf Format String 949/// Vulnerabilities, Proceedings of the 10th USENIX Security Symposium, 2001. 950/// 951/// Functionality implemented: 952/// 953/// We can statically check the following properties for string 954/// literal format strings for non v.*printf functions (where the 955/// arguments are passed directly): 956// 957/// (1) Are the number of format conversions equal to the number of 958/// data arguments? 959/// 960/// (2) Does each format conversion correctly match the type of the 961/// corresponding data argument? (TODO) 962/// 963/// Moreover, for all printf functions we can: 964/// 965/// (3) Check for a missing format string (when not caught by type checking). 966/// 967/// (4) Check for no-operation flags; e.g. using "#" with format 968/// conversion 'c' (TODO) 969/// 970/// (5) Check the use of '%n', a major source of security holes. 971/// 972/// (6) Check for malformed format conversions that don't specify anything. 973/// 974/// (7) Check for empty format strings. e.g: printf(""); 975/// 976/// (8) Check that the format string is a wide literal. 977/// 978/// All of these checks can be done by parsing the format string. 979/// 980/// For now, we ONLY do (1), (3), (5), (6), (7), and (8). 981void 982Sema::CheckPrintfArguments(const CallExpr *TheCall, bool HasVAListArg, 983 unsigned format_idx, unsigned firstDataArg) { 984 const Expr *Fn = TheCall->getCallee(); 985 986 // The way the format attribute works in GCC, the implicit this argument 987 // of member functions is counted. However, it doesn't appear in our own 988 // lists, so decrement format_idx in that case. 989 if (isa<CXXMemberCallExpr>(TheCall)) { 990 // Catch a format attribute mistakenly referring to the object argument. 991 if (format_idx == 0) 992 return; 993 --format_idx; 994 if(firstDataArg != 0) 995 --firstDataArg; 996 } 997 998 // CHECK: printf-like function is called with no format string. 999 if (format_idx >= TheCall->getNumArgs()) { 1000 Diag(TheCall->getRParenLoc(), diag::warn_printf_missing_format_string) 1001 << Fn->getSourceRange(); 1002 return; 1003 } 1004 1005 const Expr *OrigFormatExpr = TheCall->getArg(format_idx)->IgnoreParenCasts(); 1006 1007 // CHECK: format string is not a string literal. 1008 // 1009 // Dynamically generated format strings are difficult to 1010 // automatically vet at compile time. Requiring that format strings 1011 // are string literals: (1) permits the checking of format strings by 1012 // the compiler and thereby (2) can practically remove the source of 1013 // many format string exploits. 1014 1015 // Format string can be either ObjC string (e.g. @"%d") or 1016 // C string (e.g. "%d") 1017 // ObjC string uses the same format specifiers as C string, so we can use 1018 // the same format string checking logic for both ObjC and C strings. 1019 if (SemaCheckStringLiteral(OrigFormatExpr, TheCall, HasVAListArg, format_idx, 1020 firstDataArg)) 1021 return; // Literal format string found, check done! 1022 1023 // If there are no arguments specified, warn with -Wformat-security, otherwise 1024 // warn only with -Wformat-nonliteral. 1025 if (TheCall->getNumArgs() == format_idx+1) 1026 Diag(TheCall->getArg(format_idx)->getLocStart(), 1027 diag::warn_printf_nonliteral_noargs) 1028 << OrigFormatExpr->getSourceRange(); 1029 else 1030 Diag(TheCall->getArg(format_idx)->getLocStart(), 1031 diag::warn_printf_nonliteral) 1032 << OrigFormatExpr->getSourceRange(); 1033} 1034 1035namespace { 1036class CheckPrintfHandler : public FormatStringHandler { 1037 Sema &S; 1038 const StringLiteral *FExpr; 1039 const Expr *OrigFormatExpr; 1040 unsigned NumConversions; 1041 const unsigned NumDataArgs; 1042 const bool IsObjCLiteral; 1043 const char *Beg; // Start of format string. 1044 const bool HasVAListArg; 1045 const CallExpr *TheCall; 1046 unsigned FormatIdx; 1047public: 1048 CheckPrintfHandler(Sema &s, const StringLiteral *fexpr, 1049 const Expr *origFormatExpr, 1050 unsigned numDataArgs, bool isObjCLiteral, 1051 const char *beg, bool hasVAListArg, 1052 const CallExpr *theCall, unsigned formatIdx) 1053 : S(s), FExpr(fexpr), OrigFormatExpr(origFormatExpr), 1054 NumConversions(0), NumDataArgs(numDataArgs), 1055 IsObjCLiteral(isObjCLiteral), Beg(beg), 1056 HasVAListArg(hasVAListArg), 1057 TheCall(theCall), FormatIdx(formatIdx) {} 1058 1059 void DoneProcessing(); 1060 1061 void HandleIncompleteFormatSpecifier(const char *startSpecifier, 1062 unsigned specifierLen); 1063 1064 void HandleInvalidConversionSpecifier(const analyze_printf::FormatSpecifier &FS, 1065 const char *startSpecifier, 1066 unsigned specifierLen); 1067 1068 void HandleNullChar(const char *nullCharacter); 1069 1070 bool HandleFormatSpecifier(const analyze_printf::FormatSpecifier &FS, 1071 const char *startSpecifier, 1072 unsigned specifierLen); 1073private: 1074 SourceRange getFormatStringRange(); 1075 SourceRange getFormatSpecifierRange(const char *startSpecifier, 1076 unsigned specifierLen); 1077 SourceLocation getLocationOfByte(const char *x); 1078 1079 bool HandleAmount(const analyze_printf::OptionalAmount &Amt, 1080 unsigned MissingArgDiag, unsigned BadTypeDiag, 1081 const char *startSpecifier, unsigned specifierLen); 1082 1083 bool MatchType(QualType A, QualType B, bool ignoreSign); 1084 1085 const Expr *getDataArg(unsigned i) const; 1086}; 1087} 1088 1089SourceRange CheckPrintfHandler::getFormatStringRange() { 1090 return OrigFormatExpr->getSourceRange(); 1091} 1092 1093SourceRange CheckPrintfHandler:: 1094getFormatSpecifierRange(const char *startSpecifier, unsigned specifierLen) { 1095 return SourceRange(getLocationOfByte(startSpecifier), 1096 getLocationOfByte(startSpecifier+specifierLen-1)); 1097} 1098 1099SourceLocation CheckPrintfHandler::getLocationOfByte(const char *x) { 1100 return S.getLocationOfStringLiteralByte(FExpr, x - Beg); 1101} 1102 1103void CheckPrintfHandler:: 1104HandleIncompleteFormatSpecifier(const char *startSpecifier, 1105 unsigned specifierLen) { 1106 SourceLocation Loc = getLocationOfByte(startSpecifier); 1107 S.Diag(Loc, diag::warn_printf_incomplete_specifier) 1108 << getFormatSpecifierRange(startSpecifier, specifierLen); 1109} 1110 1111void CheckPrintfHandler:: 1112HandleInvalidConversionSpecifier(const analyze_printf::FormatSpecifier &FS, 1113 const char *startSpecifier, 1114 unsigned specifierLen) { 1115 1116 ++NumConversions; 1117 const analyze_printf::ConversionSpecifier &CS = 1118 FS.getConversionSpecifier(); 1119 SourceLocation Loc = getLocationOfByte(CS.getStart()); 1120 S.Diag(Loc, diag::warn_printf_invalid_conversion) 1121 << llvm::StringRef(CS.getStart(), CS.getLength()) 1122 << getFormatSpecifierRange(startSpecifier, specifierLen); 1123} 1124 1125void CheckPrintfHandler::HandleNullChar(const char *nullCharacter) { 1126 // The presence of a null character is likely an error. 1127 S.Diag(getLocationOfByte(nullCharacter), 1128 diag::warn_printf_format_string_contains_null_char) 1129 << getFormatStringRange(); 1130} 1131 1132const Expr *CheckPrintfHandler::getDataArg(unsigned i) const { 1133 return TheCall->getArg(FormatIdx + i); 1134} 1135 1136bool CheckPrintfHandler::MatchType(QualType A, QualType B, bool ignoreSign) { 1137 A = S.Context.getCanonicalType(A).getUnqualifiedType(); 1138 B = S.Context.getCanonicalType(B).getUnqualifiedType(); 1139 1140 if (A == B) 1141 return true; 1142 1143 if (ignoreSign) { 1144 if (const BuiltinType *BT = B->getAs<BuiltinType>()) { 1145 switch (BT->getKind()) { 1146 default: 1147 return false; 1148 case BuiltinType::Char_S: 1149 case BuiltinType::SChar: 1150 return A == S.Context.UnsignedCharTy; 1151 case BuiltinType::Char_U: 1152 case BuiltinType::UChar: 1153 return A == S.Context.SignedCharTy; 1154 case BuiltinType::Short: 1155 return A == S.Context.UnsignedShortTy; 1156 case BuiltinType::UShort: 1157 return A == S.Context.ShortTy; 1158 case BuiltinType::Int: 1159 return A == S.Context.UnsignedIntTy; 1160 case BuiltinType::UInt: 1161 return A == S.Context.IntTy; 1162 case BuiltinType::Long: 1163 return A == S.Context.UnsignedLongTy; 1164 case BuiltinType::ULong: 1165 return A == S.Context.LongTy; 1166 case BuiltinType::LongLong: 1167 return A == S.Context.UnsignedLongLongTy; 1168 case BuiltinType::ULongLong: 1169 return A == S.Context.LongLongTy; 1170 } 1171 return A == B; 1172 } 1173 } 1174 return false; 1175} 1176 1177bool 1178CheckPrintfHandler::HandleAmount(const analyze_printf::OptionalAmount &Amt, 1179 unsigned MissingArgDiag, 1180 unsigned BadTypeDiag, 1181 const char *startSpecifier, 1182 unsigned specifierLen) { 1183 1184 if (Amt.hasDataArgument()) { 1185 ++NumConversions; 1186 if (!HasVAListArg) { 1187 if (NumConversions > NumDataArgs) { 1188 S.Diag(getLocationOfByte(Amt.getStart()), MissingArgDiag) 1189 << getFormatSpecifierRange(startSpecifier, specifierLen); 1190 // Don't do any more checking. We will just emit 1191 // spurious errors. 1192 return false; 1193 } 1194 1195 // Type check the data argument. It should be an 'int'. 1196 // Although not in conformance with C99, we also allow the argument to be 1197 // an 'unsigned int' as that is a reasonably safe case. GCC also 1198 // doesn't emit a warning for that case. 1199 const Expr *Arg = getDataArg(NumConversions); 1200 QualType T = Arg->getType(); 1201 if (!MatchType(T, S.Context.IntTy, true)) { 1202 S.Diag(getLocationOfByte(Amt.getStart()), BadTypeDiag) 1203 << S.Context.IntTy << T 1204 << getFormatSpecifierRange(startSpecifier, specifierLen) 1205 << Arg->getSourceRange(); 1206 // Don't do any more checking. We will just emit 1207 // spurious errors. 1208 return false; 1209 } 1210 } 1211 } 1212 return true; 1213} 1214 1215bool 1216CheckPrintfHandler::HandleFormatSpecifier(const analyze_printf::FormatSpecifier &FS, 1217 const char *startSpecifier, 1218 unsigned specifierLen) { 1219 1220 using namespace analyze_printf; 1221 const ConversionSpecifier &CS = FS.getConversionSpecifier(); 1222 1223 // First check if the field width, precision, and conversion specifier 1224 // have matching data arguments. 1225 if (!HandleAmount(FS.getFieldWidth(), 1226 diag::warn_printf_asterisk_width_missing_arg, 1227 diag::warn_printf_asterisk_width_wrong_type, 1228 startSpecifier, specifierLen)) { 1229 return false; 1230 } 1231 1232 if (!HandleAmount(FS.getPrecision(), 1233 diag::warn_printf_asterisk_precision_missing_arg, 1234 diag::warn_printf_asterisk_precision_wrong_type, 1235 startSpecifier, specifierLen)) { 1236 return false; 1237 } 1238 1239 // Check for using an Objective-C specific conversion specifier 1240 // in a non-ObjC literal. 1241 if (!IsObjCLiteral && CS.isObjCArg()) { 1242 HandleInvalidConversionSpecifier(FS, startSpecifier, specifierLen); 1243 1244 // Continue checking the other format specifiers. 1245 return true; 1246 } 1247 1248 if (!CS.consumesDataArgument()) { 1249 // FIXME: Technically specifying a precision or field width here 1250 // makes no sense. Worth issuing a warning at some point. 1251 return true; 1252 } 1253 1254 ++NumConversions; 1255 1256 // Are we using '%n'? Issue a warning about this being 1257 // a possible security issue. 1258 if (CS.getKind() == ConversionSpecifier::OutIntPtrArg) { 1259 S.Diag(getLocationOfByte(CS.getStart()), diag::warn_printf_write_back) 1260 << getFormatSpecifierRange(startSpecifier, specifierLen); 1261 // Continue checking the other format specifiers. 1262 return true; 1263 } 1264 1265 1266 // The remaining checks depend on the data arguments. 1267 if (HasVAListArg) 1268 return true; 1269 1270 if (NumConversions > NumDataArgs) { 1271 S.Diag(getLocationOfByte(CS.getStart()), 1272 diag::warn_printf_insufficient_data_args) 1273 << getFormatSpecifierRange(startSpecifier, specifierLen); 1274 // Don't do any more checking. 1275 return false; 1276 } 1277 1278 // Now type check the data expression that matches the 1279 // format specifier. 1280 const Expr *Ex = getDataArg(NumConversions); 1281 const analyze_printf::ArgTypeResult &ATR = FS.getArgType(S.Context); 1282 1283 if (const QualType *T = ATR.getSpecificType()) { 1284 if (!MatchType(*T, Ex->getType(), true)) { 1285 // Check if we didn't match because of an implicit cast from a 'char' 1286 // or 'short' to an 'int'. This is done because printf is a varargs 1287 // function. 1288 if (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(Ex)) 1289 if (ICE->getType() == S.Context.IntTy) 1290 if (MatchType(*T, ICE->getSubExpr()->getType(), true)) 1291 return true; 1292 1293 S.Diag(getLocationOfByte(CS.getStart()), 1294 diag::warn_printf_conversion_argument_type_mismatch) 1295 << *T << Ex->getType() 1296 << getFormatSpecifierRange(startSpecifier, specifierLen) 1297 << Ex->getSourceRange(); 1298 } 1299 return true; 1300 } 1301 1302 return true; 1303} 1304 1305void CheckPrintfHandler::DoneProcessing() { 1306 // Does the number of data arguments exceed the number of 1307 // format conversions in the format string? 1308 if (!HasVAListArg && NumConversions < NumDataArgs) 1309 S.Diag(getDataArg(NumConversions+1)->getLocStart(), 1310 diag::warn_printf_too_many_data_args) 1311 << getFormatStringRange(); 1312} 1313 1314void Sema::CheckPrintfString(const StringLiteral *FExpr, 1315 const Expr *OrigFormatExpr, 1316 const CallExpr *TheCall, bool HasVAListArg, 1317 unsigned format_idx, unsigned firstDataArg) { 1318 1319 // CHECK: is the format string a wide literal? 1320 if (FExpr->isWide()) { 1321 Diag(FExpr->getLocStart(), 1322 diag::warn_printf_format_string_is_wide_literal) 1323 << OrigFormatExpr->getSourceRange(); 1324 return; 1325 } 1326 1327 // Str - The format string. NOTE: this is NOT null-terminated! 1328 const char *Str = FExpr->getStrData(); 1329 1330 // CHECK: empty format string? 1331 unsigned StrLen = FExpr->getByteLength(); 1332 1333 if (StrLen == 0) { 1334 Diag(FExpr->getLocStart(), diag::warn_printf_empty_format_string) 1335 << OrigFormatExpr->getSourceRange(); 1336 return; 1337 } 1338 1339 CheckPrintfHandler H(*this, FExpr, OrigFormatExpr, 1340 TheCall->getNumArgs() - firstDataArg, 1341 isa<ObjCStringLiteral>(OrigFormatExpr), Str, 1342 HasVAListArg, TheCall, format_idx); 1343 1344 if (!ParseFormatString(H, Str, Str + StrLen)) 1345 H.DoneProcessing(); 1346} 1347 1348//===--- CHECK: Return Address of Stack Variable --------------------------===// 1349 1350static DeclRefExpr* EvalVal(Expr *E); 1351static DeclRefExpr* EvalAddr(Expr* E); 1352 1353/// CheckReturnStackAddr - Check if a return statement returns the address 1354/// of a stack variable. 1355void 1356Sema::CheckReturnStackAddr(Expr *RetValExp, QualType lhsType, 1357 SourceLocation ReturnLoc) { 1358 1359 // Perform checking for returned stack addresses. 1360 if (lhsType->isPointerType() || lhsType->isBlockPointerType()) { 1361 if (DeclRefExpr *DR = EvalAddr(RetValExp)) 1362 Diag(DR->getLocStart(), diag::warn_ret_stack_addr) 1363 << DR->getDecl()->getDeclName() << RetValExp->getSourceRange(); 1364 1365 // Skip over implicit cast expressions when checking for block expressions. 1366 RetValExp = RetValExp->IgnoreParenCasts(); 1367 1368 if (BlockExpr *C = dyn_cast<BlockExpr>(RetValExp)) 1369 if (C->hasBlockDeclRefExprs()) 1370 Diag(C->getLocStart(), diag::err_ret_local_block) 1371 << C->getSourceRange(); 1372 1373 if (AddrLabelExpr *ALE = dyn_cast<AddrLabelExpr>(RetValExp)) 1374 Diag(ALE->getLocStart(), diag::warn_ret_addr_label) 1375 << ALE->getSourceRange(); 1376 1377 } else if (lhsType->isReferenceType()) { 1378 // Perform checking for stack values returned by reference. 1379 // Check for a reference to the stack 1380 if (DeclRefExpr *DR = EvalVal(RetValExp)) 1381 Diag(DR->getLocStart(), diag::warn_ret_stack_ref) 1382 << DR->getDecl()->getDeclName() << RetValExp->getSourceRange(); 1383 } 1384} 1385 1386/// EvalAddr - EvalAddr and EvalVal are mutually recursive functions that 1387/// check if the expression in a return statement evaluates to an address 1388/// to a location on the stack. The recursion is used to traverse the 1389/// AST of the return expression, with recursion backtracking when we 1390/// encounter a subexpression that (1) clearly does not lead to the address 1391/// of a stack variable or (2) is something we cannot determine leads to 1392/// the address of a stack variable based on such local checking. 1393/// 1394/// EvalAddr processes expressions that are pointers that are used as 1395/// references (and not L-values). EvalVal handles all other values. 1396/// At the base case of the recursion is a check for a DeclRefExpr* in 1397/// the refers to a stack variable. 1398/// 1399/// This implementation handles: 1400/// 1401/// * pointer-to-pointer casts 1402/// * implicit conversions from array references to pointers 1403/// * taking the address of fields 1404/// * arbitrary interplay between "&" and "*" operators 1405/// * pointer arithmetic from an address of a stack variable 1406/// * taking the address of an array element where the array is on the stack 1407static DeclRefExpr* EvalAddr(Expr *E) { 1408 // We should only be called for evaluating pointer expressions. 1409 assert((E->getType()->isAnyPointerType() || 1410 E->getType()->isBlockPointerType() || 1411 E->getType()->isObjCQualifiedIdType()) && 1412 "EvalAddr only works on pointers"); 1413 1414 // Our "symbolic interpreter" is just a dispatch off the currently 1415 // viewed AST node. We then recursively traverse the AST by calling 1416 // EvalAddr and EvalVal appropriately. 1417 switch (E->getStmtClass()) { 1418 case Stmt::ParenExprClass: 1419 // Ignore parentheses. 1420 return EvalAddr(cast<ParenExpr>(E)->getSubExpr()); 1421 1422 case Stmt::UnaryOperatorClass: { 1423 // The only unary operator that make sense to handle here 1424 // is AddrOf. All others don't make sense as pointers. 1425 UnaryOperator *U = cast<UnaryOperator>(E); 1426 1427 if (U->getOpcode() == UnaryOperator::AddrOf) 1428 return EvalVal(U->getSubExpr()); 1429 else 1430 return NULL; 1431 } 1432 1433 case Stmt::BinaryOperatorClass: { 1434 // Handle pointer arithmetic. All other binary operators are not valid 1435 // in this context. 1436 BinaryOperator *B = cast<BinaryOperator>(E); 1437 BinaryOperator::Opcode op = B->getOpcode(); 1438 1439 if (op != BinaryOperator::Add && op != BinaryOperator::Sub) 1440 return NULL; 1441 1442 Expr *Base = B->getLHS(); 1443 1444 // Determine which argument is the real pointer base. It could be 1445 // the RHS argument instead of the LHS. 1446 if (!Base->getType()->isPointerType()) Base = B->getRHS(); 1447 1448 assert (Base->getType()->isPointerType()); 1449 return EvalAddr(Base); 1450 } 1451 1452 // For conditional operators we need to see if either the LHS or RHS are 1453 // valid DeclRefExpr*s. If one of them is valid, we return it. 1454 case Stmt::ConditionalOperatorClass: { 1455 ConditionalOperator *C = cast<ConditionalOperator>(E); 1456 1457 // Handle the GNU extension for missing LHS. 1458 if (Expr *lhsExpr = C->getLHS()) 1459 if (DeclRefExpr* LHS = EvalAddr(lhsExpr)) 1460 return LHS; 1461 1462 return EvalAddr(C->getRHS()); 1463 } 1464 1465 // For casts, we need to handle conversions from arrays to 1466 // pointer values, and pointer-to-pointer conversions. 1467 case Stmt::ImplicitCastExprClass: 1468 case Stmt::CStyleCastExprClass: 1469 case Stmt::CXXFunctionalCastExprClass: { 1470 Expr* SubExpr = cast<CastExpr>(E)->getSubExpr(); 1471 QualType T = SubExpr->getType(); 1472 1473 if (SubExpr->getType()->isPointerType() || 1474 SubExpr->getType()->isBlockPointerType() || 1475 SubExpr->getType()->isObjCQualifiedIdType()) 1476 return EvalAddr(SubExpr); 1477 else if (T->isArrayType()) 1478 return EvalVal(SubExpr); 1479 else 1480 return 0; 1481 } 1482 1483 // C++ casts. For dynamic casts, static casts, and const casts, we 1484 // are always converting from a pointer-to-pointer, so we just blow 1485 // through the cast. In the case the dynamic cast doesn't fail (and 1486 // return NULL), we take the conservative route and report cases 1487 // where we return the address of a stack variable. For Reinterpre 1488 // FIXME: The comment about is wrong; we're not always converting 1489 // from pointer to pointer. I'm guessing that this code should also 1490 // handle references to objects. 1491 case Stmt::CXXStaticCastExprClass: 1492 case Stmt::CXXDynamicCastExprClass: 1493 case Stmt::CXXConstCastExprClass: 1494 case Stmt::CXXReinterpretCastExprClass: { 1495 Expr *S = cast<CXXNamedCastExpr>(E)->getSubExpr(); 1496 if (S->getType()->isPointerType() || S->getType()->isBlockPointerType()) 1497 return EvalAddr(S); 1498 else 1499 return NULL; 1500 } 1501 1502 // Everything else: we simply don't reason about them. 1503 default: 1504 return NULL; 1505 } 1506} 1507 1508 1509/// EvalVal - This function is complements EvalAddr in the mutual recursion. 1510/// See the comments for EvalAddr for more details. 1511static DeclRefExpr* EvalVal(Expr *E) { 1512 1513 // We should only be called for evaluating non-pointer expressions, or 1514 // expressions with a pointer type that are not used as references but instead 1515 // are l-values (e.g., DeclRefExpr with a pointer type). 1516 1517 // Our "symbolic interpreter" is just a dispatch off the currently 1518 // viewed AST node. We then recursively traverse the AST by calling 1519 // EvalAddr and EvalVal appropriately. 1520 switch (E->getStmtClass()) { 1521 case Stmt::DeclRefExprClass: { 1522 // DeclRefExpr: the base case. When we hit a DeclRefExpr we are looking 1523 // at code that refers to a variable's name. We check if it has local 1524 // storage within the function, and if so, return the expression. 1525 DeclRefExpr *DR = cast<DeclRefExpr>(E); 1526 1527 if (VarDecl *V = dyn_cast<VarDecl>(DR->getDecl())) 1528 if (V->hasLocalStorage() && !V->getType()->isReferenceType()) return DR; 1529 1530 return NULL; 1531 } 1532 1533 case Stmt::ParenExprClass: 1534 // Ignore parentheses. 1535 return EvalVal(cast<ParenExpr>(E)->getSubExpr()); 1536 1537 case Stmt::UnaryOperatorClass: { 1538 // The only unary operator that make sense to handle here 1539 // is Deref. All others don't resolve to a "name." This includes 1540 // handling all sorts of rvalues passed to a unary operator. 1541 UnaryOperator *U = cast<UnaryOperator>(E); 1542 1543 if (U->getOpcode() == UnaryOperator::Deref) 1544 return EvalAddr(U->getSubExpr()); 1545 1546 return NULL; 1547 } 1548 1549 case Stmt::ArraySubscriptExprClass: { 1550 // Array subscripts are potential references to data on the stack. We 1551 // retrieve the DeclRefExpr* for the array variable if it indeed 1552 // has local storage. 1553 return EvalAddr(cast<ArraySubscriptExpr>(E)->getBase()); 1554 } 1555 1556 case Stmt::ConditionalOperatorClass: { 1557 // For conditional operators we need to see if either the LHS or RHS are 1558 // non-NULL DeclRefExpr's. If one is non-NULL, we return it. 1559 ConditionalOperator *C = cast<ConditionalOperator>(E); 1560 1561 // Handle the GNU extension for missing LHS. 1562 if (Expr *lhsExpr = C->getLHS()) 1563 if (DeclRefExpr *LHS = EvalVal(lhsExpr)) 1564 return LHS; 1565 1566 return EvalVal(C->getRHS()); 1567 } 1568 1569 // Accesses to members are potential references to data on the stack. 1570 case Stmt::MemberExprClass: { 1571 MemberExpr *M = cast<MemberExpr>(E); 1572 1573 // Check for indirect access. We only want direct field accesses. 1574 if (!M->isArrow()) 1575 return EvalVal(M->getBase()); 1576 else 1577 return NULL; 1578 } 1579 1580 // Everything else: we simply don't reason about them. 1581 default: 1582 return NULL; 1583 } 1584} 1585 1586//===--- CHECK: Floating-Point comparisons (-Wfloat-equal) ---------------===// 1587 1588/// Check for comparisons of floating point operands using != and ==. 1589/// Issue a warning if these are no self-comparisons, as they are not likely 1590/// to do what the programmer intended. 1591void Sema::CheckFloatComparison(SourceLocation loc, Expr* lex, Expr *rex) { 1592 bool EmitWarning = true; 1593 1594 Expr* LeftExprSansParen = lex->IgnoreParens(); 1595 Expr* RightExprSansParen = rex->IgnoreParens(); 1596 1597 // Special case: check for x == x (which is OK). 1598 // Do not emit warnings for such cases. 1599 if (DeclRefExpr* DRL = dyn_cast<DeclRefExpr>(LeftExprSansParen)) 1600 if (DeclRefExpr* DRR = dyn_cast<DeclRefExpr>(RightExprSansParen)) 1601 if (DRL->getDecl() == DRR->getDecl()) 1602 EmitWarning = false; 1603 1604 1605 // Special case: check for comparisons against literals that can be exactly 1606 // represented by APFloat. In such cases, do not emit a warning. This 1607 // is a heuristic: often comparison against such literals are used to 1608 // detect if a value in a variable has not changed. This clearly can 1609 // lead to false negatives. 1610 if (EmitWarning) { 1611 if (FloatingLiteral* FLL = dyn_cast<FloatingLiteral>(LeftExprSansParen)) { 1612 if (FLL->isExact()) 1613 EmitWarning = false; 1614 } else 1615 if (FloatingLiteral* FLR = dyn_cast<FloatingLiteral>(RightExprSansParen)){ 1616 if (FLR->isExact()) 1617 EmitWarning = false; 1618 } 1619 } 1620 1621 // Check for comparisons with builtin types. 1622 if (EmitWarning) 1623 if (CallExpr* CL = dyn_cast<CallExpr>(LeftExprSansParen)) 1624 if (CL->isBuiltinCall(Context)) 1625 EmitWarning = false; 1626 1627 if (EmitWarning) 1628 if (CallExpr* CR = dyn_cast<CallExpr>(RightExprSansParen)) 1629 if (CR->isBuiltinCall(Context)) 1630 EmitWarning = false; 1631 1632 // Emit the diagnostic. 1633 if (EmitWarning) 1634 Diag(loc, diag::warn_floatingpoint_eq) 1635 << lex->getSourceRange() << rex->getSourceRange(); 1636} 1637 1638//===--- CHECK: Integer mixed-sign comparisons (-Wsign-compare) --------===// 1639//===--- CHECK: Lossy implicit conversions (-Wconversion) --------------===// 1640 1641namespace { 1642 1643/// Structure recording the 'active' range of an integer-valued 1644/// expression. 1645struct IntRange { 1646 /// The number of bits active in the int. 1647 unsigned Width; 1648 1649 /// True if the int is known not to have negative values. 1650 bool NonNegative; 1651 1652 IntRange() {} 1653 IntRange(unsigned Width, bool NonNegative) 1654 : Width(Width), NonNegative(NonNegative) 1655 {} 1656 1657 // Returns the range of the bool type. 1658 static IntRange forBoolType() { 1659 return IntRange(1, true); 1660 } 1661 1662 // Returns the range of an integral type. 1663 static IntRange forType(ASTContext &C, QualType T) { 1664 return forCanonicalType(C, T->getCanonicalTypeInternal().getTypePtr()); 1665 } 1666 1667 // Returns the range of an integeral type based on its canonical 1668 // representation. 1669 static IntRange forCanonicalType(ASTContext &C, const Type *T) { 1670 assert(T->isCanonicalUnqualified()); 1671 1672 if (const VectorType *VT = dyn_cast<VectorType>(T)) 1673 T = VT->getElementType().getTypePtr(); 1674 if (const ComplexType *CT = dyn_cast<ComplexType>(T)) 1675 T = CT->getElementType().getTypePtr(); 1676 if (const EnumType *ET = dyn_cast<EnumType>(T)) 1677 T = ET->getDecl()->getIntegerType().getTypePtr(); 1678 1679 const BuiltinType *BT = cast<BuiltinType>(T); 1680 assert(BT->isInteger()); 1681 1682 return IntRange(C.getIntWidth(QualType(T, 0)), BT->isUnsignedInteger()); 1683 } 1684 1685 // Returns the supremum of two ranges: i.e. their conservative merge. 1686 static IntRange join(const IntRange &L, const IntRange &R) { 1687 return IntRange(std::max(L.Width, R.Width), 1688 L.NonNegative && R.NonNegative); 1689 } 1690 1691 // Returns the infinum of two ranges: i.e. their aggressive merge. 1692 static IntRange meet(const IntRange &L, const IntRange &R) { 1693 return IntRange(std::min(L.Width, R.Width), 1694 L.NonNegative || R.NonNegative); 1695 } 1696}; 1697 1698IntRange GetValueRange(ASTContext &C, llvm::APSInt &value, unsigned MaxWidth) { 1699 if (value.isSigned() && value.isNegative()) 1700 return IntRange(value.getMinSignedBits(), false); 1701 1702 if (value.getBitWidth() > MaxWidth) 1703 value.trunc(MaxWidth); 1704 1705 // isNonNegative() just checks the sign bit without considering 1706 // signedness. 1707 return IntRange(value.getActiveBits(), true); 1708} 1709 1710IntRange GetValueRange(ASTContext &C, APValue &result, QualType Ty, 1711 unsigned MaxWidth) { 1712 if (result.isInt()) 1713 return GetValueRange(C, result.getInt(), MaxWidth); 1714 1715 if (result.isVector()) { 1716 IntRange R = GetValueRange(C, result.getVectorElt(0), Ty, MaxWidth); 1717 for (unsigned i = 1, e = result.getVectorLength(); i != e; ++i) { 1718 IntRange El = GetValueRange(C, result.getVectorElt(i), Ty, MaxWidth); 1719 R = IntRange::join(R, El); 1720 } 1721 return R; 1722 } 1723 1724 if (result.isComplexInt()) { 1725 IntRange R = GetValueRange(C, result.getComplexIntReal(), MaxWidth); 1726 IntRange I = GetValueRange(C, result.getComplexIntImag(), MaxWidth); 1727 return IntRange::join(R, I); 1728 } 1729 1730 // This can happen with lossless casts to intptr_t of "based" lvalues. 1731 // Assume it might use arbitrary bits. 1732 // FIXME: The only reason we need to pass the type in here is to get 1733 // the sign right on this one case. It would be nice if APValue 1734 // preserved this. 1735 assert(result.isLValue()); 1736 return IntRange(MaxWidth, Ty->isUnsignedIntegerType()); 1737} 1738 1739/// Pseudo-evaluate the given integer expression, estimating the 1740/// range of values it might take. 1741/// 1742/// \param MaxWidth - the width to which the value will be truncated 1743IntRange GetExprRange(ASTContext &C, Expr *E, unsigned MaxWidth) { 1744 E = E->IgnoreParens(); 1745 1746 // Try a full evaluation first. 1747 Expr::EvalResult result; 1748 if (E->Evaluate(result, C)) 1749 return GetValueRange(C, result.Val, E->getType(), MaxWidth); 1750 1751 // I think we only want to look through implicit casts here; if the 1752 // user has an explicit widening cast, we should treat the value as 1753 // being of the new, wider type. 1754 if (ImplicitCastExpr *CE = dyn_cast<ImplicitCastExpr>(E)) { 1755 if (CE->getCastKind() == CastExpr::CK_NoOp) 1756 return GetExprRange(C, CE->getSubExpr(), MaxWidth); 1757 1758 IntRange OutputTypeRange = IntRange::forType(C, CE->getType()); 1759 1760 bool isIntegerCast = (CE->getCastKind() == CastExpr::CK_IntegralCast); 1761 if (!isIntegerCast && CE->getCastKind() == CastExpr::CK_Unknown) 1762 isIntegerCast = CE->getSubExpr()->getType()->isIntegerType(); 1763 1764 // Assume that non-integer casts can span the full range of the type. 1765 if (!isIntegerCast) 1766 return OutputTypeRange; 1767 1768 IntRange SubRange 1769 = GetExprRange(C, CE->getSubExpr(), 1770 std::min(MaxWidth, OutputTypeRange.Width)); 1771 1772 // Bail out if the subexpr's range is as wide as the cast type. 1773 if (SubRange.Width >= OutputTypeRange.Width) 1774 return OutputTypeRange; 1775 1776 // Otherwise, we take the smaller width, and we're non-negative if 1777 // either the output type or the subexpr is. 1778 return IntRange(SubRange.Width, 1779 SubRange.NonNegative || OutputTypeRange.NonNegative); 1780 } 1781 1782 if (ConditionalOperator *CO = dyn_cast<ConditionalOperator>(E)) { 1783 // If we can fold the condition, just take that operand. 1784 bool CondResult; 1785 if (CO->getCond()->EvaluateAsBooleanCondition(CondResult, C)) 1786 return GetExprRange(C, CondResult ? CO->getTrueExpr() 1787 : CO->getFalseExpr(), 1788 MaxWidth); 1789 1790 // Otherwise, conservatively merge. 1791 IntRange L = GetExprRange(C, CO->getTrueExpr(), MaxWidth); 1792 IntRange R = GetExprRange(C, CO->getFalseExpr(), MaxWidth); 1793 return IntRange::join(L, R); 1794 } 1795 1796 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(E)) { 1797 switch (BO->getOpcode()) { 1798 1799 // Boolean-valued operations are single-bit and positive. 1800 case BinaryOperator::LAnd: 1801 case BinaryOperator::LOr: 1802 case BinaryOperator::LT: 1803 case BinaryOperator::GT: 1804 case BinaryOperator::LE: 1805 case BinaryOperator::GE: 1806 case BinaryOperator::EQ: 1807 case BinaryOperator::NE: 1808 return IntRange::forBoolType(); 1809 1810 // Operations with opaque sources are black-listed. 1811 case BinaryOperator::PtrMemD: 1812 case BinaryOperator::PtrMemI: 1813 return IntRange::forType(C, E->getType()); 1814 1815 // Bitwise-and uses the *infinum* of the two source ranges. 1816 case BinaryOperator::And: 1817 return IntRange::meet(GetExprRange(C, BO->getLHS(), MaxWidth), 1818 GetExprRange(C, BO->getRHS(), MaxWidth)); 1819 1820 // Left shift gets black-listed based on a judgement call. 1821 case BinaryOperator::Shl: 1822 return IntRange::forType(C, E->getType()); 1823 1824 // Right shift by a constant can narrow its left argument. 1825 case BinaryOperator::Shr: { 1826 IntRange L = GetExprRange(C, BO->getLHS(), MaxWidth); 1827 1828 // If the shift amount is a positive constant, drop the width by 1829 // that much. 1830 llvm::APSInt shift; 1831 if (BO->getRHS()->isIntegerConstantExpr(shift, C) && 1832 shift.isNonNegative()) { 1833 unsigned zext = shift.getZExtValue(); 1834 if (zext >= L.Width) 1835 L.Width = (L.NonNegative ? 0 : 1); 1836 else 1837 L.Width -= zext; 1838 } 1839 1840 return L; 1841 } 1842 1843 // Comma acts as its right operand. 1844 case BinaryOperator::Comma: 1845 return GetExprRange(C, BO->getRHS(), MaxWidth); 1846 1847 // Black-list pointer subtractions. 1848 case BinaryOperator::Sub: 1849 if (BO->getLHS()->getType()->isPointerType()) 1850 return IntRange::forType(C, E->getType()); 1851 // fallthrough 1852 1853 default: 1854 break; 1855 } 1856 1857 // Treat every other operator as if it were closed on the 1858 // narrowest type that encompasses both operands. 1859 IntRange L = GetExprRange(C, BO->getLHS(), MaxWidth); 1860 IntRange R = GetExprRange(C, BO->getRHS(), MaxWidth); 1861 return IntRange::join(L, R); 1862 } 1863 1864 if (UnaryOperator *UO = dyn_cast<UnaryOperator>(E)) { 1865 switch (UO->getOpcode()) { 1866 // Boolean-valued operations are white-listed. 1867 case UnaryOperator::LNot: 1868 return IntRange::forBoolType(); 1869 1870 // Operations with opaque sources are black-listed. 1871 case UnaryOperator::Deref: 1872 case UnaryOperator::AddrOf: // should be impossible 1873 case UnaryOperator::OffsetOf: 1874 return IntRange::forType(C, E->getType()); 1875 1876 default: 1877 return GetExprRange(C, UO->getSubExpr(), MaxWidth); 1878 } 1879 } 1880 1881 FieldDecl *BitField = E->getBitField(); 1882 if (BitField) { 1883 llvm::APSInt BitWidthAP = BitField->getBitWidth()->EvaluateAsInt(C); 1884 unsigned BitWidth = BitWidthAP.getZExtValue(); 1885 1886 return IntRange(BitWidth, BitField->getType()->isUnsignedIntegerType()); 1887 } 1888 1889 return IntRange::forType(C, E->getType()); 1890} 1891 1892/// Checks whether the given value, which currently has the given 1893/// source semantics, has the same value when coerced through the 1894/// target semantics. 1895bool IsSameFloatAfterCast(const llvm::APFloat &value, 1896 const llvm::fltSemantics &Src, 1897 const llvm::fltSemantics &Tgt) { 1898 llvm::APFloat truncated = value; 1899 1900 bool ignored; 1901 truncated.convert(Src, llvm::APFloat::rmNearestTiesToEven, &ignored); 1902 truncated.convert(Tgt, llvm::APFloat::rmNearestTiesToEven, &ignored); 1903 1904 return truncated.bitwiseIsEqual(value); 1905} 1906 1907/// Checks whether the given value, which currently has the given 1908/// source semantics, has the same value when coerced through the 1909/// target semantics. 1910/// 1911/// The value might be a vector of floats (or a complex number). 1912bool IsSameFloatAfterCast(const APValue &value, 1913 const llvm::fltSemantics &Src, 1914 const llvm::fltSemantics &Tgt) { 1915 if (value.isFloat()) 1916 return IsSameFloatAfterCast(value.getFloat(), Src, Tgt); 1917 1918 if (value.isVector()) { 1919 for (unsigned i = 0, e = value.getVectorLength(); i != e; ++i) 1920 if (!IsSameFloatAfterCast(value.getVectorElt(i), Src, Tgt)) 1921 return false; 1922 return true; 1923 } 1924 1925 assert(value.isComplexFloat()); 1926 return (IsSameFloatAfterCast(value.getComplexFloatReal(), Src, Tgt) && 1927 IsSameFloatAfterCast(value.getComplexFloatImag(), Src, Tgt)); 1928} 1929 1930} // end anonymous namespace 1931 1932/// \brief Implements -Wsign-compare. 1933/// 1934/// \param lex the left-hand expression 1935/// \param rex the right-hand expression 1936/// \param OpLoc the location of the joining operator 1937/// \param Equality whether this is an "equality-like" join, which 1938/// suppresses the warning in some cases 1939void Sema::CheckSignCompare(Expr *lex, Expr *rex, SourceLocation OpLoc, 1940 const PartialDiagnostic &PD, bool Equality) { 1941 // Don't warn if we're in an unevaluated context. 1942 if (ExprEvalContexts.back().Context == Unevaluated) 1943 return; 1944 1945 // If either expression is value-dependent, don't warn. We'll get another 1946 // chance at instantiation time. 1947 if (lex->isValueDependent() || rex->isValueDependent()) 1948 return; 1949 1950 QualType lt = lex->getType(), rt = rex->getType(); 1951 1952 // Only warn if both operands are integral. 1953 if (!lt->isIntegerType() || !rt->isIntegerType()) 1954 return; 1955 1956 // In C, the width of a bitfield determines its type, and the 1957 // declared type only contributes the signedness. This duplicates 1958 // the work that will later be done by UsualUnaryConversions. 1959 // Eventually, this check will be reorganized in a way that avoids 1960 // this duplication. 1961 if (!getLangOptions().CPlusPlus) { 1962 QualType tmp; 1963 tmp = Context.isPromotableBitField(lex); 1964 if (!tmp.isNull()) lt = tmp; 1965 tmp = Context.isPromotableBitField(rex); 1966 if (!tmp.isNull()) rt = tmp; 1967 } 1968 1969 // The rule is that the signed operand becomes unsigned, so isolate the 1970 // signed operand. 1971 Expr *signedOperand = lex, *unsignedOperand = rex; 1972 QualType signedType = lt, unsignedType = rt; 1973 if (lt->isSignedIntegerType()) { 1974 if (rt->isSignedIntegerType()) return; 1975 } else { 1976 if (!rt->isSignedIntegerType()) return; 1977 std::swap(signedOperand, unsignedOperand); 1978 std::swap(signedType, unsignedType); 1979 } 1980 1981 unsigned unsignedWidth = Context.getIntWidth(unsignedType); 1982 unsigned signedWidth = Context.getIntWidth(signedType); 1983 1984 // If the unsigned type is strictly smaller than the signed type, 1985 // then (1) the result type will be signed and (2) the unsigned 1986 // value will fit fully within the signed type, and thus the result 1987 // of the comparison will be exact. 1988 if (signedWidth > unsignedWidth) 1989 return; 1990 1991 // Otherwise, calculate the effective ranges. 1992 IntRange signedRange = GetExprRange(Context, signedOperand, signedWidth); 1993 IntRange unsignedRange = GetExprRange(Context, unsignedOperand, unsignedWidth); 1994 1995 // We should never be unable to prove that the unsigned operand is 1996 // non-negative. 1997 assert(unsignedRange.NonNegative && "unsigned range includes negative?"); 1998 1999 // If the signed operand is non-negative, then the signed->unsigned 2000 // conversion won't change it. 2001 if (signedRange.NonNegative) 2002 return; 2003 2004 // For (in)equality comparisons, if the unsigned operand is a 2005 // constant which cannot collide with a overflowed signed operand, 2006 // then reinterpreting the signed operand as unsigned will not 2007 // change the result of the comparison. 2008 if (Equality && unsignedRange.Width < unsignedWidth) 2009 return; 2010 2011 Diag(OpLoc, PD) 2012 << lt << rt << lex->getSourceRange() << rex->getSourceRange(); 2013} 2014 2015/// Diagnose an implicit cast; purely a helper for CheckImplicitConversion. 2016static void DiagnoseImpCast(Sema &S, Expr *E, QualType T, unsigned diag) { 2017 S.Diag(E->getExprLoc(), diag) << E->getType() << T << E->getSourceRange(); 2018} 2019 2020/// Implements -Wconversion. 2021void Sema::CheckImplicitConversion(Expr *E, QualType T) { 2022 // Don't diagnose in unevaluated contexts. 2023 if (ExprEvalContexts.back().Context == Sema::Unevaluated) 2024 return; 2025 2026 // Don't diagnose for value-dependent expressions. 2027 if (E->isValueDependent()) 2028 return; 2029 2030 const Type *Source = Context.getCanonicalType(E->getType()).getTypePtr(); 2031 const Type *Target = Context.getCanonicalType(T).getTypePtr(); 2032 2033 // Never diagnose implicit casts to bool. 2034 if (Target->isSpecificBuiltinType(BuiltinType::Bool)) 2035 return; 2036 2037 // Strip vector types. 2038 if (isa<VectorType>(Source)) { 2039 if (!isa<VectorType>(Target)) 2040 return DiagnoseImpCast(*this, E, T, diag::warn_impcast_vector_scalar); 2041 2042 Source = cast<VectorType>(Source)->getElementType().getTypePtr(); 2043 Target = cast<VectorType>(Target)->getElementType().getTypePtr(); 2044 } 2045 2046 // Strip complex types. 2047 if (isa<ComplexType>(Source)) { 2048 if (!isa<ComplexType>(Target)) 2049 return DiagnoseImpCast(*this, E, T, diag::warn_impcast_complex_scalar); 2050 2051 Source = cast<ComplexType>(Source)->getElementType().getTypePtr(); 2052 Target = cast<ComplexType>(Target)->getElementType().getTypePtr(); 2053 } 2054 2055 const BuiltinType *SourceBT = dyn_cast<BuiltinType>(Source); 2056 const BuiltinType *TargetBT = dyn_cast<BuiltinType>(Target); 2057 2058 // If the source is floating point... 2059 if (SourceBT && SourceBT->isFloatingPoint()) { 2060 // ...and the target is floating point... 2061 if (TargetBT && TargetBT->isFloatingPoint()) { 2062 // ...then warn if we're dropping FP rank. 2063 2064 // Builtin FP kinds are ordered by increasing FP rank. 2065 if (SourceBT->getKind() > TargetBT->getKind()) { 2066 // Don't warn about float constants that are precisely 2067 // representable in the target type. 2068 Expr::EvalResult result; 2069 if (E->Evaluate(result, Context)) { 2070 // Value might be a float, a float vector, or a float complex. 2071 if (IsSameFloatAfterCast(result.Val, 2072 Context.getFloatTypeSemantics(QualType(TargetBT, 0)), 2073 Context.getFloatTypeSemantics(QualType(SourceBT, 0)))) 2074 return; 2075 } 2076 2077 DiagnoseImpCast(*this, E, T, diag::warn_impcast_float_precision); 2078 } 2079 return; 2080 } 2081 2082 // If the target is integral, always warn. 2083 if ((TargetBT && TargetBT->isInteger())) 2084 // TODO: don't warn for integer values? 2085 return DiagnoseImpCast(*this, E, T, diag::warn_impcast_float_integer); 2086 2087 return; 2088 } 2089 2090 if (!Source->isIntegerType() || !Target->isIntegerType()) 2091 return; 2092 2093 IntRange SourceRange = GetExprRange(Context, E, Context.getIntWidth(E->getType())); 2094 IntRange TargetRange = IntRange::forCanonicalType(Context, Target); 2095 2096 // FIXME: also signed<->unsigned? 2097 2098 if (SourceRange.Width > TargetRange.Width) { 2099 // People want to build with -Wshorten-64-to-32 and not -Wconversion 2100 // and by god we'll let them. 2101 if (SourceRange.Width == 64 && TargetRange.Width == 32) 2102 return DiagnoseImpCast(*this, E, T, diag::warn_impcast_integer_64_32); 2103 return DiagnoseImpCast(*this, E, T, diag::warn_impcast_integer_precision); 2104 } 2105 2106 return; 2107} 2108 2109// MarkLive - Mark all the blocks reachable from e as live. Returns the total 2110// number of blocks just marked live. 2111static unsigned MarkLive(CFGBlock *e, llvm::BitVector &live) { 2112 unsigned count = 0; 2113 std::queue<CFGBlock*> workq; 2114 // Prep work queue 2115 live.set(e->getBlockID()); 2116 ++count; 2117 workq.push(e); 2118 // Solve 2119 while (!workq.empty()) { 2120 CFGBlock *item = workq.front(); 2121 workq.pop(); 2122 for (CFGBlock::succ_iterator I=item->succ_begin(), 2123 E=item->succ_end(); 2124 I != E; 2125 ++I) { 2126 if ((*I) && !live[(*I)->getBlockID()]) { 2127 live.set((*I)->getBlockID()); 2128 ++count; 2129 workq.push(*I); 2130 } 2131 } 2132 } 2133 return count; 2134} 2135 2136static SourceLocation GetUnreachableLoc(CFGBlock &b, SourceRange &R1, 2137 SourceRange &R2) { 2138 Stmt *S; 2139 unsigned sn = 0; 2140 R1 = R2 = SourceRange(); 2141 2142 top: 2143 if (sn < b.size()) 2144 S = b[sn].getStmt(); 2145 else if (b.getTerminator()) 2146 S = b.getTerminator(); 2147 else 2148 return SourceLocation(); 2149 2150 switch (S->getStmtClass()) { 2151 case Expr::BinaryOperatorClass: { 2152 BinaryOperator *BO = cast<BinaryOperator>(S); 2153 if (BO->getOpcode() == BinaryOperator::Comma) { 2154 if (sn+1 < b.size()) 2155 return b[sn+1].getStmt()->getLocStart(); 2156 CFGBlock *n = &b; 2157 while (1) { 2158 if (n->getTerminator()) 2159 return n->getTerminator()->getLocStart(); 2160 if (n->succ_size() != 1) 2161 return SourceLocation(); 2162 n = n[0].succ_begin()[0]; 2163 if (n->pred_size() != 1) 2164 return SourceLocation(); 2165 if (!n->empty()) 2166 return n[0][0].getStmt()->getLocStart(); 2167 } 2168 } 2169 R1 = BO->getLHS()->getSourceRange(); 2170 R2 = BO->getRHS()->getSourceRange(); 2171 return BO->getOperatorLoc(); 2172 } 2173 case Expr::UnaryOperatorClass: { 2174 const UnaryOperator *UO = cast<UnaryOperator>(S); 2175 R1 = UO->getSubExpr()->getSourceRange(); 2176 return UO->getOperatorLoc(); 2177 } 2178 case Expr::CompoundAssignOperatorClass: { 2179 const CompoundAssignOperator *CAO = cast<CompoundAssignOperator>(S); 2180 R1 = CAO->getLHS()->getSourceRange(); 2181 R2 = CAO->getRHS()->getSourceRange(); 2182 return CAO->getOperatorLoc(); 2183 } 2184 case Expr::ConditionalOperatorClass: { 2185 const ConditionalOperator *CO = cast<ConditionalOperator>(S); 2186 return CO->getQuestionLoc(); 2187 } 2188 case Expr::MemberExprClass: { 2189 const MemberExpr *ME = cast<MemberExpr>(S); 2190 R1 = ME->getSourceRange(); 2191 return ME->getMemberLoc(); 2192 } 2193 case Expr::ArraySubscriptExprClass: { 2194 const ArraySubscriptExpr *ASE = cast<ArraySubscriptExpr>(S); 2195 R1 = ASE->getLHS()->getSourceRange(); 2196 R2 = ASE->getRHS()->getSourceRange(); 2197 return ASE->getRBracketLoc(); 2198 } 2199 case Expr::CStyleCastExprClass: { 2200 const CStyleCastExpr *CSC = cast<CStyleCastExpr>(S); 2201 R1 = CSC->getSubExpr()->getSourceRange(); 2202 return CSC->getLParenLoc(); 2203 } 2204 case Expr::CXXFunctionalCastExprClass: { 2205 const CXXFunctionalCastExpr *CE = cast <CXXFunctionalCastExpr>(S); 2206 R1 = CE->getSubExpr()->getSourceRange(); 2207 return CE->getTypeBeginLoc(); 2208 } 2209 case Expr::ImplicitCastExprClass: 2210 ++sn; 2211 goto top; 2212 case Stmt::CXXTryStmtClass: { 2213 return cast<CXXTryStmt>(S)->getHandler(0)->getCatchLoc(); 2214 } 2215 default: ; 2216 } 2217 R1 = S->getSourceRange(); 2218 return S->getLocStart(); 2219} 2220 2221static SourceLocation MarkLiveTop(CFGBlock *e, llvm::BitVector &live, 2222 SourceManager &SM) { 2223 std::queue<CFGBlock*> workq; 2224 // Prep work queue 2225 workq.push(e); 2226 SourceRange R1, R2; 2227 SourceLocation top = GetUnreachableLoc(*e, R1, R2); 2228 bool FromMainFile = false; 2229 bool FromSystemHeader = false; 2230 bool TopValid = false; 2231 if (top.isValid()) { 2232 FromMainFile = SM.isFromMainFile(top); 2233 FromSystemHeader = SM.isInSystemHeader(top); 2234 TopValid = true; 2235 } 2236 // Solve 2237 while (!workq.empty()) { 2238 CFGBlock *item = workq.front(); 2239 workq.pop(); 2240 SourceLocation c = GetUnreachableLoc(*item, R1, R2); 2241 if (c.isValid() 2242 && (!TopValid 2243 || (SM.isFromMainFile(c) && !FromMainFile) 2244 || (FromSystemHeader && !SM.isInSystemHeader(c)) 2245 || SM.isBeforeInTranslationUnit(c, top))) { 2246 top = c; 2247 FromMainFile = SM.isFromMainFile(top); 2248 FromSystemHeader = SM.isInSystemHeader(top); 2249 } 2250 live.set(item->getBlockID()); 2251 for (CFGBlock::succ_iterator I=item->succ_begin(), 2252 E=item->succ_end(); 2253 I != E; 2254 ++I) { 2255 if ((*I) && !live[(*I)->getBlockID()]) { 2256 live.set((*I)->getBlockID()); 2257 workq.push(*I); 2258 } 2259 } 2260 } 2261 return top; 2262} 2263 2264static int LineCmp(const void *p1, const void *p2) { 2265 SourceLocation *Line1 = (SourceLocation *)p1; 2266 SourceLocation *Line2 = (SourceLocation *)p2; 2267 return !(*Line1 < *Line2); 2268} 2269 2270namespace { 2271 struct ErrLoc { 2272 SourceLocation Loc; 2273 SourceRange R1; 2274 SourceRange R2; 2275 ErrLoc(SourceLocation l, SourceRange r1, SourceRange r2) 2276 : Loc(l), R1(r1), R2(r2) { } 2277 }; 2278} 2279 2280/// CheckUnreachable - Check for unreachable code. 2281void Sema::CheckUnreachable(AnalysisContext &AC) { 2282 unsigned count; 2283 // We avoid checking when there are errors, as the CFG won't faithfully match 2284 // the user's code. 2285 if (getDiagnostics().hasErrorOccurred()) 2286 return; 2287 if (Diags.getDiagnosticLevel(diag::warn_unreachable) == Diagnostic::Ignored) 2288 return; 2289 2290 CFG *cfg = AC.getCFG(); 2291 if (cfg == 0) 2292 return; 2293 2294 llvm::BitVector live(cfg->getNumBlockIDs()); 2295 // Mark all live things first. 2296 count = MarkLive(&cfg->getEntry(), live); 2297 2298 if (count == cfg->getNumBlockIDs()) 2299 // If there are no dead blocks, we're done. 2300 return; 2301 2302 SourceRange R1, R2; 2303 2304 llvm::SmallVector<ErrLoc, 24> lines; 2305 bool AddEHEdges = AC.getAddEHEdges(); 2306 // First, give warnings for blocks with no predecessors, as they 2307 // can't be part of a loop. 2308 for (CFG::iterator I = cfg->begin(), E = cfg->end(); I != E; ++I) { 2309 CFGBlock &b = **I; 2310 if (!live[b.getBlockID()]) { 2311 if (b.pred_begin() == b.pred_end()) { 2312 if (!AddEHEdges && b.getTerminator() 2313 && isa<CXXTryStmt>(b.getTerminator())) { 2314 // When not adding EH edges from calls, catch clauses 2315 // can otherwise seem dead. Avoid noting them as dead. 2316 count += MarkLive(&b, live); 2317 continue; 2318 } 2319 SourceLocation c = GetUnreachableLoc(b, R1, R2); 2320 if (!c.isValid()) { 2321 // Blocks without a location can't produce a warning, so don't mark 2322 // reachable blocks from here as live. 2323 live.set(b.getBlockID()); 2324 ++count; 2325 continue; 2326 } 2327 lines.push_back(ErrLoc(c, R1, R2)); 2328 // Avoid excessive errors by marking everything reachable from here 2329 count += MarkLive(&b, live); 2330 } 2331 } 2332 } 2333 2334 if (count < cfg->getNumBlockIDs()) { 2335 // And then give warnings for the tops of loops. 2336 for (CFG::iterator I = cfg->begin(), E = cfg->end(); I != E; ++I) { 2337 CFGBlock &b = **I; 2338 if (!live[b.getBlockID()]) 2339 // Avoid excessive errors by marking everything reachable from here 2340 lines.push_back(ErrLoc(MarkLiveTop(&b, live, 2341 Context.getSourceManager()), 2342 SourceRange(), SourceRange())); 2343 } 2344 } 2345 2346 llvm::array_pod_sort(lines.begin(), lines.end(), LineCmp); 2347 for (llvm::SmallVector<ErrLoc, 24>::iterator I = lines.begin(), 2348 E = lines.end(); 2349 I != E; 2350 ++I) 2351 if (I->Loc.isValid()) 2352 Diag(I->Loc, diag::warn_unreachable) << I->R1 << I->R2; 2353} 2354 2355/// CheckFallThrough - Check that we don't fall off the end of a 2356/// Statement that should return a value. 2357/// 2358/// \returns AlwaysFallThrough iff we always fall off the end of the statement, 2359/// MaybeFallThrough iff we might or might not fall off the end, 2360/// NeverFallThroughOrReturn iff we never fall off the end of the statement or 2361/// return. We assume NeverFallThrough iff we never fall off the end of the 2362/// statement but we may return. We assume that functions not marked noreturn 2363/// will return. 2364Sema::ControlFlowKind Sema::CheckFallThrough(AnalysisContext &AC) { 2365 CFG *cfg = AC.getCFG(); 2366 if (cfg == 0) 2367 // FIXME: This should be NeverFallThrough 2368 return NeverFallThroughOrReturn; 2369 2370 // The CFG leaves in dead things, and we don't want the dead code paths to 2371 // confuse us, so we mark all live things first. 2372 std::queue<CFGBlock*> workq; 2373 llvm::BitVector live(cfg->getNumBlockIDs()); 2374 unsigned count = MarkLive(&cfg->getEntry(), live); 2375 2376 bool AddEHEdges = AC.getAddEHEdges(); 2377 if (!AddEHEdges && count != cfg->getNumBlockIDs()) 2378 // When there are things remaining dead, and we didn't add EH edges 2379 // from CallExprs to the catch clauses, we have to go back and 2380 // mark them as live. 2381 for (CFG::iterator I = cfg->begin(), E = cfg->end(); I != E; ++I) { 2382 CFGBlock &b = **I; 2383 if (!live[b.getBlockID()]) { 2384 if (b.pred_begin() == b.pred_end()) { 2385 if (b.getTerminator() && isa<CXXTryStmt>(b.getTerminator())) 2386 // When not adding EH edges from calls, catch clauses 2387 // can otherwise seem dead. Avoid noting them as dead. 2388 count += MarkLive(&b, live); 2389 continue; 2390 } 2391 } 2392 } 2393 2394 // Now we know what is live, we check the live precessors of the exit block 2395 // and look for fall through paths, being careful to ignore normal returns, 2396 // and exceptional paths. 2397 bool HasLiveReturn = false; 2398 bool HasFakeEdge = false; 2399 bool HasPlainEdge = false; 2400 bool HasAbnormalEdge = false; 2401 for (CFGBlock::pred_iterator I=cfg->getExit().pred_begin(), 2402 E = cfg->getExit().pred_end(); 2403 I != E; 2404 ++I) { 2405 CFGBlock& B = **I; 2406 if (!live[B.getBlockID()]) 2407 continue; 2408 if (B.size() == 0) { 2409 if (B.getTerminator() && isa<CXXTryStmt>(B.getTerminator())) { 2410 HasAbnormalEdge = true; 2411 continue; 2412 } 2413 2414 // A labeled empty statement, or the entry block... 2415 HasPlainEdge = true; 2416 continue; 2417 } 2418 Stmt *S = B[B.size()-1]; 2419 if (isa<ReturnStmt>(S)) { 2420 HasLiveReturn = true; 2421 continue; 2422 } 2423 if (isa<ObjCAtThrowStmt>(S)) { 2424 HasFakeEdge = true; 2425 continue; 2426 } 2427 if (isa<CXXThrowExpr>(S)) { 2428 HasFakeEdge = true; 2429 continue; 2430 } 2431 if (const AsmStmt *AS = dyn_cast<AsmStmt>(S)) { 2432 if (AS->isMSAsm()) { 2433 HasFakeEdge = true; 2434 HasLiveReturn = true; 2435 continue; 2436 } 2437 } 2438 if (isa<CXXTryStmt>(S)) { 2439 HasAbnormalEdge = true; 2440 continue; 2441 } 2442 2443 bool NoReturnEdge = false; 2444 if (CallExpr *C = dyn_cast<CallExpr>(S)) { 2445 if (B.succ_begin()[0] != &cfg->getExit()) { 2446 HasAbnormalEdge = true; 2447 continue; 2448 } 2449 Expr *CEE = C->getCallee()->IgnoreParenCasts(); 2450 if (CEE->getType().getNoReturnAttr()) { 2451 NoReturnEdge = true; 2452 HasFakeEdge = true; 2453 } else if (DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(CEE)) { 2454 ValueDecl *VD = DRE->getDecl(); 2455 if (VD->hasAttr<NoReturnAttr>()) { 2456 NoReturnEdge = true; 2457 HasFakeEdge = true; 2458 } 2459 } 2460 } 2461 // FIXME: Add noreturn message sends. 2462 if (NoReturnEdge == false) 2463 HasPlainEdge = true; 2464 } 2465 if (!HasPlainEdge) { 2466 if (HasLiveReturn) 2467 return NeverFallThrough; 2468 return NeverFallThroughOrReturn; 2469 } 2470 if (HasAbnormalEdge || HasFakeEdge || HasLiveReturn) 2471 return MaybeFallThrough; 2472 // This says AlwaysFallThrough for calls to functions that are not marked 2473 // noreturn, that don't return. If people would like this warning to be more 2474 // accurate, such functions should be marked as noreturn. 2475 return AlwaysFallThrough; 2476} 2477 2478/// CheckFallThroughForFunctionDef - Check that we don't fall off the end of a 2479/// function that should return a value. Check that we don't fall off the end 2480/// of a noreturn function. We assume that functions and blocks not marked 2481/// noreturn will return. 2482void Sema::CheckFallThroughForFunctionDef(Decl *D, Stmt *Body, 2483 AnalysisContext &AC) { 2484 // FIXME: Would be nice if we had a better way to control cascading errors, 2485 // but for now, avoid them. The problem is that when Parse sees: 2486 // int foo() { return a; } 2487 // The return is eaten and the Sema code sees just: 2488 // int foo() { } 2489 // which this code would then warn about. 2490 if (getDiagnostics().hasErrorOccurred()) 2491 return; 2492 2493 bool ReturnsVoid = false; 2494 bool HasNoReturn = false; 2495 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) { 2496 // If the result type of the function is a dependent type, we don't know 2497 // whether it will be void or not, so don't 2498 if (FD->getResultType()->isDependentType()) 2499 return; 2500 if (FD->getResultType()->isVoidType()) 2501 ReturnsVoid = true; 2502 if (FD->hasAttr<NoReturnAttr>()) 2503 HasNoReturn = true; 2504 } else if (ObjCMethodDecl *MD = dyn_cast<ObjCMethodDecl>(D)) { 2505 if (MD->getResultType()->isVoidType()) 2506 ReturnsVoid = true; 2507 if (MD->hasAttr<NoReturnAttr>()) 2508 HasNoReturn = true; 2509 } 2510 2511 // Short circuit for compilation speed. 2512 if ((Diags.getDiagnosticLevel(diag::warn_maybe_falloff_nonvoid_function) 2513 == Diagnostic::Ignored || ReturnsVoid) 2514 && (Diags.getDiagnosticLevel(diag::warn_noreturn_function_has_return_expr) 2515 == Diagnostic::Ignored || !HasNoReturn) 2516 && (Diags.getDiagnosticLevel(diag::warn_suggest_noreturn_block) 2517 == Diagnostic::Ignored || !ReturnsVoid)) 2518 return; 2519 // FIXME: Function try block 2520 if (CompoundStmt *Compound = dyn_cast<CompoundStmt>(Body)) { 2521 switch (CheckFallThrough(AC)) { 2522 case MaybeFallThrough: 2523 if (HasNoReturn) 2524 Diag(Compound->getRBracLoc(), diag::warn_falloff_noreturn_function); 2525 else if (!ReturnsVoid) 2526 Diag(Compound->getRBracLoc(),diag::warn_maybe_falloff_nonvoid_function); 2527 break; 2528 case AlwaysFallThrough: 2529 if (HasNoReturn) 2530 Diag(Compound->getRBracLoc(), diag::warn_falloff_noreturn_function); 2531 else if (!ReturnsVoid) 2532 Diag(Compound->getRBracLoc(), diag::warn_falloff_nonvoid_function); 2533 break; 2534 case NeverFallThroughOrReturn: 2535 if (ReturnsVoid && !HasNoReturn) 2536 Diag(Compound->getLBracLoc(), diag::warn_suggest_noreturn_function); 2537 break; 2538 case NeverFallThrough: 2539 break; 2540 } 2541 } 2542} 2543 2544/// CheckFallThroughForBlock - Check that we don't fall off the end of a block 2545/// that should return a value. Check that we don't fall off the end of a 2546/// noreturn block. We assume that functions and blocks not marked noreturn 2547/// will return. 2548void Sema::CheckFallThroughForBlock(QualType BlockTy, Stmt *Body, 2549 AnalysisContext &AC) { 2550 // FIXME: Would be nice if we had a better way to control cascading errors, 2551 // but for now, avoid them. The problem is that when Parse sees: 2552 // int foo() { return a; } 2553 // The return is eaten and the Sema code sees just: 2554 // int foo() { } 2555 // which this code would then warn about. 2556 if (getDiagnostics().hasErrorOccurred()) 2557 return; 2558 bool ReturnsVoid = false; 2559 bool HasNoReturn = false; 2560 if (const FunctionType *FT =BlockTy->getPointeeType()->getAs<FunctionType>()){ 2561 if (FT->getResultType()->isVoidType()) 2562 ReturnsVoid = true; 2563 if (FT->getNoReturnAttr()) 2564 HasNoReturn = true; 2565 } 2566 2567 // Short circuit for compilation speed. 2568 if (ReturnsVoid 2569 && !HasNoReturn 2570 && (Diags.getDiagnosticLevel(diag::warn_suggest_noreturn_block) 2571 == Diagnostic::Ignored || !ReturnsVoid)) 2572 return; 2573 // FIXME: Funtion try block 2574 if (CompoundStmt *Compound = dyn_cast<CompoundStmt>(Body)) { 2575 switch (CheckFallThrough(AC)) { 2576 case MaybeFallThrough: 2577 if (HasNoReturn) 2578 Diag(Compound->getRBracLoc(), diag::err_noreturn_block_has_return_expr); 2579 else if (!ReturnsVoid) 2580 Diag(Compound->getRBracLoc(), diag::err_maybe_falloff_nonvoid_block); 2581 break; 2582 case AlwaysFallThrough: 2583 if (HasNoReturn) 2584 Diag(Compound->getRBracLoc(), diag::err_noreturn_block_has_return_expr); 2585 else if (!ReturnsVoid) 2586 Diag(Compound->getRBracLoc(), diag::err_falloff_nonvoid_block); 2587 break; 2588 case NeverFallThroughOrReturn: 2589 if (ReturnsVoid) 2590 Diag(Compound->getLBracLoc(), diag::warn_suggest_noreturn_block); 2591 break; 2592 case NeverFallThrough: 2593 break; 2594 } 2595 } 2596} 2597 2598/// CheckParmsForFunctionDef - Check that the parameters of the given 2599/// function are appropriate for the definition of a function. This 2600/// takes care of any checks that cannot be performed on the 2601/// declaration itself, e.g., that the types of each of the function 2602/// parameters are complete. 2603bool Sema::CheckParmsForFunctionDef(FunctionDecl *FD) { 2604 bool HasInvalidParm = false; 2605 for (unsigned p = 0, NumParams = FD->getNumParams(); p < NumParams; ++p) { 2606 ParmVarDecl *Param = FD->getParamDecl(p); 2607 2608 // C99 6.7.5.3p4: the parameters in a parameter type list in a 2609 // function declarator that is part of a function definition of 2610 // that function shall not have incomplete type. 2611 // 2612 // This is also C++ [dcl.fct]p6. 2613 if (!Param->isInvalidDecl() && 2614 RequireCompleteType(Param->getLocation(), Param->getType(), 2615 diag::err_typecheck_decl_incomplete_type)) { 2616 Param->setInvalidDecl(); 2617 HasInvalidParm = true; 2618 } 2619 2620 // C99 6.9.1p5: If the declarator includes a parameter type list, the 2621 // declaration of each parameter shall include an identifier. 2622 if (Param->getIdentifier() == 0 && 2623 !Param->isImplicit() && 2624 !getLangOptions().CPlusPlus) 2625 Diag(Param->getLocation(), diag::err_parameter_name_omitted); 2626 2627 // C99 6.7.5.3p12: 2628 // If the function declarator is not part of a definition of that 2629 // function, parameters may have incomplete type and may use the [*] 2630 // notation in their sequences of declarator specifiers to specify 2631 // variable length array types. 2632 QualType PType = Param->getOriginalType(); 2633 if (const ArrayType *AT = Context.getAsArrayType(PType)) { 2634 if (AT->getSizeModifier() == ArrayType::Star) { 2635 // FIXME: This diagnosic should point the the '[*]' if source-location 2636 // information is added for it. 2637 Diag(Param->getLocation(), diag::err_array_star_in_function_definition); 2638 } 2639 } 2640 } 2641 2642 return HasInvalidParm; 2643} 2644