similar to: [LLVMdev] Problem with LoopDependenceAnalysis

Shanmuhka wrote: > I looked at the sanjoys patch for SIV Test. And i figured out that this is exactly what i need. > as the comments said, check if subscript A can possibly have the same value as B in analyseSIV(A,B) > but i didn't get How to use this information ? > > lets just say in the above program > When i use depends function it shows the dependency from load of x to

Shanmukha Rao wrote: > I am using LLVM for implementing LoopFission pass. > I am using LoopPass. > I know that for checking circular dependency in loop I have to use LoopDependenceAnalysis > > This is what i want to do. >         for(int i = 0; i< n ; i++){ > s1 : a[i] = a[i] + x[i]; > s2 : x[i] = x[i+1] + i*2 ; > } > >

On Thu, 15 Mar 2012 09:57:00 -0700 Preston Briggs <preston.briggs at gmail.com> wrote: > Shanmukha Rao wrote: > > I am using LLVM for implementing LoopFission pass. > > I am using LoopPass. > > I know that for checking circular dependency in loop I have to use > > LoopDependenceAnalysis > > > > This is what i want to do. > >         for(int i =

Hi, I am using Loop pass ( runOnLoop() function ) In this function I want to access all the Loops in all the functions in the current Module the LoopInfo Pass only gives the Loops in the function where the current Loop resides :-( Is there any other Pass by which I can access the Loops in others functions as well ? ...... Regards, Shanmukha Rao -------------- next part -------------- An HTML

On 4/27/12 2:05 PM, shanmuk rao wrote: > Hi, > I am using Loop pass ( runOnLoop() function ) > In this function I want to access all the Loops in all the functions > in the current Module > > the LoopInfo Pass only gives the Loops in the function where the > current Loop resides :-( > > Is there any other Pass by which I can access the Loops in others > functions

Hi all, I've sent it as a reply to another thread, but it was ill placed. Anyway, sorry about the duplication, but here it goes. I've been looking into the loop passes and noticed we do alias analysis and scalar evolution only, trying to clean up the loop as far as possible. I suppose that, if we were to define SCCs, split them into groups and re-arranging into multiple loops, we would

Hi, I am trying to implement my own Loop fission transformations in llvm. But to find circular dependency, i think i have to use LoopDependenceAnalysis. I am using ModulePass. In this pass I am getting LoopInfo and Loops. but when I try to use LoopDependenceAnalysis It throws segmentation fault. the example shows what i want to do : for(int i = 0; i< n ; i++){ s1 : a[i]

Hello, I found that LDA implemented on a function pass is much more useful than LDA based on a loop pass. In addition, I want to have an analysis result for the outer loops also, even if it would be a very conservative one. Can I commit my modified version of LDA? If you think it is worth to keep current LDA, what about adding a LDA based on function pass to the repository with some other name

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

Hi,       I am trying to debug R on fedora9.0. When I use gdb to debug R-1.9.2, I am getting the error "R: error while loading shared libraries: libRblas.so: cannot open shared object file: No such file or directory" "Program exited with code 0177. Missing separate debuginfos, use: debuginfo-install glibc.i686" I have libRblas.so shared library in two paths, 1)

Hi, I am using "line" function to plot the line. And I would like to understand "Tukeyline" algorithm. Since, the line function is calling the Tukeyline algorithm(which is compiled code) using foreign function interface, I am not able to look into the source code of this algorithm. Can somebody help me out, so that I can refer the same. Thanks in advance!!! Thanks,

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.

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 >

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,

Hello. I experience a problem when I try to run LLVM tests on the ARM "Beagle" board with Debian Lenny installed on it. When I execute "make check", I get the following output: llvm[0]: Running test suite make[1]: Entering directory `/mnt/markhor/llvm/nativeBuild/test' Making a new site.exp file... ( ulimit -t 600 ; ulimit -d 512000 ; ulimit -m 512000 ; ulimit -v 512000

Hello. I experience a problem when I try to run LLVM tests on the ARM "Beagle" board with Debian Lenny installed on it. When I execute "make check", I get the following output: llvm[0]: Running test suite make[1]: Entering directory `/mnt/markhor/llvm/nativeBuild/test' Making a new site.exp file... ( ulimit -t 600 ; ulimit -d 512000 ; ulimit -m 512000 ; ulimit -v 512000

Hi,   I developed a Loop Interchange pass. Please take a look. I have not incorporate data dependence analysis check. I can insert it when the LoopDependenceAnalysis is available.   Thank you Satya -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100713/654d5fd5/attachment.html> --------------

Hi Sanjoy, Reading through LoopDependenceAnalysis::analyseStrongSIV(), I noticed one problem and one confusion. My confusion related to your naming of the two instructions as A and B. It's consistent all through LoopDependenceAnalysis. I'd prefer something like source and destination, so I can keep track of which is which. It didn't matter so much when you were simply proving or

Gents, I spent some time reading over Sanjoy's patch for LoopDependenceAnalysis. Unfortunately, an early version of these notes escaped; this is the complete review. First off, I agree with his choice to implement the SIV tests. For scientific Fortran, the SIV (and the simpler ZIV) tests cover about 85% of the cases in practice. For C and C++, I expect the percentage will be much higher.

Hi Satya, On Tue, Jul 13, 2010 at 12:06 PM, Satya Jandhayala < satya_jandhayala at yahoo.com> wrote: > Hi, > > I developed a Loop Interchange pass. Please take a look. > I have not incorporate data dependence analysis check. I can insert it when > the LoopDependenceAnalysis is available. > Have you tried using include/llvm/Analysis/LoopDependenceAnalysis.h ? Please