similar to: [LLVMdev] Accessing Loop Variables

On Oct 12, 2009, at 3:46 AM, Prasenjit Chakraborty wrote: > > Hi, > How do I access the loop variables in a loop. > > for(i = 0; i < N; i++) > for(j = 0; j < M; j++) > A[i][j+k] = i + j; > > Is there anyway for me to know that in A[i][j+k], i & j are loop > variables > whereas k is not! The ScalarEvolution analysis can help here.

Hi, I am new to LLVM. I want to go through all loops in a function. I see that there is a LoopPass manager that I can use. But that is not much of help, as I want to get the order of loops in CallGraphSCC order, hence I visit each function and then just want to go over the loops. Regards, Prasenjit Chakraborty Performance Modeling and Analysis IBM Systems & Technology Lab

Hi, I'm trying to write a simple pass to print out Loop invariant instructions, using the Loop::isLoopInvariant(Instruction *I) function. it is giving me false value on instructions which should be loop invariant. the code i am using is: bool MyLoopPass::runOnLoop(Loop * L, LPPassManager &lpm){ BasicBlock* lat=L->getLoopLatch(); for (BasicBlock::iterator i = lat->begin(), e =

On Nov 17, 2010, at 2:20 AM, Sreeraj a wrote: > Hi, > I'm trying to write a simple pass to print out Loop invariant instructions, using the > Loop::isLoopInvariant(Instruction *I) > function. it is giving me false value on instructions which should be loop invariant. > > the code i am using is: The isLoopInvariant method just works for scalar operations like

Hi all! I'm new here, and would like to implement my own Loop Invariant Detection adding some more information on Quasi-Invariants. First, is there anything about Quasi-Invariants detection in LLVM I would missed? I've seen LICM using LoopInfo::isLoopInvariant for finding invariants. It seems that this method considers a Value invariant if: - it's an Instruction not presents in the

The funny thing is that i am manually able to hoist the Loop invariant instruction to the basicBlock terminator, by editing the human readable form and then using llvm-as to convert it into bytecode. On Thu, Nov 18, 2010 at 4:01 AM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 17, 2010, at 1:38 PM, Sreeraj a wrote: > > > Thanks Chris, > > > > I was

Ty Eli for your answer. On Tue, Jan 17, 2017 at 8:11 PM, Friedman, Eli <efriedma at codeaurora.org> wrote: > On 1/17/2017 7:12 AM, Thomas RUBIANO via llvm-dev wrote: > >> Hi all! >> >> I'm new here, and would like to implement my own Loop Invariant Detection >> adding some more information on Quasi-Invariants. >> >> First, is there anything

Thanks Chris, I was able to weed out loop invariant arithmetic instructions using isLoopInvariant function. when i try to do an instruction->moveBefore(bb->getTerminator()) i'm getting a seg fault. any obvious reasons that i'm missing out on? Thanks in advance On Wed, Nov 17, 2010 at 10:41 PM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 17, 2010, at 2:20

On Wed, Jan 18, 2017 at 8:05 PM, Friedman, Eli <efriedma at codeaurora.org> wrote: > On 1/18/2017 2:56 AM, Thomas RUBIANO wrote: > > Ty Eli for your answer. > > On Tue, Jan 17, 2017 at 8:11 PM, Friedman, Eli <efriedma at codeaurora.org> > wrote: > >> On 1/17/2017 7:12 AM, Thomas RUBIANO via llvm-dev wrote: >> >>> Hi all! >>>

i am getting seg fault on functions like I->eraseFromParent also. I'm assuming that the problem comes when i change the loop structure. On Thu, Nov 18, 2010 at 4:05 AM, Sreeraj a <writetosrj at gmail.com> wrote: > The funny thing is that i am manually able to hoist the Loop invariant > instruction to the basicBlock terminator, by editing the human readable form > and then

Hello, I am having problems getting one xlite clients to communicate through asterisk. I am getting an error message: chan_sip.c:15593 handle_request_register: Registration from '"chinmay chakraborty"<sip:1234 at 10.44.32.193 <sip%3A1234 at 10.44.32.193>>' failed for '10.44.32.193' - No matching peer found sip show peers Name/username Host

Hi, (please Cc me) In xyplot (), type = "l" (or one that includes "l", *el*) is (generally) meaningful only when the 'x' variable is sorted. In practice, one either sorts the data frame before hand or writes a tiny panel function which sorts the supplied x and then calls the default panel.xyplot(). Trouble arises when there is a conditional variable as well as a

Hi, I sent an email to Mark Fisheh of Oracle Corp. & posted this issue at OTN under Linux thread this morning. I hope that someone among you might have experienced this and can help. On that basis, I am sending this to you too. I am stuck & will really appreciate if you can shed some light on this. Thanks. Anjan

Hello, If I have a value with a SCEV for which the hasComputableLoopEvolution member function returns true for a given loop, is there a way to construct the value one or more iterations ahead in the loop? I guess I can dyn_cast the SCEV down to each of the various subclasses and construct these values myself for each one, but I'm wondering if there's something I missed. Thanks, Dan --

On Nov 17, 2010, at 1:38 PM, Sreeraj a wrote: > Thanks Chris, > > I was able to weed out loop invariant arithmetic instructions using isLoopInvariant function. > when i try to do an instruction->moveBefore(bb->getTerminator()) i'm getting a seg fault. > any obvious reasons that i'm missing out on? No idea, sorry. -Chris

Dear All, Is the following patch to ScalarEvolution correct? It seems that without it, the enclosing for loop could skip over SCEVAddRecExpr's in the Ops[] array. -- John T. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: scpatch URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080222/3ff8edd7/attachment.ksh>

Hi, We have implemented the rsqrt instruction generation for X86 target architecture. We have introduced a flag -fp-rsqrt flag which controls the generatation of X86 rsqrt instruction generation. We have observed minor effects on precision due to rsqrt and hence has put these transformations under the mentioned flag. Note that -fp-rsqrt is only enabled with -enable-unsafe-fp-math flag presently.

On Wed, Nov 14, 2012 at 10:43 PM, Chakraborty, Soham <Soham.Chakraborty at amd.com> wrote: > Hi, > > > > We have implemented the rsqrt instruction generation for X86 target > architecture. We have introduced a flag -fp-rsqrt flag which controls the > generatation of X86 rsqrt instruction generation. > > We have observed minor effects on precision due to rsqrt and

Driver init call graph under baremetal: driver_init-> msix_capability_init-> msix_program_entries-> msix_mask_irq-> entry->masked = 1 request_irq-> __setup_irq-> irq_startup-> unmask_msi_irq-> msix_mask_irq-> entry->masked = 0 So

Hello, I am facing an issue with a small test where there is a chance that sign-extension is not introduced as expected - #include <stdio.h> void func( long x ) { printf(" %ld \n", x); } int main() { char c = -1; func ( c ); // c is zero extended to x return 0; } generated IR - define i32 @main() #0 { ........ store i8 -1, i8* %c, align 1 %2 = load i8,