similar to: [LLVMdev] Call Graph with inderct call analysis

Hi, I'm looking for ways of generating a call flow graph analysis pass, with indirect function calls as well (i.e. through function pointers). I would greatly appreciate any guidance? Also does LLVM have any pre-existing analysis that I can use for generating something like this. Thanks Nipun -- View this message in context:

Hi, I'm looking for ways of generating a call flow graph analysis pass, with indirect function calls as well (i.e. through function pointers). I would greatly appreciate any guidance? Also does LLVM have any pre-existing analysis that I can use for generating something like this. Thanks Nipun -- View this message in context:

Hii, Thanks for the response, yes I couldn't find any way to extract the names through any of the passes. Where could I potentially insert a hack so that any function call to intrinsic functions or library functions can be retrieved? Could you gimme any ideas for the start? -Nipun On Fri, Jan 30, 2009 at 10:39 PM, Eli Friedman <eli.friedman at gmail.com>wrote: > On Fri, Jan 30,

On Fri, Jan 30, 2009 at 7:10 PM, Nipun Arora <nipun2512 at gmail.com> wrote: > Essentially I would like to extract the control flow graph representation > with function names (eg. _mm_cvtsi32_si128) instead of the functions being > replaced by 'llvm.*' > Is there anyway to extract these names directly as function calls? The names disappear in an unrecoverable way once

Hi Eli, Well I think a way to hack it might be better for my purposes, can you suggest any ways of getting started on that and where. Essentially I'm developing an IDE and need to extract the dependency graphs while retaining the actual function names rather than them being converted to llvm.* names. If I go for the other option you suggested. I'd have to do a one-to one mapping of all

Hi, I was able to figure out this one, by checking out profile.pl. However, I am still interested in getting to know if there is anyway to compile from bitcode to a normal executable? Maybe I am missing something obvious... :P ? Thanks Nipun On Fri, Apr 1, 2011 at 1:34 PM, Nipun Arora <nipun2512 at gmail.com> wrote: > Hi, > > Could anyone tell me how exactly can one convert a

On Sat, Jan 31, 2009 at 1:14 PM, Nipun Arora <nipun2512 at gmail.com> wrote: > Hii, > > Thanks for the response, yes I couldn't find any way to extract the names > through any of the passes. > Where could I potentially insert a hack so that any function call to > intrinsic functions or library functions can be retrieved? > Could you gimme any ideas for the start?

The easiest way is just to invoke clang on the .bc file, since it understands it. clang file.bc -o file llc will get you native assembly, which you can assemble and link with gcc. llc file.bc -o file.s && gcc file.s -o file I couldn't find a way to convince llc to use MC to generate an object file. In any case, you'll need to invoke the system linker to produce the executable.

Hi James, I will look into the RedHat newlib library, however, we def are looking for a solution for glibc, but maybe newlib would be a good way to go to test our complete workflow before putting an effort to generate control flow graphs for glibc. btw. I did have another question, hopefully you would be able to answer, what we are looking to do is to get the control flow graph including some

Hi Tobi, Thanks for the response, could you point me to the source files of the memory dependence pass? Thanks Nipun On Mon, Mar 28, 2011 at 2:46 PM, Tobias Grosser <grosser at fim.uni-passau.de>wrote: > On 03/28/2011 12:15 PM, Nipun Arora wrote: > > Hi, > > > > I have been trying to run the memdep analysis using opt with the > > following command: opt -analyze

Hi, Could anyone tell me how exactly can one convert a .bc file (bitcode file) to an executable in the native program. I was trying an instrumentation transform with the following workflow opt -insert-edge-profiling input.bc -o output.bc and then try and execute output.bc using lli output.bc however the program gives the following error : Program used external function

Hi, I need to generate a data dependancy graph. Is there any functionality available in LLVM which can help me? Or if anyone can point to the correct place? Thanks Nipun Arora Graduate Research Assistant Dept of Computer Science Columbia University -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi all, I am trying to do an analysis of a parallelized code using sse optimizations. The problem I am encountering is that I need to do some matching based on the analysis and I would like to extract the names of the functions as is rather than llvm intrinsics with an llvm. representation. Essentially I would like to extract the control flow graph representation with function names (eg.

On 03/28/2011 12:15 PM, Nipun Arora wrote: > Hi, > > I have been trying to run the memdep analysis using opt with the > following command: opt -analyze -memdep <*.bc>. > However, I keep getting the following error: Pass::print not implemented > for pass: 'Memory Dependence Analysis' ! . > I get similar errors for a lot of the analyses passes, which seem as if

On Dec 4, 2008, at 3:07 PM, Nipun Arora wrote: > Hi, > > I need to generate a data dependancy graph. Is there any > functionality available in LLVM which can help me? Or if anyone can > point to the correct place? There are many different forms of dependency graph, do you mean for loop dependencies, load and store dependencies, def/use dependencies, etc? -Chris

Hi, I have been trying to run the memdep analysis using opt with the following command: opt -analyze -memdep <*.bc>. However, I keep getting the following error: Pass::print not implemented for pass: 'Memory Dependence Analysis' ! . I get similar errors for a lot of the analyses passes, which seem as if they should have a print out? Is there any other memory dependence analysis

I agree. Being a newbie myself, I can relate to what problems someone new to llvm would have.While I think most of the stuff I have tried will be useful, I wouldn't be entirely sure if its the best way to go about it. Thanks Nipun Arora Columbia University On Wed, Mar 11, 2009 at 11:01 AM, Anthony Danalis <adanalis at eecs.utk.edu>wrote: > > On Mar 11, 2009, at 10:53 AM, Jon

If we get the blessing of one of the old-timers who is willing to spend a little time reviewing postings, we can deal with the 'misleading information' issue. In addition, it might be _useful_ to understand why people were misled. On Wed, Mar 11, 2009 at 5:16 PM, Nipun Arora <nipun2512 at gmail.com> wrote: > I agree. Being a newbie myself, I can relate to what problems someone

Right now I am writing passes just to look for arrays & structs I am trying to identify the array by parsing the memory description(use regex's) ex./ { [20 x i8], i32 } *- for a struct. is a structure with a character array of size 20 and an integer. I'm not sure if llvm provides an easier way to do this? The type id for most arrays comes out to be a pointer rather than an array, its

How do you define a data structure for this purpose? Do you mean individual data types like structs or arrays? Or higher-level "logical" structures like lists, trees, or hash tables? The former is obviously easier but even the latter is possible, in some cases. --Vikram Associate Professor, Computer Science University of Illinois at Urbana-Champaign http://llvm.org/~vadve On