search for: loopdependencyanalysis

...(int i = 0; i< n ; i++) s2: x[i] = x[i+1] + i*2 ; but in llvm i couldn't able to find there is no dependency from s2 to s1. LoopDependenceAnalyis always gives there is a dependency from every load instructions to every store instructions. is there any other alternative to LoopDependencyAnalysis ? thank you ...... Regards, Shanmukha Rao Compilers lab, Indian Institute of Science, Bangalore. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120315/94716630/attachment.html>

...s far as possible. I suppose that, if we were to define SCCs, split them into groups and re-arranging into multiple loops, we would still do it in the IR. Would that spoil any other pass? What passes should run before/after such a pass? I believe that would be a FunctionPass and registered in the LoopDependencyAnalysis "runOnLoop()", so it can run when such pass is called by the PassManager. Or should it be a completely separate pass (VectorizationPass?) so we can control it from a separate command-line flag? Any comments appreciated before I dig in. cheers, --renato http://systemcall.org/ Reclaim...

...>> >> >> but in llvm i couldn't able to find there is no dependency from s2 to s1. >> >> LoopDependenceAnalyis always gives there is a dependency from every load instructions to every store instructions. >> >> >> is there any other alternative to LoopDependencyAnalysis ?

Hi, I'm surporiseing that the loop carried dependence analysis is not exsited ; This problem can't be resolved in the future ?

On Thu, Dec 17, 2009 at 7:09 AM, Renato Golin <rengolin at systemcall.org> wrote: > > I believe that would be a FunctionPass and registered in the > LoopDependencyAnalysis "runOnLoop()", so it can run when such pass is > called by the PassManager. Or should it be a completely separate pass > (VectorizationPass?) so we can control it from a separate command-line > flag? > A separate VectorizationPass that requires dependence analysis is the way...

...from s1 to s2 * I wont consider the RAR dependency */ after distribution(it should be) : for(int i = 0; i< n ; i++) s1: a[i] = a[i] + x[i]; for(int i = 0; i< n ; i++) s2: x[i] = x[i+1] + i*2 ; I think there is a function isDependendent() in LoopDependencyAnalysis. thank you, shanmuk -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120305/dbf61896/attachment.html>

Hello, Erwin > Although most of this is plain portable C++ perhaps LLVM can auto-vectorize > some of this? Well, I doubt so, unfortunately - LLVM does not have any autopar these days > There is a little bit of hand optimized x86 SSE code. This is only enabled > on 32bit Windows and Mac OSX Intel builds. Ok. What's about Linux builds? Are there any other implementations e.g.

Hi Anton, Thanks a lot for offering help. Bullet uses basic linear algebra with 4-way vectors, quaternion and matrices. Although most of this is plain portable C++ perhaps LLVM can auto-vectorize some of this? There is a little bit of hand optimized x86 SSE code. This is only enabled on 32bit Windows and Mac OSX Intel builds. >> Should I just use the 2.75 release? If you are interested,