21#include "llvm/ADT/BitVector.h"
22#include "llvm/ADT/ImmutableList.h"
23#include "llvm/ADT/SmallSet.h"
24#include "llvm/ADT/SmallVector.h"
25#include "llvm/Support/raw_ostream.h"
45 : PersistentOrigins(Persistent), BlockLocalOrigins(BlockLocal) {}
49 return PersistentOrigins ==
Other.PersistentOrigins &&
50 BlockLocalOrigins ==
Other.BlockLocalOrigins;
54 void dump(llvm::raw_ostream &OS)
const {
55 OS <<
"LoanPropagationLattice State:\n";
56 OS <<
" Persistent Origins:\n";
57 if (PersistentOrigins.isEmpty())
59 for (
const auto &Entry : PersistentOrigins) {
60 if (Entry.second.isEmpty())
61 OS <<
" Origin " << Entry.first <<
" contains no loans\n";
62 for (
const LoanID &LID : Entry.second)
63 OS <<
" Origin " << Entry.first <<
" contains Loan " << LID <<
"\n";
65 OS <<
" Block-Local Origins:\n";
66 if (BlockLocalOrigins.isEmpty())
68 for (
const auto &Entry : BlockLocalOrigins) {
69 if (Entry.second.isEmpty())
70 OS <<
" Origin " << Entry.first <<
" contains no loans\n";
71 for (
const LoanID &LID : Entry.second)
72 OS <<
" Origin " << Entry.first <<
" contains Loan " << LID <<
"\n";
80 AnalysisImpl(
const CFG &
C, AnalysisDeclContext &AC, FactManager &F,
81 OriginLoanMap::Factory &OriginLoanMapFactory,
82 LoanSet::Factory &LoanSetFactory)
83 : DataflowAnalysis(
C, AC, F), OriginLoanMapFactory(OriginLoanMapFactory),
84 LoanSetFactory(LoanSetFactory),
85 PersistentOrigins(F.getPersistentOrigins()) {}
89 StringRef getAnalysisName()
const {
return "LoanPropagation"; }
91 Lattice getInitialState() {
return Lattice{}; }
94 Lattice
join(Lattice A, Lattice B) {
95 assert(A.BlockLocalOrigins.isEmpty() && B.BlockLocalOrigins.isEmpty() &&
96 "block-local origins must not reach a block boundary");
98 A.PersistentOrigins, B.PersistentOrigins, OriginLoanMapFactory,
100 assert((S1 || S2) &&
"unexpectedly merging 2 empty sets");
105 return utils::join(*S1, *S2, LoanSetFactory);
110 return Lattice(JoinedOrigins, OriginLoanMapFactory.getEmptyMap());
117 Lattice transferAtBlockExit(Lattice L) {
118 return Lattice(L.PersistentOrigins, OriginLoanMapFactory.getEmptyMap());
122 Lattice
transfer(Lattice In,
const IssueFact &F) {
124 LoanID LID = F.getLoanID();
125 LoanSet NewLoans = LoanSetFactory.add(LoanSetFactory.getEmptySet(), LID);
126 return setLoans(In, OID, NewLoans);
132 Lattice
transfer(Lattice In,
const OriginFlowFact &F) {
133 OriginID DestOID = F.getDestOriginID();
134 OriginID SrcOID = F.getSrcOriginID();
137 F.getKillDest() ? LoanSetFactory.getEmptySet() : getLoans(In, DestOID);
138 LoanSet SrcLoans = getLoans(In, SrcOID);
141 return setLoans(In, DestOID, MergedLoans);
144 Lattice
transfer(Lattice In,
const KillOriginFact &F) {
145 return setLoans(In, F.getKilledOrigin(), LoanSetFactory.getEmptySet());
148 Lattice
transfer(Lattice In,
const ExpireFact &F) {
149 if (
auto OID = F.getOriginID())
150 return setLoans(In, *OID, LoanSetFactory.getEmptySet());
155 return getLoans(getState(P), OID);
158 llvm::SmallVector<OriginID> buildOriginFlowChain(
ProgramPoint StartPoint,
161 const CFG *Cfg)
const {
162 assert(getLoans(StartOID, StartPoint).
contains(TargetLoan) &&
163 "TargetLoan must be present in the StartOID at the StartPoint");
166 const CFGBlock *EndBlock =
nullptr;
167 size_t BlockID = FactMgr.getBlockID(StartPoint);
168 for (
const CFGBlock *
Block : *Cfg)
169 if (
Block->getBlockID() == BlockID) {
177 using SearchState = std::pair<const CFGBlock *, OriginID>;
179 SearchState CurrState;
180 llvm::ImmutableList<OriginID> OriginFlowChain;
183 llvm::SmallVector<DFSNode> PendingStates;
184 llvm::SmallSet<SearchState, 16> VistedStates;
185 llvm::ImmutableList<OriginID>::Factory OriginFlowChainFactory;
186 PendingStates.push_back(
187 {{EndBlock, StartOID}, OriginFlowChainFactory.getEmptyList()});
190 while (!PendingStates.empty()) {
191 DFSNode CurrNode = PendingStates.pop_back_val();
192 auto [CurrBlock, CurrOID] = CurrNode.CurrState;
195 const auto [BuildResult,
Complete] =
196 buildOriginFlowChain(CurrBlock, CurrOID, TargetLoan);
197 if (!BuildResult.empty()) {
199 CurrNode.OriginFlowChain =
200 OriginFlowChainFactory.add(OID, CurrNode.OriginFlowChain);
201 CurrOID = BuildResult.back();
206 llvm::SmallVector<OriginID>
Result(CurrNode.OriginFlowChain.begin(),
207 CurrNode.OriginFlowChain.end());
214 for (
const CFGBlock *PredBlock : CurrBlock->preds()) {
215 SearchState NextState = {PredBlock, CurrOID};
216 if (getLoans(getOutState(PredBlock), CurrOID).
contains(TargetLoan) &&
217 VistedStates.insert(NextState).second)
218 PendingStates.push_back({NextState, CurrNode.OriginFlowChain});
222 llvm_unreachable(
"Could not reconstruct origin flow. Search finished "
223 "without reaching IssueFact");
226 llvm::SmallVector<OriginID> buildOriginFlowChain(
const UseFact *UF,
228 const CFG *Cfg)
const {
229 for (
const OriginList *Cur = UF->getUsedOrigins(); Cur;
230 Cur = Cur->peelOuterOrigin())
231 if (getLoans(Cur->getOuterOriginID(), UF).contains(TargetLoan))
232 return buildOriginFlowChain(UF, Cur->getOuterOriginID(), TargetLoan,
240 bool isPersistent(
OriginID OID)
const {
241 return PersistentOrigins.test(OID.Value);
245 if (isPersistent(OID))
246 return Lattice(OriginLoanMapFactory.add(L.PersistentOrigins, OID, Loans),
247 L.BlockLocalOrigins);
248 return Lattice(L.PersistentOrigins,
249 OriginLoanMapFactory.add(L.BlockLocalOrigins, OID, Loans));
254 isPersistent(OID) ? &L.PersistentOrigins : &L.BlockLocalOrigins;
255 if (
auto *Loans = Map->lookup(OID))
257 return LoanSetFactory.getEmptySet();
268 std::pair<llvm::SmallVector<OriginID>,
bool>
269 buildOriginFlowChain(
const CFGBlock *
Block,
const OriginID StartOID,
270 const LoanID TargetLoan)
const {
272 llvm::SmallVector<OriginID> OriginFlowChain;
274 for (
const Fact *F : llvm::reverse(FactMgr.getFacts(
Block))) {
275 if (
const auto *IF = F->getAs<IssueFact>())
276 if (IF->getLoanID() == TargetLoan && IF->getOriginID() == CurrOID)
277 return {OriginFlowChain,
true};
279 const auto *OFF = F->getAs<OriginFlowFact>();
280 if (!OFF || OFF->getDestOriginID() != CurrOID)
283 const OriginID SrcOriginID = OFF->getSrcOriginID();
284 if (!getLoans(SrcOriginID, OFF).
contains(TargetLoan))
287 OriginFlowChain.push_back(SrcOriginID);
288 CurrOID = SrcOriginID;
291 return {OriginFlowChain,
false};
294 OriginLoanMap::Factory &OriginLoanMapFactory;
295 LoanSet::Factory &LoanSetFactory;
298 const llvm::BitVector &PersistentOrigins;
303 using AnalysisImpl::AnalysisImpl;
308 OriginLoanMap::Factory &OriginLoanMapFactory,
309 LoanSet::Factory &LoanSetFactory)
310 : PImpl(
std::make_unique<
Impl>(
C, AC, F, OriginLoanMapFactory,
318 return PImpl->getLoans(OID, P);
323 const CFG *Cfg)
const {
324 return PImpl->buildOriginFlowChain(StartPoint, StartOID, TargetLoan, Cfg);
329 return PImpl->buildOriginFlowChain(UF, TargetLoan, Cfg);
This file defines AnalysisDeclContext, a class that manages the analysis context data for context sen...
static void dump(llvm::raw_ostream &OS, StringRef FunctionName, ArrayRef< CounterExpression > Expressions, ArrayRef< CounterMappingRegion > Regions)
Forward-declares and imports various common LLVM datatypes that clang wants to use unqualified.
static bool contains(const std::set< tok::TokenKind > &Terminators, const Token &Tok)
AnalysisDeclContext contains the context data for the function, method or block under analysis.
Represents a source-level, intra-procedural CFG that represents the control-flow of a Stmt.
A generic, policy-based driver for dataflow analyses.
llvm::SmallVector< OriginID > buildOriginFlowChain(ProgramPoint StartPoint, const OriginID StartOID, const LoanID TargetLoan, const CFG *Cfg) const
Builds the chain of origins through which a loan has propagated.
LoanSet getLoans(OriginID OID, ProgramPoint P) const
~LoanPropagationAnalysis()
LoanPropagationAnalysis(const CFG &C, AnalysisDeclContext &AC, FactManager &F, OriginLoanMap::Factory &OriginLoanMapFactory, LoanSet::Factory &LoanSetFactory)
BlockID
The various types of blocks that can occur within a API notes file.
void transfer(const StmtToEnvMap &StmtToEnv, const Stmt &S, Environment &Env, Environment::ValueModel &Model)
Evaluates S and updates Env accordingly.
@ OS
Indicates that the tracking object is a descendant of a referenced-counted OSObject,...
@ Asymmetric
An asymmetric join preserves keys unique to the first map as-is, while applying the JoinValues operat...
SetTy< T > join(SetTy< T > A, SetTy< T > B, typename SetTy< T >::Factory &F)
Computes the union of two ImmutableSets.
const Fact * ProgramPoint
A ProgramPoint identifies a location in the CFG by pointing to a specific Fact.
utils::ID< struct LoanTag > LoanID
utils::ID< struct OriginTag > OriginID
utils::SetTy< LoanID > LoanSet
utils::MapTy< OriginID, LoanSet > OriginLoanMap
bool operator==(const CallGraphNode::CallRecord &LHS, const CallGraphNode::CallRecord &RHS)
@ Result
The result type of a method or function.
bool operator!=(CanQual< T > x, CanQual< U > y)
@ Other
Other implicit parameter.