search for: mtewari

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 function runOnLoop, I have the following instruction PHINode *indv = NULL; indv = L->getCanonicalInductionVariable(); However, when I check indv is always set to NULL. Since the code has a canonical

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 function runOnLoop...

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: > > Also, make su...

Hi I want to write a LLVM pass that transforms loops only if they belong to certain special functions. Right now I have a pass that can transform loops as I intend, but I do not know how to check if the loop is actually contained in one of the special functions. Is there a way to identify the function to which a particular loop belongs ? I am not sure if my pass should implement both runOnLoop

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, pthread_barrier_t* barrier) { However, in the bit code I see that the function name has been modified to the following define float

Hi I am trying to write up a transformation for the following code where instead of incrementing the loop variable by 1, I increment it by 2 ie. for (i=0; i < THRES; *i++*) { //do something } gets transformed to for (i=0; i < THRES; *i+=2*) { //do something } I am thinking of transforming the llvm bit-code in the following way. Iterate over the function for the original code till I