Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use a linear time dominators algorithm #9481

Open
fitzgen opened this issue Oct 17, 2024 · 1 comment
Open

Use a linear time dominators algorithm #9481

fitzgen opened this issue Oct 17, 2024 · 1 comment

Comments

@fitzgen
Copy link
Member

fitzgen commented Oct 17, 2024

Right now we use the classic simple-fast algorithm (A Simple, Fast Dominance Algorithm by Cooper et al) and while this works well most of the time in practice, it has quadratic worst case time.

Linear-time alternatives exist: https://dl.acm.org/doi/10.5555/1123869

We should consider using them instead.

SpiderMonkey found the Semi-NCA algorithm to be a big speed up: https://spidermonkey.dev/blog/2024/10/16/75x-faster-optimizing-the-ion-compiler-backend.html

@amartosch
Copy link
Contributor

I'd like to have a try at it. The plan would be to implement the Semi-NCA algorithm, because LLVM also seems to use it.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants