search for: dependenceanalyz

I am not sure if my problem is similar to: http://lists.cs.uiuc.edu/pipermail/llvmdev/2003-December/000715.html It seems that the constructor of the static global pass object isn't called: lib/CodeGen/DependenceAnalyzer.cpp: static RegisterAnalysis<DependenceAnalyzer> X("depana", "Dependence Analysis"); I traced into struct RegisterAnalysis ctor, but my pass doesn't appear. I put it in an anonymous namespace, it doesn't work too. The class definitions: class DependenceAnaly...

Hi! I can't build LLVM using GCC 4.1 (GCC CVS mainline) after http://mail.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20050328/025003.html Build terminated with error: /home/wanderer/pkg/build/llvm/src/llvm/lib/Target/SparcV9/ModuloScheduling/DependenceAnalyzer.cpp:25: error: explicit qualification in declaration of `llvm::FunctionPass* llvm::createDependenceAnalyzer()' at line: FunctionPass *llvm::createDependenceAnalyzer() { Removing redundent "llvm::" fix problem. Vladimir

...... ; ++P) > *P > > to: > > int *P = ... > for (int i = 0; ... ; ++i) > P[i] > > If you're interested in dependence analysis, the next important step is to > start analyzing distance and direction vectors. You can check out lib/Target/SparcV9/ModuloScheduling/DependenceAnalyzer.cpp It uses Alias Analysis and Scalar Evolution to figure out dependences and distances for single dimensional arrays. It needs more work, but its a start. Its not used by anyone currently. I wrote it for my ModuloScheduling work. -Tanya

Hi, Is it possible to generate a data dependence graph of llvm assembly file? How can I get the data flow information in X.ll file? Also, in .ll file I see everyline ends with something like this: <type> [#uses=3] What is the significance of this and is it used anyway by the compiler for data dependence analysis. I would be grateful for any help. Regards, Manvi

On Fri, 17 Jun 2005, Manvi Agarwal wrote: > Hi Chris, Hi. FYI, it's usually better to email the llvmdev list with generic llvm questions. > Is it possible to get control flow graph of the application with the llvm > infrastructure in terms of basic blocks? Yes, given a BasicBlock*, you can iterate over the pred/succ blocks in the CFG like this: #include

On Mon, 18 Jul 2005, Naftali Schwartz wrote: > Hi, everyone. I've been examining llvm for a while and been duly impressed. > I'd like to contribute in the area of dependence analysis, and a good place > to start seems to be in the transformation of pointers to explicit array > accesses. Is anyone else working on this? If not, does this seem a > plausible place to

Hi, everyone. I've been examining llvm for a while and been duly impressed. I'd like to contribute in the area of dependence analysis, and a good place to start seems to be in the transformation of pointers to explicit array accesses. Is anyone else working on this? If not, does this seem a plausible place to start and how would be the best way to go about it? Thanks, Naftali

...Target/SparcV9/InstrSched/SchedGraph.h Index: lib/Target/SparcV9/InstrSched/SchedGraphCommon.cpp Index: lib/Target/SparcV9/InstrSched/SchedPriorities.cpp Index: lib/Target/SparcV9/InstrSched/SchedPriorities.h Index: lib/Target/SparcV9/LiveVar/BBLiveVar.cpp Index: lib/Target/SparcV9/ModuloScheduling/DependenceAnalyzer.cpp Index: lib/Target/SparcV9/ModuloScheduling/MSSchedule.cpp Index: lib/Target/SparcV9/ModuloScheduling/MSchedGraph.cpp Index: lib/Target/SparcV9/ModuloScheduling/MSchedGraph.h Index: lib/Target/SparcV9/ModuloScheduling/ModuloScheduling.cpp Index: lib/Target/SparcV9/ModuloScheduling/ModuloSchedu...