similar to: opt with Polly doesn't find the passes

Hi Tobias, I tried to invoke other passes and none of them are available, e.g.: ~/toolchain/install/llvm-3.8/bin/opt -load ~/toolchain/install/llvm-3.8/lib/libPolly.so -polly-cleanup opt: Unknown command line argument '-polly-cleanup'. Try: '/home/fwinter/toolchain/install/llvm-3.8/bin/opt -help' opt: Did you mean '-polly-tiling'? I am just shooting around hoping to

On 02/03/2016 11:06 AM, Tobias Grosser wrote: > On 02/03/2016 04:46 PM, Frank Winter via llvm-dev wrote: >> >> >> On 02/03/2016 10:41 AM, Tobias Grosser wrote: >>> On 02/03/2016 04:37 PM, Frank Winter wrote: >>>> Hi Tobias, >>>> >>>> I tried to invoke other passes and none of them are available, e.g.: >>>>

Hi, When I test "matmul" in the polly directory, I get the following performance data: //=============================== --> 12. Compare the runtime of the executables time ./matmul.normalopt.exe 0:23.53 real, 23.48 user, 0.00 sys time ./matmul.polly.interchanged.exe 0:22.86 real, 22.82 user, 0.01 sys time ./matmul.polly.interchanged+tiled.exe 0:22.87 real, 22.83 user, 0.00 sys

On 02/03/2016 10:41 AM, Tobias Grosser wrote: > On 02/03/2016 04:37 PM, Frank Winter wrote: >> Hi Tobias, >> >> I tried to invoke other passes and none of them are available, e.g.: >> >> ~/toolchain/install/llvm-3.8/bin/opt -load >> ~/toolchain/install/llvm-3.8/lib/libPolly.so -polly-cleanup >> >> opt: Unknown command line argument

Dear community, the next step of the "Improvement of vectorization process in Polly" project is to implement the packing transformation described in http://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf. I had a discussion with Tobias and we decided that a packing transformation is in many ways a data-layout transformation that will require to introduce a new array, copy

Hi, 2011/4/8 Vlad Krylov <krvladislav at gmail.com>: > Hi. > > I see that to detect scops firstly we search for regions in CFG ( by > RegionInfo ) and then select regions that answer some requirements ( > in ScopDetection ). Because only affine expressions in conditions and > bounds are permissible, we trying to get scalar expressions into > affine form by

Hi, A few tests seem broken for a long time, some for more than a month. Would it possible for respective owners to take a look please? I'm at checkout 133a7e631cee97965e310f0d110739217427fd3d, compiling on Windows 10. These tests fail with Visual Studio 2019: Failing Tests (7): Clang Tools :: clang-tidy/checkers/cert-mem57-cpp-cpp17.cpp Clang Tools ::

Hi Justin, the non-translatable IR with GPU code replaced by appropriate CUDA Driver > API calls. One of CUDA driver apis (cuLaunch) need a ptx asm string as its input. So if I want to provide a one-touch solution and don't introduce any changes to tools outside polly, I must prepare the ptx string before I can generate the correct non-translatable IR part. As your suggestion, It may

Hi. I see that to detect scops firstly we search for regions in CFG ( by RegionInfo ) and then select regions that answer some requirements ( in ScopDetection ). Because only affine expressions in conditions and bounds are permissible, we trying to get scalar expressions into affine form by AffineSCEVIterator. At present there plugs for scev types Truncate, ZeroExtend, SignExtend, UDivExpr,

Hi everyone, I'll be very thankful if anyone can help me. I want to extract the dependences details by using polly. I followed the following steps on example code matmul.c: 1. clang -S -emit-llvm matmul.c -o matmul.s 2. opt -S -polly-canonicalize matmul.s > matmul.preopt.ll 3. opt -basicaa -polly-dependences -analyze matmul.preopt.ll But it doesn't show me the dependences. I

Hi Justin, 2012/4/3 Justin Holewinski <justin.holewinski at gmail.com> > *Motivation* >> With the broad proliferation of GPU computing, it is very important to >> provide an easy and automatic tool to develop or port the applications to >> GPU for normal developers, especially for those domain experts who want to >> harness the huge computing power of GPU. Polly

How to feed pocc by jscop files which are made with -polly-export-jscop? 2011/4/8 ether zhhb <etherzhhb at gmail.com>: > Hi, > > 2011/4/8 Vlad Krylov <krvladislav at gmail.com>: >> Hi. >> >> I see that to detect scops firstly we search for regions in CFG ( by >> RegionInfo ) and then select regions that answer some requirements ( >> in

Hi, all I tried Polly installation on Ubuntu. On its building, it returned no errors. But when I run "make polly-test", it returns 11 unexpected failures as follows. ----------------------------------- ******************** Testing Time: 19.77s ******************** Failing Tests (11): Polly :: CodeGen/do_pluto_matmult.ll Polly :: CodeGen/loop_with_condition.ll Polly ::

I'm writing a Pass that I would like to remain loadable by opt. The pass also requires DominatorTree(for PromoteMemToReg). Looking for examples the only way I found to require a dependecny is by doing something like this: char Hello::ID = 0; namespace llvm { void initializeHelloPass(llvm::PassRegistry&); } INITIALIZE_PASS_BEGIN(Hello, "hello", "Hello

On 06/08/2011 01:17 AM, MORIYAMA Tomohiro wrote: > Hi, all > > I tried Polly installation on Ubuntu. > > On its building, it returned no errors. > But when I run "make polly-test", it returns 11 unexpected failures as > follows. > ----------------------------------- > ******************** > Testing Time: 19.77s > ******************** > Failing Tests

** *Hi everyone,As you may know, stock LLVM does not provide the kind of advanced loop transformations necessary to provide good performance on many applications. LLVM's Polly project provides many of the required capabilities, including loop transformations such as fission, fusion, skewing, blocking/tiling, and interchange, all powered by state-of-the-art dependence analysis. Polly also

On 11/08/2011 03:20 AM, ret val wrote: > I'm writing a Pass that I would like to remain loadable by opt. The > pass also requires DominatorTree(for PromoteMemToReg). > > Looking for examples the only way I found to require a dependecny is > by doing something like this: > char Hello::ID = 0; > namespace llvm { void

Hi all, I am a phd student from Huazhong University of Sci&Tech, China. The following is my GSoC 2012 proposal. Comments are welcome! *Title: Automatic GPGPU Code Generation for LLVM* *Abstract* Very often, manually developing an GPGPU application is a time-consuming, complex, error-prone and iterative process. In this project, I propose to build an automatic GPGPU code generation framework

I would like to know the status of the autovectorization support in LLVM. does LLVM have a loop dependence analysis, does LLVM have a infrastructure for autovectorization ? etc. Kind Regards Xin Tong -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110624/3dc35318/attachment.html>

On 24 June 2011 21:13, Xin Tong Utoronto <x.tong at utoronto.ca> wrote: > I would like to know the status of the autovectorization support in LLVM. >  does LLVM have a loop dependence analysis, does LLVM have a infrastructure > for autovectorization ? etc. Not yet, but it's getting there... http://polly.grosser.es/ cheers, --renato