similar to: [LLVMdev] Find size of memory pointer is pointing to

Hi, Within the basic block I got the instructions and so the operands i got the operands. Can we get the size of the operands. Specifically, if operand is of type structure, Can we get size of this operand? -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, Can we find the type of the pointer, means can we find is it a Integer pointer or float, etc. -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121112/4271572e/attachment.html>

Hi, Can we check whether a given funcion is user defined or not? -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121106/8d56dd24/attachment.html>

I want to know that is there any way to find a given instruction is using an array as operand? -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120817/ec62123c/attachment.html>

On Nov 12, 2012, at 4:19 AM, <llvmdev-request at cs.uiuc.edu> wrote: > Date: Mon, 12 Nov 2012 10:58:40 +0100 > From: Duncan Sands <baldrick at free.fr> > To: llvmdev at cs.uiuc.edu > Subject: Re: [LLVMdev] Find size of memory pointer is pointing to > Message-ID: <50A0C850.8050106 at free.fr> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed >

Hi, Can we find the type of the pointer, means can we find is it a Integer pointer or float, etc. -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121112/692686e5/attachment.html>

Hi, I want to ask is that can we use the information generated by existing passes into a new pass? If yes, then how ? For example -loops gives the natural loop information, so can we use this information into new pass by calling it. -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was

Hi, Can we check whether a function is user defined or not? -- Sunil Rathee MTech IIT Delhi Not going along with the crowd can help you stand out in the crowd -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121106/68012441/attachment.html>

Sir/Ma'am, I am a MTech student at IIT Bombay, doing my thesis in compiler optimization. I am working on "Profile Based Pointer Analysis to Perform Optimization", and would like to implement the optimization in llvm for performing experiments. When I was trying to build and install the compiler after configuring llvm-gcc I got the following error: gcc: gengtype-lex.c: No such

Hi, I am a student at IIT Kanpur. I am working on Path Profiling, i just came with a need to know about the number of static paths in a program(actually in a function) before it's actually get run. As i saw in PathProfiling.c file in llvm\runtime\libprofile they are just storing the path information at run time and dynamically adding entries for the new path. But i need to know the number of

Hi, I am a student at IIT Kanpur. I am working on Path Profiling, i just came with a need to know about the number of static paths in a program(actually in a function) before it's actually get run. As i saw in PathProfiling.c file in llvm\runtime\libprofile they are just storing the path information at run time and dynamically adding entries for the new path. But i need to know the number of

Hi, I am a Mtech student at IIT,Bombay and presently studying llvm as a part of my Seminar work.Currently,i am writing a simple pass that would detect function pointer call,use and declarations in the src program. I could detect function pointer calls using the getCalledFunction(). However,i am stuck in identifying function pointer declaration and use. is there a way one can distinguish between

Respected R Help Team Members, I am venkatesh .B , doing mtech in *University of Hyd,HYDERABAD. *i want know , is there any package that contains Hungarian algorithm, that solves linear assignment problem. thanking you. * * -- *Sincerely B.venkatesh University of Hyd,HYDERABAD 9440186746* [[alternative HTML version deleted]]

Hi Ambika, > I am a MTech student at IIT Bombay, doing my thesis in compiler > optimization. > I am working on "Profile Based Pointer Analysis to Perform > Optimization", and would like to implement the optimization in llvm for > performing experiments. > > When I was trying to build and install the compiler after configuring > llvm-gcc I got the following

Hello Sir, Im trying to test run pbqp register allocator for small C programs. by llc -regalloc=pbqp -debug <bitcode of the file> It is giving me segmentation fault for even very simple programs having loops or if statements. Please tell me where I'm going wrong. -- Regards, Smriti Jaiswal MTech Dept of Computer Science and Engg, IIT Kanpur -------------- next part --------------

The simple C code on which im running the allocator is attached. And these are the set of commands. I dont understand ..guess i might be doing something very silly. Please help *Commands:* clang -emit-llvm -c test.c -o test.bc opt -mem2reg test.bc -o testssa.bc llc -regalloc=pbqp testssa.bc On Mon, Aug 12, 2013 at 7:59 AM, David Blaikie <dblaikie at gmail.com> wrote: > > > >

On Sun, Nov 3, 2013 at 9:19 AM, Christopher Wood <christopherwood07 at gmail.com> wrote: > On Sun, Nov 3, 2013 at 1:02 AM, Daniel Berlin <dberlin at dberlin.org> wrote: >> >> As for a "better" way to implement PRE, it depends on what algorithm >> you want to use. If you just want to write a PRE pass, that's easy >> enough without dominance

I had this on my TODO list for a while, but the recent introduction of inaccessiblememonly makes it suddenly more urgent, as there is a risk to waste effort in duplicated work and/or end up with suboptimal solutions. I collected 2 use cases for inaccessiblememonly : - Allocation like functions. - Runtime functions for managed languages, that touch state that the program itself can never touch

Hi, I had asked earlier from my another ID about duplicating a basic block, but that server is down for moment. I was given suggestion to use CloneBasicBlock, but when I used it I get an error : While deleting: i32* %a Use still stuck around after Def is destroyed: store i32* %a, i32** %p, align 4 opt: /home/ambika/llvm_3/llvm-2.6/lib/VMCore/Value.cpp:81: virtual llvm::Value::~Value():

> Rmetrics - New Version is available for R 1.9 !! > in R-binary and R-source form from the site "http://www.rmetrics.org", > and install the binary "zip" files in the usual way via the menu I'm confused - does the fact that you are only distributing ".zip" files means that (shudder) I need Microsoft Windows in order to run this? (I hunted on the