search for: scevvalid

Hi Sylvestre, it seems the code coverage runs are not updated since a couple of months. http://llvm.org/reports/coverage/tools/polly/lib/Support/SCEVValidator.cpp.gcov.html The last run was on 2017-05-20 02:07:48. Are you still maintaining these? Is this on purpose? Any chance this could be fixed? Best, Tobias

...structure to represent linear expressions, which re-organize the sub-expressions in SCEV in form of what you want. To construct the linear expressions, you need to visit and analyze all sub-expressions in the SCEV, instead of simply looking at the top-level SCEV. Maybe you could have a look at the SCEVValidator[1], which check if a SCEV is affine, and and SCEVAffinator[2], which build a kind of affine expression from SCEV, all of them need to visit and analyze all sub-expressions in the SCEV. best regards ether [1]http://llvm.org/viewvc/llvm-project/polly/trunk/lib/Support/SCEVValidator.cpp?view=mar...

Is there any chance of replacing/extending the GEP instruction? As noted in the GEP FAQ, GEPs don't support variable-length arrays; when the front ends have to support VLAs, they linearize the subscript expressions, throwing away information. The FAQ suggests that folks interested in writing an analysis that understands array indices (I'm thinking of dependence analysis) should be

...ted in something that sounds like option 1. I'm not interested of code generation. Attached is a an handwritten testcase of the situation I'm into. ScopDetection refuses to analyze the external loop because there is a branch that depends on an SCEVUnknown generated inside the same region (SCEVValidator.cpp:267 is the check that returns invalid). With "this code X into Y" you mean at the source level or at the IR level ? :P (I think I know the answer, just to be sure). Marcello -------------- next part -------------- A non-text attachment was scrubbed... Name: testcase2.ll Type: ap...

...parameters, but Affine is actually of isl_aff type. Perhaps we could first commit a patch file to handle common cases, then we can considering submitting another patch file to handle general cases. >I think this is the right idea, but probably the wrong place to put it. >I would put this into SCEVValidator::visitAddRecExpr. This function >always adds the AddRecExpr itself as a parameter, whenever it is found >to be parametric. However, what we should do is to create a new ScevExpr >that starts at zero and is otherwise identical. We then add this as a >parameter. When doing this, we...

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

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" . >From what I understand polly skips Scops that contain these branches (which comprises something like "if (i % 2 == 0)" where i is a loop varying variable) because these kind of

...} > + > + if (i == e) { > + // Parameters.push_back(Parameter); > + ParameterIds[Parameter] = index; > + return; > + } > + } > + } I think this is the right idea, but probably the wrong place to put it. I would put this into SCEVValidator::visitAddRecExpr. This function always adds the AddRecExpr itself as a parameter, whenever it is found to be parametric. However, what we should do is to create a new ScevExpr that starts at zero and is otherwise identical. We then add this as a parameter. When doing this, we now also need t...

On 07/29/2013 09:15 AM, Sven Verdoolaege wrote: > On Mon, Jul 29, 2013 at 07:37:14AM -0700, Tobias Grosser wrote: >> On 07/29/2013 03:18 AM, Sven Verdoolaege wrote: >>> On Sun, Jul 28, 2013 at 04:42:25PM -0700, Tobias Grosser wrote: >>>> Sven: In terms of making the behaviour of isl easier to understand, >>>> it may make sense to fail/assert in case

Hi Sebastian, Recently, I found the "Polly - Calculate dependences" pass would lead to significant compile-time overhead when compiling some loop-intensive source code. Tobias told me you found similar problem as follows: http://llvm.org/bugs/show_bug.cgi?id=14240 My evaluation shows that "Polly - Calculate dependences" pass consumes 96.4% of total compile-time overhead

...nalyses still depend on isl as a back-end, they never directly use it. Instead there is a C++ interface in-between that encapsulates the features needed. Once our use cases are clear we can re-implement this interface. ** For comparison, the value analysis covers parts of the ScopDetection, all of SCEVValidator and SCEVAffinator as well as parts of ScopInfo and ScopBuilder in Polly. *** The memory analysis is concerned with the construction and functionality Polly implements in the MemoryAccess class. **** The dependence analysis is similar to Polly's DependenceInfo class but is supposed to allow...

...s a back-end, they never > directly use it. Instead there is a C++ interface in-between that > encapsulates the features needed. Once our use cases are clear we can > re-implement this interface. > > ** For comparison, the value analysis covers parts of the ScopDetection, > all of SCEVValidator and SCEVAffinator as well as parts of ScopInfo and > ScopBuilder in Polly. > *** The memory analysis is concerned with the construction and > functionality Polly implements in the MemoryAccess class. > **** The dependence analysis is similar to Polly's DependenceInfo class >...

...ill depend on isl as a back-end, they never directly use it. Instead there is a C++ interface in-between that encapsulates the features needed. Once our use cases are clear we can re-implement this interface. > > ** For comparison, the value analysis covers parts of the ScopDetection, all of SCEVValidator and SCEVAffinator as well as parts of ScopInfo and ScopBuilder in Polly. > *** The memory analysis is concerned with the construction and functionality Polly implements in the MemoryAccess class. > **** The dependence analysis is similar to Polly's DependenceInfo class but is supposed...

...> >directly use it. Instead there is a C++ interface in-between that > >encapsulates the features needed. Once our use cases are clear we can > >re-implement this interface. > > > >** For comparison, the value analysis covers parts of the ScopDetection, > >all of SCEVValidator and SCEVAffinator as well as parts of ScopInfo and > >ScopBuilder in Polly. > >*** The memory analysis is concerned with the construction and > >functionality Polly implements in the MemoryAccess class. > >**** The dependence analysis is similar to Polly's Dependence...

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