Algorithmic complexity for dominators calculation is O(N + E * D) for each iteration, (N is number of nodes, E is number of edges, D is size of largest dominators set). The number of iterations is about 6 for Gmail.
Size calculation is indeed not so effective. It takes about 200 iterations for
Gmail. I will fix that. Thanks for turning my attention to this issue. http://codereview.chromium.org/5154007/diff/1/include/v8-profiler.h File include/v8-profiler.h (right): http://codereview.chromium.org/5154007/diff/1/include/v8-profiler.h#newcode318 include/v8-profiler.h:318: * Returns a dominator node. This is the node that participates in every On 2010/11/22 09:49:48, Søren Gjesse wrote:
is the -> is a?
Done. http://codereview.chromium.org/5154007/ -- v8-dev mailing list [email protected] http://groups.google.com/group/v8-dev
