#include <DataFlowUtil.h>
Iterated dominance frontier
Definition at line 151 of file DataFlowUtil.h.
◆ IteratedDominanceFrontier()
SVF::IteratedDominanceFrontier::IteratedDominanceFrontier |
( |
| ) |
|
|
inline |
Definition at line 162 of file DataFlowUtil.h.
llvm::DominanceFrontierBase< BasicBlock, false > DominanceFrontierBase
const DominanceFrontier * DF
◆ ~IteratedDominanceFrontier()
virtual SVF::IteratedDominanceFrontier::~IteratedDominanceFrontier |
( |
| ) |
|
|
inlinevirtual |
◆ calculate()
Definition at line 125 of file DataFlowUtil.cpp.
134 worklist.insert(it->second.begin(), it->second.end());
135 while (!worklist.empty())
138 worklist.erase(worklist.begin());
139 if (Frontiers[bb].find(item) == Frontiers[bb].end())
141 Frontiers[bb].insert(item);
142 const_iterator parent =
DF.find(item);
144 worklist.insert(parent->second.begin(), parent->second.end());
llvm::BasicBlock BasicBlock
llvm::DominanceFrontierBase< BasicBlock, false > DominanceFrontierBase
const DominanceFrontier * DF
◆ getAnalysisUsage()
virtual void SVF::IteratedDominanceFrontier::getAnalysisUsage |
( |
AnalysisUsage & |
AU | ) |
const |
|
inlinevirtual |
◆ getIDFSet()
iterator SVF::IteratedDominanceFrontier::getIDFSet |
( |
BasicBlock * |
B | ) |
|
|
inline |
Definition at line 183 of file DataFlowUtil.h.
185 if (Frontiers.find(B) == Frontiers.end())
187 return Frontiers.find(B);
void calculate(BasicBlock *, const DominanceFrontier &DF)
const DominanceFrontier * DF
◆ DF
◆ ID
char IteratedDominanceFrontier::ID = 0 |
|
static |
The documentation for this class was generated from the following files: