similar to: [LLVMdev] GSoC2012 proposal -- A new Back-end for polyhedral Optimization framework for LLVM (Polly)

Hi Qingrui Liu, sorry for replying slowly. Here some comments: On 03/24/2012 02:47 PM, Tsingray Liu wrote: > Hi all, > My name is Qingrui Liu, a student at Sun Yat-sen University, China. > I have been working on high level synthesis project which is implemented > as a back-end of LLVM, in the last two years. When I want to use Polly to > generate parallel LLVM-IR from

Hi Tobi, Thank you very much for the elaborate advises and sorry for the long delay. I have kept thinking your advises and investigate more detail of the existing code of Polly. Now, I re-evaluate my proposal and something interesting is added to the new one. ：） On Fri, Mar 30, 2012 at 5:52 AM, Tobias Grosser <tobias at grosser.es> wrote: > Hi Qingrui Liu, > > sorry for replying

Hi tobi, >> 2. Allow the some generic parallelism information live out specific >> autopar framework, so these information can benefit more passes in >> llvm. For example, the X86 and PTX backend could use these information >> to perform target specific auto-vectorization. > > What other types of parallelism are you expecting? We currently support > thread level

Hi all, I find a bug in the VASTContext.h of the latest clang. I fixed it and commit a patch for it. As follows: >From 447d31176b513a03b253eb25ef314c2a3c0e428a Mon Sep 17 00:00:00 2001 From: Tsingray <tsingray at buildbot-slave-desktop.(none)> Date: Thu, 8 Mar 2012 22:11:54 +0800 Subject: [PATCH] fix a 'does not name a type' bug in VASTContext.h ---

On 09/12/2011 04:28 PM, Sebastian Pop wrote: > Hi Alexandra, > > On Thu, Sep 8, 2011 at 13:53, Jimborean Alexandra<xinfinity_a at yahoo.com> wrote: >> I had a look at the CodeGeneration from Polly. Is it possible to use it >> without creating the Scops, by transforming it into a LoopPass? > > Yes. If you don't want to use the autopar of Polly and just rely on

Hi, I want to execute the iterations of a loop in parallel, by inserting calls either to pthreads or to the gomp library at the LLVM IR level. As a first step, I inserted an omp pragma in a C file and compiled it with llvm-gcc to check the generated LLVM code. If I understand correctly, to parallelize the loop in LLVM IR, I have to separate the loop in a new function, put all required parameters

Hi Alexandra, On Thu, Sep 8, 2011 at 13:53, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > I had a look at the CodeGeneration from Polly. Is it possible to use it > without creating the Scops, by transforming it into a LoopPass? Yes. If you don't want to use the autopar of Polly and just rely on the pragmas inserted by the programmer, you don't need SCoPs. You can

Hi, thanks to Tobias for doing most of the work to get the vector code generation working with ISL's code generation. Attached are two patches to port the vector code generation part of the testsuite from Cloog/CodeGen to Isl/CodeGen. Tobi, do you want to commit these two patches separately, or you want me to combine them, as the second patch is needed to make the testsuite pass? Also, let

Hello, I would like to work with Orange as part of GSoC 2012(and continue henceforth). Apologies for joining in a bit late- i was waiting to get a proper grasp of things before discussing it here. Currently I am a Masters students in Mathematics with my bachelors in Computer Science[integrated dual degree]. Over the last year and a half, I have worked on a few ML projects and have a couple of

Hello everyone Is there someone planning to work on adding to Polly the techniques described in "The polyhedral model is more widely applicable than you think" to increase the coverage of the polyhedral model? I'm not familiar with Polly, but this would involve modifying its front-end and the code generator right? Any idea of how difficult this would be? Thanks! -Arnaldo

Dear LLVM contributors, my name is Matthias, I am a graduate student majoring in computer science at the Vienna University of Technology, and I am glad to be one of this year's GSoC students who work for the Julia foundation. Julia is a relatively young programming language that uses LLVM for just-in-time compilation and the goal of my project is to integrate Polly in this environment to

Hi, I just have a detail look at the code of Polly[1], it seems that Polly start to support some basic auto-parallelization stuffs. I have some idea to improve the current auto-vectorization and parallelization approach in Polly. 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

Dear Community, in an earlier post, students working on LLVM were asked to provide a short report on their GSoC project. in the following I want to give an overview on the current status of my GSoC project and outline my next planned activities. Since my mentoring organization is Julia, I also send this to the according mailing list. *1. Activities so far:* As described in my proposal [1], I

On Mon, Sep 12, 2011 at 10:44, Tobias Grosser <tobias at grosser.es> wrote: >> You can have the parallel code generation part of Polly working as >> a LoopPass. > > Are you sure about this? In CodeGeneration we basically translate a CLooG > AST into LLVM-IR. Without a CLooG AST this does not work. I mean you could rewrite that code to work on a per loop basis, like

On 09/12/2011 04:56 PM, Sebastian Pop wrote: > On Mon, Sep 12, 2011 at 10:44, Tobias Grosser<tobias at grosser.es> wrote: >>> You can have the parallel code generation part of Polly working as >>> a LoopPass. >> >> Are you sure about this? In CodeGeneration we basically translate a CLooG >> AST into LLVM-IR. Without a CLooG AST this does not work. >

On 11/14/2011 02:45 PM, Marcello Maggioni wrote: > 2011/11/14 Tobias Grosser<tobias at grosser.es>: >> On 11/14/2011 01:24 AM, Marcello Maggioni wrote: >>> >>> Hi Tobias. >>> >>> I worked on enabling Polly accepting non affine memory accesses and I >>> produced a patch. >> >> Great. >> >>> I saw that there were

Dear All; Is there any work that discusses ​LLVM framework's short comings regarding auto vectorization and polyhedral optimizations? Regards, > -- Abid M. Malik ****************************************************** "I have learned silence from the talkative, toleration from the intolerant, and kindness from the unkind"---Gibran "Success is not for the chosen few, but

Hi all, I have updated my GSoS proposal: "FastPolly: Reducing LLVM-Polly Compiling overhead" (https://gist.github.com/tanstar/5441808). I think the pass ordering problem you discussed early can be also investigated in this project! Is there any comment or advice about my proposal? I appreciate all your help and advice. Thanks, Star Tan Proposal:

I just checkout release_38 branches of llvm, clang and polly and built it on and x86 Ubuntu with cmake: CMAKE_BUILD_TYPE="Debug" CMAKE_INSTALL_PREFIX="$HOME/toolchain/install/llvm-3.8" LLVM_TARGETS_TO_BUILD="X86" cmake -G "Unix Makefiles" \ -DBUILD_SHARED_LIBS="ON" \ -DCMAKE_BUILD_TYPE=$CMAKE_BUILD_TYPE \

Hi Alexandra, I don't know much, maybe this topic should be bridged with polly-dev (adding it to CC) to bring it more attention. Indeed, polly uses ScopPass, that creates serious limitations in compatibility with other passes. To my understanding, scops are used because ISL loop analysis tool uses scops. In fact, just for handling OpenMP directives scops are not required, unless one need to