search for: logytech

You said it was expensive, but if you had to put a big-o estimate on it, what would it be? -Thanks Jeff Kunkel On Tue, Nov 2, 2010 at 8:54 PM, Andrei Alvares <logytech at gmail.com> wrote: > Hello Jeff, > > On Tue, Nov 2, 2010 at 9:17 PM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > > My god! I would love a branch predictor! It would simplify many aspects > of > > my register allocator. > > The branch predictor of the implem...

...h our pass. []z, Andrei On Wed, Nov 3, 2010 at 8:22 AM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: > You said it was expensive, but if you had to put a big-o estimate on it, > what would it be? > -Thanks > Jeff Kunkel > > On Tue, Nov 2, 2010 at 8:54 PM, Andrei Alvares <logytech at gmail.com> wrote: >> >> Hello Jeff, >> >> On Tue, Nov 2, 2010 at 9:17 PM, Jeff Kunkel <jdkunk3 at gmail.com> wrote: >> > My god! I would love a branch predictor! It would simplify many aspects >> > of >> > my register allocator. >&gt...

...:57 PM, kapil anand <kapilanand2 at gmail.com> wrote: > Thanks Andrei! > > I haven't read the paper. I would see whether this fulfills my requirements > or whether I need to make any changes. > > --Kapil > > > On Tue, Nov 2, 2010 at 12:43 PM, Andrei Alvares <logytech at gmail.com>wrote: > >> Hello Kapil, >> >> I have implemented a static profiler for LLVM as a google summer of >> code project in 2009. I wrote it for the 2.4 branch, but the >> implementation never made into the tree. I have recently ported it to >> LLVM...

...at gmail.com> wrote: >> >> Thanks Andrei! >> >> I haven't read the paper. I would see whether this fulfills my >> requirements or whether I need to make any changes. >> >> --Kapil >> >> On Tue, Nov 2, 2010 at 12:43 PM, Andrei Alvares <logytech at gmail.com> >> wrote: >>> >>> Hello Kapil, >>> >>>  I have implemented a static profiler for LLVM as a google summer of >>> code project in 2009. I wrote it for the 2.4 branch, but the >>> implementation never made into the tree. I ha...

Thanks Andrei! I haven't read the paper. I would see whether this fulfills my requirements or whether I need to make any changes. --Kapil On Tue, Nov 2, 2010 at 12:43 PM, Andrei Alvares <logytech at gmail.com> wrote: > Hello Kapil, > > I have implemented a static profiler for LLVM as a google summer of > code project in 2009. I wrote it for the 2.4 branch, but the > implementation never made into the tree. I have recently ported it to > LLVM 2.8, but I haven't tes...

Hello Kapil, I have implemented a static profiler for LLVM as a google summer of code project in 2009. I wrote it for the 2.4 branch, but the implementation never made into the tree. I have recently ported it to LLVM 2.8, but I haven't tested it. You can take a look at the code from: http://homepages.dcc.ufmg.br/~rimsa/tools/stprof-llvm.patch The implementation is based on Wu's

Hello everyone, Can LLVM calculate DominatorTree and LoopInfo for call graphs? For example, I need to know if an edge (function1->function2) is a backedge. If there was a DominatorTree for call graphs that would be easy. Since I haven't found, I've copied the algorithm FindFunctionBackedges in BasicBlockUtils.cpp and modified it to use call graphs. Unfortunately, since the call

Hello all, I would like to participate in this year's Google Summer of Code and I am sending you a short description of my proposal. I have written the formal proposal already and if someone is interested I can send him the pdf. One of the open projects in the LLVM list is to enhance LLVM with static profiling capabilities. LLVM already provides a unified structure for writing pro