Complexity of control flow graphs?
Peter B. Kessler
Peter.Kessler at Sun.COM
Wed Aug 12 11:40:36 PDT 2009
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
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.,
to see if it matters?
Thanks for any insights you have on this issue.
More information about the hotspot-compiler-dev