similar to: How to get information about data dependencies?

Michael Kruse via llvm-dev <llvm-dev at lists.llvm.org> writes: > LLVM has multiple dependence analyses, each with its up- and downsides: > > * llvm::DependenceAnalysis > * llvm::LoopAccessAnalysis Can someone explain the differences between these? As far as I can tell they essentially do the same thing (though perhaps one is more precise?). LAA seems to be used by

Michael Kruse via llvm-dev <llvm-dev at lists.llvm.org> writes: > AFAIK they are independent developments. LoopAccessAnalysis was > extracted out of the LoopVectorizer in 2015, and first developed in > 2013 (https://github.com/llvm/llvm-project/commit/d517976758c8674bdcd4c74457f7a83f20e432c5) > > DependenceAnalysis was a from-scratch implementation from 2012 >

On Wed, Jul 13, 2016 at 1:40 AM Sean Silva <chisophugis at gmail.com> wrote: > On Wed, Jul 13, 2016 at 12:39 AM, Hal Finkel <hfinkel at anl.gov> wrote: > >> Interesting. I'm not sure this is the right metric, however. There are >> lots of analyses that hold pointers to other analyses but don't need to. >> The analysis handle itself can be reacquired

> On Feb 22, 2016, at 6:27 AM, Vikram TV <vikram.tarikere at gmail.com> wrote: > > > > On Fri, Feb 19, 2016 at 10:46 PM, Vikram TV <vikram.tarikere at gmail.com <mailto:vikram.tarikere at gmail.com>> wrote: > Hi, > > Thanks for the reply. Few thoughts inlined. > > On Fri, Feb 19, 2016 at 8:00 AM, Adam Nemet <anemet at apple.com

> On Jul 13, 2016, at 2:02 AM, Sean Silva via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > > On Wed, Jul 13, 2016 at 1:50 AM, Chandler Carruth <chandlerc at gmail.com <mailto:chandlerc at gmail.com>> wrote: > On Wed, Jul 13, 2016 at 1:40 AM Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote: > On Wed, Jul 13,

Hi, Thanks for the reply. Few thoughts inlined. On Fri, Feb 19, 2016 at 8:00 AM, Adam Nemet <anemet at apple.com> wrote: > Hi Vikram, > > On Feb 18, 2016, at 9:21 AM, Vikram TV via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > Hi all, > > I have created a patch (up for review at: http://reviews.llvm.org/D17386) > that does Loop Fusion implementation.

On 09/22/2017 12:03 AM, Mehdi AMINI wrote: > Hi Hal, > > > 2017-09-21 20:59 GMT-07:00 Hal Finkel via llvm-dev > <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>>: > > > On 09/12/2017 10:26 PM, Gerolf Hoflehner wrote: >> >> >>> On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev >>> <llvm-dev at

On 09/11/2017 12:26 PM, Adam Nemet wrote: > Hi Hal, Tobias, Michael and others, > >> On Sep 1, 2017, at 11:47 AM, Hal Finkel via llvm-dev >> <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >> >> ** >> >> *Hi everyone,As you may know, stock LLVM does not provide the kind of >> advanced loop transformations

On 09/12/2017 10:26 PM, Gerolf Hoflehner wrote: > > >> On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev >> <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >> >> >> On 09/11/2017 12:26 PM, Adam Nemet wrote: >>> Hi Hal, Tobias, Michael and others, >>> *...* >>> >>> One thing that I’d

Hi Hal, 2017-09-21 20:59 GMT-07:00 Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org> : > > On 09/12/2017 10:26 PM, Gerolf Hoflehner wrote: > > > > On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > > On 09/11/2017 12:26 PM, Adam Nemet wrote: > > Hi Hal, Tobias, Michael and others, > *...* >

> On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > On 09/11/2017 12:26 PM, Adam Nemet wrote: >> Hi Hal, Tobias, Michael and others, >> >>> On Sep 1, 2017, at 11:47 AM, Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >>> >>>

2017-09-21 22:22 GMT-07:00 Hal Finkel <hfinkel at anl.gov>: > > On 09/22/2017 12:03 AM, Mehdi AMINI wrote: > > Hi Hal, > > > 2017-09-21 20:59 GMT-07:00 Hal Finkel via llvm-dev < > llvm-dev at lists.llvm.org>: > >> >> On 09/12/2017 10:26 PM, Gerolf Hoflehner wrote: >> >> >> >> On Sep 11, 2017, at 10:47 PM, Hal Finkel via

On 09/22/2017 12:25 AM, Mehdi AMINI wrote: > > > 2017-09-21 22:22 GMT-07:00 Hal Finkel <hfinkel at anl.gov > <mailto:hfinkel at anl.gov>>: > > > On 09/22/2017 12:03 AM, Mehdi AMINI wrote: >> Hi Hal, >> >> >> 2017-09-21 20:59 GMT-07:00 Hal Finkel via llvm-dev >> <llvm-dev at lists.llvm.org <mailto:llvm-dev at

Hi, I want to create a copy of DependenceAnalysis downstream. At first I tried the HelloWorld tutorial. But then I figured, maybe I should move on to create my pass by mimicking some other pass in LLVM. So, I tried copying DependenceAnalysis itself [1] Although after a lot of time of trying it compiled, I'm pretty sure I have done it completely in the wrong way. What is more, I can't

Hi Adam, On Wed, Mar 23, 2016 at 1:50 PM, Adam Nemet via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > On Mar 22, 2016, at 5:13 PM, Philip Reames <listmail at philipreames.com> > wrote: > > > > On 03/20/2016 05:38 AM, Aries Gunawan via llvm-dev wrote: > > > *Loop Dependence Analysis Infrastructure. *I have looked in the source > codes repo and I

> On Mar 22, 2016, at 5:13 PM, Philip Reames <listmail at philipreames.com <mailto:listmail at philipreames.com>> wrote: > > > > On 03/20/2016 05:38 AM, Aries Gunawan via llvm-dev wrote: >> Hi everyone, >> >> I am very interested in contributing to LLVM project in this year’s GSoC. I am new with LLVM, but this is used in the compiler course in my

I have been looking into this small test case (Part A) where loop vectorization is disabled due to possible store-load forwarding conflict (Part B). As you can see, due to the presence of dependence distance 2 the loop is vectorizable only for a width of 2. However, the presence of dependence distance 15 (due to y[j-15]) results in store-load forwarding issue as store packet of y[16:17] (iteration

----- Original Message ----- > From: "Sean Silva" <chisophugis at gmail.com> > To: "Chandler Carruth" <chandlerc at gmail.com> > Cc: "Xinliang David Li" <davidxl at google.com>, "llvm-dev" > <llvm-dev at lists.llvm.org>, "Davide Italiano" > <dccitaliano at gmail.com>, "Tim Amini Golling" >

> On Mar 5, 2015, at 10:33 PM, Nema, Ashutosh <Ashutosh.Nema at amd.com> wrote: > > > I am about to post the patches to make LAA suitable for Loop Distribution. As you will hopefully find this will make the LAA more generic. I will cc you on the patches. > > Sure Adam. > > RuntimeCheckEmitter > “RuntimeCheckEmitter::addRuntimeCheck” > While creating

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