similar to: [LLVMdev] git mirror

On 5 August 2010 02:14, Tobias Grosser <grosser at fim.uni-passau.de> wrote: > On 08/05/2010 01:45 AM, David Greene wrote: > > Do pushes to the LLVM git mirror get forwarded to the svn trunk > > automatically? For various reasons it may be more convenient > > for me to work on LLVM through git but I don't want to go through > > a lot of pain to send patches

On 9 January 2011 00:07, Tobias Grosser <grosser at fim.uni-passau.de> wrote: > Matching the target vector width in our heuristics will obviously give the > best performance. So to get optimal performance Polly needs to take target > data into account. Indeed! And even if you lack target information, you won't generate wrong code. ;) > Talking about OpenCL. The lowering

Wenbin Zhang wrote: > I'll try the trunk, as well as check my code again. If indeed it's not > fixed, I'll try to post a triggering case here. > Thanks for the advice~ > Did you run the -mergereturn pass (it might also be called UnifyExitNodes in the source code)? This is the pass that ensures that each function has exactly one basic block that returns control to the

On 07/06/2011 07:53 AM, David A. Greene wrote: > Tobias Grosser<tobias at grosser.es> writes: > >>> Will git-cherrypick work or is the merging process going to confuse >>> git-svn? >> >> To use git-svn you should always have a history without any git >> merges. Just commit after commit after commit. I do not know what kind >> of history

On Mon, Mar 28, 2011 at 10:19 PM, Tobias Grosser <grosser at fim.uni-passau.de>wrote: > On 03/28/2011 09:12 AM, Justin Holewinski wrote: > >> Hi All, >> >> I am going to submit a GSoC proposal for LLVM this year, and I would >> like to first post it here to get constructive feedback before I submit >> it before the April 8 deadline. This is the first

Tobias Grosser <tobias at grosser.es> writes: >> Will git-cherrypick work or is the merging process going to confuse >> git-svn? > > To use git-svn you should always have a history without any git > merges. Just commit after commit after commit. I do not know what kind > of history git-cherrypick produces. To clarify, I just need to create the branch at the point

On 03/28/2011 12:15 PM, Nipun Arora wrote: > Hi, > > I have been trying to run the memdep analysis using opt with the > following command: opt -analyze -memdep <*.bc>. > However, I keep getting the following error: Pass::print not implemented > for pass: 'Memory Dependence Analysis' ! . > I get similar errors for a lot of the analyses passes, which seem as if

Hi, I have been trying to run the memdep analysis using opt with the following command: opt -analyze -memdep <*.bc>. However, I keep getting the following error: Pass::print not implemented for pass: 'Memory Dependence Analysis' ! . I get similar errors for a lot of the analyses passes, which seem as if they should have a print out? Is there any other memory dependence analysis

On 08/05/2010 06:46 AM, Wenbin Zhang wrote: > Hi all, > I'm using postDominatorTree to do some program analysis. My code works > well for small tests, but when I run it on real applications, the > following error occurs: > /Inorder PostDominator Tree: DFSNumbers invalid: 0 slow queries. > [1] <<exit node>> {0,21} > [2] %bb1 {1,2} > [2] %bb {3,4} > [2]

On 11/18/2011 01:36 PM, Marcello Maggioni wrote: > 2011/11/18 Marcello Maggioni<hayarms at gmail.com>: >> The patch is attached. >> >> The patch to correct the test runs on OSX will be posted shortly after >> this one (I preferred to separate the two so that a problem with >> either one of the two wouldn't give problems to the other and also to >>

Rafael Ávila de Espíndola <rafael.espindola at gmail.com> writes: > On 07/05/2011 03:27 PM, David Greene wrote: >> My git-svn fu is not very strong. >> >> In the course of preparing a set of AVX patches, I've committed several >> changes to my local LLVM git clone. I don't want to send all of those >> changes upstream right away. What's the

On 07/05/2011 03:48 PM, David A. Greene wrote: > Rafael Ávila de Espíndola<rafael.espindola at gmail.com> writes: > >> On 07/05/2011 03:27 PM, David Greene wrote: >>> My git-svn fu is not very strong. >>> >>> In the course of preparing a set of AVX patches, I've committed several >>> changes to my local LLVM git clone. I don't want to

On 8 January 2011 18:27, Tobias Grosser <grosser at fim.uni-passau.de> wrote: > OK. First of all to agree on a name, we decided to call the Polyhedral > analysis we develop PoLLy, as in Polly the parrot. ;-) Maybe it was a > misleading choice? I never realised... ;) Polly it is! > In general as I explained I agree that a three stage approach is useful, > for the reasons you

On 6 January 2011 15:16, Tobias Grosser <grosser at fim.uni-passau.de> wrote: >> The main idea is, we separate the transform passes and codegen passes >> for auto-parallelization and vectorization (Graphite[2] for gcc seems >> to taking similar approach for auto-vectorization). I agree with Ether. A two-stage vectorization would allow you to use the simple loop-unroller

On 10/05/2010 09:42 AM, hamed hamzehi wrote: > Hi > yes, I'm asking for any advice, I want to implement multithreaded code > generator in LLVM. > tnx Hi, this generally depends which kind of code you want to multithread, because generally this is a difficult problem. However, if you limit yourself for the moment to loops that fit into the polyhedral model, you can take

On 01/08/2011 07:34 PM, Renato Golin wrote: > On 9 January 2011 00:07, Tobias Grosser<grosser at fim.uni-passau.de> wrote: >> Matching the target vector width in our heuristics will obviously give the >> best performance. So to get optimal performance Polly needs to take target >> data into account. > > Indeed! And even if you lack target information, you

hi all, The patch in the attachment add a new pass - region pass to the llvm system. A region pass is similar to a loop pass, all of them execute on a group of BasicBlocks at one time, but it operate on a single entry single exit region, not the nature loop. The original purpose to add such a pass to llvm system is to allow us find out the static control part (SCoP) for the polyhedral

Good evening, Jay! ...Instructions, ... 1. git clone http://llvm.org/git/XXX.git (assume it "origin") 2. Create git authors file (assume /path/to/file/of/authors) with single line. foad = Jay Foad <jay.foad at gmail.com> Oh yeah, you should define your name and mailto same as described in llvm.org/git with case-sensitive. 3. Edit .git/config manually :p [svn]

I'll try the trunk, as well as check my code again. If indeed it's not fixed, I'll try to post a triggering case here. Thanks for the advice~ Best, --Wenbin ----- Original Message ----- From: "Tobias Grosser" <grosser at fim.uni-passau.de> To: "Wenbin Zhang" <zhangwen at cse.ohio-state.edu> Cc: <llvmdev at cs.uiuc.edu> Sent: Thursday, August

Hi yes, I'm asking for any advice, I want to implement multithreaded code generator in LLVM. tnx --- On Tue, 10/5/10, Duncan Sands <baldrick at free.fr> wrote: From: Duncan Sands <baldrick at free.fr> Subject: Re: [LLVMdev] Multithreaded code generation To: llvmdev at cs.uiuc.edu Date: Tuesday, October 5, 2010, 10:50 AM Hi Hamed, > I want to use LLVM to automatically