similar to: [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 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

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

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

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

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

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.

Hi RamShankar, On top of Rafael mentioned ,Please check with lib/CodeGen/StrongPHIElimination.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,

Hi, I am a newbie to llvm. I am wondering what approach is used when coming out of SSA form. I also appreciate pointers on where to look in the source code for this phase. Best regards, Ram Ramshankar -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120824/87feb1d3/attachment.html>

On 24 August 2012 02:27, Ramanarayanan, Ramshankar <Ramshankar.Ramanarayanan at amd.com> wrote: > Hi, > > > > I am a newbie to llvm. I am wondering what approach is used when coming out > of SSA form. I also appreciate pointers on where to look in the source code > for this phase. > lib/CodeGen/PHIElimination.cpp is probably what you want. > > Best regards,

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

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

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

I needed the following patch to be able to use gprof with profiled build. regards, Benoit --- a/Makefile.rules (revision 37946) +++ b/Makefile.rules (working copy) @@ -212,6 +212,7 @@ CXX.Flags := $(OPTIMIZE_OPTION) -pg -g C.Flags := $(OPTIMIZE_OPTION) -pg -g LD.Flags := $(OPTIMIZE_OPTION) -pg -g + KEEP_SYMBOLS := 1 else ifeq ($(ENABLE_OPTIMIZED),1) BuildMode := Release

We want to join out Linux-Server: SLES 10 SP1 x86 with Samba (samba-client-3.0.24-2.23) to our W2000 Domain. so i use the command: net join -S TQ-NET.DE -UAdministrator and i get the following Errormessage: Failed to join domain! ADS join did not work, falling back to RPC... [2008/03/12 12:07:29, 0] utils/net_rpc_join.c:net_rpc_join_newstyle(350) Error in domain join verification