search for: bikshandi

...typically just recognize the idioms as they optimize. LLVM doesn't include loop fusion, but Polly may help there. Likewise, Polly and AESOP are probably your best bets for things like memory access patterns and auto-parallelization. All the best, Stefanus On Wed, Apr 17, 2013 at 11:32 AM, Bikshandi, Ganesh < ganesh.bikshandi at intel.com> wrote: > Hi,**** > > ** ** > > For one of our research projects, we are planning to use LLVM. We need the > following features:**** > > ** ** > > **1. **We need to aggressively fuse loops that have inter-loop >...

Hi, For one of our research projects, we are planning to use LLVM. We need the following features: 1. We need to aggressively fuse loops that have inter-loop dependencies. 2. We need to identify intrinsic functions and induction variables. 3. We need to detect few memory access patterns like copy, transpose-copy, stride-copy etc. 4. Lastly, auto-vectorization and

Ganesh, I modified DataStructure.cpp so that global nodes are no longer removed from any graphs. Only that file has changed. Chris, if you get a chance to do this, it would be nice if you could take a quick look at the change I made and make sure that's all that's needed. Thanks, --Vikram http://www.cs.uiuc.edu/~vadve > From: Chris Lattner <sabre at nondot.org> >

I tried to used the getScalarMap function of the DSGraph to get the nodes that the scalars point to in a function. But the getScalarMap returns a null map always. Is there any problem in the getScalarMap function or is there any "protocol" to be followed while using the function? Thanks, Ganesh

Specifically we did the following: ...... DSGraph* DSG = getAnalysis<BUDataStructures>().getDSGraph( F ); std::map< Value*, DSNodeHandle> scalarmap = DSG->getScalarMap(); ...... The scalarmap is always empty. I printed the size of the map which came out to be zero always. But the getNodeForValue works correctly for the same DSG, which means that the scalarmap cannot be empty.

Chris, We tried that too...but still it returns an empty map. We also saw that Scalar Type has been removed from the DSNode types. Why is that? Thanks, Ganesh On Wed, 20 Nov 2002, Chris Lattner wrote: > > ...... > > DSGraph* DSG = getAnalysis<BUDataStructures>().getDSGraph( F ); > > std::map< Value*, DSNodeHandle> scalarmap = DSG->getScalarMap(); > >

Prof. Vikram, I updated the DataStructure.cpp and recompiled the llvm. But still I have the same scenario. I don't get the same DSnode for global. I tried several methods; but none of them were successful. I used the getNodeForValue and again I found that the global value had different nodes in different functions. However, the getGlobals worked well for function call. Thanks, Ganesh On Mon,

I have some questions regarding how globals are represented in DS graph. Specifically, I wrote the following simple program: List *g; void alloc_func(){ g = ( List* ) malloc( sizeof( List ) ); } void free_func(){ free( g ); } int main(){ alloc_func(); free_func(); } I noticed that the DSnode for g in alloc_func is different from that of free_func and NEITHER of them had GlobalNode