[llvm-commits] BlockFrequency for BasicBlocks

[Jakub Staszak]

Oh yes, I noticed that before, but actually what it does is copy(po_begin(BB), po_end(BB), back_inserter(Blocks));  so I do they same thing in my code. The only difference is that ReversePostOrderTraversal doesn't give public access to the vector, and I need that in rpot_at method.

-Kuba

On Jun 18, 2011, at 6:42 PM, Jakob Stoklund Olesen wrote:

> 
> On Jun 18, 2011, at 4:39 PM, Jakub Staszak wrote:
> 
>>> The block frequency pass should only require a *single* CFG graph traversal. I'm not sure how to do that with LLVM's current rpot/pot iterators. Ideally, LLVM would have a DFSOrder analysis to order the blocks. That ordering will remain valid until some CFG transform.
>> I've been looking for something like that in LLVM, but I couldn't find it. 
> 
> include/llvm/ADT/DepthFirstIterator.h 
> include/llvm/ADT/PostOrderIterator.h
> 
> /jakob
> 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20110618/b4eabae9/attachment.html>