search for: malveeka

Displaying 9 results from an estimated 9 matches for "malveeka".

2011 May 21
4
[LLVMdev] getCanonicalInductionVariable
...uction PHINode *indv = NULL; indv = L->getCanonicalInductionVariable(); However, when I check indv is always set to NULL. Since the code has a canonical induction variable, I was expecting the endv to start pointing to the induction var phi node. Please let me what I'm missing here Thanks Malveeka -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110521/b305df61/attachment.html>
2011 May 05
2
[LLVMdev] Loop transformations using LLVM
...liar with the llvm infrastructure and I am not sure if the above approach is even going to work. It'll be great if someone can suggest a better or more concrete way of doing the above transformation ? Is there already something similar in the source tree that can I look up for ideas ? Thanks! Malveeka -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110505/0edf031c/attachment.html>
2011 May 07
1
[LLVMdev] Loop transformations using LLVM
On May 5, 2011, at 5:11 AM, Rotem, Nadav wrote: > Malveeka, > > You can use the LoopInfo analysis to find the induction variable. > > http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c > > Cheers, > Nadav getCanonicalInductionVariable is a good example of finding IVs without iterating over...
2011 May 05
0
[LLVMdev] Loop transformations using LLVM
Malveeka, You can use the LoopInfo analysis to find the induction variable. http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c Cheers, Nadav From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Malveeka Tewari Sent: Thursday...
2011 May 22
0
[LLVMdev] getCanonicalInductionVariable
Hi, What does your LLVM IR look like. Are you sure the loop hasnt been optimized away? Arushi On Sat, May 21, 2011 at 5:52 PM, Malveeka Tewari <mtewari at eng.ucsd.edu>wrote: > Hi > > I have the followed code for which I am writing a loop pass. > > int main() { > int i = 0; > for (i=0; i<20; i++) { > printf ("hello world %d\n", i); > } > return 0; > } > > In the...
2011 May 23
0
[LLVMdev] Fwd: getCanonicalInductionVariable
Forwarding to list :) ~Will ---------- Forwarded message ---------- From: Malveeka Tewari <mtewari at eng.ucsd.edu> Date: Sun, May 22, 2011 at 12:38 AM Subject: Re: [LLVMdev] getCanonicalInductionVariable To: willdtz at gmail.com Adding -mem2reg fixed the problem ! Thanks a lot! Malveeka On Sat, May 21, 2011 at 9:47 PM, Will Dietz <willdtz at gmail.com> wrote: >...
2011 Jun 04
2
[LLVMdev] Function name changes in .bc on running llvm-g++
...er, float %e, i32 %pid, %union.pthread_barrier_t* %barrier) nounwind { What is the reason for the function renaming and is there a way to avoid so that the function name remains unchanged. This is how I am invoking llvm-g++ llvm-g++ -emit-llvm -c -O0 streamcluster.cpp -o streamcluster.bc Thanks! Malveeka -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110603/c36224d8/attachment.html>
2011 May 25
1
[LLVMdev] Running both Function and Loop passes together
...gs ? I am not sure if my pass should implement both runOnLoop and runOnFunction methods or not. I tried implementing a pass that subclasses both Function and Loop Pass, but that didn't seem to work. Any suggestions on the best way to implement such a pass will be extremely helpful. Thanks! Malveeka -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110525/383471c6/attachment.html>
2011 Jun 04
0
[LLVMdev] Function name changes in .bc on running llvm-g++
On 6/3/11 9:55 PM, Malveeka Tewari wrote: > Hi > > I am running llvm-g++ on a .cpp file to generate the llvm bitcode. > > The function definition in the .cpp file is: > > float pFL(Points *points, int *feasible, int numfeasible, float z, long *k, > double cost, long iter, float e, int pid, pth...