1 //===--- UseAfterMoveCheck.cpp - clang-tidy -------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 #include "UseAfterMoveCheck.h" 10 11 #include "clang/AST/Expr.h" 12 #include "clang/AST/ExprCXX.h" 13 #include "clang/AST/ExprConcepts.h" 14 #include "clang/ASTMatchers/ASTMatchers.h" 15 #include "clang/Analysis/CFG.h" 16 #include "clang/Lex/Lexer.h" 17 18 #include "../utils/ExprSequence.h" 19 20 using namespace clang::ast_matchers; 21 using namespace clang::tidy::utils; 22 23 24 namespace clang { 25 namespace tidy { 26 namespace bugprone { 27 28 namespace { 29 30 AST_MATCHER(Expr, hasUnevaluatedContext) { 31 if (isa<CXXNoexceptExpr>(Node) || isa<RequiresExpr>(Node)) 32 return true; 33 if (const auto *UnaryExpr = dyn_cast<UnaryExprOrTypeTraitExpr>(&Node)) { 34 switch (UnaryExpr->getKind()) { 35 case UETT_SizeOf: 36 case UETT_AlignOf: 37 return true; 38 default: 39 return false; 40 } 41 } 42 if (const auto *TypeIDExpr = dyn_cast<CXXTypeidExpr>(&Node)) 43 return !TypeIDExpr->isPotentiallyEvaluated(); 44 return false; 45 } 46 47 /// Contains information about a use-after-move. 48 struct UseAfterMove { 49 // The DeclRefExpr that constituted the use of the object. 50 const DeclRefExpr *DeclRef; 51 52 // Is the order in which the move and the use are evaluated undefined? 53 bool EvaluationOrderUndefined; 54 }; 55 56 /// Finds uses of a variable after a move (and maintains state required by the 57 /// various internal helper functions). 58 class UseAfterMoveFinder { 59 public: 60 UseAfterMoveFinder(ASTContext *TheContext); 61 62 // Within the given function body, finds the first use of 'MovedVariable' that 63 // occurs after 'MovingCall' (the expression that performs the move). If a 64 // use-after-move is found, writes information about it to 'TheUseAfterMove'. 65 // Returns whether a use-after-move was found. 66 bool find(Stmt *FunctionBody, const Expr *MovingCall, 67 const ValueDecl *MovedVariable, UseAfterMove *TheUseAfterMove); 68 69 private: 70 bool findInternal(const CFGBlock *Block, const Expr *MovingCall, 71 const ValueDecl *MovedVariable, 72 UseAfterMove *TheUseAfterMove); 73 void getUsesAndReinits(const CFGBlock *Block, const ValueDecl *MovedVariable, 74 llvm::SmallVectorImpl<const DeclRefExpr *> *Uses, 75 llvm::SmallPtrSetImpl<const Stmt *> *Reinits); 76 void getDeclRefs(const CFGBlock *Block, const Decl *MovedVariable, 77 llvm::SmallPtrSetImpl<const DeclRefExpr *> *DeclRefs); 78 void getReinits(const CFGBlock *Block, const ValueDecl *MovedVariable, 79 llvm::SmallPtrSetImpl<const Stmt *> *Stmts, 80 llvm::SmallPtrSetImpl<const DeclRefExpr *> *DeclRefs); 81 82 ASTContext *Context; 83 std::unique_ptr<ExprSequence> Sequence; 84 std::unique_ptr<StmtToBlockMap> BlockMap; 85 llvm::SmallPtrSet<const CFGBlock *, 8> Visited; 86 }; 87 88 } // namespace 89 90 91 // Matches nodes that are 92 // - Part of a decltype argument or class template argument (we check this by 93 // seeing if they are children of a TypeLoc), or 94 // - Part of a function template argument (we check this by seeing if they are 95 // children of a DeclRefExpr that references a function template). 96 // DeclRefExprs that fulfill these conditions should not be counted as a use or 97 // move. 98 static StatementMatcher inDecltypeOrTemplateArg() { 99 return anyOf(hasAncestor(typeLoc()), 100 hasAncestor(declRefExpr( 101 to(functionDecl(ast_matchers::isTemplateInstantiation())))), 102 hasAncestor(expr(hasUnevaluatedContext()))); 103 } 104 105 UseAfterMoveFinder::UseAfterMoveFinder(ASTContext *TheContext) 106 : Context(TheContext) {} 107 108 bool UseAfterMoveFinder::find(Stmt *FunctionBody, const Expr *MovingCall, 109 const ValueDecl *MovedVariable, 110 UseAfterMove *TheUseAfterMove) { 111 // Generate the CFG manually instead of through an AnalysisDeclContext because 112 // it seems the latter can't be used to generate a CFG for the body of a 113 // lambda. 114 // 115 // We include implicit and temporary destructors in the CFG so that 116 // destructors marked [[noreturn]] are handled correctly in the control flow 117 // analysis. (These are used in some styles of assertion macros.) 118 CFG::BuildOptions Options; 119 Options.AddImplicitDtors = true; 120 Options.AddTemporaryDtors = true; 121 std::unique_ptr<CFG> TheCFG = 122 CFG::buildCFG(nullptr, FunctionBody, Context, Options); 123 if (!TheCFG) 124 return false; 125 126 Sequence = 127 std::make_unique<ExprSequence>(TheCFG.get(), FunctionBody, Context); 128 BlockMap = std::make_unique<StmtToBlockMap>(TheCFG.get(), Context); 129 Visited.clear(); 130 131 const CFGBlock *Block = BlockMap->blockContainingStmt(MovingCall); 132 if (!Block) { 133 // This can happen if MovingCall is in a constructor initializer, which is 134 // not included in the CFG because the CFG is built only from the function 135 // body. 136 Block = &TheCFG->getEntry(); 137 } 138 139 return findInternal(Block, MovingCall, MovedVariable, TheUseAfterMove); 140 } 141 142 bool UseAfterMoveFinder::findInternal(const CFGBlock *Block, 143 const Expr *MovingCall, 144 const ValueDecl *MovedVariable, 145 UseAfterMove *TheUseAfterMove) { 146 if (Visited.count(Block)) 147 return false; 148 149 // Mark the block as visited (except if this is the block containing the 150 // std::move() and it's being visited the first time). 151 if (!MovingCall) 152 Visited.insert(Block); 153 154 // Get all uses and reinits in the block. 155 llvm::SmallVector<const DeclRefExpr *, 1> Uses; 156 llvm::SmallPtrSet<const Stmt *, 1> Reinits; 157 getUsesAndReinits(Block, MovedVariable, &Uses, &Reinits); 158 159 // Ignore all reinitializations where the move potentially comes after the 160 // reinit. 161 // If `Reinit` is identical to `MovingCall`, we're looking at a move-to-self 162 // (e.g. `a = std::move(a)`). Count these as reinitializations. 163 llvm::SmallVector<const Stmt *, 1> ReinitsToDelete; 164 for (const Stmt *Reinit : Reinits) { 165 if (MovingCall && Reinit != MovingCall && 166 Sequence->potentiallyAfter(MovingCall, Reinit)) 167 ReinitsToDelete.push_back(Reinit); 168 } 169 for (const Stmt *Reinit : ReinitsToDelete) { 170 Reinits.erase(Reinit); 171 } 172 173 // Find all uses that potentially come after the move. 174 for (const DeclRefExpr *Use : Uses) { 175 if (!MovingCall || Sequence->potentiallyAfter(Use, MovingCall)) { 176 // Does the use have a saving reinit? A reinit is saving if it definitely 177 // comes before the use, i.e. if there's no potential that the reinit is 178 // after the use. 179 bool HaveSavingReinit = false; 180 for (const Stmt *Reinit : Reinits) { 181 if (!Sequence->potentiallyAfter(Reinit, Use)) 182 HaveSavingReinit = true; 183 } 184 185 if (!HaveSavingReinit) { 186 TheUseAfterMove->DeclRef = Use; 187 188 // Is this a use-after-move that depends on order of evaluation? 189 // This is the case if the move potentially comes after the use (and we 190 // already know that use potentially comes after the move, which taken 191 // together tells us that the ordering is unclear). 192 TheUseAfterMove->EvaluationOrderUndefined = 193 MovingCall != nullptr && 194 Sequence->potentiallyAfter(MovingCall, Use); 195 196 return true; 197 } 198 } 199 } 200 201 // If the object wasn't reinitialized, call ourselves recursively on all 202 // successors. 203 if (Reinits.empty()) { 204 for (const auto &Succ : Block->succs()) { 205 if (Succ && findInternal(Succ, nullptr, MovedVariable, TheUseAfterMove)) 206 return true; 207 } 208 } 209 210 return false; 211 } 212 213 void UseAfterMoveFinder::getUsesAndReinits( 214 const CFGBlock *Block, const ValueDecl *MovedVariable, 215 llvm::SmallVectorImpl<const DeclRefExpr *> *Uses, 216 llvm::SmallPtrSetImpl<const Stmt *> *Reinits) { 217 llvm::SmallPtrSet<const DeclRefExpr *, 1> DeclRefs; 218 llvm::SmallPtrSet<const DeclRefExpr *, 1> ReinitDeclRefs; 219 220 getDeclRefs(Block, MovedVariable, &DeclRefs); 221 getReinits(Block, MovedVariable, Reinits, &ReinitDeclRefs); 222 223 // All references to the variable that aren't reinitializations are uses. 224 Uses->clear(); 225 for (const DeclRefExpr *DeclRef : DeclRefs) { 226 if (!ReinitDeclRefs.count(DeclRef)) 227 Uses->push_back(DeclRef); 228 } 229 230 // Sort the uses by their occurrence in the source code. 231 std::sort(Uses->begin(), Uses->end(), 232 [](const DeclRefExpr *D1, const DeclRefExpr *D2) { 233 return D1->getExprLoc() < D2->getExprLoc(); 234 }); 235 } 236 237 bool isStandardSmartPointer(const ValueDecl *VD) { 238 const Type *TheType = VD->getType().getNonReferenceType().getTypePtrOrNull(); 239 if (!TheType) 240 return false; 241 242 const CXXRecordDecl *RecordDecl = TheType->getAsCXXRecordDecl(); 243 if (!RecordDecl) 244 return false; 245 246 const IdentifierInfo *ID = RecordDecl->getIdentifier(); 247 if (!ID) 248 return false; 249 250 StringRef Name = ID->getName(); 251 if (Name != "unique_ptr" && Name != "shared_ptr" && Name != "weak_ptr") 252 return false; 253 254 return RecordDecl->getDeclContext()->isStdNamespace(); 255 } 256 257 void UseAfterMoveFinder::getDeclRefs( 258 const CFGBlock *Block, const Decl *MovedVariable, 259 llvm::SmallPtrSetImpl<const DeclRefExpr *> *DeclRefs) { 260 DeclRefs->clear(); 261 for (const auto &Elem : *Block) { 262 Optional<CFGStmt> S = Elem.getAs<CFGStmt>(); 263 if (!S) 264 continue; 265 266 auto AddDeclRefs = [this, Block, 267 DeclRefs](const ArrayRef<BoundNodes> Matches) { 268 for (const auto &Match : Matches) { 269 const auto *DeclRef = Match.getNodeAs<DeclRefExpr>("declref"); 270 const auto *Operator = Match.getNodeAs<CXXOperatorCallExpr>("operator"); 271 if (DeclRef && BlockMap->blockContainingStmt(DeclRef) == Block) { 272 // Ignore uses of a standard smart pointer that don't dereference the 273 // pointer. 274 if (Operator || !isStandardSmartPointer(DeclRef->getDecl())) { 275 DeclRefs->insert(DeclRef); 276 } 277 } 278 } 279 }; 280 281 auto DeclRefMatcher = declRefExpr(hasDeclaration(equalsNode(MovedVariable)), 282 unless(inDecltypeOrTemplateArg())) 283 .bind("declref"); 284 285 AddDeclRefs(match(traverse(TK_AsIs, findAll(DeclRefMatcher)), *S->getStmt(), 286 *Context)); 287 AddDeclRefs(match(findAll(cxxOperatorCallExpr( 288 hasAnyOverloadedOperatorName("*", "->", "[]"), 289 hasArgument(0, DeclRefMatcher)) 290 .bind("operator")), 291 *S->getStmt(), *Context)); 292 } 293 } 294 295 void UseAfterMoveFinder::getReinits( 296 const CFGBlock *Block, const ValueDecl *MovedVariable, 297 llvm::SmallPtrSetImpl<const Stmt *> *Stmts, 298 llvm::SmallPtrSetImpl<const DeclRefExpr *> *DeclRefs) { 299 auto DeclRefMatcher = 300 declRefExpr(hasDeclaration(equalsNode(MovedVariable))).bind("declref"); 301 302 auto StandardContainerTypeMatcher = hasType(hasUnqualifiedDesugaredType( 303 recordType(hasDeclaration(cxxRecordDecl(hasAnyName( 304 "::std::basic_string", "::std::vector", "::std::deque", 305 "::std::forward_list", "::std::list", "::std::set", "::std::map", 306 "::std::multiset", "::std::multimap", "::std::unordered_set", 307 "::std::unordered_map", "::std::unordered_multiset", 308 "::std::unordered_multimap")))))); 309 310 auto StandardSmartPointerTypeMatcher = hasType(hasUnqualifiedDesugaredType( 311 recordType(hasDeclaration(cxxRecordDecl(hasAnyName( 312 "::std::unique_ptr", "::std::shared_ptr", "::std::weak_ptr")))))); 313 314 // Matches different types of reinitialization. 315 auto ReinitMatcher = 316 stmt(anyOf( 317 // Assignment. In addition to the overloaded assignment operator, 318 // test for built-in assignment as well, since template functions 319 // may be instantiated to use std::move() on built-in types. 320 binaryOperation(hasOperatorName("="), hasLHS(DeclRefMatcher)), 321 // Declaration. We treat this as a type of reinitialization too, 322 // so we don't need to treat it separately. 323 declStmt(hasDescendant(equalsNode(MovedVariable))), 324 // clear() and assign() on standard containers. 325 cxxMemberCallExpr( 326 on(expr(DeclRefMatcher, StandardContainerTypeMatcher)), 327 // To keep the matcher simple, we check for assign() calls 328 // on all standard containers, even though only vector, 329 // deque, forward_list and list have assign(). If assign() 330 // is called on any of the other containers, this will be 331 // flagged by a compile error anyway. 332 callee(cxxMethodDecl(hasAnyName("clear", "assign")))), 333 // reset() on standard smart pointers. 334 cxxMemberCallExpr( 335 on(expr(DeclRefMatcher, StandardSmartPointerTypeMatcher)), 336 callee(cxxMethodDecl(hasName("reset")))), 337 // Methods that have the [[clang::reinitializes]] attribute. 338 cxxMemberCallExpr( 339 on(DeclRefMatcher), 340 callee(cxxMethodDecl(hasAttr(clang::attr::Reinitializes)))), 341 // Passing variable to a function as a non-const pointer. 342 callExpr(forEachArgumentWithParam( 343 unaryOperator(hasOperatorName("&"), 344 hasUnaryOperand(DeclRefMatcher)), 345 unless(parmVarDecl(hasType(pointsTo(isConstQualified())))))), 346 // Passing variable to a function as a non-const lvalue reference 347 // (unless that function is std::move()). 348 callExpr(forEachArgumentWithParam( 349 traverse(TK_AsIs, DeclRefMatcher), 350 unless(parmVarDecl(hasType( 351 references(qualType(isConstQualified())))))), 352 unless(callee(functionDecl(hasName("::std::move"))))))) 353 .bind("reinit"); 354 355 Stmts->clear(); 356 DeclRefs->clear(); 357 for (const auto &Elem : *Block) { 358 Optional<CFGStmt> S = Elem.getAs<CFGStmt>(); 359 if (!S) 360 continue; 361 362 SmallVector<BoundNodes, 1> Matches = 363 match(findAll(ReinitMatcher), *S->getStmt(), *Context); 364 365 for (const auto &Match : Matches) { 366 const auto *TheStmt = Match.getNodeAs<Stmt>("reinit"); 367 const auto *TheDeclRef = Match.getNodeAs<DeclRefExpr>("declref"); 368 if (TheStmt && BlockMap->blockContainingStmt(TheStmt) == Block) { 369 Stmts->insert(TheStmt); 370 371 // We count DeclStmts as reinitializations, but they don't have a 372 // DeclRefExpr associated with them -- so we need to check 'TheDeclRef' 373 // before adding it to the set. 374 if (TheDeclRef) 375 DeclRefs->insert(TheDeclRef); 376 } 377 } 378 } 379 } 380 381 static void emitDiagnostic(const Expr *MovingCall, const DeclRefExpr *MoveArg, 382 const UseAfterMove &Use, ClangTidyCheck *Check, 383 ASTContext *Context) { 384 SourceLocation UseLoc = Use.DeclRef->getExprLoc(); 385 SourceLocation MoveLoc = MovingCall->getExprLoc(); 386 387 Check->diag(UseLoc, "'%0' used after it was moved") 388 << MoveArg->getDecl()->getName(); 389 Check->diag(MoveLoc, "move occurred here", DiagnosticIDs::Note); 390 if (Use.EvaluationOrderUndefined) { 391 Check->diag(UseLoc, 392 "the use and move are unsequenced, i.e. there is no guarantee " 393 "about the order in which they are evaluated", 394 DiagnosticIDs::Note); 395 } else if (UseLoc < MoveLoc || Use.DeclRef == MoveArg) { 396 Check->diag(UseLoc, 397 "the use happens in a later loop iteration than the move", 398 DiagnosticIDs::Note); 399 } 400 } 401 402 void UseAfterMoveCheck::registerMatchers(MatchFinder *Finder) { 403 auto CallMoveMatcher = 404 callExpr(callee(functionDecl(hasName("::std::move"))), argumentCountIs(1), 405 hasArgument(0, declRefExpr().bind("arg")), 406 anyOf(hasAncestor(compoundStmt( 407 hasParent(lambdaExpr().bind("containing-lambda")))), 408 hasAncestor(functionDecl().bind("containing-func"))), 409 unless(inDecltypeOrTemplateArg()), 410 // try_emplace is a common maybe-moving function that returns a 411 // bool to tell callers whether it moved. Ignore std::move inside 412 // try_emplace to avoid false positives as we don't track uses of 413 // the bool. 414 unless(hasParent(cxxMemberCallExpr( 415 callee(cxxMethodDecl(hasName("try_emplace"))))))) 416 .bind("call-move"); 417 418 Finder->addMatcher( 419 traverse( 420 TK_AsIs, 421 // To find the Stmt that we assume performs the actual move, we look 422 // for the direct ancestor of the std::move() that isn't one of the 423 // node types ignored by ignoringParenImpCasts(). 424 stmt( 425 forEach(expr(ignoringParenImpCasts(CallMoveMatcher))), 426 // Don't allow an InitListExpr to be the moving call. An 427 // InitListExpr has both a syntactic and a semantic form, and the 428 // parent-child relationships are different between the two. This 429 // could cause an InitListExpr to be analyzed as the moving call 430 // in addition to the Expr that we actually want, resulting in two 431 // diagnostics with different code locations for the same move. 432 unless(initListExpr()), 433 unless(expr(ignoringParenImpCasts(equalsBoundNode("call-move"))))) 434 .bind("moving-call")), 435 this); 436 } 437 438 void UseAfterMoveCheck::check(const MatchFinder::MatchResult &Result) { 439 const auto *ContainingLambda = 440 Result.Nodes.getNodeAs<LambdaExpr>("containing-lambda"); 441 const auto *ContainingFunc = 442 Result.Nodes.getNodeAs<FunctionDecl>("containing-func"); 443 const auto *CallMove = Result.Nodes.getNodeAs<CallExpr>("call-move"); 444 const auto *MovingCall = Result.Nodes.getNodeAs<Expr>("moving-call"); 445 const auto *Arg = Result.Nodes.getNodeAs<DeclRefExpr>("arg"); 446 447 if (!MovingCall || !MovingCall->getExprLoc().isValid()) 448 MovingCall = CallMove; 449 450 Stmt *FunctionBody = nullptr; 451 if (ContainingLambda) 452 FunctionBody = ContainingLambda->getBody(); 453 else if (ContainingFunc) 454 FunctionBody = ContainingFunc->getBody(); 455 else 456 return; 457 458 // Ignore the std::move if the variable that was passed to it isn't a local 459 // variable. 460 if (!Arg->getDecl()->getDeclContext()->isFunctionOrMethod()) 461 return; 462 463 UseAfterMoveFinder Finder(Result.Context); 464 UseAfterMove Use; 465 if (Finder.find(FunctionBody, MovingCall, Arg->getDecl(), &Use)) 466 emitDiagnostic(MovingCall, Arg, Use, this, Result.Context); 467 } 468 469 } // namespace bugprone 470 } // namespace tidy 471 } // namespace clang 472