search for: d6930

...nalysis pass, so it has the advantage that the result of the analysis is cached until it gets invalidated (i.e. when the loop changes). For an example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. Please let me know if you have any questions. Adam > > > Thanks, > Ashutosh -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150310/6f81764f/attachment...

...s, so it has the advantage that the result of the analysis is cached until it gets invalidated (i.e. when the loop changes). > > For an example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(P...

...s, so it has the advantage that the result of the analysis is cached until it gets invalidated (i.e. when the loop changes). > > For an example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(P...

...s, so it has the advantage that the result of the analysis is cached until it gets invalidated (i.e. when the loop changes). > > For an example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(P...

...= 0; k < M; k += 4) { S1: MC[k+1:k+5] = ... } for (k = 0; k < M; k++) { S2: DC[k+1] = DC[k], MC[k] } I'd like to collect feedback on the design decisions made so far. These are implemented in a proof-of-concept patch (http://reviews.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...

> 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