similar to: how to use the result obtained from Deal Package

Thanks!!! James and Michael. yes now got the idea how it is working. Manish On Tue, Aug 2, 2011 at 7:59 AM, James Molloy <james.molloy at arm.com> wrote: > Hi Manish,**** > > ** ** > > As Michael mentioned, the Instruction is its own result.**** > > ** ** > > The Instruction class subclasses Value. If you treat the Instruction as a > Value you will get what

Thanks Michael. I wish to get Type of %1 i.e. result of instruction. Let me try out your suggestion. But It is still not clear to me how will dyn_cast will help here. I already have pointer to this particular instruction. On Mon, Aug 1, 2011 at 5:34 PM, Michael Ilseman <michael at lunarg.com> wrote: > In LLVM, %1 is the instruction itself. This is because LLVM IR is in > SSA, so the

In LLVM, %1 is the instruction itself. This is because LLVM IR is in SSA, so the "=" really means equality. If you look at a use of %1, e.g. as an operand to another instruction, you'll see that it's the instruction itself that is there (i.e. you can dyn_cast<Instruction> it). On Mon, Aug 1, 2011 at 5:27 PM, Manish Gupta <manishg at cs.ucsd.edu> wrote: > What

I am facing problem in installing the R package on linux . When i put the command install.packages("BART") Then it asks for selecting the mirror , i have selected the mirrror , but it is showing no package in repository .I have selected different different repository still i am getting the same error what can i do , please help me out.i am sending the screenshot of unix terminal . I will

1. You should run the passes in the same opt command, for passes like loops which is an analysis pass provides results to the following passes. 2. You can pass a -debug flag to opt to see the some debugging info. 3. I tried this opt -mem2reg -loops -loopsimplify -loop-unroll -unroll-count=3 -debug loop.o -o tt.bc and got this message. Loop Size = 14 Can't unroll; loop not terminated by

Even after all the sequence of commands below bit-code is not showing any effect of loop-unrolling *manish at manish:~/Test2$ llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* *manish at manish:~/Test2$ opt-2.8 -loops Hello.bc -o Hello1.bc* *manish at manish:~/Test2$ opt-2.8 -loopsimplify Hello1.bc -o Hello2.bc* *manish at manish:~/Test2$ opt-2.8 -indvars Hello2.bc -o Hello3.bc* *manish at

The README at the location shared by John says "DSA is undergoing significant changes and may not be entirely stable or correct. See lib/DSA/README" So, I was wondering from where should one pick the code. Although I will start my analysis and see how results turn out to be. But any comments on this line will be helpful. Thanks Manish On Tue, Sep 20, 2011 at 5:13 PM, Manish Gupta

On 8/4/11 2:45 PM, Manish Gupta wrote: > Hey John, > > Yes this is what I am looking for. I wrote a code as I described in my > first mail and I am getting desired result except when the chain > encounters load instruction (you have also mentioned the that u skip > loads). Okay. Just out of curiosity, is your static slice local (stopping at function arguments) or

Hey John, Yes this is what I am looking for. I wrote a code as I described in my first mail and I am getting desired result except when the chain encounters load instruction (you have also mentioned the that u skip loads). I think the recursive trace back for a Value V depending on Operands (o1,...oN) should terminate at the nearest definition of the oN (i.e. it is not an instruction but a LLVM

********************************************************************** CALL FOR PARTICIPATION ====================== The 8th IEEE International Conference on Autonomic Computing Karlsruhe, Germany June 14-18, 2011 http://icac2011.cis.fiu.edu

********************************************************************** CALL FOR PARTICIPATION ====================== The 8th IEEE International Conference on Autonomic Computing Karlsruhe, Germany June 14-18, 2011 http://icac2011.cis.fiu.edu

On 8/4/11 1:53 PM, Manish Gupta wrote: > It would be great help if someone can point me to similar code in > Analysis or Transform, i.e. tracing value dependencies chains. If I understand correctly, given an instruction I, you want to find its operands o1 through oN, and then find the instructions (or LLVM values) that generate the values o1 through oN, and then find the instructions

It would be great help if someone can point me to similar code in Analysis or Transform, i.e. tracing value dependencies chains. Thanks, Manish On Wed, Aug 3, 2011 at 10:47 AM, Manish Gupta <manishg at cs.ucsd.edu> wrote: > Hello All, > > What would be the best way to trace Value Dependency Chains in LLVM. Can I > use some API to perform this? > > The use-def chain

Thanks Everyone for the info. I am planning to work with DSA on llvm-2.9. Hope it is working as John mentioned. Manish On Tue, Sep 20, 2011 at 7:06 AM, John Criswell <criswell at illinois.edu>wrote: > On 9/19/11 9:12 PM, Manish Gupta wrote: > > Dear All, > > I am curious to know the reason for removal of andersen pointer analysis. > Is it because of some issues? We

What member function to use if I wish to operate on results of an instruction. eg. Instruction %1 = getelementptr inbounds [10 x i32]* %a, i32 0, i32 %0 I->getOperand will give me the operands. How should I get hold of %1? Thanks, Manish -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, You might want to try running -loops -loop-simplify before loop unroll. >From loop simplify.cpp This pass performs several transformations to transform natural loops into a00011 // simpler form, which makes subsequent analyses and transformations simpler and00012 // more effective. Arushi On Tue, May 3, 2011 at 2:17 PM, Manish Gupta <mgupta.iitr at gmail.com> wrote: > You

On 9/19/11 9:12 PM, Manish Gupta wrote: > Dear All, > > I am curious to know the reason for removal of andersen pointer > analysis. Is it because of some issues? We need it on llvm-2.9, if > possible. > > Do we have some better version of pointer analysis on llvm-2.9? The Data Structure Analysis pass (DSA) is a unification-style points-to analysis. It should work with

Dear Manish, First, in answer to your original question: yes, there is a pass that will convert constant expression GEPs used within LLVM instructions into GEP instructions. SAFECode has a pass called BreakConstantGEPs in safecode/trunk/lib/ArrayBoundChecks/BreakConstantGEPs.cpp (http://llvm.org/viewvc/llvm-project/safecode/trunk/lib/ArrayBoundChecks/BreakConstantGEPs.cpp?view=log). It

On 10/1/11 11:01 PM, Manish Gupta wrote: > Dear All, > > I am trying to use DataStructure Alias Analysis. From the code at > poolalloc it seems that rDSA needs to be compiled to get -ds-aa > feature while the Makefile builds just the DSA. I seem to recall replying to this, but my email client says I didn't, so I'm responding again. :) The rDSA code is some experimental

Hi, I am working on R plot but i need to write some text for the bars where the value is = 0 > counts 3 4 5 0 12 * 0* 4 1 3 *0* 1 http://r.789695.n4.nabble.com/file/n4633189/Screenshot-2.png My aim is to write some comment in plot. http://r.789695.n4.nabble.com/file/n4633189/Screenshot-2.png How can we implement it? -- View this message in context: