similar to: [LLVMdev] Profiling in LLVM

Hi, this is the fourth in a series of patches to cleanup and improve the LLVM Profiling Infrastructure. It depends on the previous patches from http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023569.html http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023602.html http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-July/023642.html This patch introduces an implementation of the ProfileInfo

Hi all, as proposed in http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-February/020396.html I implemented the algorithm presented in [Ball94]. It only instruments the minimal number of edges necessary for edge profiling. The main changes introduced by this patch are: *) a interface compatible rewrite of ProfileInfo *) a cleanup of ProfileInfoLoader (some functionality in ProfileInfoLoader

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

Hi Andreas, First, thanks again for undertaking this work and submitting it back. There is a lot of good stuff here and it would be great to see it get back into the tree. I have a few major high-level comments on the patch. First off, the patch is quite large and should be broken down into separate incremental changes which are easier to review and apply. I think the patches should more or less

This proposal adds support for path profiling [Ball96] to LLVM. Path profiling compactly represents acyclic paths in a directed acyclic graph representation of the control flow graph of a routine. Instrumentation can be added to uniquely identify paths executed at runtime. Path profiles enable precise enumeration of the sequence of basic blocks executed in order for a particular path. Using path

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

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 >

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 implementation is not as accurate as the one from the paper, but it is close enough. Unfortunately, the branch predictor is a very expensive pass, because it relies on

My god! I would love a branch predictor! It would simplify many aspects of my register allocator. Second, I am surprised it did not make it into the tree. Since more is being done with register allocation as a while "RegAllocBasic" was just put in, I hope this is looked at again. Do you have a working svn copy? Also, could you send me a copy/link to that '94 paper off the list

Hi Jeff, There is an algorithm to build the dominator tree that is O(n2), where n is the number of nodes on the control flow graph. I believe exists another that is linear, but I don't which one of them is implemented in LLVM. The problem is that the branch predictor requires post dominance information. None of the LLVM basic passes require post dominance information (AFAIK), hence it is

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 >

Hi Daniel, Daniel Dunbar wrote: > Hi Andreas, > > First, thanks again for undertaking this work and submitting it back. There is a > lot of good stuff here and it would be great to see it get back into the tree. Thanks for taking the time to review this, I know its a huge patch. I still have a few questions on how you would like this patch to be re-factored and split up. > [...]

On Wed, Aug 5, 2009 at 12:22 PM, Andreas Neustifter<e0325716 at student.tuwien.ac.at> wrote: >> On Wed, Jul 22, 2009 at 5:47 AM, Andreas >> Neustifter<e0325716 at student.tuwien.ac.at> wrote: >>> >>> Hi Daniel! >>> >>> Daniel Dunbar wrote: >>>> >>>> I merged in my changes to your patch, which results in the

Is there currently a way to get static profiling information for a program (e.g. an implementation of "Static Branch Frequency and Program Profile Analysis" by Wu and Larus, or something more recent) using an LLVM pass? Sean -------------- next part -------------- An HTML attachment was scrubbed... URL:

Sorry, forgot attachment. On 23.07.09 07:40), Andreas Neustifter wrote: > Good Morning. > > On 22.07.09 14:47), Andreas Neustifter wrote: >> Daniel Dunbar wrote: >>> I merged in my changes to your patch, which results in the attached >>> patch. There may be some missed merge errors. The main problem I have >>> with the rest of this patch is that it

On Wed, Aug 13, 2008 at 7:00 PM, Sean Soria <sean.soria at gmail.com> wrote: > Is there currently a way to get static profiling information for a program > (e.g. an implementation of "Static Branch Frequency and Program Profile > Analysis" by Wu and Larus, or something more recent) using an LLVM pass? the profiling code, which has bitrotted considerably, supports random

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! Andreas Neustifter wrote: > > Daniel Dunbar wrote: >> >> Thanks, applied as r78247. Next? :) > > > > Oh my, first he is lagging and now it's all a hurry :-) > > > > Okay, here comes the next one. > > > > I'm taking a short vacation next week so I will try to prepare 1 or 2 of > >

Hi! Daniel Dunbar wrote: > > Sorry for the lag time... No problem. As long as I know that you get to it sometime its fine for me... > On Wed, Jul 22, 2009 at 5:47 AM, Andreas > Neustifter<e0325716 at student.tuwien.ac.at> wrote: >> Hi Daniel! >> >> Daniel Dunbar wrote: >>> I merged in my changes to your patch, which results in the attached

On Tue, Nov 2, 2010 at 12:28 AM, kapil anand <kapilanand2 at gmail.com> wrote: > Hi all, > > Does LLVM infrastructure contain implementation of any static profiling > algorithm apart from "Spill-Weight" calculation present in Live Intervals > class? The future work page does suggest implementation of some "static > profiling" algorithms to make an

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! Andreas Neustifter wrote: > Daniel Dunbar wrote: >> Thanks, applied as r78247. Next? :) > > Oh my, first he is lagging and now it's all a hurry :-) > > Okay, here comes the next one. > > I'm taking a short vacation next week so I will try to prepare 1 or 2 of > the next patches so that you can work on them