|
LLVM
4.0.0
|
Determine the iterated dominance frontier, given a set of defining blocks, and optionally, a set of live-in blocks. More...
#include <IteratedDominanceFrontier.h>
Public Member Functions | |
| IDFCalculator (DominatorTreeBase< BasicBlock > &DT) | |
| void | setDefiningBlocks (const SmallPtrSetImpl< BasicBlock * > &Blocks) |
| Give the IDF calculator the set of blocks in which the value is defined. More... | |
| void | setLiveInBlocks (const SmallPtrSetImpl< BasicBlock * > &Blocks) |
| Give the IDF calculator the set of blocks in which the value is live on entry to the block. More... | |
| void | resetLiveInBlocks () |
| Reset the live-in block set to be empty, and tell the IDF calculator to not use liveness anymore. More... | |
| void | calculate (SmallVectorImpl< BasicBlock * > &IDFBlocks) |
| Calculate iterated dominance frontiers. More... | |
Determine the iterated dominance frontier, given a set of defining blocks, and optionally, a set of live-in blocks.
In turn, the results can be used to place phi nodes.
This algorithm is a linear time computation of Iterated Dominance Frontiers, pruned using the live-in set. By default, liveness is not used to prune the IDF computation. The template parameters should be either BasicBlock* or Inverse<BasicBlock *>, depending on if you want the forward or reverse IDF.
Definition at line 46 of file IteratedDominanceFrontier.h.
|
inline |
Definition at line 49 of file IteratedDominanceFrontier.h.
| void llvm::IDFCalculator< NodeTy >::calculate | ( | SmallVectorImpl< BasicBlock * > & | IDFBlocks | ) |
Calculate iterated dominance frontiers.
This uses the linear-time phi algorithm based on DJ-graphs mentioned in the file-level comment. It performs DF->IDF pruning using the live-in set, to avoid computing the IDF for blocks where an inserted PHI node would be dead.
Definition at line 21 of file IteratedDominanceFrontier.cpp.
References llvm::SmallVectorImpl< T >::clear(), llvm::df_begin(), llvm::df_end(), llvm::SmallVectorImpl< T >::emplace_back(), llvm::SmallVectorBase::empty(), llvm::WebAssembly::End, llvm::DomTreeNodeBase< NodeT >::getBlock(), llvm::DomTreeNodeBase< NodeT >::getIDom(), llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::SmallVectorImpl< T >::pop_back_val(), and llvm::SmallVectorTemplateBase< T, isPodLike< T >::value >::push_back().
|
inline |
Reset the live-in block set to be empty, and tell the IDF calculator to not use liveness anymore.
Definition at line 73 of file IteratedDominanceFrontier.h.
|
inline |
Give the IDF calculator the set of blocks in which the value is defined.
This is equivalent to the set of starting blocks it should be calculating the IDF for (though later gets pruned based on liveness).
Note: This set must live for the entire lifetime of the IDF calculator.
Definition at line 56 of file IteratedDominanceFrontier.h.
|
inline |
Give the IDF calculator the set of blocks in which the value is live on entry to the block.
This is used to prune the IDF calculation to not include blocks where any phi insertion would be dead.
Note: This set must live for the entire lifetime of the IDF calculator.
Definition at line 66 of file IteratedDominanceFrontier.h.
1.8.6