similar to: [LLVMdev] Find all backedges of CFG by MachineDominatorTree. please look at my jpg.

Thank you, Nick. Yes, I have add getAnalysisUsage. As I know, some CFG is irreducible. At this time, Dominator Tree can not find some backedge. Is it means some MachineLoop is not be found? dominatorTree.jpg is a previous exmaple. best regards! renkun --- 10年3月9日，周二, Nick Lewycky <nicholas at mxc.ca> 写道： > 发件人: Nick Lewycky <nicholas at mxc.ca> > 主题: Re: [LLVMdev] Find

Hi:    I want to do some optimization on MachineLoop. So I want to get MachineLoopInfo from MachineFunction. I reference MachineLICM.cpp. So I try to write a pass in Target/mytarget directory. I find there is Error. llvm/include/llvm/PassAnalysisSupport.h:198: AnalysisType& llvm::Pass::getAnalysisID(const llvm::PassInfo*) const [with AnalysisType = llvm::MachineLoopInfo]: Assertion

2010/1/25 任坤 <hbrenkun at yahoo.cn>: > Hi: > > I hope to cut all backedges of MachineFunction CFG, then topological sort MachineBasicBlocks. > > 1. MachineDominatorTree *domintree = new MachineDominatorTree(); > domintree->runOnMachineFunction(mf); > > 2. Then travel mf one by one. > When domintree->dominates(next,current) is true, there is a backedge

Hi: I hope to cut all backedges of MachineFunction CFG, then topological sort MachineBasicBlocks. 1. MachineDominatorTree *domintree = new MachineDominatorTree(); domintree->runOnMachineFunction(mf); 2. Then travel mf one by one. When domintree->dominates(next,current) is true, there is a backedge from current node to next node. move this backedge form CFG. But I find A LOOP in

This is an excellent project. We look forward to seeing your work! Is it possible for you to implement your work on the mainline and contribute back patches along the way? That way, the community can offer suggestions and we will try *harder* not to break your pass. Evan On Oct 29, 2008, at 10:39 PM, Star wrote: > Hi, Benoit, > Thanks very much for your advice. > You see the

Hi, Evan. I'm new in LLVM project developing. How should I work on the mainline? I have check out the latest copy of LLVM from Subvresion using the Read-Only account. Do you mean I should provide the patch to the mainline periodic in this LLVMDEV mailing list? Anyway, thanks for your advice :) Star > -----Original Message----- > From: Evan Cheng [mailto:evan.cheng at apple.com] >

Hi, Benoit, Thanks very much for your advice. You see the algorithm greatly improve the performance of liveness analysis. However, it seems still not efficient. First, it is inefficient in space. You have to pre-compute all Tq for every Tq and save them, even though only the highest nodes of Tq are needed for a given query(q,v); Second, it is inefficient in time. Given any query(q,v), you have to

Hello, > On Oct 28, 2008, at 10:10 AM, 谭明星 wrote: >> >> PS: The following are links about this paper: >> http://portal.acm.org/citation.cfm?id=1356064 >> http://www.if.insa-lyon.fr/chercheurs/jpbabau/emsoc/presentations/EmSoC07_Boissinot.pdf >> I've put the slides from CGO online:

On Sun, Mar 29, 2009 at 3:33 PM, Benoit Boissinot <bboissin+llvm at gmail.com> wrote: > While it is not described in the litterature, I don't think you need > to introduce a new > function: >      x0 = ... >  x1, x2 = \sigma (x0) >         | >    +----+------+ >    |           | >    v           v >  ... = x1    ... = x2 > > Can be transformed to: >

On Mon, Mar 30, 2009 at 1:05 AM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Sun, Mar 29, 2009 at 3:33 PM, Benoit Boissinot > <bboissin+llvm at gmail.com> wrote: >> While it is not described in the litterature, I don't think you need >> to introduce a new >> function: >>      x0 = ... >>  x1, x2 = \sigma (x0) >>         | >>

Hi: I hope to cut all backedges of MachineFunction CFG, then topological sort MachineBasicBlocks. 1. MachineDominatorTree *domintree = new MachineDominatorTree(); domintree->runOnMachineFunction(mf); 2. Then travel mf one by one. When domintree->dominates(next,current) is true, there is a backedge from current node to next node. move this backedge form CFG. But I find A LOOP in

Mingxing, Your project sounds interesting and if it significantly improves over the live variable analysis that is in LLVM right now, I think it could be a useful contribution. I'm copying the 'llvmdev at cs.uiuc.edu' mailing list, which you should join. Send all related messages to this list to get feedback on your goals and also to get help with any problems you face.

Hi, guys, what is the interface for finding the immediate dominator of a machine basic block in LLVM 2.1? I found some methods to check if a node dominates other in llvm::MachineDominatorTree, but I was looking for something like: MachineBasicBlock * mbb = ... MachineBasicBlock * iDom = XXX->getImmediateDominator(mbb); is there something similar? best, Fernando

Dear Ciao, Duncan, Thank you for replying. I tried and the error goes away. But there comes a new error: LLVM ERROR: Unknown object format! How can I solve this problem? Thank you! BestAndy --- 12年9月18日，周二, Duncan Sands <baldrick at free.fr> 写道： 发件人: Duncan Sands <baldrick at free.fr> 主题: Re: [LLVMdev] Problems on getting UNREACHABLE executed 收件人: llvmdev at cs.uiuc.edu 日期:

2009/3/29 Misha Brukman <brukman at gmail.com>: > 2009/3/27 Andre Tavares <andrelct at dcc.ufmg.br> >> >> I'm a Computer Science master student at UFMG, Brasil. I'm interested in >> taking part on Google Summer of Codes 2009. My idea is not on the LLVM list, >> but I have written a project description to make my intentions clear. My >> project

Bhavani, A simple way that I'm not sure is 100% guaranteed to work is if the branch is to an earlier or later basic block. Micah -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of bhavani krishnan Sent: Wednesday, December 03, 2008 3:20 PM To: Nick Lewycky; LLVM Developers Mailing List Subject: [LLVMdev] Identifying

Hello, LoopSimplify try to separate a loop with multiple backedges into a nested loop (an outer loop and an inner loop). Naturally, this kind of a loop corresponds to a single loop in source code. I can see this could be useful for cases described in the comments in lib/Transforms/Utils/LoopSimplify.cpp, which looks like a corner case. For most cases, how does this help ? Junjie

Dear Evan Chang: I register incorrect Register class for MVT::f64. I have fixed it. Thanks your advice. "-view-legalize-dags" is very good option. But I don't know why my LLC do not know " -view-legalize-type-dags" option. By the way, I use llvm 2.5 merged from llvm2.4. Best Regards, Ren Kun --- 09年3月31日，周二, Evan Cheng <echeng at apple.com> 写道： 发件人: Evan Cheng

Hi, How do I find out if a branch instruction belongs to an if-else or a loop i.e it is a backedge. Thanks, Bhavani

On May 10, 2010, at 11:35 AM, Benoit Boissinot wrote: > To me it looks like any basic block from the loop body with a > successor not in the loop body is a BB "building the condition" (an > "exit" block). I assume you mean "any basic block from the loop header". I don't think your rule will work. Consider this counterexample: while (j < 10