Chromium Code Reviews
DescriptionSwitch dominator algorithm from [1] to [2].
[1] has worse upper bound complexity than [2] but has lower
overhead. With [1] dart2js heaps would converge in ~10 iterations, but
with analyzer heaps would take ~10k iterations.
This reduces the time to analyze the final heap of the analyzer
analyzing dart2js from ~30 minutes to 26 seconds.
Increases peak memory usage by 21N bytes plus O(2N) words.
[1] "A Simple, Fast Dominance Algorithm." Keith D. Cooper, Timothy
J. Harvey, and Ken Kennedy.
[2] "A Fast Algorithm for Finding Dominators in a Flowgraph."
T. Lengauer and R. E. Tarjan.
R=johnmccutchan@google.com
Committed: https://github.com/dart-lang/sdk/commit/5eb3bccaf1f61e2993b8909a27a9256b96cb8e88
Patch Set 1 #
Total comments: 2
Messages
Total messages: 5 (1 generated)
|
|||||||||||||||||||