search for: ispostdominators

...> // Initialize roots > this->Roots = graph.getRoots(); > iterate over roots { > this->IDoms[root] = 0; > this->DomTreeNodes[root] = 0; > } > > Calculate(*this, graph); > } > > > Note that the flag IsPostDominators is gone. > Where necessary it can be replaced by checking if > the graph has exactly one root. I am not sure about this. Something not yet implemented are postdominator trees for infinite loops. At the moment these basic blocks are just not part of the postdominator tree. I believe a solu...

...e diff --git a/include/llvm/Analysis/DominanceFrontier.h b/include/llvm/Analysis/DominanceFrontier.h index a304dff..e743d2d 100644 --- a/include/llvm/Analysis/DominanceFrontier.h +++ b/include/llvm/Analysis/DominanceFrontier.h @@ -52,7 +52,7 @@ protected: static constexpr bool IsPostDominators = IsPostDom; public: - DominanceFrontierBase() = default; + DominanceFrontierBase() { } /// getRoots - Return the root blocks of the current CFG. This may include /// multiple blocks if we are computing post dominators. For forward seems to fix the problem and I think i...

Hi! I have seen that findNearestCommonDominator has been added to class PostDominatorTree, maybe on my request. Now there is the following problem: in class DominatorTreeBase there is an assert in findNearestCommonDominator that asserts if the tree is not a PostDominator tree: assert (!this->isPostDominator() && "This is not implemented for post

On 03/07/2010 10:33 PM, Jochen Wilhelmy wrote: > Hi! Hi Jochen, > I have seen that findNearestCommonDominator has been added > to class PostDominatorTree, maybe on my request. > > Now there is the following problem: > in class DominatorTreeBase there is an assert in findNearestCommonDominator > that asserts if the tree is not a PostDominator tree: > > assert

Hi! Is it possible to get findNearestCommonDominator working for post dominator trees by changing llvm/include/llvm/Analysis/Dominators.h starting at line 432: NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) { /*assert (!this->isPostDominator() && "This is not implemented for post dominators");*/ assert (A->getParent() == B->getParent() &&

...h& graph) { reset(); this->Vertex.push_back(0); // Initialize roots this->Roots = graph.getRoots(); iterate over roots { this->IDoms[root] = 0; this->DomTreeNodes[root] = 0; } Calculate(*this, graph); } Note that the flag IsPostDominators is gone. Where necessary it can be replaced by checking if the graph has exactly one root. -Jochen

...sh_back(0); > > // Initialize roots > this->Roots = graph.getRoots(); > iterate over roots { > this->IDoms[root] = 0; > this->DomTreeNodes[root] = 0; > } > > Calculate(*this, graph); > } > > > Note that the flag IsPostDominators is gone. > Where necessary it can be replaced by checking if > the graph has exactly one root. > > -Jochen > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.ed...

This is release_50 branch of git, sha1: f1d5723be3f9456a6b16cdf687847ac2918846de Using gcc 7.2.0 from homebrew. $ CC=/usr/local/opt/gcc/bin/x86_64-apple-darwin16.7.0-gcc-7 CXX=/usr/local/opt/gcc/bin/x86_64-apple-darwin16.7.0-g++-7 cmake .. -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=/Users/andy/local/llvm5 -DCMAKE_PREFIX_PATH=/Users/andy/local/llvm5 $ make VERBOSE=1 [ 92%] Linking CXX