search for: domtreebase

Hi, Has anyone successfully been able to implement domination over a callgraph, I'm getting stuck on supporting DomTreeBuilder for Calculate. Many thanks --- Marcel Achim -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200527/36b77777/attachment.html> -------------- next part --------------

...ut maybe the problem is here): virtual bool runOnModule(Module &M) { CallGraph& cg = getAnalysis<CallGraph>(); DominatorTreeBase<CallGraphNode> *DTB; DTB = new DominatorTreeBase<CallGraphNode>(false); DTB->recalculate(cg); errs() << "DomTreeBase:"; DTB->print(errs()); return false; } virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequired<CallGraph>(); } Error list: /Developer/llvm/include/llvm/Analysis/Dominators.h:666:35: error: no viable conversion from 'typename TraitsTy...

Hi Kuba, Thanks for your advice in your previous letter. During last week, I have read the documents on Doxygen and the source code of the DomTreeBase/DomTree/PostDomTree/DeferredDominance class, I believe now I have a much better understanding on the relationship between these classes and how DeferredDominance class performs lazy updates. I have also learnt the current usage and drawbacks of the fragmented API by looking into how several ‘transf...

...op over successor blocks to also > be able to iterate over predecessors. I did not see anything in the > interface that would let that happen but perhaps I don’t understand the API > so I modified it to explicitly iterate over predecessors under a flag. > Sigh. Yes, we fixed it to take domtreebase, so it can take the postdomtree, but nobody modified it to change the calculation. I'll fix this in a second. > I don’t have comparisons but the problem I had was it would iterative > over two much of the graph when we discovered a block was live. > So, the calculation should only...

...kub > > On Mon, Mar 12, 2018 at 4:02 PM, Chijun Sima <simachijun at gmail.com> wrote: >> >> Hi Kuba, >> >> Thanks for your advice in your previous letter. >> >> During last week, I have read the documents on Doxygen and the source >> code of the DomTreeBase/DomTree/PostDomTree/DeferredDominance class, I >> believe now I have a much better understanding on the relationship >> between these classes and how DeferredDominance class performs lazy >> updates. I have also learnt the current usage and drawbacks of the >> fragmented API...

...g we really want to avoid. Sincerely, Jakub On Mon, Mar 12, 2018 at 4:02 PM, Chijun Sima <simachijun at gmail.com> wrote: > Hi Kuba, > > Thanks for your advice in your previous letter. > > During last week, I have read the documents on Doxygen and the source > code of the DomTreeBase/DomTree/PostDomTree/DeferredDominance class, I > believe now I have a much better understanding on the relationship > between these classes and how DeferredDominance class performs lazy > updates. I have also learnt the current usage and drawbacks of the > fragmented API by looking into...

...02 PM, Chijun Sima <simachijun at gmail.com> > wrote: > >> > >> Hi Kuba, > >> > >> Thanks for your advice in your previous letter. > >> > >> During last week, I have read the documents on Doxygen and the source > >> code of the DomTreeBase/DomTree/PostDomTree/DeferredDominance class, I > >> believe now I have a much better understanding on the relationship > >> between these classes and how DeferredDominance class performs lazy > >> updates. I have also learnt the current usage and drawbacks of the > &gt...

...gmail.com> >> > wrote: >> >> >> >> Hi Kuba, >> >> >> >> Thanks for your advice in your previous letter. >> >> >> >> During last week, I have read the documents on Doxygen and the source >> >> code of the DomTreeBase/DomTree/PostDomTree/DeferredDominance class, I >> >> believe now I have a much better understanding on the relationship >> >> between these classes and how DeferredDominance class performs lazy >> >> updates. I have also learnt the current usage and drawbacks of...

Hi Chijun, Thanks for your interest in the project. I have gone through most of the LLVM Kaleidoscope tutorial and I have > watched the video of the presentation “Dominator Trees and incremental > updates that transcend time” presented on the 2017 LLVM Developers’ > Meeting. I have also started to understand the algorithm mentioned in > the comments of the code related to the

Hello, I’m an undergraduate student studying CS in the South China University of Technology. I have been using clang compiler and related tools since I started studying C++ and I would like to work on LLVM in this year’s GSoC. I am interested in “Implement a single updater class for Dominators”. [1] I have achieved a bronze medal in the 2017 ACM-ICPC Asia Xian Regional Contest [2] (being a

Some question: 1. IDFCalculator already allows reverse graphs, and gets used for that, so what did you have to change? (this change was made in the past year, so i wonder if you were working on a branch or something). 2. What are the actual numbers here in terms of calculation of IDF vs your method. IDF calculator is linear time (Well, depends on priority queue impl, but we could fix that