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, Dear Boissinot: 1. When I have irreducible CFG, I travel its nodes by DFS. search backedge for every node. After I finish one node, push it into a stack. [0, 1, 2, M] <---push. [0, 1, 2, M,...N] <---push. When resolving node M, find a edge from node N to node M, N is not in stack(M < N), It is a backedge. N is in stack(M > N), It is NOT a backedge.

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

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:

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

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] >

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) >>         | >>

I'm trying to create the Machine LICM pass and I have this defined: class VISIBILITY_HIDDEN MachineLICM : public MachineFunctionPass { ... public: virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.setPreservesCFG(); AU.addRequired<MachineLoopInfo>(); AU.addRequired<MachineDominatorTree>(); } ... }; But when I go to use it:

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

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.

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

Antony Blakey wrote: > SVN head LLVM and Clang built out of the box for me a week ago on > MSYS/MINGW, using the following files: Ok, I tried to do the same. The compilations stops with the following error message (actually, I got to the same point in my attempt to build LLVM with the MinGW compiler shipped with Cygwin): llvm[1]: Compiling MachineLoopInfo.cpp for Debug build

Hi, I'm trying to use the VLIWPacketizerList to schedule instructions for the R600 target, and I'm running into this assertion failure: ScheduleDAGInstrs.cpp:558: Cannot schedule terminators or labels! I think I might not be using the VLIWPacketizerList class correctly. I've attached my code to this email. Can anyone spot what I'm doing wrong? Also, I had to add a LiveIntervals

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 日期:

On Dec 6, 2007, at 5:56 PM, Bill Wendling wrote: > I'm trying to create the Machine LICM pass and I have this defined: > > But when I go to use it: > > bool MachineLICM::runOnMachineFunction(MachineFunction &MF) { > ... > // Get our Loop information... > LI = &getAnalysis<MachineLoopInfo>(); > ... > for (MachineLoopInfo::iterator

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

On Sep 5, 2013, at 5:15 PM, Ken Dyck <kd at kendyck.com> wrote: > Hi, > > One of the long-standing code clean-up bugs in Bugzilla is to extract > the Machine* code from the CodeGen library into a separate one, on > which CodeGen depends ( > http://llvm.org/bugs/show_bug.cgi?id=1121). > > I'd like to start working on this. The general approach I'm planning