Complexity of control flow graphs?

[Tom Rodriguez]

I don't think anyone has looked at this code in a long time.  It's not  
the tallest nail compile time wise and we haven't seen any bugs so  
it's just been left alone.  Why the interest?

tom

On Aug 12, 2009, at 11:40 AM, Peter B. Kessler wrote:

> Does anyone have a sense of the complexity of the control flow  
> graphs seen by the HotSpot compiler?  For example, how many nodes  
> and edges are examined by PhaseCFG::Dominators (or  
> PhaseIdealLoop::Dominators)?
>
> In light of
>
>   http://jgaa.info/accepted/2006/GeorgiadisTarjanWerneck2006.10.1.pdf
>
> is there any point (other than reducing complexity!) in changing the  
> LINK and EVAL methods to only do path compression, and not try to  
> balance the trees used by LINK?
>
> Has anyone tried other dominator algorithms in there, e.g.,
>
>   http://www.cs.rice.edu/~keith/EMBED/dom.pdf
>
> to see if it matters?
>
> Thanks for any insights you have on this issue.
>
> 			... peter