1 //===-- DataflowEnvironment.cpp ---------------------------------*- C++ -*-===// 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 // This file defines an Environment class that is used by dataflow analyses 10 // that run over Control-Flow Graphs (CFGs) to keep track of the state of the 11 // program at given program points. 12 // 13 //===----------------------------------------------------------------------===// 14 15 #include "clang/Analysis/FlowSensitive/DataflowEnvironment.h" 16 #include "clang/AST/Decl.h" 17 #include "clang/AST/DeclCXX.h" 18 #include "clang/AST/Type.h" 19 #include "clang/Analysis/FlowSensitive/DataflowLattice.h" 20 #include "clang/Analysis/FlowSensitive/Value.h" 21 #include "llvm/ADT/DenseMap.h" 22 #include "llvm/ADT/DenseSet.h" 23 #include "llvm/ADT/STLExtras.h" 24 #include "llvm/Support/Casting.h" 25 #include "llvm/Support/ErrorHandling.h" 26 #include <cassert> 27 #include <memory> 28 #include <utility> 29 30 namespace clang { 31 namespace dataflow { 32 33 // FIXME: convert these to parameters of the analysis or environment. Current 34 // settings have been experimentaly validated, but only for a particular 35 // analysis. 36 static constexpr int MaxCompositeValueDepth = 3; 37 static constexpr int MaxCompositeValueSize = 1000; 38 39 /// Returns a map consisting of key-value entries that are present in both maps. 40 template <typename K, typename V> 41 llvm::DenseMap<K, V> intersectDenseMaps(const llvm::DenseMap<K, V> &Map1, 42 const llvm::DenseMap<K, V> &Map2) { 43 llvm::DenseMap<K, V> Result; 44 for (auto &Entry : Map1) { 45 auto It = Map2.find(Entry.first); 46 if (It != Map2.end() && Entry.second == It->second) 47 Result.insert({Entry.first, Entry.second}); 48 } 49 return Result; 50 } 51 52 static bool compareDistinctValues(QualType Type, Value &Val1, 53 const Environment &Env1, Value &Val2, 54 const Environment &Env2, 55 Environment::ValueModel &Model) { 56 // Note: Potentially costly, but, for booleans, we could check whether both 57 // can be proven equivalent in their respective environments. 58 59 // FIXME: move the reference/pointers logic from `areEquivalentValues` to here 60 // and implement separate, join/widen specific handling for 61 // reference/pointers. 62 switch (Model.compare(Type, Val1, Env1, Val2, Env2)) { 63 case ComparisonResult::Same: 64 return true; 65 case ComparisonResult::Different: 66 return false; 67 case ComparisonResult::Unknown: 68 switch (Val1.getKind()) { 69 case Value::Kind::Integer: 70 case Value::Kind::Reference: 71 case Value::Kind::Pointer: 72 case Value::Kind::Struct: 73 // FIXME: this choice intentionally introduces unsoundness to allow 74 // for convergence. Once we have widening support for the 75 // reference/pointer and struct built-in models, this should be 76 // `false`. 77 return true; 78 default: 79 return false; 80 } 81 } 82 llvm_unreachable("All cases covered in switch"); 83 } 84 85 /// Attempts to merge distinct values `Val1` and `Val2` in `Env1` and `Env2`, 86 /// respectively, of the same type `Type`. Merging generally produces a single 87 /// value that (soundly) approximates the two inputs, although the actual 88 /// meaning depends on `Model`. 89 static Value *mergeDistinctValues(QualType Type, Value &Val1, 90 const Environment &Env1, Value &Val2, 91 const Environment &Env2, 92 Environment &MergedEnv, 93 Environment::ValueModel &Model) { 94 // Join distinct boolean values preserving information about the constraints 95 // in the respective path conditions. 96 if (isa<BoolValue>(&Val1) && isa<BoolValue>(&Val2)) { 97 // FIXME: Checking both values should be unnecessary, since they should have 98 // a consistent shape. However, right now we can end up with BoolValue's in 99 // integer-typed variables due to our incorrect handling of 100 // boolean-to-integer casts (we just propagate the BoolValue to the result 101 // of the cast). So, a join can encounter an integer in one branch but a 102 // bool in the other. 103 // For example: 104 // ``` 105 // std::optional<bool> o; 106 // int x; 107 // if (o.has_value()) 108 // x = o.value(); 109 // ``` 110 auto *Expr1 = cast<BoolValue>(&Val1); 111 auto *Expr2 = cast<BoolValue>(&Val2); 112 auto &MergedVal = MergedEnv.makeAtomicBoolValue(); 113 MergedEnv.addToFlowCondition(MergedEnv.makeOr( 114 MergedEnv.makeAnd(Env1.getFlowConditionToken(), 115 MergedEnv.makeIff(MergedVal, *Expr1)), 116 MergedEnv.makeAnd(Env2.getFlowConditionToken(), 117 MergedEnv.makeIff(MergedVal, *Expr2)))); 118 return &MergedVal; 119 } 120 121 // FIXME: Consider destroying `MergedValue` immediately if `ValueModel::merge` 122 // returns false to avoid storing unneeded values in `DACtx`. 123 // FIXME: Creating the value based on the type alone creates misshapen values 124 // for lvalues, since the type does not reflect the need for `ReferenceValue`. 125 if (Value *MergedVal = MergedEnv.createValue(Type)) 126 if (Model.merge(Type, Val1, Env1, Val2, Env2, *MergedVal, MergedEnv)) 127 return MergedVal; 128 129 return nullptr; 130 } 131 132 // When widening does not change `Current`, return value will equal `&Prev`. 133 static Value &widenDistinctValues(QualType Type, Value &Prev, 134 const Environment &PrevEnv, Value &Current, 135 Environment &CurrentEnv, 136 Environment::ValueModel &Model) { 137 // Boolean-model widening. 138 if (isa<BoolValue>(&Prev)) { 139 assert(isa<BoolValue>(Current)); 140 // Widen to Top, because we know they are different values. If previous was 141 // already Top, re-use that to (implicitly) indicate that no change occured. 142 if (isa<TopBoolValue>(Prev)) 143 return Prev; 144 return CurrentEnv.makeTopBoolValue(); 145 } 146 147 // FIXME: Add other built-in model widening. 148 149 // Custom-model widening. 150 if (auto *W = Model.widen(Type, Prev, PrevEnv, Current, CurrentEnv)) 151 return *W; 152 153 // Default of widening is a no-op: leave the current value unchanged. 154 return Current; 155 } 156 157 /// Initializes a global storage value. 158 static void insertIfGlobal(const Decl &D, 159 llvm::DenseSet<const VarDecl *> &Vars) { 160 if (auto *V = dyn_cast<VarDecl>(&D)) 161 if (V->hasGlobalStorage()) 162 Vars.insert(V); 163 } 164 165 static void insertIfFunction(const Decl &D, 166 llvm::DenseSet<const FunctionDecl *> &Funcs) { 167 if (auto *FD = dyn_cast<FunctionDecl>(&D)) 168 Funcs.insert(FD); 169 } 170 171 static void 172 getFieldsGlobalsAndFuncs(const Decl &D, 173 llvm::DenseSet<const FieldDecl *> &Fields, 174 llvm::DenseSet<const VarDecl *> &Vars, 175 llvm::DenseSet<const FunctionDecl *> &Funcs) { 176 insertIfGlobal(D, Vars); 177 insertIfFunction(D, Funcs); 178 if (const auto *Decomp = dyn_cast<DecompositionDecl>(&D)) 179 for (const auto *B : Decomp->bindings()) 180 if (auto *ME = dyn_cast_or_null<MemberExpr>(B->getBinding())) 181 // FIXME: should we be using `E->getFoundDecl()`? 182 if (const auto *FD = dyn_cast<FieldDecl>(ME->getMemberDecl())) 183 Fields.insert(FD); 184 } 185 186 /// Traverses `S` and inserts into `Fields`, `Vars` and `Funcs` any fields, 187 /// global variables and functions that are declared in or referenced from 188 /// sub-statements. 189 static void 190 getFieldsGlobalsAndFuncs(const Stmt &S, 191 llvm::DenseSet<const FieldDecl *> &Fields, 192 llvm::DenseSet<const VarDecl *> &Vars, 193 llvm::DenseSet<const FunctionDecl *> &Funcs) { 194 for (auto *Child : S.children()) 195 if (Child != nullptr) 196 getFieldsGlobalsAndFuncs(*Child, Fields, Vars, Funcs); 197 198 if (auto *DS = dyn_cast<DeclStmt>(&S)) { 199 if (DS->isSingleDecl()) 200 getFieldsGlobalsAndFuncs(*DS->getSingleDecl(), Fields, Vars, Funcs); 201 else 202 for (auto *D : DS->getDeclGroup()) 203 getFieldsGlobalsAndFuncs(*D, Fields, Vars, Funcs); 204 } else if (auto *E = dyn_cast<DeclRefExpr>(&S)) { 205 insertIfGlobal(*E->getDecl(), Vars); 206 insertIfFunction(*E->getDecl(), Funcs); 207 } else if (auto *E = dyn_cast<MemberExpr>(&S)) { 208 // FIXME: should we be using `E->getFoundDecl()`? 209 const ValueDecl *VD = E->getMemberDecl(); 210 insertIfGlobal(*VD, Vars); 211 insertIfFunction(*VD, Funcs); 212 if (const auto *FD = dyn_cast<FieldDecl>(VD)) 213 Fields.insert(FD); 214 } 215 } 216 217 // FIXME: Add support for resetting globals after function calls to enable 218 // the implementation of sound analyses. 219 void Environment::initFieldsGlobalsAndFuncs(const FunctionDecl *FuncDecl) { 220 assert(FuncDecl->getBody() != nullptr); 221 222 llvm::DenseSet<const FieldDecl *> Fields; 223 llvm::DenseSet<const VarDecl *> Vars; 224 llvm::DenseSet<const FunctionDecl *> Funcs; 225 226 // Look for global variable and field references in the 227 // constructor-initializers. 228 if (const auto *CtorDecl = dyn_cast<CXXConstructorDecl>(FuncDecl)) { 229 for (const auto *Init : CtorDecl->inits()) { 230 if (Init->isMemberInitializer()) { 231 Fields.insert(Init->getMember()); 232 } else if (Init->isIndirectMemberInitializer()) { 233 for (const auto *I : Init->getIndirectMember()->chain()) 234 Fields.insert(cast<FieldDecl>(I)); 235 } 236 const Expr *E = Init->getInit(); 237 assert(E != nullptr); 238 getFieldsGlobalsAndFuncs(*E, Fields, Vars, Funcs); 239 } 240 // Add all fields mentioned in default member initializers. 241 for (const FieldDecl *F : CtorDecl->getParent()->fields()) 242 if (const auto *I = F->getInClassInitializer()) 243 getFieldsGlobalsAndFuncs(*I, Fields, Vars, Funcs); 244 } 245 getFieldsGlobalsAndFuncs(*FuncDecl->getBody(), Fields, Vars, Funcs); 246 247 // These have to be added before the lines that follow to ensure that 248 // `create*` work correctly for structs. 249 DACtx->addModeledFields(Fields); 250 251 for (const VarDecl *D : Vars) { 252 if (getStorageLocation(*D) != nullptr) 253 continue; 254 auto &Loc = createStorageLocation(D->getType().getNonReferenceType()); 255 setStorageLocation(*D, Loc); 256 if (auto *Val = createValue(D->getType().getNonReferenceType())) 257 setValue(Loc, *Val); 258 } 259 260 for (const FunctionDecl *FD : Funcs) { 261 if (getStorageLocation(*FD) != nullptr) 262 continue; 263 auto &Loc = createStorageLocation(FD->getType()); 264 setStorageLocation(*FD, Loc); 265 } 266 } 267 268 Environment::Environment(DataflowAnalysisContext &DACtx) 269 : DACtx(&DACtx), 270 FlowConditionToken(&DACtx.arena().makeFlowConditionToken()) {} 271 272 Environment Environment::fork() const { 273 Environment Copy(*this); 274 Copy.FlowConditionToken = &DACtx->forkFlowCondition(*FlowConditionToken); 275 return Copy; 276 } 277 278 Environment::Environment(DataflowAnalysisContext &DACtx, 279 const DeclContext &DeclCtx) 280 : Environment(DACtx) { 281 CallStack.push_back(&DeclCtx); 282 283 if (const auto *FuncDecl = dyn_cast<FunctionDecl>(&DeclCtx)) { 284 assert(FuncDecl->getBody() != nullptr); 285 286 initFieldsGlobalsAndFuncs(FuncDecl); 287 288 for (const auto *ParamDecl : FuncDecl->parameters()) { 289 assert(ParamDecl != nullptr); 290 // References aren't objects, so the reference itself doesn't have a 291 // storage location. Instead, the storage location for a reference refers 292 // directly to an object of the referenced type -- so strip off any 293 // reference from the type. 294 auto &ParamLoc = 295 createStorageLocation(ParamDecl->getType().getNonReferenceType()); 296 setStorageLocation(*ParamDecl, ParamLoc); 297 if (Value *ParamVal = 298 createValue(ParamDecl->getType().getNonReferenceType())) 299 setValue(ParamLoc, *ParamVal); 300 } 301 } 302 303 if (const auto *MethodDecl = dyn_cast<CXXMethodDecl>(&DeclCtx)) { 304 auto *Parent = MethodDecl->getParent(); 305 assert(Parent != nullptr); 306 if (Parent->isLambda()) 307 MethodDecl = dyn_cast<CXXMethodDecl>(Parent->getDeclContext()); 308 309 // FIXME: Initialize the ThisPointeeLoc of lambdas too. 310 if (MethodDecl && !MethodDecl->isStatic()) { 311 QualType ThisPointeeType = MethodDecl->getThisObjectType(); 312 ThisPointeeLoc = &createStorageLocation(ThisPointeeType); 313 if (Value *ThisPointeeVal = createValue(ThisPointeeType)) 314 setValue(*ThisPointeeLoc, *ThisPointeeVal); 315 } 316 } 317 } 318 319 bool Environment::canDescend(unsigned MaxDepth, 320 const DeclContext *Callee) const { 321 return CallStack.size() <= MaxDepth && !llvm::is_contained(CallStack, Callee); 322 } 323 324 Environment Environment::pushCall(const CallExpr *Call) const { 325 Environment Env(*this); 326 327 if (const auto *MethodCall = dyn_cast<CXXMemberCallExpr>(Call)) { 328 if (const Expr *Arg = MethodCall->getImplicitObjectArgument()) { 329 if (!isa<CXXThisExpr>(Arg)) 330 Env.ThisPointeeLoc = getStorageLocation(*Arg, SkipPast::Reference); 331 // Otherwise (when the argument is `this`), retain the current 332 // environment's `ThisPointeeLoc`. 333 } 334 } 335 336 Env.pushCallInternal(Call->getDirectCallee(), 337 llvm::ArrayRef(Call->getArgs(), Call->getNumArgs())); 338 339 return Env; 340 } 341 342 Environment Environment::pushCall(const CXXConstructExpr *Call) const { 343 Environment Env(*this); 344 345 Env.ThisPointeeLoc = &Env.createStorageLocation(Call->getType()); 346 if (Value *Val = Env.createValue(Call->getType())) 347 Env.setValue(*Env.ThisPointeeLoc, *Val); 348 349 Env.pushCallInternal(Call->getConstructor(), 350 llvm::ArrayRef(Call->getArgs(), Call->getNumArgs())); 351 352 return Env; 353 } 354 355 void Environment::pushCallInternal(const FunctionDecl *FuncDecl, 356 ArrayRef<const Expr *> Args) { 357 // Canonicalize to the definition of the function. This ensures that we're 358 // putting arguments into the same `ParamVarDecl`s` that the callee will later 359 // be retrieving them from. 360 assert(FuncDecl->getDefinition() != nullptr); 361 FuncDecl = FuncDecl->getDefinition(); 362 363 CallStack.push_back(FuncDecl); 364 365 initFieldsGlobalsAndFuncs(FuncDecl); 366 367 const auto *ParamIt = FuncDecl->param_begin(); 368 369 // FIXME: Parameters don't always map to arguments 1:1; examples include 370 // overloaded operators implemented as member functions, and parameter packs. 371 for (unsigned ArgIndex = 0; ArgIndex < Args.size(); ++ParamIt, ++ArgIndex) { 372 assert(ParamIt != FuncDecl->param_end()); 373 374 const Expr *Arg = Args[ArgIndex]; 375 auto *ArgLoc = getStorageLocation(*Arg, SkipPast::Reference); 376 if (ArgLoc == nullptr) 377 continue; 378 379 const VarDecl *Param = *ParamIt; 380 381 QualType ParamType = Param->getType(); 382 if (ParamType->isReferenceType()) { 383 setStorageLocation(*Param, *ArgLoc); 384 } else { 385 auto &Loc = createStorageLocation(*Param); 386 setStorageLocation(*Param, Loc); 387 388 if (auto *ArgVal = getValue(*ArgLoc)) { 389 setValue(Loc, *ArgVal); 390 } else if (Value *Val = createValue(ParamType)) { 391 setValue(Loc, *Val); 392 } 393 } 394 } 395 } 396 397 void Environment::popCall(const CallExpr *Call, const Environment &CalleeEnv) { 398 // We ignore `DACtx` because it's already the same in both. We don't want the 399 // callee's `DeclCtx`, `ReturnVal`, `ReturnLoc` or `ThisPointeeLoc`. We don't 400 // bring back `DeclToLoc` and `ExprToLoc` because we want to be able to later 401 // analyze the same callee in a different context, and `setStorageLocation` 402 // requires there to not already be a storage location assigned. Conceptually, 403 // these maps capture information from the local scope, so when popping that 404 // scope, we do not propagate the maps. 405 this->LocToVal = std::move(CalleeEnv.LocToVal); 406 this->MemberLocToStruct = std::move(CalleeEnv.MemberLocToStruct); 407 this->FlowConditionToken = std::move(CalleeEnv.FlowConditionToken); 408 409 if (Call->isGLValue()) { 410 if (CalleeEnv.ReturnLoc != nullptr) 411 setStorageLocationStrict(*Call, *CalleeEnv.ReturnLoc); 412 } else if (!Call->getType()->isVoidType()) { 413 if (CalleeEnv.ReturnVal != nullptr) 414 setValueStrict(*Call, *CalleeEnv.ReturnVal); 415 } 416 } 417 418 void Environment::popCall(const CXXConstructExpr *Call, 419 const Environment &CalleeEnv) { 420 // See also comment in `popCall(const CallExpr *, const Environment &)` above. 421 this->LocToVal = std::move(CalleeEnv.LocToVal); 422 this->MemberLocToStruct = std::move(CalleeEnv.MemberLocToStruct); 423 this->FlowConditionToken = std::move(CalleeEnv.FlowConditionToken); 424 425 if (Value *Val = CalleeEnv.getValue(*CalleeEnv.ThisPointeeLoc)) { 426 setValueStrict(*Call, *Val); 427 } 428 } 429 430 bool Environment::equivalentTo(const Environment &Other, 431 Environment::ValueModel &Model) const { 432 assert(DACtx == Other.DACtx); 433 434 if (ReturnVal != Other.ReturnVal) 435 return false; 436 437 if (ReturnLoc != Other.ReturnLoc) 438 return false; 439 440 if (ThisPointeeLoc != Other.ThisPointeeLoc) 441 return false; 442 443 if (DeclToLoc != Other.DeclToLoc) 444 return false; 445 446 if (ExprToLoc != Other.ExprToLoc) 447 return false; 448 449 // Compare the contents for the intersection of their domains. 450 for (auto &Entry : LocToVal) { 451 const StorageLocation *Loc = Entry.first; 452 assert(Loc != nullptr); 453 454 Value *Val = Entry.second; 455 assert(Val != nullptr); 456 457 auto It = Other.LocToVal.find(Loc); 458 if (It == Other.LocToVal.end()) 459 continue; 460 assert(It->second != nullptr); 461 462 if (!areEquivalentValues(*Val, *It->second) && 463 !compareDistinctValues(Loc->getType(), *Val, *this, *It->second, Other, 464 Model)) 465 return false; 466 } 467 468 return true; 469 } 470 471 LatticeJoinEffect Environment::widen(const Environment &PrevEnv, 472 Environment::ValueModel &Model) { 473 assert(DACtx == PrevEnv.DACtx); 474 assert(ReturnVal == PrevEnv.ReturnVal); 475 assert(ReturnLoc == PrevEnv.ReturnLoc); 476 assert(ThisPointeeLoc == PrevEnv.ThisPointeeLoc); 477 assert(CallStack == PrevEnv.CallStack); 478 479 auto Effect = LatticeJoinEffect::Unchanged; 480 481 // By the API, `PrevEnv` is a previous version of the environment for the same 482 // block, so we have some guarantees about its shape. In particular, it will 483 // be the result of a join or widen operation on previous values for this 484 // block. For `DeclToLoc` and `ExprToLoc`, join guarantees that these maps are 485 // subsets of the maps in `PrevEnv`. So, as long as we maintain this property 486 // here, we don't need change their current values to widen. 487 // 488 // FIXME: `MemberLocToStruct` does not share the above property, because 489 // `join` can cause the map size to increase (when we add fresh data in places 490 // of conflict). Once this issue with join is resolved, re-enable the 491 // assertion below or replace with something that captures the desired 492 // invariant. 493 assert(DeclToLoc.size() <= PrevEnv.DeclToLoc.size()); 494 assert(ExprToLoc.size() <= PrevEnv.ExprToLoc.size()); 495 // assert(MemberLocToStruct.size() <= PrevEnv.MemberLocToStruct.size()); 496 497 llvm::DenseMap<const StorageLocation *, Value *> WidenedLocToVal; 498 for (auto &Entry : LocToVal) { 499 const StorageLocation *Loc = Entry.first; 500 assert(Loc != nullptr); 501 502 Value *Val = Entry.second; 503 assert(Val != nullptr); 504 505 auto PrevIt = PrevEnv.LocToVal.find(Loc); 506 if (PrevIt == PrevEnv.LocToVal.end()) 507 continue; 508 assert(PrevIt->second != nullptr); 509 510 if (areEquivalentValues(*Val, *PrevIt->second)) { 511 WidenedLocToVal.insert({Loc, Val}); 512 continue; 513 } 514 515 Value &WidenedVal = widenDistinctValues(Loc->getType(), *PrevIt->second, 516 PrevEnv, *Val, *this, Model); 517 WidenedLocToVal.insert({Loc, &WidenedVal}); 518 if (&WidenedVal != PrevIt->second) 519 Effect = LatticeJoinEffect::Changed; 520 } 521 LocToVal = std::move(WidenedLocToVal); 522 // FIXME: update the equivalence calculation for `MemberLocToStruct`, once we 523 // have a systematic way of soundly comparing this map. 524 if (DeclToLoc.size() != PrevEnv.DeclToLoc.size() || 525 ExprToLoc.size() != PrevEnv.ExprToLoc.size() || 526 LocToVal.size() != PrevEnv.LocToVal.size() || 527 MemberLocToStruct.size() != PrevEnv.MemberLocToStruct.size()) 528 Effect = LatticeJoinEffect::Changed; 529 530 return Effect; 531 } 532 533 Environment Environment::join(const Environment &EnvA, const Environment &EnvB, 534 Environment::ValueModel &Model) { 535 assert(EnvA.DACtx == EnvB.DACtx); 536 assert(EnvA.ThisPointeeLoc == EnvB.ThisPointeeLoc); 537 assert(EnvA.CallStack == EnvB.CallStack); 538 539 Environment JoinedEnv(*EnvA.DACtx); 540 541 JoinedEnv.CallStack = EnvA.CallStack; 542 JoinedEnv.ThisPointeeLoc = EnvA.ThisPointeeLoc; 543 544 if (EnvA.ReturnVal == nullptr || EnvB.ReturnVal == nullptr) { 545 // `ReturnVal` might not always get set -- for example if we have a return 546 // statement of the form `return some_other_func()` and we decide not to 547 // analyze `some_other_func()`. 548 // In this case, we can't say anything about the joined return value -- we 549 // don't simply want to propagate the return value that we do have, because 550 // it might not be the correct one. 551 // This occurs for example in the test `ContextSensitiveMutualRecursion`. 552 JoinedEnv.ReturnVal = nullptr; 553 } else if (areEquivalentValues(*EnvA.ReturnVal, *EnvB.ReturnVal)) { 554 JoinedEnv.ReturnVal = EnvA.ReturnVal; 555 } else { 556 assert(!EnvA.CallStack.empty()); 557 // FIXME: Make `CallStack` a vector of `FunctionDecl` so we don't need this 558 // cast. 559 auto *Func = dyn_cast<FunctionDecl>(EnvA.CallStack.back()); 560 assert(Func != nullptr); 561 if (Value *MergedVal = 562 mergeDistinctValues(Func->getReturnType(), *EnvA.ReturnVal, EnvA, 563 *EnvB.ReturnVal, EnvB, JoinedEnv, Model)) 564 JoinedEnv.ReturnVal = MergedVal; 565 } 566 567 if (EnvA.ReturnLoc == EnvB.ReturnLoc) 568 JoinedEnv.ReturnLoc = EnvA.ReturnLoc; 569 else 570 JoinedEnv.ReturnLoc = nullptr; 571 572 // FIXME: Once we're able to remove declarations from `DeclToLoc` when their 573 // lifetime ends, add an assertion that there aren't any entries in 574 // `DeclToLoc` and `Other.DeclToLoc` that map the same declaration to 575 // different storage locations. 576 JoinedEnv.DeclToLoc = intersectDenseMaps(EnvA.DeclToLoc, EnvB.DeclToLoc); 577 578 JoinedEnv.ExprToLoc = intersectDenseMaps(EnvA.ExprToLoc, EnvB.ExprToLoc); 579 580 JoinedEnv.MemberLocToStruct = 581 intersectDenseMaps(EnvA.MemberLocToStruct, EnvB.MemberLocToStruct); 582 583 // FIXME: update join to detect backedges and simplify the flow condition 584 // accordingly. 585 JoinedEnv.FlowConditionToken = &EnvA.DACtx->joinFlowConditions( 586 *EnvA.FlowConditionToken, *EnvB.FlowConditionToken); 587 588 for (auto &Entry : EnvA.LocToVal) { 589 const StorageLocation *Loc = Entry.first; 590 assert(Loc != nullptr); 591 592 Value *Val = Entry.second; 593 assert(Val != nullptr); 594 595 auto It = EnvB.LocToVal.find(Loc); 596 if (It == EnvB.LocToVal.end()) 597 continue; 598 assert(It->second != nullptr); 599 600 if (areEquivalentValues(*Val, *It->second)) { 601 JoinedEnv.LocToVal.insert({Loc, Val}); 602 continue; 603 } 604 605 if (Value *MergedVal = mergeDistinctValues( 606 Loc->getType(), *Val, EnvA, *It->second, EnvB, JoinedEnv, Model)) { 607 JoinedEnv.LocToVal.insert({Loc, MergedVal}); 608 } 609 } 610 611 return JoinedEnv; 612 } 613 614 StorageLocation &Environment::createStorageLocation(QualType Type) { 615 return DACtx->createStorageLocation(Type); 616 } 617 618 StorageLocation &Environment::createStorageLocation(const VarDecl &D) { 619 // Evaluated declarations are always assigned the same storage locations to 620 // ensure that the environment stabilizes across loop iterations. Storage 621 // locations for evaluated declarations are stored in the analysis context. 622 return DACtx->getStableStorageLocation(D); 623 } 624 625 StorageLocation &Environment::createStorageLocation(const Expr &E) { 626 // Evaluated expressions are always assigned the same storage locations to 627 // ensure that the environment stabilizes across loop iterations. Storage 628 // locations for evaluated expressions are stored in the analysis context. 629 return DACtx->getStableStorageLocation(E); 630 } 631 632 void Environment::setStorageLocation(const ValueDecl &D, StorageLocation &Loc) { 633 assert(!DeclToLoc.contains(&D)); 634 assert(!isa_and_nonnull<ReferenceValue>(getValue(Loc))); 635 DeclToLoc[&D] = &Loc; 636 } 637 638 StorageLocation *Environment::getStorageLocation(const ValueDecl &D) const { 639 auto It = DeclToLoc.find(&D); 640 if (It == DeclToLoc.end()) 641 return nullptr; 642 643 StorageLocation *Loc = It->second; 644 645 assert(!isa_and_nonnull<ReferenceValue>(getValue(*Loc))); 646 647 return Loc; 648 } 649 650 void Environment::setStorageLocation(const Expr &E, StorageLocation &Loc) { 651 const Expr &CanonE = ignoreCFGOmittedNodes(E); 652 assert(!ExprToLoc.contains(&CanonE)); 653 ExprToLoc[&CanonE] = &Loc; 654 } 655 656 void Environment::setStorageLocationStrict(const Expr &E, 657 StorageLocation &Loc) { 658 // `DeclRefExpr`s to builtin function types aren't glvalues, for some reason, 659 // but we still want to be able to associate a `StorageLocation` with them, 660 // so allow these as an exception. 661 assert(E.isGLValue() || 662 E.getType()->isSpecificBuiltinType(BuiltinType::BuiltinFn)); 663 setStorageLocation(E, Loc); 664 } 665 666 StorageLocation *Environment::getStorageLocation(const Expr &E, 667 SkipPast SP) const { 668 // FIXME: Add a test with parens. 669 auto It = ExprToLoc.find(&ignoreCFGOmittedNodes(E)); 670 return It == ExprToLoc.end() ? nullptr : &skip(*It->second, SP); 671 } 672 673 StorageLocation *Environment::getStorageLocationStrict(const Expr &E) const { 674 // See comment in `setStorageLocationStrict()`. 675 assert(E.isGLValue() || 676 E.getType()->isSpecificBuiltinType(BuiltinType::BuiltinFn)); 677 StorageLocation *Loc = getStorageLocation(E, SkipPast::None); 678 679 if (Loc == nullptr) 680 return nullptr; 681 682 if (auto *RefVal = dyn_cast_or_null<ReferenceValue>(getValue(*Loc))) 683 return &RefVal->getReferentLoc(); 684 685 return Loc; 686 } 687 688 StorageLocation *Environment::getThisPointeeStorageLocation() const { 689 return ThisPointeeLoc; 690 } 691 692 PointerValue &Environment::getOrCreateNullPointerValue(QualType PointeeType) { 693 return DACtx->getOrCreateNullPointerValue(PointeeType); 694 } 695 696 void Environment::setValue(const StorageLocation &Loc, Value &Val) { 697 LocToVal[&Loc] = &Val; 698 699 if (auto *StructVal = dyn_cast<StructValue>(&Val)) { 700 auto &AggregateLoc = *cast<AggregateStorageLocation>(&Loc); 701 702 const QualType Type = AggregateLoc.getType(); 703 assert(Type->isRecordType()); 704 705 for (const FieldDecl *Field : DACtx->getReferencedFields(Type)) { 706 assert(Field != nullptr); 707 StorageLocation &FieldLoc = AggregateLoc.getChild(*Field); 708 MemberLocToStruct[&FieldLoc] = std::make_pair(StructVal, Field); 709 if (auto *FieldVal = StructVal->getChild(*Field)) 710 setValue(FieldLoc, *FieldVal); 711 } 712 } 713 714 auto It = MemberLocToStruct.find(&Loc); 715 if (It != MemberLocToStruct.end()) { 716 // `Loc` is the location of a struct member so we need to also update the 717 // value of the member in the corresponding `StructValue`. 718 719 assert(It->second.first != nullptr); 720 StructValue &StructVal = *It->second.first; 721 722 assert(It->second.second != nullptr); 723 const ValueDecl &Member = *It->second.second; 724 725 StructVal.setChild(Member, Val); 726 } 727 } 728 729 void Environment::clearValue(const StorageLocation &Loc) { 730 LocToVal.erase(&Loc); 731 732 if (auto It = MemberLocToStruct.find(&Loc); It != MemberLocToStruct.end()) { 733 // `Loc` is the location of a struct member so we need to also clear the 734 // member in the corresponding `StructValue`. 735 736 assert(It->second.first != nullptr); 737 StructValue &StructVal = *It->second.first; 738 739 assert(It->second.second != nullptr); 740 const ValueDecl &Member = *It->second.second; 741 742 StructVal.clearChild(Member); 743 } 744 } 745 746 void Environment::setValueStrict(const Expr &E, Value &Val) { 747 assert(E.isPRValue()); 748 assert(!isa<ReferenceValue>(Val)); 749 750 StorageLocation *Loc = getStorageLocation(E, SkipPast::None); 751 if (Loc == nullptr) { 752 Loc = &createStorageLocation(E); 753 setStorageLocation(E, *Loc); 754 } 755 setValue(*Loc, Val); 756 } 757 758 Value *Environment::getValue(const StorageLocation &Loc) const { 759 return LocToVal.lookup(&Loc); 760 } 761 762 Value *Environment::getValue(const ValueDecl &D) const { 763 auto *Loc = getStorageLocation(D); 764 if (Loc == nullptr) 765 return nullptr; 766 return getValue(*Loc); 767 } 768 769 Value *Environment::getValue(const Expr &E, SkipPast SP) const { 770 auto *Loc = getStorageLocation(E, SP); 771 if (Loc == nullptr) 772 return nullptr; 773 return getValue(*Loc); 774 } 775 776 Value *Environment::getValueStrict(const Expr &E) const { 777 assert(E.isPRValue()); 778 Value *Val = getValue(E, SkipPast::None); 779 780 assert(Val == nullptr || !isa<ReferenceValue>(Val)); 781 782 return Val; 783 } 784 785 Value *Environment::createValue(QualType Type) { 786 llvm::DenseSet<QualType> Visited; 787 int CreatedValuesCount = 0; 788 Value *Val = createValueUnlessSelfReferential(Type, Visited, /*Depth=*/0, 789 CreatedValuesCount); 790 if (CreatedValuesCount > MaxCompositeValueSize) { 791 llvm::errs() << "Attempting to initialize a huge value of type: " << Type 792 << '\n'; 793 } 794 return Val; 795 } 796 797 Value *Environment::createValueUnlessSelfReferential( 798 QualType Type, llvm::DenseSet<QualType> &Visited, int Depth, 799 int &CreatedValuesCount) { 800 assert(!Type.isNull()); 801 802 // Allow unlimited fields at depth 1; only cap at deeper nesting levels. 803 if ((Depth > 1 && CreatedValuesCount > MaxCompositeValueSize) || 804 Depth > MaxCompositeValueDepth) 805 return nullptr; 806 807 if (Type->isBooleanType()) { 808 CreatedValuesCount++; 809 return &makeAtomicBoolValue(); 810 } 811 812 if (Type->isIntegerType()) { 813 // FIXME: consider instead `return nullptr`, given that we do nothing useful 814 // with integers, and so distinguishing them serves no purpose, but could 815 // prevent convergence. 816 CreatedValuesCount++; 817 return &DACtx->arena().create<IntegerValue>(); 818 } 819 820 if (Type->isReferenceType() || Type->isPointerType()) { 821 CreatedValuesCount++; 822 QualType PointeeType = Type->getPointeeType(); 823 auto &PointeeLoc = createStorageLocation(PointeeType); 824 825 if (Visited.insert(PointeeType.getCanonicalType()).second) { 826 Value *PointeeVal = createValueUnlessSelfReferential( 827 PointeeType, Visited, Depth, CreatedValuesCount); 828 Visited.erase(PointeeType.getCanonicalType()); 829 830 if (PointeeVal != nullptr) 831 setValue(PointeeLoc, *PointeeVal); 832 } 833 834 if (Type->isReferenceType()) 835 return &DACtx->arena().create<ReferenceValue>(PointeeLoc); 836 else 837 return &DACtx->arena().create<PointerValue>(PointeeLoc); 838 } 839 840 if (Type->isRecordType()) { 841 CreatedValuesCount++; 842 llvm::DenseMap<const ValueDecl *, Value *> FieldValues; 843 for (const FieldDecl *Field : DACtx->getReferencedFields(Type)) { 844 assert(Field != nullptr); 845 846 QualType FieldType = Field->getType(); 847 if (Visited.contains(FieldType.getCanonicalType())) 848 continue; 849 850 Visited.insert(FieldType.getCanonicalType()); 851 if (auto *FieldValue = createValueUnlessSelfReferential( 852 FieldType, Visited, Depth + 1, CreatedValuesCount)) 853 FieldValues.insert({Field, FieldValue}); 854 Visited.erase(FieldType.getCanonicalType()); 855 } 856 857 return &DACtx->arena().create<StructValue>(std::move(FieldValues)); 858 } 859 860 return nullptr; 861 } 862 863 StorageLocation &Environment::skip(StorageLocation &Loc, SkipPast SP) const { 864 switch (SP) { 865 case SkipPast::None: 866 return Loc; 867 case SkipPast::Reference: 868 // References cannot be chained so we only need to skip past one level of 869 // indirection. 870 if (auto *Val = dyn_cast_or_null<ReferenceValue>(getValue(Loc))) 871 return Val->getReferentLoc(); 872 return Loc; 873 } 874 llvm_unreachable("bad SkipPast kind"); 875 } 876 877 const StorageLocation &Environment::skip(const StorageLocation &Loc, 878 SkipPast SP) const { 879 return skip(*const_cast<StorageLocation *>(&Loc), SP); 880 } 881 882 void Environment::addToFlowCondition(BoolValue &Val) { 883 DACtx->addFlowConditionConstraint(*FlowConditionToken, Val); 884 } 885 886 bool Environment::flowConditionImplies(BoolValue &Val) const { 887 return DACtx->flowConditionImplies(*FlowConditionToken, Val); 888 } 889 890 void Environment::dump(raw_ostream &OS) const { 891 // FIXME: add printing for remaining fields and allow caller to decide what 892 // fields are printed. 893 OS << "DeclToLoc:\n"; 894 for (auto [D, L] : DeclToLoc) 895 OS << " [" << D->getNameAsString() << ", " << L << "]\n"; 896 897 OS << "ExprToLoc:\n"; 898 for (auto [E, L] : ExprToLoc) 899 OS << " [" << E << ", " << L << "]\n"; 900 901 OS << "LocToVal:\n"; 902 for (auto [L, V] : LocToVal) { 903 OS << " [" << L << ", " << V << ": " << *V << "]\n"; 904 } 905 906 OS << "FlowConditionToken:\n"; 907 DACtx->dumpFlowCondition(*FlowConditionToken, OS); 908 } 909 910 void Environment::dump() const { 911 dump(llvm::dbgs()); 912 } 913 914 AggregateStorageLocation * 915 getImplicitObjectLocation(const CXXMemberCallExpr &MCE, 916 const Environment &Env) { 917 Expr *ImplicitObject = MCE.getImplicitObjectArgument(); 918 if (ImplicitObject == nullptr) 919 return nullptr; 920 StorageLocation *Loc = 921 Env.getStorageLocation(*ImplicitObject, SkipPast::Reference); 922 if (Loc == nullptr) 923 return nullptr; 924 if (ImplicitObject->getType()->isPointerType()) { 925 if (auto *Val = cast_or_null<PointerValue>(Env.getValue(*Loc))) 926 return &cast<AggregateStorageLocation>(Val->getPointeeLoc()); 927 return nullptr; 928 } 929 return cast<AggregateStorageLocation>(Loc); 930 } 931 932 AggregateStorageLocation *getBaseObjectLocation(const MemberExpr &ME, 933 const Environment &Env) { 934 Expr *Base = ME.getBase(); 935 if (Base == nullptr) 936 return nullptr; 937 StorageLocation *Loc = Env.getStorageLocation(*Base, SkipPast::Reference); 938 if (Loc == nullptr) 939 return nullptr; 940 if (ME.isArrow()) { 941 if (auto *Val = cast_or_null<PointerValue>(Env.getValue(*Loc))) 942 return &cast<AggregateStorageLocation>(Val->getPointeeLoc()); 943 return nullptr; 944 } 945 return cast<AggregateStorageLocation>(Loc); 946 } 947 948 } // namespace dataflow 949 } // namespace clang 950