similar to: [LLVMdev] Data Dependency graph

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 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

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

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,

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

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

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

Hey Devang, Thanks for the assist, I'm trying to extract a signature which uniquely identifies a block of code.... this is required for a project I am doing. The no of data structures is one of the identifying features of this signature. Thanks Nipun On Fri, Oct 31, 2008 at 1:05 PM, Devang Patel <dpatel at apple.com> wrote: > Hi Nipun, > On Oct 30, 2008, at 9:31 PM, Nipun

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

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

Hi I was having just one more problem. I would like to find these datastructures/ primitive types etc inside a block, however the valuesymbol table is available only at a functional level. What can I do so as to get the number + type of datastructs(eg. arrays etc) inside a single block? Thanks Nipun On Fri, Oct 31, 2008 at 12:05 PM, Devang Patel <dpatel at apple.com> wrote: > Hi

Hi Nipun, On Oct 30, 2008, at 9:31 PM, Nipun Arora wrote: > Hi > > I am trying to count the no of datastructures and the type, say for > example the number of arrays in a given code. Which pass would give > me this info? And what do I need to use in it? What are you trying to achieve here with this information ? You can iterate over types to collect the info you need. For

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?

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

Hi Nipun, As you say, glibc is rather GCC -oriented. I certainly haven't tried this myself, but have you thought of using an alternate C library such as RedHat newlib? That can certainly be compiled by clang (we do it every night). Cheers, James From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Nipun Arora Sent: 26 January 2012 15:54 To:

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

Nipun Arora wrote: > Hi, > > How can one extract the operand of an instruction in an LLVM pass? > Like I can get the opcode bt I'd like to get the operands as well > Use the getOperand() method of class Instruction (which I think is inherited from Value or User or some other LLVM class). It takes a single parameter that is an index specifying which operand to return. The

Hi John, Thanks for the detailed answer, this gives me a good starting point to look into. I was also wondering if you could give an idea (in terms of %ge) the overhead one can expect with such an instrumentation. I want something really lightweight and simple which can possible be applied to production systems, so overhead is a concern. Thanks Nipun On 12/09/2011 02:21 PM, John Criswell

On 12/7/11 4:51 PM, Nipun Arora wrote: > Hi, > > I need to write a transform pass which instruments the target program to > output the name of each function executed, and the rdtsc counter along > with it. Doing this in LLVM is really straightforward. You simply iterate through all the functions in a module and add instructions to their entry basic blocks to do whatever it is