similar to: [RFC] Polly Status and Integration

>Do you recall the arguments why it was considered a bad idea? Felt like long time ago, but it turned out that was actually just a bit over a year ago. Here's the thread. http://lists.llvm.org/pipermail/llvm-dev/2016-August/104079.html Only a few explicitly responded, but I took that as silent majority was satisfied with the responses. Prior to that thread, I also pinged HPC oriented LLVM

On Fri, Oct 13, 2017 at 5:13 PM, Michael Kruse via llvm-dev < llvm-dev at lists.llvm.org> wrote: > 2017-10-14 1:29 GMT+02:00 Saito, Hideki via llvm-dev < > llvm-dev at lists.llvm.org>: > > I'm also sorry that I'm not commenting on the main part of your RFC in > this reply. I just want to focus on > > one thing here. > > > >

>I think we need to get that story right for both cases up front. Renato, I kicked off this secondary discussion, borrowing the opportunity from Michael's RFC, but to the point of reviewing https://reviews.llvm.org/D38676, I'd like the review to proceed separately from this bigger (and most likely longer) discussion. We intentionally made the interfaces similar such that whatever the

On 10/14/2017 05:28 PM, Daniel Berlin via llvm-dev wrote: > > > On Sat, Oct 14, 2017 at 2:54 PM, Michael Kruse <llvmdev at meinersbur.de > <mailto:llvmdev at meinersbur.de>> wrote: > > 2017-10-14 5:03 GMT+02:00 Daniel Berlin <dberlin at dberlin.org > <mailto:dberlin at dberlin.org>>: > > FWIW: We hit a subset of this issue with

Oops! I mistook UDT for CDT! I've missed deadline, so... 2011/4/9 Tobias Grosser <grosser at fim.uni-passau.de>: > On 04/08/2011 08:35 PM, Vlad Krylov wrote: >> >> 2011/4/8 ether zhhb<etherzhhb at gmail.com>: >>> >>> Hi, >>> >>> 2011/4/8 Vlad Krylov<krvladislav at gmail.com>: >>>> >>>> Hi.

Hi, I'd like to ask another thing about Polly and SCoP discarding. I've noticed that Polly discards quite simple loops like: for (int i = 1; i < 1000; i++) {} or for (int i= 0; i < 1000; i+=2) {} is this an intended behavior or there is some way to make it accept these kind of loops ? Thanks, Marcello 2011/10/3 Marcello Maggioni <hayarms at gmail.com>: > Hi Tobias,

On 04/08/2011 08:35 PM, Vlad Krylov wrote: > 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

On 10/01/2011 03:26 PM, Marcello Maggioni wrote: > Hello everyone, > > I'm trying to use LLVM+Polly to obtain a polyhedral representation of > some loops to use later for passes I want to implement, but seems like > Polly will stop when reaching any statement that has non-affine access > functions of the loop bounds discarding the whole SCoP entirely. > > What I would

On 02/08/2012 08:08 PM, Marcello Maggioni wrote: > Hi, I'm using Polly to analyze memory access patterns for an > university project and I'm trying to get polly working on some loops > that polly marks as "containing non affine branches" . Hi Marcello, sorry for the long delay. > From what I understand polly skips Scops that contain these branches > (which

Am So., 12. Jan. 2020 um 20:07 Uhr schrieb Chris Lattner < clattner at nondot.org>: > The central idea is to use a modifiable loop tree -- similar to > LoopInfo -- as the primary representation. LLVM-IR is converted to a > loop tree, then optimized and finally LLVM-IR is generated again for > subtrees that are considered profitable. This is not a new concept, it > has already

2012/2/12 Tobias Grosser <tobias at grosser.es>: > On 02/08/2012 08:08 PM, Marcello Maggioni wrote: >> >> Hi, I'm using Polly to analyze memory access patterns for an >> university project and I'm trying to get polly working on some loops >> that polly marks as "containing non affine branches" . > > > Hi Marcello, > > sorry for the

Hi Tobias, thanks for the answer. I'll try to give a look to the code you pointed me to , and I'll try to make the modification myself. I'm new to LLVM and Polly, but the code of both seem clean and understandable, so I hope to be able to do it myself. In case I'll ask here for support :) Marcello 2011/10/1 Tobias Grosser <tobias at grosser.es>: > On 10/01/2011 03:26

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 ScopDetection ). Because only affine expressions in conditions and >> bounds

Status Update on VPlan ---- where we are currently, and what's ahead of us ==========================================================   Goal: ----- Extending Loop Vectorizer (LV) such that it can handle outer loops, via uplifting its infrastructure with VPlan. The goal of this status update is to summarize the progress and the future steps needed.   Background: ----------- This is related to

Hello everyone, I'm trying to use LLVM+Polly to obtain a polyhedral representation of some loops to use later for passes I want to implement, but seems like Polly will stop when reaching any statement that has non-affine access functions of the loop bounds discarding the whole SCoP entirely. What I would like to achieve is still getting some information for the statements that , instead,

Hi Tobias. I worked on enabling Polly accepting non affine memory accesses and I produced a patch. I saw that there were a lot of updates in Polly recently, so I had to redo a lot of the work I did and that slowed me quite a bit. I tested the patch on some programs and it seems to work and not to break anything, but you know the topic much better than me, so if you find something wrong please

Mmm, this code seems to kill polly: #include <stdio.h> #include <stdlib.h> int main() { char *B; int i,j,k,h; const int x = 0, y=0; B = (char *)malloc(sizeof(char)*1024*1024); for (i = 1; i < 1024; i++) for (j = 1; j < 1024; j++) { if (i+j > 1000) B[j] = i; } printf("Random Value: %d", B[rand() % 1024*1024]); return 0; } running: opt

On 02/07/2012 07:04 PM, Preston Briggs wrote: >>> The 1st loop is trivially parallel. I think Polly would recognize >>> this and do good things. >> >> This case is trivial. >> >> But keep in mind that unsigned loop ivs and integers can cause modulo >> wrapping which is not trivial to handle - Both Polly, but also any other >> tool, need to

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