search for: accessanalysi

...s their effective type differs for these pointers (One with 32-bit and the other with 64-bit) Question: Is this intended to try for the RtCheck on pointers from different address spaces? The comments given in the code snippet (below) hints they aren't. Code snippet from LoopAccessAnalysis.cpp: ----------------------------------------------------------------------------------------------------------------------- bool AccessAnalysis::canCheckPtrAtRT(...) { ---------- // If the pointers that we would use for the bounds comparison have different // address space...

...views.llvm.org/D6930 <http://reviews.llvm.org/D6930>). Here is the list of design choices: - Loop Distribution is implemented as a separate pass to be run before the Loop Vectorizer. - The pass reuses the Memory Dependence Checker framework from the Loop Vectorizer. This along with the AccessAnalysis class is split out into a new LoopAccessAnalysis class. We may want to turn this into an analysis pass on its own. - It also reuses the Run-time Memory Check code from the Loop Vectorizer. The hmmer loop requires memchecks. This is again captured by the same LoopAccessAnalysis class. -...

> On Mar 3, 2015, at 1:29 AM, Nema, Ashutosh <Ashutosh.Nema at amd.com <mailto:Ashutosh.Nema at amd.com>> wrote: > > Hi Adam, > > Thanks for looking into LoopVersioning work. > > I have gone through recent LoopAccessAnalysis changes and found some of the stuff > overlaps (i.e. runtime memory check, loop access analysis etc.). LoopVersioning can > use some of the things from LAA. > > LoopVersioning is a memory check based multi versioning optimization, it simply creates > aggressive alias version of l...

...de as their effective type differs for these pointers (One with 32-bit and the other with 64-bit) Question: Is this intended to try for the RtCheck on pointers from different address spaces? The comments given in the code snippet (below) hints they aren’t. Code snippet from LoopAccessAnalysis.cpp: ----------------------------------------------------------------------------------------------------------------------- bool AccessAnalysis::canCheckPtrAtRT(...) { ---------- // If the pointers that we would use for the bounds comparison have different // address space...

...ssary checks that could unnecessarily slow things down. > > > I just wanted to keep a flexibility open. > We can give a try to LoopVersioning by keeping point 1 & 3 checks. but I’m not sure about point 2. > Will give a try to your upcoming patch. > > > > LoopAccessAnalysis::analyzeLoop > Here again its very specific to LoopVectorizer. > The way it handles stores & loads may not be appreciated by other optimization > expecting other treatment. I suggest we should think on flexibility for user to > override load & store handling. We can provide vi...

...block or edge?). Extensions for outer loop vectorization (cyclic control flow) to be presented at the dev meeting: [2] C) Control-Flow Modeling Not needed, it's always just a single loop. VPlan: Hierarchical-CFG of VPBasicBlocks and VPRegionBlocks. D) Access Modeling (LoopAccessInfo/LoopAccessAnalysis/AccessAnalysis) Use AliasSetTracker and look analyze each set independently. No PHI nodes (apart from induction variable) allowed (there seems to be some support for reductions). E) Dependency Analysis (MemoryDepChecker) Leaks only DependenceType and max vectorization factor to the outside....

Hi Ashutosh, Have you been following the recent Loop Access Analysis work? LAA was split out from the Loop Vectorizer that have been performing the kind of loop versioning that you describe. The main reason was to be able to share this functionality with other passes. Loop Access Analysis is an analysis pass that computes basic memory dependence and the runtime checks. The versioning decision

I like to propose a new loop multi versioning optimization for LICM. For now I kept this for LICM only, but it can be used in multiple places. The main motivation is to allow optimizations stuck because of memory alias dependencies. Most of the time when alias analysis is unsure about memory access and it says may-alias. This un surety from alias analysis restrict some of the memory based

...//pollylabs.org/education.htmland especially http://playground.pollylabs.org. Finally, let me highlight a few ongoing development efforts in Polly that are potentially relevant to this discussion. Polly’s loop analysis is sound and technically superior to what’s in LLVM currently (i.e. in LoopAccessAnalysis and DependenceAnalysis). There are, however, two known reasons why Polly’s transformations could not yet be enabled by default: * A correctness issue: Currently, Polly assumes that 64 bits is large enough for all new loop-induction variables and index expressions. In rare cases,...