llvm::BitVector EnqueuedBlocks;
25llvm::PriorityQueue<
const CFGBlock*,
31: EnqueuedBlocks(Cfg.getNumBlockIDs()), WorkList(
C) {}
34 if(
Block&& !EnqueuedBlocks[
Block->getBlockID()]) {
35EnqueuedBlocks[
Block->getBlockID()] =
true;
36WorkList.push(
Block);
53 return Cmp(rhs, lhs);
70 for(
autoB :
Block->succs())
83 for(
autoB :
Block->succs())
98 for(
autoB :
Block->preds())
AnalysisDeclContext contains the context data for the function, method or block under analysis.
Represents a single basic block in a source-level CFG.
unsigned getBlockID() const
Represents a source-level, intra-procedural CFG that represents the control-flow of a Stmt.
A worklist implementation where the enqueued blocks will be dequeued based on the order defined by 'C...
void enqueueBlock(const CFGBlock *Block)
DataflowWorklistBase(const CFG &Cfg, Comp C)
const CFGBlock * dequeue()
The JSON file list parser is used to communicate input to InstallAPI.
A worklist implementation for backward dataflow analysis.
BackwardDataflowWorklist(const CFG &Cfg, AnalysisDeclContext &Ctx)
void enqueuePredecessors(const CFGBlock *Block)
A worklist implementation for forward dataflow analysis.
void enqueueSuccessors(const CFGBlock *Block)
ForwardDataflowWorklist(const CFG &Cfg, AnalysisDeclContext &Ctx)
ForwardDataflowWorklist(const CFG &Cfg, PostOrderCFGView *POV)
PostOrderCFGView::BlockOrderCompare Cmp
bool operator()(const CFGBlock *lhs, const CFGBlock *rhs) const
A worklist implementation for forward dataflow analysis based on a weak topological ordering of the n...
WTODataflowWorklist(const CFG &Cfg, const WTOCompare &Cmp)
void enqueueSuccessors(const CFGBlock *Block)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4