search for: maximumspanningtree

Hi, since the MaximumSpanningTree-Algorithm is useful in may ways it would be great to have this available as generic algorithm. (See http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20090824/085454.html) Problem is: I can't get it to work. The attached patch (which depends on lib/Transforms/Instrumentation/MaximumS...

Andreas Neustifter wrote: > $> .../lib/Transforms/Instrumentation/MaximumSpanningTree.cpp:38: error: > 'stable_sort' is not a member of 'std' > > which I find kind of curious since std::stable_sort didn't make a > problem in the specific implementation. > I don't see anything that definitely pulls <algorithm> in, so it may be a case of...

Hi, I succeeded in converting the MaximumSpanningTree module to a generic one that is able to hold any kind of data. There was talk about puting this into llvm/ADT, is this implementation ready for that? Any complaints if I put this in? Thanks, Andi -- ========================================================================== This email is signed...

Hi, I succeeded in converting the MaximumSpanningTree module to a generic one that is able to hold any kind of data. There was talk about puting this into llvm/ADT, is this implementation ready for that? Any complaints if I put this in? Thanks, Andi -- ========================================================================== This email is signed...

...(some functionality in ProfileInfoLoader was duplicated in ProfileInfo or ProfileInfoLoaderPass; ProfileInfoLoader now really only performs the loading but not the post-processing) *) a new instrumentation pass that performs the optimal edge profiling instrumentation *) a helper module MaximumSpanningTree that selects the edges with have to be instrumented for optimal edge profiling *) a ProfileEstimatorPass that does an offline estimation of a profile based on branching and loop depth (also proposed in [Ball94]) (it is possible to use this ProfileEstimator stand-alone to have at least...

...ctor so that we can use binary search to do quick > + // lookups. > + SmallVector<BlockT*, 128> LoopBBs(block_begin(), block_end()); > + std::sort(LoopBBs.begin(), LoopBBs.end()); Would it be better to use a DenseSet for this lookup? > --- llvm-van/include/llvm/Analysis/MaximumSpanningTree.h 1970-01-01 01:00:00.000000000 +0100 > +++ llvm-c7/include/llvm/Analysis/MaximumSpanningTree.h 2009-06-26 16:47:01.000000000 +0200 ... > +#include "llvm/Support/Streams.h" Please don't use Support/Streams.h in a header, it pollutes any translation unit which imports...

...er to use a DenseSet for this lookup? Well, its the same that is used in getExitBlocks() where I got the implementation from. I really don't know but I think the current implementation is okay from what I gather form the LLVM Programmer's Manual. >> --- llvm-van/include/llvm/Analysis/MaximumSpanningTree.h 1970-01-01 01:00:00.000000000 +0100 >> +++ llvm-c7/include/llvm/Analysis/MaximumSpanningTree.h 2009-06-26 16:47:01.000000000 +0200 > ... >> +#include "llvm/Support/Streams.h" > > Please don't use Support/Streams.h in a header, it pollutes any transla...