similar to: [LLVMdev] [Pass] How to gather data dependencies

Take a look to this page: https://sites.google.com/site/parallelizationforllvm/ On Wed, Aug 7, 2013 at 10:52 PM, Valmico <valmico88 at gmail.com> wrote: > Hello, > > I'm currently trying to develop new LLVM Pass that will generate simple > data dependencies graph. For now I'm trying to get familiar with > DependenceAnalysis. > My general idea is to traverse each

Valmico <valmico88 at gmail.com> wrote: > I'm currently trying to develop new LLVM Pass that will generate > simple data dependencies graph. For now I'm trying to get familiar > with DependenceAnalysis. > My general idea is to traverse each function (runOnFunction) > top to bottom Instruction by Instruction, using DA.depends( I, I2, ...) > on every Instructions

2013/8/8 Preston Briggs <preston.briggs at gmail.com> > > Hi, > > The DependenceAnalysis pass isn't reliable yet; it has several errors that > need to be corrected. These manifest by the analysis claiming there's no > dependence when one in fact exists. > > Your proposed scheme of testing every pair of instructions is > asymptotically expensive, requiring

On Fri, Aug 9, 2013 at 1:05 PM, Valmico <valmico88 at gmail.com> wrote: > I assume that DA is tool capable to give me an list of Dependencies in code > or at least a easy way to test instructions without much knowledge about ZIV SIV, > and other tests that has to be done find out dependencies? DA exists to support building a dependence graph. It checks to see if two instructions

Hi all, Unfortunately, all my Hunks are failed when I apply : patch -p1 < da.patch command. The problem might be due to the fact that da.patch file was created against revision 167549, but I am on revision 167719 (I believe the most recent one). I am not sure if this cause the problem ? But Preston may I ask you to generate the patch file against revison 167719 ? Thanks in advance. On

On 13.11.2012, at 10:46, erkan diken <erkandiken at gmail.com> wrote: Hi all, Unfortunately, all my Hunks are failed when I apply : patch -p1 < da.patch command. The problem might be due to the fact that da.patch file was created against revision 167549, but I am on revision 167719 (I believe the most recent one). I am not sure if this cause the problem ? But Preston may I ask you to

Erkan, you're right. Sorry about that. Attached is the most recent version. Preston Hi Preston, > I am trying to use DA as well. I used your example and commands that you > wrote in order to get DA information. > However, it does not report any dependence info. > I am wondering whether your local copy differs from the one on the > repository ? > Thanks. > Erkan.

Preston, thanks for the explanation and patch. Now it's printing the direction and distance values. On Tue, Nov 13, 2012 at 12:22 PM, Preston Briggs <preston.briggs at gmail.com>wrote: > Erkan, you're right. Sorry about that. > Attached is the most recent version. > > Preston > > > > Hi Preston, >> I am trying to use DA as well. I used your example

Dear all, I have already checked some related posted messages, such as: http://lists.cs.uiuc.edu/pipermail/llvmdev/2008-January/012315.html and http://lists.cs.uiuc.edu/pipermail/llvmdev/2008-February/012466.html After getting rid of some error messages, I was able to run the following commands: 1) opt -insert-path-profiling matmul.bc -o matmul.pp.bc 2) lli -load

Dear all, I want to build an LLVM pass by using CMake. After reading the ralevant part of the documentation ( http://llvm.org/releases/3.1/docs/CMake.html#passdev), I copied the files in the llvm/lib/Transforms/Hello to another folder in order to give a try. Then I renamed the folder as Hello2. Then I have changed CMakeLists.txt as following: cmake_minimum_required(VERSION 2.8) # A

erkan diken <erkandiken at gmail.com> writes: [snip] > It seems that cmake is ok. When I run make install, it gives errors (see > below) and i think the reason is that it can not find the directory to llvm > header files. > I could not figure it out which variable to set and how to use it in order > to point the required directory ? > ( as in the make pass build which

Hello, thanks to your advices now my pass is on good way (i hope), but i've faced one problem that i cannot solve by myself: Running all these passes (-basicaa -mem2reg -simplifycfg -loop-simplify -loop-rotate -simplifycfg -instcombine -indvars -da) helped a lot, but now i'm unable to find dependencies that are outside of the loop. f.eg. code like this returns no dependencies (and no

Hi, The DependenceAnalysis pass will find loop-carried dependences. However, it is a conservative analysis and will sometimes suggest there may be more dependences than actually exist. In your example, I expect the analysis is confused for some reason and is returning the default confused response. You could test it using the isConfused() method. Note that the DVEntry::ALL direction is always

What version of LLVM are you using? The profiling framework is completely messed up in the newer versions of LLVM.. I used to work with profiling in 2.5 some time ago, and it seemed to work fine.. If you really need this to work quickly, you might want to just get the old version and get on with it.. The newer versions of LLVM need to get the profiling part fixed soon..It is messing up my work as

Hi Guys, I noticed that the operation actions( promote/expand/custom) are set per operation basis. Wondering if we can set it up globally? For example, I have native supported 32 bits registers, to handle 8 bits value operations, I want to do promote. and to support 64 bit operations, I want to expand. If I can set up the operation actions for the same type globally, then I can avoid to

Hi everyone! Here, I have a question and am curious about i128. I want to know how the LLVM handle i128, because many compiler backend doesn't support i128 directly. So I am very curious and want to how the llvm handle this situation? Besides i128, such as i256, i512, even i24? Thanks. Best Regards Wu Zhao -------------- next part -------------- An HTML attachment was scrubbed...

Hi, all ! I am doing some study about code generation in LLVM, It is a pity that there is little introduction to it. Some paper introduces that code generation in LLVM is based on Table Driven, and i have referred paper "*An experiment in table driven code generation*", But it has not given me any help. Can you give a help understanding the code generation in LLVM. Thanks a lot.

Hi I want to analyse the memory dependencies which exist in a loop at an intra iteration as well as inter iteration (loop carried dependencies). I looked at the DependenceAnalysis implementation which returns a lot of the information I require (based on a prior AliasAnalysis pass), however I need to pass the Src and Dst instructions in program order. I was wondering how I can collect all the

Hi Preston, Thank you for the prompt response. You can use DependenceAnalysis to get the info you want by expensively > testing all pairs of memory references. Isn't all pairs testing incorrect in the sense that a pair may only exist for a certain path? Consider the following example. A[i] = 42; // S1 if( condition ) // C1 { A[i] = 20; // S2 } B[i] = A[i];

Hi all, Sorry for having been quiet for so long, I have my university exams going on, and will be able to contribute only after the coming Friday. Thanks! -- Sanjoy Das http://playingwithpointers.com