search for: boissinot

...neDominatorTree>(); for (MachineLoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) { CurLoop = *I; } } ****************************** I copy find from MachineLICM.cpp, and change class name. What is different ?? Thanks. Ren Kun --- 10年1月26日，周二, Benoit Boissinot <bboissin+llvm at gmail.com> 写道： > 发件人: Benoit Boissinot <bboissin+llvm at gmail.com> > 主题: Re: [LLVMdev] Find all backedges of CFG by MachineDominatorTree.  please look at my jpg. > 收件人: "任坤" <hbrenkun at yahoo.cn> > 抄送: "llvm" <llvmdev at cs.u...

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 sta...

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: http://perso.ens-lyon.fr/benoit.boissinot/upload/bboissin-liveness-cgo-slides.pdf They should be much better than the one from my presentation at EmSoC. regards, Benoit

...and Lifelong Program Analysis. I have read > most of the LLVM documents onhttp://www.llvm.org/docs, some papers > on http://www.llvm.org/pubs/ and some source code in LLVM2.3. The > live variables analysis in LLVM seems not very efficient, and the > algorithm presented in Benoit Boissinot, Fast liveness checking for > ssa-form programs (the best paper of ACM SIGPLAN CGO’08) is much > better, especially for JIT compilation. So, I want to implement > this algorithm in LLVM, which is also planed to be my final project > in “Advance Compiler Techniques” class. >...

...gards! renkun --- 10年3月9日，周二, Nick Lewycky <nicholas at mxc.ca> 写道： > 发件人: Nick Lewycky <nicholas at mxc.ca> > 主题: Re: [LLVMdev] Find all backedges of CFG by MachineDominatorTree. please look at my jpg. > 收件人: "任坤" <hbrenkun at yahoo.cn> > 抄送: "Benoit Boissinot" <bboissin+llvm at gmail.com>, "llvm" <llvmdev at cs.uiuc.edu> > 日期: 2010年3月9日,周二,下午2:02 > 任坤   wrote: > > Hi: > >     I want to do some optimization > on MachineLoop. > > So I want to get MachineLoopInfo from > MachineFunction. > > &gt...

...is a loop entry. So, maybe I could use this information to improve this algorithm, even though I don't know clearly how to improve it now. Thanks again, I will try to implement it in LLVM, and further more, try my best to improve it. Best wishes, Star. -----Original Message----- From: Benoit Boissinot [mailto:bboissin at gmail.com] Sent: Wednesday, October 29, 2008 10:06 PM To: LLVM Developers Mailing List Cc: 谭明星 Subject: Re: [LLVMdev] A new project proposal for LLVM and calling help from a chinese student Hello, > On Oct 28, 2008, at 10:10 AM, 谭明星 wrote: >> >> PS: The followi...

...to improve this algorithm, even though I don't know > clearly how > to improve it now. > Thanks again, I will try to implement it in LLVM, and further more, > try my > best to improve it. > > Best wishes, > Star. > > -----Original Message----- > From: Benoit Boissinot [mailto:bboissin at gmail.com] > Sent: Wednesday, October 29, 2008 10:06 PM > To: LLVM Developers Mailing List > Cc: 谭明星 > Subject: Re: [LLVMdev] A new project proposal for LLVM and calling > help from > a chinese student > > Hello, > >> On Oct 28, 2008, at 10:10...

...know > > clearly how > > to improve it now. > > Thanks again, I will try to implement it in LLVM, and further more, > > try my > > best to improve it. > > > > Best wishes, > > Star. > > > > -----Original Message----- > > From: Benoit Boissinot [mailto:bboissin at gmail.com] > > Sent: Wednesday, October 29, 2008 10:06 PM > > To: LLVM Developers Mailing List > > Cc: 谭明星 > > Subject: Re: [LLVMdev] A new project proposal for LLVM and calling > > help from > > a chinese student > > > > Hello, &g...

...int P?" I can write something myself (and will if need be), but just want to avoid reinventing the wheels in case improvements have been made since 2014. If not, what's the best way to contribute this analysis to LLVM? I mean, for example, is "Computing Liveness Sets for SSA" by Boissinot [2] efficient enough to be implemented in LLVM? Or should I find a better algorithm to solve this? [1] http://lists.llvm.org/pipermail/llvm-dev/2014-July/074793.html [2] http://hal.inria.fr/docs/00/58/53/03/PDF/RR-7503.pdf Thanks for your help, Cheers Son Tuan Vu -------------- next part -----...

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 >  ... = x...

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

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. Co...

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

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

On Mon, May 10, 2010 at 8:05 PM, Trevor Harmon <Trevor.W.Harmon at nasa.gov> wrote: > On May 10, 2010, at 8:43 AM, Xinfinity wrote: > >> Is it possible to get the list of BasicBlocks building the condition >> of a loop and the list of BasicBlocks that form the body? > > Based on my (limited) experience with Loop and LoopInfo, this isn't > possible. (But

...ination.cpp and the papers like Budimlic, et al. Fast copy coalescing and live-range identification. // In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language // Design and Implementation (Berlin, Germany, June 17 - 19, 2002). // PLDI '02. ACM, New York, NY, 25-32. Boissinot, et al. Revisiting Out-of-SSA Translation for Correctness, Code // Quality and Efficiency, // In Proceedings of the 7th annual IEEE/ACM International Symposium on Code // Generation and Optimization (Seattle, Washington, March 22 - 25, 2009). // CGO '09. IEEE, Washington, DC, 114-125....

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

...can write something myself (and will if need be), but just want to avoid > reinventing the wheels in case improvements have been made since 2014. If > not, what's the best way to contribute this analysis to LLVM? I mean, for > example, is "Computing Liveness Sets for SSA" by Boissinot [2] efficient > enough to be implemented in LLVM? > > > This one should be efficient enough. > That said, what are you trying to achieve? > > The reason we don’t have such algorithm in LLVM IR is because we don’t > need it. Usually def-uses chains and dominance property are...

Is anyone aware of an existing framework for asking liveness questions about SSA values in the IR? I'm looking for something more precise than the trivial definition provided by SSA itself. I can write something myself (and will if need be), but it seemed like a generic enough problem that I was surprised I couldn't find something already in tree. Anyone know of something I've

From the fact that nobody is replying I guess there's no easy way to do what I asked. Can you just confirm then that the following is a meaningful way to do it? * D_b <- set of dominators of BB b * S_b <- set containing b and its successors (optional) * VD_b <- set of the values defined in D_b * VS_b <- set of the values with uses in S_b (optional) * LV_b