Branch: refs/heads/main
Home: https://github.com/WebKit/WebKit
Commit: 64f40e1806635d78dfe9a758585b5598d8793034
https://github.com/WebKit/WebKit/commit/64f40e1806635d78dfe9a758585b5598d8793034
Author: David Degazio <[email protected]>
Date: 2024-07-25 (Thu, 25 Jul 2024)
Changed paths:
M Source/WTF/wtf/Dominators.h
Log Message:
-----------
Use faster iterative algorithm to compute dominators for small CFGs
https://bugs.webkit.org/show_bug.cgi?id=276977
rdar://problem/132363948
Reviewed by Yusuke Suzuki.
Implements the dominance algorithm described in "A Simple, Fast Dominance
Algorithm"
(Cooper, Harvey, Kennedy 2001), and uses it over Lengauer-Tarjan when computing
dominators for graphs smaller than 20,000 nodes. On the JetStream 2 benchmark,
this
means we compute dominance about 60% faster than Lengauer-Tarjan, although this
doesn't seem to translate to a measurable progression overall.
* Source/WTF/wtf/Dominators.h:
(WTF::Dominators::Dominators):
(WTF::Dominators::IterativeDominance::IterativeDominance):
(WTF::Dominators::IterativeDominance::computeReversePostorder):
(WTF::Dominators::IterativeDominance::intersect):
(WTF::Dominators::IterativeDominance::compute):
(WTF::Dominators::IterativeDominance::immediateDominator):
Canonical link: https://commits.webkit.org/281359@main
To unsubscribe from these emails, change your notification settings at
https://github.com/WebKit/WebKit/settings/notifications
_______________________________________________
webkit-changes mailing list
[email protected]
https://lists.webkit.org/mailman/listinfo/webkit-changes
